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="Overmars, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Geometric eccentricity and the complexity of manipulation plans
A.F. van der Stappen
,
K. Goldberg
,
M.H. Overmars
Algorithmica
26
(3-4), 2000, pp. 494-514
Locked and unlocked polygonal chains in 3D
T. Biedl
,
E. Demaine
,
M. Demaine
,
S. Lazard
,
A. Lubiw
,
J. O'Rourke
,
M. Overmars
,
S. Robbins
,
I. Streinu
,
G. Toussaint
,
S. Whitesides
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 866-867
Feasibility of design in stereolithography
B. Asberg
,
G. Blanco
,
P. Bose
,
J. Garcia-Lopez
,
M. Overmars
,
G. Toussaint
,
G. Wilfong
,
B. Zhu
Algorithmica
19
, 1997, pp. 61-83
Improved bounds for electing a leader in a synchronous ring
M. Overmars
,
N. Santoro
Algorithmica
18
(2), 1997, pp. 246-262
An improved technique for output-sensitive hidden surface removal
M.H. Overmars
,
M. Sharir
Algorithmica
11
, 1994, pp. 469-484
Efficient ray-shooting and hidden surface removal
M. de Berg
,
D. Halperin
,
M. Overmars
,
J. Snoeyink
,
M. van Kreveld
Algorithmica
12
(1), 1994, pp. 30-53
Feasibility of design in stereolithography
B. Asberg
,
G. Blanco
,
P. Bose
,
J. Garcia-Lopez
,
M. Overmars
,
G. Toussaint
,
G. Wilfong
,
B. Zhu
Lecture Notes in Computer Science
761
, 1993, pp. 228-237
Maintenance of 2- and 3-edge-connected components of graphs I
J.A. La Poutré
,
J. van Leeuwen
,
M.H. Overmars
Discrete Mathematics
114
(1-3), 1993, pp. 329-359
Hidden surface removal for axis-parallel polyhedra
M. de Berg
,
M.H. Overmars
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. 252-261
Output-sensitive hidden surface removal
M. Overmars
,
M. Sharir
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 598-603
Dominance in the presence of obstacles
M.T. de Berg
,
M.H. Overmars
Lecture Notes in Computer Science
344
, 1989, pp. 190-201
Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
L. Guibas
,
M. Overmars
,
M. Sharir
Lecture Notes in Computer Science
318
, 1988, pp. 64-73
Normalized divide-and-conquer: a scaling technique for solving multi-dimensional problems
R.G. Karlsson
,
M.H. Overmars
Information Processing Letters
26
(6), 1988, January, pp. 307-312
Maintaining range trees in secondary memory
M.H. Overmars
,
M.H.M. Smid
Lecture Notes in Computer Science
294
, 1988, pp. 38-51
New upper bounds in Klee's measure problem
M.H. Overmars
,
C.K. Yap
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 550-556
Efficient data structures for range searching on a grid
M.H. Overmars
Journal of Algorithms
9
(2), 1988, June, pp. 254-275
Connectability problems
M.H. Overmars
Lecture Notes in Computer Science
318
, 1988, pp. 105-112
Zooming by repeated range detection
H. Edelsbrunner
,
M.H. Overmars
Information Processing Letters
24
(6), 1987, April, pp. 413-417
Batched dynamic solutions to decomposable searching problems
H. Edelsbrunner
,
M.H. Overmars
Journal of Algorithms
6
(4), 1985, pp. 515-542
Stratified balanced search trees
J. van Leeuwen
,
M.H. Overmars
Acta Informatica
18
(4), 1983, pp. 345-359
On the equivalence of some rectangle problems
H. Edelsbrunner
,
M.H. Overmars
Information Processing Letters
14
(3), 1982, May, pp. 124-127
Dynamic multi-dimensional data structures based on quad- and k-d trees
M.H. Overmars
,
J. van Leeuwen
Acta Informatica
17
(3), 1982, pp. 267-285
Lower bounds and upper bounds on VLSI-layouts for perfect binary trees
M.H. Overmars
Applied Computer Science
, 1982, pp. 225-231
Optimal dynamization of decomposable searching problems
K. Mehlhorn
,
M.H. Overmars
Information Processing Letters
12
(2), 1981, April, pp. 93-98
Worst-case optimal insertion and deletion methods for decomposable searching problems
M.H. Overmars
,
J. van Leeuwen
Information Processing Letters
12
(4), 1981, August, pp. 168-173
Seiten 1
2
>