J. Culberson

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
DP-Complete Problems Derived from Extremal NP-Complete Properties Mathematical Foundations of Computer Science 2009	2009-10-16	Paper
scientific article; zbMATH DE number 5547880 (Why is no real title available?) (available as arXiv preprint)	2009-04-28	Paper
Principles and Practice of Constraint Programming – CP 2004 Lecture Notes in Computer Science	2008-09-09	Paper
Recognizing maximal unfrozen graphs with respect to independent sets is CO-NP-complete	2008-05-27	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 Electronic Notes in Discrete Mathematics	2007-05-29	Paper
On the complexity of unfrozen problems Discrete Applied Mathematics	2006-01-10	Paper
Resolution complexity of random constraint satisfaction problems: Another half of the story Discrete Applied Mathematics	2006-01-10	Paper
scientific article; zbMATH DE number 2013546 (Why is no real title available?)	2003-12-04	Paper
scientific article; zbMATH DE number 1946856 (Why is no real title available?)	2003-07-07	Paper
Frozen development in graph coloring Theoretical Computer Science	2002-03-03	Paper
scientific article; zbMATH DE number 1249657 (Why is no real title available?)	1999-02-09	Paper
scientific article; zbMATH DE number 956843 (Why is no real title available?)	1997-03-31	Paper
scientific article; zbMATH DE number 956851 (Why is no real title available?)	1996-12-11	Paper
Multicommodity flows in simple multistage networks Networks	1995-09-27	Paper
Covering Polygons Is Hard Journal of Algorithms	1994-09-08	Paper
Searching in the plane Information and Computation	1993-12-20	Paper
New results from an algorithm for counting posets Order	1992-06-26	Paper
Analysis of the standard deletion algorithms in exact fit domain binary search trees Algorithmica	1990-01-01	Paper
A fast algorithm for constructing trees from distance matrices Information Processing Letters	1989-01-01	Paper
Orthogonally convex covering of orthogonal polygons without holes Journal of Computer and System Sciences	1989-01-01	Paper
scientific article; zbMATH DE number 4062645 (Why is no real title available?)	1988-01-01	Paper

Research outcomes over time

This page was built for person: J. Culberson