LEADER 05970nam 22008655 450 001 996465382303316 005 20230329183715.0 010 $a3-642-30347-1 024 7 $a10.1007/978-3-642-30347-0 035 $a(CKB)3400000000085283 035 $a(SSID)ssj0000697502 035 $a(PQKBManifestationID)11455855 035 $a(PQKBTitleCode)TC0000697502 035 $a(PQKBWorkID)10691345 035 $a(PQKB)11408323 035 $a(DE-He213)978-3-642-30347-0 035 $a(MiAaPQ)EBC3070946 035 $a(PPN)16831648X 035 $a(EXLCZ)993400000000085283 100 $a20120531d2012 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFun with Algorithms$b[electronic resource] $e6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012, Proceedings /$fedited by Evangelos Kranakis, DANNY KRIZANC, Flaminia Luccio 205 $a1st ed. 2012. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2012. 215 $a1 online resource (XI, 397 p. 148 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7288 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-30346-3 320 $aIncludes bibliographical references and index. 327 $tDistributed Algorithms by Forgetful Mobile Robots /$rPaola Flocchini --$tStability and Metastability of the Logit Dynamics of Strategic Games /$rGiuseppe Persiano --$tArt Galleries, k-modems, and k-convexity /$rJorge Urrutia --$tThe Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs /$rTerry Anderson and Therese Biedl --$tScandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box /$rEsther M. Arkin, Alon Efrat, George Hart, Irina Kostitsyna and Alexander Kro?ller, et al. --$tThe Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye /$rMichael A. Bender, Ritwik Bose, Rezaul Chowdhury and Samuel McCauley --$tMad at Edge Crossings? Break the Edges! /$rTill Bruckdorfer and Michael Kaufmann --$tTrain Marshalling Is Fixed Parameter Tractable /$rLeo Brueggeman, Michael Fellows, Rudolf Fleischer, Martin Lackner and Christian Komusiewicz, et al. --$tConflict-Free Graph Orientations with Parity Constraints /$rSarah Cannon, Mashhood Ishaque and Csaba D. To?th --$tThe Multi-interval Ulam-Re?nyi Game /$rFerdinando Cicalese --$tPicture-Hanging Puzzles /$rErik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell and Ronald L. Rivest, et al. 327 $tOptimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors /$rStefan Dobrev, Lata Narayanan and Jaroslav Opatrny --$tThe Byzantine Brides Problem /$rSwan Dubois, Se?bastien Tixeuil and Nini Zhu --$tLean Programs, Branch Mispredictions, and Sorting /$rAmr Elmasry and Jyrki Katajainen --$tOn Computer Integrated Rationalized Crossword Puzzle Manufacturing /$rJakob Engel, Markus Holzer, Oliver Ruepp and Frank Sehnke --$tSolving Single-Digit Sudoku Subproblems /$rDavid Eppstein --$tFinding Good Coffee in Paris /$rPaola Flocchini, Matthew Kellett, Peter C. Mason and Nicola Santoro --$tTo Satisfy Impatient Web Surfers Is Hard /$rFedor V. Fomin, Fre?de?ric Giroire, Alain Jean-Marie, Dorian Mazauric and Nicolas Nisse --$tMaking Life Easier for Firefighters /$rFedor V. Fomin, Pinar Heggernes and Erik Jan van Leeuwen --$tCounting Perfect Matchings in Graphs of Degree 3 /$rMartin Fu?rer --$tM.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns /$rEllen Gethner, David G. Kirkpatrick and Nicholas J. Pippenger --$tOn the Complexity of Rolling Block and Alice Mazes /$rMarkus Holzer and Sebastian Jakobi --$tGrid Graphs with Diagonal Edges and the Complexity of Xmas Mazes /$rMarkus Holzer and Sebastian Jakobi. 330 $aThis book constitutes the refereed proceedings of the 6th International Conference, FUN 2012, held in June 2012 in Venice, Italy. The 34 revised full papers were carefully reviewed and selected from 56 submissions. They feature a large variety of topics in the field of the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7288 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer networks 606 $aArtificial intelligence 606 $aArtificial intelligence?Data processing 606 $aComputer science 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Communication Networks 606 $aArtificial Intelligence 606 $aData Science 606 $aTheory of Computation 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer networks. 615 0$aArtificial intelligence. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Communication Networks. 615 24$aArtificial Intelligence. 615 24$aData Science. 615 24$aTheory of Computation. 676 $a005.1 702 $aKranakis$b Evangelos$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKRIZANC$b DANNY$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLuccio$b Flaminia$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aKranakis, Evangelos, 712 02$aKrizanc, Danny, 712 02$aLuccio, Flaminia,$f1969- , 712 12$aFUN (Conference) 906 $aBOOK 912 $a996465382303316 996 $aFun with Algorithms$9772446 997 $aUNISA