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
[1]
Hilfe
Suche: Author="Welzl, E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A subexponential bound for linear programming
J. Matous̑ek
,
M. Sharir
,
E. Welzl
Algorithmica
16
, 1996, pp. 498-516
Drawing graphs in the plane with high resolution
M. Formann
,
T. Hagerup
,
J. Haralambides
,
M. Kaufmann
,
F.T. Leighton
,
A. Symvonis
,
E. Welzl
,
G. Woeginger
SIAM Journal on Computing
22
(5), 1993, October, pp. 1035-1052
Drawing graphs in the plane with high resolution
M. Formann
,
T. Hagerup
,
J. Haralambides
,
M. Kaufmann
,
F.T. Leighton
,
A. Simvonis
,
E. Welzl
,
G. Woeginger
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 86-95
Efficient parallel computation of arrangements of hyperplanes in
d
dimensions
T. Hagerup
,
H. Jung
,
E. Welzl
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'90 (Island of Crete, Greece, July 2-6, 1990)
, 1990, pp. 290-297
Weaving patterns of lines and line segments in space
J. Pach
,
R. Pollack
,
E. Welzl
Lecture Notes in Computer Science
450
, 1990, pp. 439-446
Approximation of convex figures by pairs of rectangles
O. Schwarzkopf
,
U. Fuchs
,
G. Rote
,
E. Welzl
Lecture Notes in Computer Science
415
, 1990, pp. 240-249
Combinatorial complexity bounds for arrangements of curves and surfaces
K.L. Clarkson
,
H. Edelsbrunner
,
L.J. Guibas
,
M. Sharir
,
E. Welzl
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 568-579
Testing the necklace condition for shortest tours and optimal factors in the plane
H. Edelsbrunner
,
G. Rote
,
E. Welzl
Lecture Notes in Computer Science
267
, 1987, pp. 364-375
On the maximal number of edges of many faces in an arrangement
H. Edelsbrunner
,
E. Welzl
Journal of Combinatorial Theory Series A
41
, 1986, pp. 159-166
Halfplanar range search in linear space and
O(n^{0.695})
query time
H. Edelsbrunner
,
E. Welzl
Information Processing Letters
23
(6), 1986, December, pp. 289-293
Constructing belts in two-dimensional arrangements with applications
H. Edelsbrunner
,
E. Welzl
SIAM Journal on Computing
15
(1), 1986, February, pp. 271-284
The bounded degree problem for NLC grammars is decidable
D. Janssens
,
G. Rozenberg
,
E. Welzl
Journal of Computer and System Sciences
33
(3), 1986, December, pp. 415-422
Graph theoretic closure properties of the family of boundary NLC graph languages
G. Rozenberg
,
E. Welzl
Acta Informatica
23
(3), 1986, pp. 289-309
Boundary NLC graph grammars - basic definitions, normal forms, and complexity
G. Rozenberg
,
E. Welzl
Information and Control
69
(1-3), 1986, pp. 136-167
On the number of line separations of a finite set in the plane
H. Edelsbrunner
,
E. Welzl
Journal of Combinatorial Theory Series A
38
, 1985, pp. 15-29
Recurrent words and simultaneous growth in TOL systems
K.-J. Lange
,
E. Welzl
Theoretical Computer Science
35
(1), 1985, pp. 1-15
String grammars with disconnecting
K.-J. Lange
,
E. Welzl
Lecture Notes in Computer Science
199
, 1985, pp. 249-256
Complexity and decidability for chain code picture languages
I.H. Sudborough
,
E. Welzl
Theoretical Computer Science
36
(2,3), 1985, pp. 173-202
Constructing the visibility graph for
n
-line segments in
O(n^2)
time
E. Welzl
Information Processing Letters
20
(4), 1985, May, pp. 167-171
Encoding graphs by derivations and implications for the theory of graph grammars
E. Welzl
Lecture Notes in Computer Science
172
, 1984, pp. 503-513
Using String Languages to Describe Picture Languages
H.A. Maurer
,
G. Rozenberg
,
E. Welzl
Information and Control
54
(3), 1982, pp. 155-185
Colour-families are dense
E. Welzl
Theoretical Computer Science
17
, 1982, pp. 29-41
On the complexity of the general coloring problem
H.A. Maurer
,
J.H. Sudborough
,
E. Welzl
Information and Control
51
, 1981, pp. 128-145
On the density of color-families
E. Welzl
Lecture Notes in Computer Science
115
, 1981, pp. 68-72