Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Culberson, Joseph"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
DP
-complete problems derived from extremal
NP
-complete properties
Yi Cao
,
Joseph Culberson
,
Lorna Stewart
Lecture Notes in Computer Science
5734
, 2009, pp. 199-210
Frozen development in graph coloring
Joseph Culberson
,
Ian Gent
Theoretical Computer Science
265
(1-2), 2001, pp. 227-264
Covering polygons is hard
Joseph C. Culberson
,
Robert A. Reckhow
Journal of Algorithms
17
(1), 1994, pp. 2-44
Searching in the plane
Ricardo A. Baeza-Yates
,
Joseph C. Culberson
,
Gregory J.E. Rawlins
Information and Computation
106
(2), 1993, October, pp. 234-252
Analysis of the standard deletion algorithms in exact fit domain binary search trees
Joseph Culberson
,
J. Ian Munro
Algorithmica
5
, 1990, pp. 295-311
Orthogonally convex coverings of orthogonal polygons without holes
Joseph Culberson
,
Robert A. Reckhow
Journal of Computer and System Sciences
39
, 1989, pp. 166-204
A fast algorithm for constructing trees from distance matrices
Joseph C. Culberson
,
Piotr Rudnicki
Information Processing Letters
30
, 1989, pp. 215-220