Author of the publication

UNO Is Hard, Even for a Single Player.

, , , , and . FUN, volume 6099 of Lecture Notes in Computer Science, page 133-144. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs., , , , and . CoRR, (2014)A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number., , , and . Theor. Comput. Sci., (2021)Counting the number of independent sets in chordal graphs., , and . J. Discrete Algorithms, 6 (2): 229-242 (2008)Efficient algorithms for dualizing large-scale hypergraphs., and . ALENEX, page 1-13. SIAM, (2013)On Complexity of Flooding Games on Graphs with Interval Representations., , , , and . TJJCCGG, volume 8296 of Lecture Notes in Computer Science, page 73-84. Springer, (2012)Listing Maximal Independent Sets with Minimal Space and Bounded Delay., , , , and . SPIRE, volume 10508 of Lecture Notes in Computer Science, page 144-160. Springer, (2017)Polynomial Delay and Space Discovery of Connected and Acyclic Sub-hypergraphs in a Hypergraph., , , and . Discovery Science, volume 8140 of Lecture Notes in Computer Science, page 308-323. Springer, (2013)Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem., , , and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 452-462. Springer, (2011)Efficient Algorithms for Airline Problem., , and . TAMC, volume 4484 of Lecture Notes in Computer Science, page 428-439. Springer, (2007)Enumeration of Perfect Sequences of Chordal Graph., , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 859-870. Springer, (2008)