default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th FUN 2012: Venice, Italy
- Evangelos Kranakis, Danny Krizanc, Flaminia L. Luccio:
Fun with Algorithms - 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012. Proceedings. Lecture Notes in Computer Science 7288, Springer 2012, ISBN 978-3-642-30346-3 - Paola Flocchini:
Distributed Algorithms by Forgetful Mobile Robots. 1 - Giuseppe Persiano:
Stability and Metastability of the Logit Dynamics of Strategic Games. 2 - Jorge Urrutia:
Art Galleries, k-modems, and k-convexity. 3 - Terry Anderson, Therese Biedl:
The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs. 4-15 - Esther M. Arkin, Alon Efrat
, George Hart, Irina Kostitsyna, Alexander Kröller, Joseph S. B. Mitchell, Valentin Polishchuk:
Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box. 16-27 - Michael A. Bender, Ritwik Bose, Rezaul Alam Chowdhury, Samuel McCauley:
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye. 28-39 - Till Bruckdorfer, Michael Kaufmann:
Mad at Edge Crossings? Break the Edges! 40-50 - Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond:
Train Marshalling Is Fixed Parameter Tractable. 51-56 - Sarah Cannon, Mashhood Ishaque, Csaba D. Tóth:
Conflict-Free Graph Orientations with Parity Constraints. 57-68 - Ferdinando Cicalese:
The Multi-interval Ulam-Rényi Game. 69-80 - Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu:
Picture-Hanging Puzzles. 81-93 - Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny:
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors. 94-106 - Swan Dubois, Sébastien Tixeuil, Nini Zhu:
The Byzantine Brides Problem. 107-118 - Amr Elmasry, Jyrki Katajainen:
Lean Programs, Branch Mispredictions, and Sorting. 119-130 - Jakob Engel, Markus Holzer, Oliver Ruepp, Frank Sehnke:
On Computer Integrated Rationalized Crossword Puzzle Manufacturing. 131-141 - David Eppstein:
Solving Single-Digit Sudoku Subproblems. 142-153 - Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro:
Finding Good Coffee in Paris. 154-165 - Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse:
To Satisfy Impatient Web Surfers Is Hard. 166-176 - Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen:
Making Life Easier for Firefighters. 177-188 - Martin Fürer:
Counting Perfect Matchings in Graphs of Degree 3. 189-197 - Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger:
M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. 198-209 - Markus Holzer, Sebastian Jakobi:
On the Complexity of Rolling Block and Alice Mazes. 210-222 - Markus Holzer, Sebastian Jakobi:
Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes. 223-234 - Hiro Ito, Stefan Langerman, Yuichi Yoshida:
Algorithms and Complexity of Generalized River Crossing Problems. 235-244 - Fumika Kino, Yushi Uno:
Solving Tantrix via Integer Programming. 245-257 - Michael Lampis, Valia Mitsou, Karolina Soltys:
Scrabble Is PSPACE-Complete. 258-269 - Kevin J. Lang:
Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set. 270-281 - Kitty Meeks, Alexander Scott:
Spanning Trees and the Complexity of Flood-Filling Games. 282-292 - Tillmann Miltzow:
Tron, a Combinatorial Game on Abstract Graphs. 293-304 - Kirk Pruhs, Gerhard J. Woeginger:
Divorcing Made Easy. 305-314 - Jirí Sgall:
A New Analysis of Best Fit Bin Packing. 315-321 - Brett Stevens, Aaron Williams:
The Coolest Order of Binary Strings. 322-333 - Akira Suzuki, Kei Uchizawa, Takeaki Uno:
Hitori Number. 334-345 - Wojciech Rytter, Bartosz Szreder:
Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric. 346-356 - Giovanni Viglietta:
Gaming Is a Hard Job, But Someone Has to Do It! 357-367 - Giovanni Viglietta:
Hardness of Mastermind. 368-378 - Graham Cormode, S. Muthukrishnan, Jinyun Yan:
Scienceography: The Study of How Science Is Written. 379-391
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.
last updated on 2024-11-07 20:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
