


default search action
Theoretical Computer Science, Volume 586
Volume 586, June 2015
- Peter Widmayer:

FUN with algorithms. 1
- Michael Brand

:
No easy puzzles: Hardness results for jigsaw puzzles. 2-11 - Ke Chen

, Adrian Dumitrescu:
Nonconvex cases for carpenter's rulers. 12-25 - Guillaume Fertin

, Shahrad Jamshidi, Christian Komusiewicz
:
Towards an algorithmic guide to Spiral Galaxies. 26-39 - Ferdinando Cicalese, Gennaro Cordasco

, Luisa Gargano
, Martin Milanic
, Joseph G. Peters, Ugo Vaccaro:
Spread of influence in weighted networks under time and budget constraints. 40-58 - Michele Borassi

, Pierluigi Crescenzi
, Michel Habib
, Walter A. Kosters, Andrea Marino
, Frank W. Takes
:
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. 59-80 - Katsuhisa Yamanaka, Erik D. Demaine, Takehiro Ito, Jun Kawahara, Masashi Kiyomi

, Yoshio Okamoto
, Toshiki Saitoh
, Akira Suzuki
, Kei Uchizawa
, Takeaki Uno:
Swapping labeled tokens on graphs. 81-94 - Konstantinos Georgiou, Evangelos Kranakis

, Danny Krizanc:
Excuse me! or the courteous theatregoers' problem. 95-110 - Erik D. Demaine, Martin L. Demaine:

Fun with fonts: Algorithmic typography. 111-119 - Giovanni Viglietta:

Lemmings is PSPACE-complete. 120-134 - Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta:

Classic Nintendo games are (computationally) hard. 135-160 - Irina Kostitsyna

, Maarten Löffler, Valentin Polishchuk:
Optimizing airspace closure with respect to politicians' egos. 161-175

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














