Author of the publication

DP-Complete Problems Derived from Extremal NP-Complete Properties.

, , and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 199-210. Springer, (2009)

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

DP-Complete Problems Derived from Extremal NP-Complete Properties., , and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 199-210. Springer, (2009)Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search., , and . IJCAI, page 78-83. Professional Book Center, (2005)On the Futility of Blind Search: An Algorithmic View of "No Free Lunch".. Evol. Comput., 6 (2): 109-127 (1998)A World Championship Caliber Checkers Program., , , , , and . Artif. Intell., 53 (2-3): 273-289 (1992)Using Infeasibility to Improve Abstraction-Based Heuristics., , and . SARA, volume 4612 of Lecture Notes in Computer Science, page 413-414. Springer, (2007)Frozen development in graph coloring., and . Theor. Comput. Sci., 265 (1-2): 227-264 (2001)Orthogonally Convex Coverings of Orthogonal Polygons without Holes., and . J. Comput. Syst. Sci., 39 (2): 166-204 (1989)Covering Polygons Is Hard (Preliminary Abstract), and . FOCS, page 601-611. IEEE Computer Society, (1988)Cost-Driven Data Caching in the Cloud: An Algorithmic Approach., , , , , , and . INFOCOM, page 1-10. IEEE, (2021)A General Theory of Additive State Space Abstractions., , , , and . J. Artif. Intell. Res., (2008)