J. Culberson

Available identifiers

Publication	Date of Publication	Type
DP-Complete Problems Derived from Extremal NP-Complete Properties	2009-10-16	Paper
https://portal.mardi4nfdi.de/entity/Q3624064	2009-04-28	Paper
Principles and Practice of Constraint Programming – CP 2004	2008-09-09	Paper
Recognizing maximal unfrozen graphs with respect to independent sets is CO-NP-complete	2008-05-27	Paper
Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story	2007-05-29	Paper
On the complexity of unfrozen problems	2006-01-10	Paper
Resolution complexity of random constraint satisfaction problems: Another half of the story	2006-01-10	Paper
https://portal.mardi4nfdi.de/entity/Q4436921	2003-12-04	Paper
https://portal.mardi4nfdi.de/entity/Q4411142	2003-07-07	Paper
Frozen development in graph coloring	2002-03-03	Paper
https://portal.mardi4nfdi.de/entity/Q4230728	1999-02-09	Paper
https://portal.mardi4nfdi.de/entity/Q5687250	1997-03-31	Paper
https://portal.mardi4nfdi.de/entity/Q5687258	1996-12-11	Paper
Multicommodity flows in simple multistage networks	1995-09-27	Paper
Covering Polygons Is Hard	1994-09-08	Paper
Searching in the plane	1993-12-20	Paper
New results from an algorithm for counting posets	1992-06-26	Paper
Analysis of the standard deletion algorithms in exact fit domain binary search trees	1990-01-01	Paper
A fast algorithm for constructing trees from distance matrices	1989-01-01	Paper
Orthogonally convex covering of orthogonal polygons without holes	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3796804	1988-01-01	Paper

This page was built for person: J. Culberson