Search results for "Fun"

Hits ?▲	Authors	Title	Venue	Year	Link
50	Valentin Polishchuk, Leonid Sedov	Gender-Aware Facility Location in Multi-Gender World.	FUN	2018	DBLP DOI BibTeX RDF
50	Zachary Abel, Jeffrey Bosboom, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy	Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible.	FUN	2018	DBLP DOI BibTeX RDF
50	Rémy Belmonte, Mehdi Khosravian Ghadikolaei, Masashi Kiyomi, Michael Lampis, Yota Otachi	How Bad is the Freedom to Flood-It?.	FUN	2018	DBLP DOI BibTeX RDF
50	Hans L. Bodlaender, Tom C. van der Zanden	On the Exact Complexity of Polyomino Packing.	FUN	2018	DBLP DOI BibTeX RDF
50	Florian D. Schwahn, Clemens Thielen	The Complexity of Escaping Labyrinths and Enchanted Forests.	FUN	2018	DBLP DOI BibTeX RDF
50	David Eppstein	Faster Evaluation of Subtraction Games.	FUN	2018	DBLP DOI BibTeX RDF
50	Guangqi Cui, John P. Dickerson, Naveen Durvasula, William Gasarch, Erik Metz, Jacob Prinz, Naveen Raman, Daniel Smolyak, Sung Hyun Yoo	A Muffin-Theorem Generator.	FUN	2018	DBLP DOI BibTeX RDF
50	Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende	God Save the Queen.	FUN	2018	DBLP DOI BibTeX RDF
50	Naoki Kitamura, Yuya Kawabata, Taisuke Izumi	Uniform Distribution On Pachinko.	FUN	2018	DBLP DOI BibTeX RDF
50	Markus Holzer 0001, Jan-Tobias Maurer	Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms.	FUN	2018	DBLP DOI BibTeX RDF
50	Martin Farach-Colton	Mind the Gap (Invited Paper).	FUN	2018	DBLP DOI BibTeX RDF
50	David Eppstein	Making Change in 2048.	FUN	2018	DBLP DOI BibTeX RDF
50	Kazumasa Shinagawa, Takaaki Mizuki	Card-based Protocols Using Triangle Cards.	FUN	2018	DBLP DOI BibTeX RDF
50	Erik D. Demaine, Fabrizio Grandoni 0001 (eds.)	8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy	FUN	2016	DBLP BibTeX RDF
50	Hiro Ito, Takahiro Ueda	How to Solve the Cake-Cutting Problem in Sublinear Time.	FUN	2016	DBLP DOI BibTeX RDF
50	Luciano Gualà, Stefano Leucci 0001, Emanuele Natale, Roberto Tauraso	Large Peg-Army Maneuvers.	FUN	2016	DBLP DOI BibTeX RDF
50	Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya	Convex Configurations on Nana-kin-san Puzzle.	FUN	2016	DBLP DOI BibTeX RDF
50	Felix Herter, Günter Rote	Loopless Gray Code Enumeration and the Tower of Bucharest.	FUN	2016	DBLP DOI BibTeX RDF
50	Davide Bacciu, Vincenzo Gervasi, Giuseppe Prencipe	LOL: An Investigation into Cybernetic Humor, or: Can Machines Laugh?.	FUN	2016	DBLP DOI BibTeX RDF
50	Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade 0001	Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen.	FUN	2016	DBLP DOI BibTeX RDF
50	Rudolf Fleischer	Counting Circles Without Computing Them.	FUN	2016	DBLP DOI BibTeX RDF
50	Stefan Langerman, Yushi Uno	Threes!, Fives, 1024!, and 2048 are Hard.	FUN	2016	DBLP DOI BibTeX RDF
50	William S. Evans, Mereke van Garderen, Maarten Löffler, Valentin Polishchuk	Recognizing a DOG is Hard, But Not When It is Thin and Unit.	FUN	2016	DBLP DOI BibTeX RDF
50	Fabrizio Luccio	An Arithmetic for Rooted Trees.	FUN	2016	DBLP DOI BibTeX RDF
50	Jessica A. Enright, John D. Faben	Building a Better Mouse Maze.	FUN	2016	DBLP DOI BibTeX RDF
50	Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stéphane Pérennes	Spy-Game on Graphs.	FUN	2016	DBLP DOI BibTeX RDF
50	Neeldhara Misra	Two Dots is NP-complete.	FUN	2016	DBLP DOI BibTeX RDF
50	Marzio De Biasi, Tim Ophelders	The Complexity of Snake.	FUN	2016	DBLP DOI BibTeX RDF
50	Erik D. Demaine, Giovanni Viglietta, Aaron Williams	Super Mario Bros. is Harder/Easier Than We Thought.	FUN	2016	DBLP DOI BibTeX RDF
50	Francesco Cambi, Pierluigi Crescenzi, Linda Pagli	Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering.	FUN	2016	DBLP DOI BibTeX RDF
50	Michael A. Bekos, Till Bruckdorfer, Henry Förster, Michael Kaufmann 0001, Simon Poschenrieder, Thomas Stüber	Algorithms and Insights for RaceTrack.	FUN	2016	DBLP DOI BibTeX RDF
50		Front Matter, Table of Contents, Preface, Conference Organization.	FUN	2016	DBLP DOI BibTeX RDF
50	Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno	Hanabi is NP-complete, Even for Cheaters who Look at Their Cards.	FUN	2016	DBLP DOI BibTeX RDF
50	Michael A. Bender, Samuel McCauley, Bertrand Simon 0001, Shikha Singh 0002, Frédéric Vivien	Resource Optimization for Program Committee Members: A Subreview Article.	FUN	2016	DBLP DOI BibTeX RDF
50	Ahmed Abdelkader, Aditya Acharya, Philip Dasler	2048 Without New Tiles Is Still Hard.	FUN	2016	DBLP DOI BibTeX RDF
50	Matteo Almanza, Stefano Leucci 0001, Alessandro Panconesi	Trainyard is NP-hard.	FUN	2016	DBLP DOI BibTeX RDF
50	Stefan Neumann 0003, Andreas Wiese	This House Proves That Debating is Harder Than Soccer.	FUN	2016	DBLP DOI BibTeX RDF
50	Jérémy Barbay	Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time.	FUN	2016	DBLP DOI BibTeX RDF
50	Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Giovanni Viglietta	A Rupestrian Algorithm.	FUN	2016	DBLP DOI BibTeX RDF
50	Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson	The Fewest Clues Problem.	FUN	2016	DBLP DOI BibTeX RDF
50	Alfredo Ferro, Fabrizio Luccio, Peter Widmayer (eds.)	Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings	FUN	2014	DBLP DOI BibTeX RDF
50	Erik D. Demaine, Fermi Ma, Erik Waingarten	Playing Dominoes Is Hard, Except by Yourself.	FUN	2014	DBLP DOI BibTeX RDF
50	Bang Ye Wu	Finding Centers and Medians of a Tree by Distance Queries.	FUN	2014	DBLP DOI BibTeX RDF
50	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.	FUN	2014	DBLP DOI BibTeX RDF
50	Minghui Jiang 0001, Pedro J. Tejada, Haitao Wang 0001	Quell.	FUN	2014	DBLP DOI BibTeX RDF
50	Michael Brand	No Easy Puzzles: A Hardness Result for Jigsaw Puzzles.	FUN	2014	DBLP DOI BibTeX RDF
50	Vincenzo Gervasi, Giuseppe Prencipe, Valerio Volpi	Zombie Swarms: An Investigation on the Behaviour of Your Undead Relatives.	FUN	2014	DBLP DOI BibTeX RDF
50	Jannik Dreier, Hugo Jonker, Pascal Lafourcade 0001	Secure Auctions without Cryptography.	FUN	2014	DBLP DOI BibTeX RDF
50	Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz	Towards an Algorithmic Guide to Spiral Galaxies.	FUN	2014	DBLP DOI BibTeX RDF
50	Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta	Classic Nintendo Games Are (Computationally) Hard.	FUN	2014	DBLP DOI BibTeX RDF
50	Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow	Counting Houses of Pareto Optimal Matchings in the House Allocation Problem.	FUN	2014	DBLP DOI BibTeX RDF
50	Shantanu Das 0001, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro	Synchronized Dancing of Oblivious Chameleons.	FUN	2014	DBLP DOI BibTeX RDF
50	Paolo Boldi	Algorithmic Gems in the Data Miner's Cave.	FUN	2014	DBLP DOI BibTeX RDF
50	Rudolf Fleischer, Tao Zhang	Competitive Analysis of the Windfall Game.	FUN	2014	DBLP DOI BibTeX RDF
50	Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro	How to go Viral: Cheaply and Quickly.	FUN	2014	DBLP DOI BibTeX RDF
50	Takaaki Mizuki, Hiroki Shizuya	Practical Card-Based Cryptography.	FUN	2014	DBLP DOI BibTeX RDF
50	Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi	Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set.	FUN	2014	DBLP DOI BibTeX RDF
50	Vladimir G. Deineko, Gerhard J. Woeginger	Another Look at the Shoelace TSP: The Case of Very Old Shoes.	FUN	2014	DBLP DOI BibTeX RDF
50	Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada	Normal, Abby Normal, Prefix Normal.	FUN	2014	DBLP DOI BibTeX RDF
50	Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc	Excuse Me! or The Courteous Theatregoers' Problem - (Extended Abstract).	FUN	2014	DBLP DOI BibTeX RDF
50	Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski	Clearing Connections by Few Agents.	FUN	2014	DBLP DOI BibTeX RDF
50	Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter	Happy Edges: Threshold-Coloring of Regular Lattices.	FUN	2014	DBLP DOI BibTeX RDF
50	Kazuya Haraguchi, Hirotaka Ono 0001	Approximability of Latin Square Completion-Type Puzzles.	FUN	2014	DBLP DOI BibTeX RDF
50	Palash Dey, Prachi Goyal, Neeldhara Misra	UNO Gets Easier for a Single Player.	FUN	2014	DBLP DOI BibTeX RDF
50	Ke Chen 0011, Adrian Dumitrescu	Nonconvex Cases for Carpenter's Rulers.	FUN	2014	DBLP DOI BibTeX RDF
50	Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk	Optimizing Airspace Closure with Respect to Politicians' Egos.	FUN	2014	DBLP DOI BibTeX RDF
50	Barbara Keller, David Peleg, Roger Wattenhofer	How Even Tiny Influence Can Have a Big Impact!	FUN	2014	DBLP DOI BibTeX RDF
50	Harrah Essed, Wei Therese	The Harassed Waitress Problem.	FUN	2014	DBLP DOI BibTeX RDF
50	Sven Oliver Krumke, Florian D. Schwahn, Clemens Thielen	Being Negative Makes Life NP-hard (for Product Sellers).	FUN	2014	DBLP DOI BibTeX RDF
50	Giovanni Viglietta	Lemmings Is PSPACE-Complete.	FUN	2014	DBLP DOI BibTeX RDF
50	Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino 0001, Frank W. Takes	On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method.	FUN	2014	DBLP DOI BibTeX RDF
50	Evangelos Kranakis, Danny Krizanc, Flaminia L. Luccio (eds.)	Fun with Algorithms - 6th International Conference, FUN 2012, Venice, Italy, June 4-6, 2012. Proceedings	FUN	2012	DBLP DOI BibTeX RDF
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.	FUN	2012	DBLP DOI BibTeX RDF
50	Fumika Kino, Yushi Uno	Solving Tantrix via Integer Programming.	FUN	2012	DBLP DOI BibTeX RDF
50	Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger	M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns.	FUN	2012	DBLP DOI BibTeX RDF
50	Terry Anderson, Therese Biedl	The Vulcan Game of Kal-Toh: Finding or Making Triconnected Planar Subgraphs.	FUN	2012	DBLP DOI BibTeX RDF
50	Ferdinando Cicalese	The Multi-interval Ulam-Rényi Game.	FUN	2012	DBLP DOI BibTeX RDF
50	Wojciech Rytter, Bartosz Szreder	Computing Maximum Hamiltonian Paths in Complete Graphs with Tree Metric.	FUN	2012	DBLP DOI BibTeX RDF
50	Hiro Ito, Stefan Langerman, Yuichi Yoshida	Algorithms and Complexity of Generalized River Crossing Problems.	FUN	2012	DBLP DOI BibTeX RDF
50	Stefan Dobrev, Lata Narayanan, Jaroslav Opatrny	Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors.	FUN	2012	DBLP DOI BibTeX RDF
50	Martin Fürer	Counting Perfect Matchings in Graphs of Degree 3.	FUN	2012	DBLP DOI BibTeX RDF
50	Markus Holzer 0001, Sebastian Jakobi	On the Complexity of Rolling Block and Alice Mazes.	FUN	2012	DBLP DOI BibTeX RDF
50	Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen	Making Life Easier for Firefighters.	FUN	2012	DBLP DOI BibTeX RDF
50	Giovanni Viglietta	Gaming Is a Hard Job, But Someone Has to Do It!	FUN	2012	DBLP DOI BibTeX RDF
50	Jirí Sgall	A New Analysis of Best Fit Bin Packing.	FUN	2012	DBLP DOI BibTeX RDF
50	Kirk Pruhs, Gerhard J. Woeginger	Divorcing Made Easy.	FUN	2012	DBLP DOI BibTeX RDF
50	Brett Stevens, Aaron Williams	The Coolest Order of Binary Strings.	FUN	2012	DBLP DOI BibTeX RDF
50	Tillmann Miltzow	Tron, a Combinatorial Game on Abstract Graphs.	FUN	2012	DBLP DOI BibTeX RDF
50	Swan Dubois, Sébastien Tixeuil, Nini Zhu	The Byzantine Brides Problem.	FUN	2012	DBLP DOI BibTeX RDF
50	Giuseppe Persiano	Stability and Metastability of the Logit Dynamics of Strategic Games.	FUN	2012	DBLP DOI BibTeX RDF
50	Graham Cormode, S. Muthukrishnan 0001, Jinyun Yan	Scienceography: The Study of How Science Is Written.	FUN	2012	DBLP DOI BibTeX RDF
50	Fedor V. Fomin, Frédéric Giroire, Alain Jean-Marie, Dorian Mazauric, Nicolas Nisse	To Satisfy Impatient Web Surfers Is Hard.	FUN	2012	DBLP DOI BibTeX RDF
50	Michael A. Bender, Ritwik Bose, Rezaul Alam Chowdhury, Samuel McCauley	The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye.	FUN	2012	DBLP DOI BibTeX RDF
50	Akira Suzuki, Kei Uchizawa, Takeaki Uno	Hitori Number.	FUN	2012	DBLP DOI BibTeX RDF
50	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.	FUN	2012	DBLP DOI BibTeX RDF
50	Amr Elmasry, Jyrki Katajainen	Lean Programs, Branch Mispredictions, and Sorting.	FUN	2012	DBLP DOI BibTeX RDF
50	Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro	Finding Good Coffee in Paris.	FUN	2012	DBLP DOI BibTeX RDF
50	Kitty Meeks, Alexander Scott 0001	Spanning Trees and the Complexity of Flood-Filling Games.	FUN	2012	DBLP DOI BibTeX RDF
50	David Eppstein	Solving Single-Digit Sudoku Subproblems.	FUN	2012	DBLP DOI BibTeX RDF
50	Jakob Engel, Markus Holzer 0001, Oliver Ruepp, Frank Sehnke	On Computer Integrated Rationalized Crossword Puzzle Manufacturing.	FUN	2012	DBLP DOI BibTeX RDF