Vai al contenuto principale della pagina

Fun with algorithms [electronic resource] : 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012. Proceedings / Evangelos Kranakis, Danny Krizanc, Flaminia Luccio (eds.).



(Visualizza formato Marc21)    (visualizza in BIBRAME 2.0)

Creatore: FUN (Conference) (6th : 2012 : Venice, Italy)
Titolo: Fun with algorithms [electronic resource] : 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012. Proceedings / Evangelos Kranakis, Danny Krizanc, Flaminia Luccio (eds.).
Link to work: Fun with algorithms Visualizza cluster
Pubblicazione: Berlin ; New York : Springer, c2012
Estensione: 1 online resource.
Tipo formato: computer
Tipo contenuto: text
Tipo supporto: online resource
Disciplina: 518/.1
Titolo uniforme di collana: Lecture notes in computer science ; 7288.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Classificazione LOC: QA9.58 .F86 2012
Creatori/Collaboratori: Kranakis, Evangelos
Krizanc, Danny
Luccio, Flaminia, , 1969-
Accesso convegno: FUN (Conference)
Note generali: International conference proceedings.
Contenuto supplementare: Includes bibliographical references and index.
Nota di contenuto: Algorithms and Complexity of Generalized River Crossing Problems / Hiro Ito, Stefan Langerman and Yuichi Yoshida -- Solving Tantrix via Integer Programming / Fumika Kino and Yushi Uno -- Scrabble Is PSPACE-Complete / Michael Lampis, Valia Mitsou and Karolina Sołtys -- Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set / Kevin J. Lang -- Spanning Trees and the Complexity of Flood-Filling Games / Kitty Meeks and Alexander Scott -- Tron, a Combinatorial Game on Abstract Graphs / Tillmann Miltzow -- Divorcing Made Easy / Kirk Pruhs and Gerhard J. Woeginger -- A New Analysis of Best Fit Bin Packing / Jiří Sgall -- The Coolest Order of Binary Strings / Brett Stevens and Aaron Williams -- Hitori Number / Akira Suzuki, Kei Uchizawa and Takeaki Uno -- Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric / Wojciech Rytter and Bartosz Szreder -- Gaming Is a Hard Job, But Someone Has to Do It! / Giovanni Viglietta -- Hardness of Mastermind / Giovanni Viglietta -- Scienceography: The Study of How Science Is Written / Graham Cormode, S. Muthukrishnan and Jinyun Yan.
Distributed Algorithms by Forgetful Mobile Robots / Paola Flocchini -- Stability and Metastability of the Logit Dynamics of Strategic Games / Giuseppe Persiano -- Art Galleries, k-modems, and k-convexity / Jorge Urrutia -- The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs / Terry Anderson and Therese Biedl -- Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box / Esther M. Arkin, Alon Efrat, George Hart, Irina Kostitsyna and Alexander Kröller, et al. -- The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye / Michael A. Bender, Ritwik Bose, Rezaul Chowdhury and Samuel McCauley -- Mad at Edge Crossings? Break the Edges! / Till Bruckdorfer and Michael Kaufmann -- Train Marshalling Is Fixed Parameter Tractable / Leo Brueggeman, Michael Fellows, Rudolf Fleischer, Martin Lackner and Christian Komusiewicz, et al. -- Conflict-Free Graph Orientations with Parity Constraints / Sarah Cannon, Mashhood Ishaque and Csaba D. Tóth -- The Multi-interval Ulam-Rényi Game / Ferdinando Cicalese -- Picture-Hanging Puzzles / Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell and Ronald L. Rivest, et al.
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors / Stefan Dobrev, Lata Narayanan and Jaroslav Opatrny -- The Byzantine Brides Problem / Swan Dubois, Sébastien Tixeuil and Nini Zhu -- Lean Programs, Branch Mispredictions, and Sorting / Amr Elmasry and Jyrki Katajainen -- On Computer Integrated Rationalized Crossword Puzzle Manufacturing / Jakob Engel, Markus Holzer, Oliver Ruepp and Frank Sehnke -- Solving Single-Digit Sudoku Subproblems / David Eppstein -- Finding Good Coffee in Paris / Paola Flocchini, Matthew Kellett, Peter C. Mason and Nicola Santoro -- To Satisfy Impatient Web Surfers Is Hard / Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric and Nicolas Nisse -- Making Life Easier for Firefighters / Fedor V. Fomin, Pinar Heggernes and Erik Jan van Leeuwen -- Counting Perfect Matchings in Graphs of Degree 3 / Martin Fürer -- M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns / Ellen Gethner, David G. Kirkpatrick and Nicholas J. Pippenger -- On the Complexity of Rolling Block and Alice Mazes / Markus Holzer and Sebastian Jakobi -- Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes / Markus Holzer and Sebastian Jakobi.
Restrizioni accesso: Access restricted to authorized users and institutions.
Collana: Lecture notes in computer science, 0302-9743 ; 7288
LNCS sublibrary. SL 1, Theoretical computer science and general issues
Varianti del titolo: FUN 2012
ISBN: 3642303471 (electronic bk.)
9783642303470 (electronic bk.)
9783642303463
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 5643156
Localizzazioni e accesso elettronico http://dx.doi.org/10.1007/978-3-642-30347-0
Lo trovi qui: University of Alberta / NEOS Library Consortium
Item: Permalink to OPAC