The following pages link to Joseph C. Culberson (Q690240):
Displaying 22 items.
- Searching in the plane (Q690242) (← links)
- (Q911248) (redirect page) (← links)
- Analysis of the standard deletion algorithms in exact fit domain binary search trees (Q911249) (← links)
- A fast algorithm for constructing trees from distance matrices (Q1116346) (← links)
- New results from an algorithm for counting posets (Q1177709) (← links)
- Orthogonally convex covering of orthogonal polygons without holes (Q1825650) (← links)
- On the complexity of unfrozen problems (Q2581544) (← links)
- Resolution complexity of random constraint satisfaction problems: Another half of the story (Q2581550) (← links)
- DP-Complete Problems Derived from Extremal NP-Complete Properties (Q3182925) (← links)
- Resolution Complexity of Random Constraint Satisfaction Problems: Another Half of the Story (Q3439112) (← links)
- (Q3624064) (← links)
- (Q3796804) (← links)
- (Q4230728) (← links)
- Covering Polygons Is Hard (Q4304059) (← links)
- (Q4411142) (← links)
- (Q4436921) (← links)
- Multicommodity flows in simple multistage networks (Q4698226) (← links)
- (Q5387655) (← links)
- (Q5687250) (← links)
- (Q5687258) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900282) (← links)
- Frozen development in graph coloring (Q5958809) (← links)
