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="Overmars, Mark"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Flexible path planning using corridor maps
Mark Overmars
,
Ioannis Karamouzas
,
Roland Geraerts
Lecture Notes in Computer Science
5193
, 2008, pp. 1-12
Computing maximally separated sets in the plane
Pankaj K. Agarwal
,
Mark Overmars
,
Micha Sharir
SIAM Journal on Computing
36
(3), 2006, pp. 815-834
TSP with neighborhoods of varying size
Mark de Berg
,
Joachim Gudmundsson
,
Matthew J. Katz
,
Christos Levcopoulos
,
Mark H. Overmars
,
A. Frank van der Stappen
Journal of Algorithms
57
(1), 2005, pp. 22-36
Flat-state connectivity of linkages under dihedral motions
Greg Aloupis
,
Erik D. Demaine
,
Vida Dujmović
,
Jeff Erickson
,
Stefan Langerman
,
Henk Meijer
,
Joseph O'Rourke
,
Mark Overmars
,
Michael Soss
,
Ileana Streinu
,
Godfried T. Toussaint
Lecture Notes in Computer Science
2518
, 2002, pp. 369-380
TSP with neighborhoods of varying size
Mark de Berg
,
Joachim Gudmundsson
,
Matthew J. Katz
,
Christos Levcopoulos
,
Mark H. Overmars
,
A. Frank van der Stappen
Lecture Notes in Computer Science
2461
, 2002, pp. 187-199
Reporting intersecting pairs of polytopes in two and three dimensions
Pankaj K. Agarwal
,
Mark de Berg
,
Sariel Har-Peled
,
Mark H. Overmars
,
Micha Sharir
,
Jan Vahrenhold
Lecture Notes in Computer Science
2125
, 2001, pp. 122-134
On
R
-trees with low stabbing number
Mark de Berg
,
Joachim Gudmundsson
,
Mikael Hammar
,
Mark Overmars
Lecture Notes in Computer Science
1879
, 2000, pp. 167-178
Geometric algorithms for robotic manipulation
Mark H. Overmars
Lecture Notes in Computer Science
1443
, 1998, pp. 116-117
Guarding scenes against invasive hypercubes
Mark de Berg
,
Haggai David
,
Matthew J. Katz
,
Mark Overmars
,
A. Frank van der Stappen
,
Jules Vleugels
Proceedings of the 2nd Workshop on Algorithm Engineering, WAE'98 (Saarbrücken, Germany, August 20-22, 1998)
(MPI-I-98-1-019), 1998, pp. 110-120
Models and motion planning
Mark de Berg
,
Matthew J. Katz
,
Mark Overmars
,
A. Frank van der Stappen
,
Jules Vleugels
Lecture Notes in Computer Science
1432
, 1998, pp. 83-94
Dynamic motion planning in low obstacle density environments
Robert-Paul Berretty
,
Mark Overmars
,
A. Frank van der Stappen
Lecture Notes in Computer Science
1272
, 1997, pp. 3-16
Range searching and point location among fat objects
Mark H. Overmars
,
A. Frank van der Stappen
Journal of Algorithms
21
(3), 1996, pp. 629-656
Reaching a goal with directional uncertainty
Mark de Berg
,
Leonidas Guibas
,
Dan Halperin
,
Mark Overmars
,
Otfried Schwarzkopf
,
Micha Sharir
,
Monique Teillaud
Theoretical Computer Science
140
(2), 1995, pp. 301-317
Range searching and point location among fat objects
Mark H. Overmars
,
A. Frank van der Stappen
Proceedings of the 2nd Annual European Symposium on Algorithms. ESA '94 (Utrecht, The Netherlands, September 26-28, 1994)
LNCS 855
, 1994, pp. 240-253
New results on binary space partitions in the plane
Mark de Berg
,
Marko de Groot
,
Mark Overmars
Proceedings of the 4th Scandinavian Workshop on Algorithm Theory - SWAT '94 (Aarhus, Denmark, July 6-8, 1994)
LNCS 824
, 1994, pp. 61-72
Computing and verifying depth orders
Mark de Berg
,
Mark Overmars
,
Otfried Schwarzkopf
SIAM Journal on Computing
23
(2), 1994, April, pp. 437-446
Concatenable structures for decomposable problems
Marc J. van Kreveld
,
Mark H. Overmars
Information and Computation
110
(1), 1994, April, pp. 130-148
Intersection queries in curved objects
Pankaj K. Agarwal
,
Marc van Kreveld
,
Mark Overmars
Journal of Algorithms
15
(2), 1993, pp. 229-266
Output-sensitive methods for rectilinear hidden surface removal
Michael T. Goodrich
,
Mikhail J. Atallah
,
Mark H. Overmars
Information and Computation
107
(1), 1993, November, pp. 1-24
Reaching a goal with directional uncertainty
Mark de Berg
,
Leonidas Guibas
,
Dan Halperin
,
Mark Overmars
,
Otfried Schwarzkopf
,
Micha Sharir
,
Monique Teillaud
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 1-10
Union-copy structures and dynamic segment trees
Marc J. van Kreveld
,
Mark H. Overmars
Journal of the ACM
40
(3), 1993, July, pp. 635-652
Efficient motion planning for an
L
-shaped object
Dan Halperin
,
Mark H. Overmars
,
Micha Sharir
SIAM Journal on Computing
21
(1), 1992, February, pp. 1-23
Point location in fat subdivisions
Mark H. Overmars
Information Processing Letters
44
(5), 1992, pp. 261-265
A general approach to dominance in the plane
Mark T. de Berg
,
Svante Carlsson
,
Mark H. Overmars
Journal of Algorithms
13
, 1992, pp. 274-296
New upper bounds in Klee's measure problem
Mark H. Overmars
,
Chee-Keng Yap
SIAM Journal on Computing
20
(6), 1991, December, pp. 1034-1045
Seiten 1
2
>