Dominance in the Presence of Obstracles. - Mark de Berg; Mark H. Overmars (WG, 1988)

Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract) - Mark de Berg; Mark H. Overmars (FOCS, 1990)

Translating Polygons with Applications to Hidden Surface Removal. - Mark de Berg (SWAT, 1990)

Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. - Mark de Berg; Marc J. van Kreveld; Bengt J. Nilsson; Mark H. Overmars (SWAT, 1990)

Maintaining Range Trees in Secondary Memory. Part I: Partitions. - Mark H. Overmars; Michiel H. M. Smid; Mark de Berg; Marc J. van Kreveld (Acta Informatica, 1990)

Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). - Mark de Berg; Marc J. van Kreveld; Bengt J. Nilsson (SCG, 1991)

Finding Squares and Rectangles in Sets of Points. - Marc J. van Kreveld; Mark de Berg (BIT, 1991)

On Rectilinear Link Distance. - Mark de Berg (Comput. Geom., 1991)

Hidden Surface Removal for C-oriented Polyhedra. - Mark de Berg; Mark H. Overmars (Comput. Geom., 1991)

Efficient algorithms for ray shooting and hidden surface removal. - Mark de Berg (1992)

Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). - Mark de Berg; Marc J. van Kreveld; Jack Snoeyink (SWAT, 1992)

Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra. - Mark de Berg (Comput. Geom., 1992)

Shortest path queries in rectilinear worlds. - Mark de Berg; Marc J. van Kreveld; Bengt J. Nilsson; Mark H. Overmars (Int. J. Comput. Geom. Appl., 1992)

A General Approach to Dominance in the Plane. - Mark de Berg; Svante Carlsson; Mark H. Overmars (J. Algorithms, 1992)

Ray Shooting, Depth Orders and Hidden Surface Removal - Mark de Berg (Springer, 1993)

New Results on Binary Space Partitions in the Plane (Extended Abstract). - Mark de Berg; Marko de Groot; Mark H. Overmars (SWAT, 1994)

Efficient Ray Shooting and Hidden Surface Removal. - Mark de Berg; Dan Halperin; Mark H. Overmars; Jack Snoeyink; Marc J. van Kreveld (Algorithmica, 1994)

Rectilinear Decompositions with Low Stabbing Number. - Mark de Berg; Marc J. van Kreveld (Inf. Process. Lett., 1994)

Computing and Verifying Depth Orders. - Mark de Berg; Mark H. Overmars; Otfried Schwarzkopf (SIAM J. Comput., 1994)

Linear Size Binary Space Partitions for Fat Objects. - Mark de Berg (ESA, 1995)

Generalized Hidden Surface Removal. - Mark de Berg (Comput. Geom., 1995)

On Lazy Randomized Incremental Construction. - Mark de Berg; Katrin Dobrindt; Otfried Schwarzkopf (Discret. Comput. Geom., 1995)

Piecewise Linear Paths Among Convex Obstacles. - Mark de Berg; Jirí Matousek 001; Otfried Schwarzkopf (Discret. Comput. Geom., 1995)

Translation queries for sets of polygons. - Mark de Berg; Hazel Everett; Hubert Wagener (Int. J. Comput. Geom. Appl., 1995)

Cuttings and applications. - Mark de Berg; Otfried Schwarzkopf (Int. J. Comput. Geom. Appl., 1995)

Two- and Three-Dimensional Point Location in Rectangular Subdivisions. - Mark de Berg; Marc J. van Kreveld; Jack Snoeyink (J. Algorithms, 1995)

Reaching a Goal with Directional Uncertainty. - Mark de Berg; Leonidas J. Guibas; Dan Halperin; Mark H. Overmars; Otfried Schwarzkopf; Micha Sharir; Monique Teillaud (Theor. Comput. Sci., 1995)

The Complexity of Rivers in Triangulated Terrains. - Mark de Berg; Prosenjit Bose; Katrin Dobrindt; Marc J. van Kreveld; Mark H. Overmars; Marko de Groot; Thomas Roos; Jack Snoeyink; Sidi Yu (CCCG, 1996)

Visualization of TINs. - Mark de Berg (Algorithmic Foundations of Geographic Information Systems, 1996)

Simple Traversal of a Subdivision Without Extra Storage. - Mark de Berg; René van Oostrum; Mark H. Overmars (SCG, 1996)

Efficient Generation of k-Directional Assembly Sequences. - Pankaj K. Agarwal; Mark de Berg; Dan Halperin; Micha Sharir (SODA, 1996)

Computing Half-plane and Strip Discrepancy of Planar Point Sets. - Mark de Berg (Comput. Geom., 1996)

Point Location in Zones of K-flats in Arrangements. - Mark de Berg; Marc J. van Kreveld; Otfried Schwarzkopf; Jack Snoeyink (Comput. Geom., 1996)

Vertical Decompositions for Triangles in 3-Space. - Mark de Berg; Leonidas J. Guibas; Dan Halperin (Discret. Comput. Geom., 1996)

Computational geometry: algorithms and applications. - Mark de Berg (Springer, 1997)

Trekking in the Alps Without Freezing or Getting Tired. - Mark de Berg; Marc J. van Kreveld (Algorithmica, 1997)

Trends and Developments in Computational Geometry. - Mark de Berg (Comput. Graph. Forum, 1997)

New Results on Binary Space Partitions in the Plane. - Mark de Berg; Marko de Groot; Mark H. Overmars (Comput. Geom., 1997)

Perfect Binary Space Partitions. - Mark de Berg; Marko de Groot; Mark H. Overmars (Comput. Geom., 1997)

Simple Traversal of a Subdivision Without Extra Storage. - Mark de Berg; Marc J. van Kreveld; René van Oostrum; Mark H. Overmars (Int. J. Geogr. Inf. Sci., 1997)

Sparse Arrangements and the Number of Views of Polyhedral Scenes. - Mark de Berg; Dan Halperin; Mark H. Overmars; Marc J. van Kreveld (Int. J. Comput. Geom. Appl., 1997)

Computing a Single Cell in the Overlay of Two Simple Polygons. - Mark de Berg; Olivier Devillers; Katrin Dobrindt; Otfried Schwarzkopf (Inf. Process. Lett., 1997)

Recovering lines with fixed linear probes. - Mark de Berg; Prosenjit Bose; David Bremner; William S. Evans; Lata Narayanan (CCCG, 1998)

Computing constrained minimum-width annuli of point sets. - Mark de Berg; Prosenjit Bose; David Bremner; Suneeta Ramaswami; Gordon T. Wilfong (Comput. Aided Des., 1998)

The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. - Mark de Berg; Hazel Everett; Leonidas J. Guibas (Comput. Geom., 1998)

On Levels of Detail in Terrains. - Mark de Berg; Katrin Dobrindt (Graph. Model. Image Process., 1998)

Motion Planning in Environments with Low Obstacle Density. - A. Frank van der Stappen; Mark H. Overmars; Mark de Berg; Jules Vleugels (Discret. Comput. Geom., 1998)

Computing the Angularity Tolerance. - Mark de Berg; Henk Meijer; Mark H. Overmars; Gordon T. Wilfong (Int. J. Comput. Geom. Appl., 1998)

Computing the Maximum Overlap of Two Convex Polygons under Translations. - Mark de Berg; Otfried Cheong; Olivier Devillers; Marc J. van Kreveld; Monique Teillaud (Theory Comput. Syst., 1998)

Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. - Pankaj K. Agarwal; Mark de Berg; Jirí Matousek 001; Otfried Schwarzkopf (SIAM J. Comput., 1998)

On The Design of Genetic Algorithms for Geographical Applications. - Steven van Dijk; Dirk Thierens; Mark de Berg (GECCO, 1999)

Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. - Paolo Ferragina; S. Muthukrishnan 001; Mark de Berg (STOC, 1999)

Motion Planning for Multiple Robots. - Boris Aronov; Mark de Berg; A. Frank van der Stappen; Petr Svestka; Jules Vleugels (Discret. Comput. Geom., 1999)

Computational geometry: algorithms and applications, 2nd Edition. - Mark de Berg (Springer, 2000)

On R-trees with Low Stabbing Number. - Mark de Berg; Joachim Gudmundsson; Mikael Hammar; Mark H. Overmars (ESA, 2000)

Scalability and Efficiency of Genetic Algorithms for Geometrical Applications. - Steven van Dijk; Dirk Thierens; Mark de Berg (PPSN, 2000)

Linear Size Binary Space Partitions for Uncluttered Scenes. - Mark de Berg (Algorithmica, 2000)

Lower Bounds for Kinetic Planar Subdivisions. - Pankaj K. Agarwal; Julien Basch; Mark de Berg; Leonidas J. Guibas; John Hershberger 001 (Discret. Comput. Geom., 2000)

A segment-tree based kinetic BSP. - Mark de Berg; João Comba; Leonidas J. Guibas (SCG, 2001)

Schematization of road networks. - Sergio Cabello; Mark de Berg; Steven van Dijk; Marc J. van Kreveld; Tycho Strijk (SCG, 2001)

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 (WADS, 2001)

Realistic Input Models for Geometric Algorithms. - Mark de Berg; A. Frank van der Stappen; Jules Vleugels; Matthew J. Katz (Algorithmica, 2002)

Separating an object from its cast. - Hee-Kap Ahn; Mark de Berg; Prosenjit Bose; Siu-Wing Cheng; Dan Halperin; Jirí Matousek 001; Otfried Schwarzkopf (Comput. Aided Des., 2002)

Reporting intersecting pairs of convex polytopes in two and three dimensions. - Pankaj K. Agarwal; Mark de Berg; Sariel Har-Peled; Mark H. Overmars; Micha Sharir; Jan Vahrenhold (Comput. Geom., 2002)

Models and motion planning. - Mark de Berg; Matthew J. Katz; Mark H. Overmars; A. Frank van der Stappen; Jules Vleugels (Comput. Geom., 2002)

Box-Trees and R-Trees with Near-Optimal Query Time. - Pankaj K. Agarwal; Mark de Berg; Joachim Gudmundsson; Mikael Hammar; Herman J. Haverkort (Discret. Comput. Geom., 2002)

Using Genetic Algorithms for Solving Hard Problems in GIS. - Steven van Dijk; Dirk Thierens; Mark de Berg (GeoInformatica, 2002)

Guest Editor's Foreword. - Mark de Berg; Stefan Schirra (Int. J. Comput. Geom. Appl., 2002)

On the fatness of Minkowski sums. - Mark de Berg; A. Frank van der Stappen (Inf. Process. Lett., 2002)

Kinetic Dictionaries: How to Shoot a Moving Target. - Mark de Berg (ESA, 2003)

Significant-Presence Range Queries in Categorical Data. - Mark de Berg; Herman J. Haverkort (WADS, 2003)

Guarding scenes against invasive hypercubes. - Mark de Berg; Haggai David; Matthew J. Katz; Mark H. Overmars; A. Frank van der Stappen; Jules Vleugels (Comput. Geom., 2003)

On R-trees with low query complexity. - Mark de Berg; Joachim Gudmundsson; Mikael Hammar; Mark H. Overmars (Comput. Geom., 2003)

Spanning Trees Crossing Few Barriers. - Tetsuo Asano; Mark de Berg; Otfried Cheong; Leonidas J. Guibas; Jack Snoeyink; Hisao Tamaki (Discret. Comput. Geom., 2003)

On simplifying dot maps. - Mark de Berg; Prosenjit Bose; Otfried Cheong; Pat Morin (Comput. Geom., 2004)

Box-trees for collision checking in industrial installations. - Herman J. Haverkort; Mark de Berg; Joachim Gudmundsson (Comput. Geom., 2004)

Guest Editor's Foreword. - Mark de Berg (Discret. Comput. Geom., 2004)

On the Design and Analysis of Competent Selecto-recombinative GAs. - Steven van Dijk; Dirk Thierens; Mark de Berg (Evol. Comput., 2004)

Computational Geometry. - Mark de Berg; Bettina Speckmann (Handbook of Data Structures and Applications, 2004)

Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. - Pankaj K. Agarwal; Mark de Berg; Jie Gao 001; Leonidas J. Guibas; Sariel Har-Peled (CCCG, 2005)

Vertical ray shooting for fat objects. - Mark de Berg (SCG, 2005)

Lower bounds for kinetic sorting. - Mohammad Ali Abam; Mark de Berg (EuroCG, 2005)

Sparse Geometric Graphs with Small Dilation. - Boris Aronov; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Herman J. Haverkort; Antoine Vigneron (ISAAC, 2005)

A Polynomial-time Algorithm to Design Push Plans for Sensorless Parts Sorting. - Mark de Berg; Xavier Goaoc; A. Frank van der Stappen (Robotics: Science and Systems, 2005)

Optimal spanners for axis-aligned rectangles. - Tetsuo Asano; Mark de Berg; Otfried Cheong; Hazel Everett; Herman J. Haverkort; Naoki Katoh; Alexander Wolff 001 (Comput. Geom., 2005)

Schematization of networks. - Sergio Cabello; Mark de Berg; Marc J. van Kreveld (Comput. Geom., 2005)

TSP with neighborhoods of varying size. - Mark de Berg; Joachim Gudmundsson; Matthew J. Katz; Christos Levcopoulos; Mark H. Overmars; A. Frank van der Stappen (J. Algorithms, 2005)

Approximate range searching using binary space partitions. - Mark de Berg; Micha Streppel (Comput. Geom., 2006)

I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. - Mark de Berg; Herman J. Haverkort; Shripad Thite; Laura Toma (ISAAC, 2007)

I/O-Efficient Flow Modeling on Fat Terrains. - Mark de Berg; Otfried Cheong; Herman J. Haverkort; Jung Gun Lim; Laura Toma (WADS, 2007)

Kinetic sorting and kinetic convex hulls. - Mohammad Ali Abam; Mark de Berg (Comput. Geom., 2007)

Editorial. - Mark de Berg; Joachim Gudmundsson; René van Oostrum; Bettina Speckmann (Comput. Geom., 2007)

An intersection-sensitive algorithm for snap rounding. - Mark de Berg; Dan Halperin; Mark H. Overmars (Comput. Geom., 2007)

Computational geometry: algorithms and applications, 3rd Edition. - Mark de Berg; Otfried Cheong; Marc J. van Kreveld; Mark H. Overmars (Springer, 2008)

Fault-Tolerant Conflict-Free Coloring. - Mohammad Ali Abam; Mark de Berg; Sheung-Hung Poon (CCCG, 2008)

The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. - Boris Aronov; Mark de Berg; Shripad Thite (ESA, 2008)

Spatial Support and Spatial Confidence for Spatial Association Rules. - Patrick Laube; Mark de Berg; Marc J. van Kreveld (SDH, 2008)

Cutting cycles of rods in space: hardness and approximation. - Boris Aronov; Mark de Berg; Chris Gray; Elena Mumford (SODA, 2008)

Sparse geometric graphs with small dilation. - Boris Aronov; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Herman J. Haverkort; Michiel H. M. Smid; Antoine Vigneron (Comput. Geom., 2008)

Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. - Boris Aronov; Mark de Berg; Chris Gray (Comput. Geom., 2008)

Cache-Oblivious Selection in Sorted X+Y Matrices - Mark de Berg; Shripad Thite (CoRR, 2008)

Improved Bounds on the Union Complexity of Fat Objects. - Mark de Berg (Discret. Comput. Geom., 2008)

Cache-oblivious selection in sorted X. - Mark de Berg; Shripad Thite (Inf. Process. Lett., 2008)

Vertical Ray Shooting and Computing Depth Orders for Fat Objects. - Mark de Berg; Chris Gray (SIAM J. Comput., 2008)

The priority R-tree: A practically efficient and worst-case optimal R-tree. - Lars Arge; Mark de Berg; Herman J. Haverkort; Ke Yi 001 (ACM Trans. Algorithms, 2008)

Kinetic spanners in Rd. - Mohammad Ali Abam; Mark de Berg (SCG, 2009)

Rectangular cartograms: the game. - Mark de Berg; Fred van Nijnatten; Bettina Speckmann; Kevin Verbeek (SCG, 2009)

Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy. - Mark de Berg; Peter Hachenberger (SEA, 2009)

Kinetic Collision Detection for Convex Fat Objects. - Mohammad Ali Abam; Mark de Berg; Sheung-Hung Poon; Bettina Speckmann (Algorithmica, 2009)

Cache-Oblivious R-Trees. - Lars Arge; Mark de Berg; Herman J. Haverkort (Algorithmica, 2009)

Efficient c-oriented range searching with DOP-trees. - Mark de Berg; Herman J. Haverkort; Micha Streppel (Comput. Geom., 2009)

Region-Fault Tolerant Geometric Spanners. - Mohammad Ali Abam; Mark de Berg; Mohammad Farshi; Joachim Gudmundsson (Discret. Comput. Geom., 2009)

On rectilinear duals for vertex-weighted plane graphs. - Mark de Berg; Elena Mumford; Bettina Speckmann (Discret. Math., 2009)

Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. - Sergio Cabello; Mark de Berg; Panos Giannopoulos; Christian Knauer; René van Oostrum; Remco C. Veltkamp (Int. J. Comput. Geom. Appl., 2009)

Covering Many or Few Points with Unit Disks. - Mark de Berg; Sergio Cabello; Sariel Har-Peled (Theory Comput. Syst., 2009)

Kinetic kd-Trees and Longest-Side kd-Trees. - Mohammad Ali Abam; Mark de Berg; Bettina Speckmann (SIAM J. Comput., 2009)

Finding monochromatic l-shapes in bichromatic point sets. - Farnaz Sheikhi; Mark de Berg; Ali Mohades; Mansoor Davoodi Monfared (CCCG, 2010)

Optimal Binary Space Partitions in the Plane. - Mark de Berg; Amirali Khosravi (COCOON, 2010)

Better bounds on the union complexity of locally fat objects. - Mark de Berg (SCG, 2010)

10491 Results of the break-out group: Aggregation. - Mark de Berg; Jörg-Rüdiger Sack; Bettina Speckmann; Anne Driemel; Maike Buchin; Monika Sester; Marc J. van Kreveld (Representation, Analysis and Visualization of Moving Objects, 2010)

10491 Results of the break-out group: Gulls Data. - Emiel van Loon; Jörg-Rüdiger Sack; Kevin Buchin; Maike Buchin; Mark de Berg; Marc J. van Kreveld; Joachim Gudmundsson; David M. Mountain (Representation, Analysis and Visualization of Moving Objects, 2010)

The Traveling Salesman Problem under Squared Euclidean Distances. - Fred van Nijnatten; René Sitters; Gerhard J. Woeginger; Alexander Wolff 001; Mark de Berg (STACS, 2010)

A simple and efficient kinetic spanner. - Mohammad Ali Abam; Mark de Berg; Joachim Gudmundsson (Comput. Geom., 2010)

The complexity of flow on fat terrains and its i/o-efficient computation. - Mark de Berg; Otfried Cheong; Herman J. Haverkort; Jung Gun Lim; Laura Toma (Comput. Geom., 2010)

Decompositions and boundary coverings of non-convex fat polyhedra. - Mark de Berg; Chris Gray (Comput. Geom., 2010)

Computing the visibility map of fat objects. - Mark de Berg; Chris Gray (Comput. Geom., 2010)

Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. - Mark de Berg; Herman J. Haverkort; Shripad Thite; Laura Toma (Comput. Geom., 2010)

Streaming Algorithms for Line Simplification. - Mohammad Ali Abam; Mark de Berg; Peter Hachenberger; Alireza Zarei (Discret. Comput. Geom., 2010)

Optimal BSPs and Rectilinear Cartograms. - Mark de Berg; Elena Mumford; Bettina Speckmann (Int. J. Comput. Geom. Appl., 2010)

Visibility Maps of Realistic Terrains have Linear Smoothed Complexity. - Mark de Berg; Herman J. Haverkort; Constantinos P. Tsirogiannis (J. Comput. Geom., 2010)

Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. - Mohammad Ali Abam; Boris Aronov; Mark de Berg; Amirali Khosravi (SCG, 2011)

Kinetic convex hulls and delaunay triangulations in the black-box model. - Mark de Berg; Marcel Roeloffzen; Bettina Speckmann (SCG, 2011)

Delineating imprecise regions via shortest-path graphs. - Mark de Berg; Wouter Meulemans; Bettina Speckmann (GIS, 2011)

Exact and approximate computations of watersheds on triangulated terrains. - Mark de Berg; Constantinos P. Tsirogiannis (GIS, 2011)

Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures. - Mark de Berg; Herman J. Haverkort; Constantinos P. Tsirogiannis (SODA, 2011)

Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves. - Mark de Berg; Atlas F. Cook (TAPAS, 2011)

Piecewise-Linear Approximations of Uncertain Functions. - Mohammad Ali Abam; Mark de Berg; Amirali Khosravi (WADS, 2011)

On Rectilinear Partitions with Minimum Stabbing Number. - Mark de Berg; Amirali Khosravi; Sander Verdonschot; Vincent van der Weele (WADS, 2011)

Out-of-Order Event Processing in Kinetic Data Structures. - Mohammad Ali Abam; Pankaj K. Agarwal; Mark de Berg; Hai Yu 005 (Algorithmica, 2011)

Geometric Spanners for Weighted Point Sets. - Mohammad Ali Abam; Mark de Berg; Mohammad Farshi; Joachim Gudmundsson; Michiel H. M. Smid (Algorithmica, 2011)

Kinetic Spanners in ℝd. - Mohammad Ali Abam; Mark de Berg (Discret. Comput. Geom., 2011)

Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes. - Mark de Berg; Marcel Roeloffzen; Bettina Speckmann (ESA, 2012)

Guest Editorial. - Mark de Berg (Algorithmica, 2012)

Approximation algorithms for free-label maximization. - Mark de Berg; Dirk H. P. Gerrits (Comput. Geom., 2012)

Unions of Fat Convex Polytopes Have Short Skeletons. - Boris Aronov; Mark de Berg (Discret. Comput. Geom., 2012)

Optimal Binary Space Partitions for Segments in the Plane. - Mark de Berg; Amirali Khosravi (Int. J. Comput. Geom. Appl., 2012)

Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model. - Mark de Berg; Marcel Roeloffzen; Bettina Speckmann (J. Comput. Geom., 2012)

Kinetic 2-centers in the black-box model. - Mark de Berg; Marcel Roeloffzen; Bettina Speckmann (SoCG, 2013)

Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap. - Mark de Berg; Dirk H. P. Gerrits (ESA, 2013)

Distance-Sensitive Planar Point Location. - Boris Aronov; Mark de Berg; Marcel Roeloffzen; Bettina Speckmann (WADS, 2013)

Fast Fréchet queries. - Mark de Berg; Atlas F. Cook IV; Joachim Gudmundsson (Comput. Geom., 2013)

Computing Push Plans for Disk-shaped Robots. - Mark de Berg; Dirk H. P. Gerrits (Int. J. Comput. Geom. Appl., 2013)

Fat Polygonal Partitions with Applications to Visualization and Embeddings. - Mark de Berg; Krzysztof Onak; Anastasios Sidiropoulos (J. Comput. Geom., 2013)

Separability of Imprecise Points. - Mark de Berg; Ali D. Mehrabi; Farnaz Sheikhi (SWAT, 2014)

Treemaps with bounded aspect ratio. - Mark de Berg; Bettina Speckmann; Vincent van der Weele (Comput. Geom., 2014)

Improved Bounds for the Union of Locally Fat Objects in the Plane. - Boris Aronov; Mark de Berg; Esther Ezra; Micha Sharir (SIAM J. Comput., 2014)

Fast computation of categorical richness on raster data sets and related problems. - Mark de Berg; Constantinos Tsirogiannis; Bryan T. Wilkinson (SIGSPATIAL/GIS, 2015)

Separating bichromatic point sets by L-shapes. - Farnaz Sheikhi; Ali Mohades; Mark de Berg; Mansoor Davoodi (Comput. Geom., 2015)

Progressive geometric algorithms. - Sander P. A. Alewijnse; Timur M. Bagautdinov; Mark de Berg; Quirijn W. Bouts; Alex P. ten Brink; Kevin Buchin; Michel A. Westenberg (J. Comput. Geom., 2015)

Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons. - Aviv Adler; Mark de Berg; Dan Halperin; Kiril Solovey (IEEE Trans Autom. Sci. Eng., 2015)

Distance-sensitive planar point location. - Boris Aronov; Mark de Berg; David Eppstein; Marcel Roeloffzen; Bettina Speckmann (Comput. Geom., 2016)

Straight-path queries in trajectory data. - Mark de Berg; Ali D. Mehrabi (J. Discrete Algorithms, 2016)

Hierarchical Space Decompositions for Low-Density Scenes. - Mark de Berg (Encyclopedia of Algorithms, 2016)

An Efficient Algorithm for the 1D Total Visibility-Index Problem. - Peyman Afshani; Mark de Berg; Henri Casanova; Benjamin Karsin; Colin Lambrechts; Nodari Sitchinava; Constantinos Tsirogiannis (ALENEX, 2017)

Data Structures for Fréchet Queries in Trajectory Data. - Mark de Berg; Ali D. Mehrabi; Tim Ophelders (CCCG, 2017)

Range-Clustering Queries. - Mikkel Abrahamsen; Mark de Berg; Kevin Buchin; Mehran Mehr; Ali D. Mehrabi (SoCG, 2017)

Removing Depth-Order Cycles among Triangles: An Efficient Algorithm Generating Triangular Fragments. - Mark de Berg (FOCS, 2017)

A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data. - Mark de Berg; Joachim Gudmundsson; Ali D. Mehrabi (SIGSPATIAL/GIS, 2017)

The Dominating Set Problem in Geometric Intersection Graphs. - Mark de Berg; Sándor Kisfaludi-Bak; Gerhard J. Woeginger (IPEC, 2017)

The Homogeneous Broadcast Problem in Narrow and Wide Strips. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak (WADS, 2017)

Separability of imprecise points. - Farnaz Sheikhi; Ali Mohades; Mark de Berg; Ali D. Mehrabi (Comput. Geom., 2017)

Faster DB-scan and HDB-scan in Low-Dimensional Euclidean Spaces. - Mark de Berg; Ade Gunawan; Marcel Roeloffzen (CoRR, 2017)

Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. - Mark de Berg; Tim Leijsen; André van Renssen; Marcel Roeloffzen; Aleksandar Markovic 001; Gerhard J. Woeginger (CoRR, 2017)

Guest Editors' Foreword. - Mark de Berg; Adrian Dumitrescu; Khaled M. Elbassioni (Int. J. Comput. Geom. Appl., 2017)

Guarding monotone art galleries with sliding cameras in linear time. - Mark de Berg; Stephane Durocher; Saeed Mehrabi 001 (J. Discrete Algorithms, 2017)

Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. - Helmut Alt; Mark de Berg; Christian Knauer (J. Comput. Geom., 2017)

Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. - Boris Aronov; Mark de Berg; Aleksandar Markovic 001; Gerhard J. Woeginger (COCOON, 2018)

A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak; Dániel Marx; Tom C. van der Zanden (STOC, 2018)

Finding Pairwise Intersections Inside a Query Range. - Mark de Berg; Joachim Gudmundsson; Ali D. Mehrabi (Algorithmica, 2018)

Independent-set reconfiguration thresholds of hereditary graph classes. - Mark de Berg; Bart M. P. Jansen; Debankur Mukherjee (Discret. Appl. Math., 2018)

An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization. - Peyman Afshani; Mark de Berg; Henri Casanova; Ben Karsin; Colin Lambrechts; Nodari Sitchinava; Constantinos Tsirogiannis (ACM J. Exp. Algorithmics, 2018)

Faster Algorithms for Computing Plurality Points. - Mark de Berg; Joachim Gudmundsson; Mehran Mehr (ACM Trans. Algorithms, 2018)

Throughput and Packet Displacements of Dynamic Broadcasting Algorithms. - Mark de Berg; Corrie Jacobien Carstens; Michel Mandjes (ALGOSENSORS, 2019)

ETH-Tight Algorithms for Geometric Network Problems Using Geometric Separators. - Mark de Berg (CCCG, 2019)

On One-Round Discrete Voronoi Games. - Mark de Berg; Sándor Kisfaludi-Bak; Mehran Mehr (ISAAC, 2019)

The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak (Algorithmica, 2019)

The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak (Algorithmica, 2019)

Shortcuts for the circle. - Sang Won Bae 001; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2019)

Dynamic conflict-free colorings in the plane. - Mark de Berg; Aleksandar Markovic 001 (Comput. Geom., 2019)

Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces. - Mark de Berg; Ade Gunawan; Marcel Roeloffzen (Int. J. Comput. Geom. Appl., 2019)

Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. - Mark de Berg; Tim Leijsen; Aleksandar Markovic 001; André van Renssen; Marcel Roeloffzen; Gerhard J. Woeginger (Int. J. Comput. Geom. Appl., 2019)

Covering many points with a small-area box. - Mark de Berg; Sergio Cabello; Otfried Cheong; David Eppstein; Christian Knauer (J. Comput. Geom., 2019)

Geodesic Spanners for Points on a Polyhedral Terrain. - Mohammad Ali Abam; Mark de Berg; Mohammad Javad Rezaei Seraji (SIAM J. Comput., 2019)

The complexity of Dominating Set in geometric intersection graphs. - Mark de Berg; Sándor Kisfaludi-Bak; Gerhard J. Woeginger (Theor. Comput. Sci., 2019)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs. - Mark de Berg; Sándor Kisfaludi-Bak (Treewidth, Kernels, and Algorithms, 2020)

Euclidean TSP in Narrow Strips. - Henk Alkema; Mark de Berg; Sándor Kisfaludi-Bak (SoCG, 2020)

Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces. - Boris Aronov; Mark de Berg; Aleksandar Markovic 001; Gerhard J. Woeginger (Algorithmica, 2020)

On beta-Plurality Points in Spatial Voting Games. - Boris Aronov; Mark de Berg; Joachim Gudmundsson; Michael Horton 001 (CoRR, 2020)

Euclidean TSP in Narrow Strip. - Henk Alkema; Mark de Berg; Sándor Kisfaludi-Bak (CoRR, 2020)

Minimum Perimeter-Sum Partitions in the Plane. - Mikkel Abrahamsen; Mark de Berg; Kevin Buchin; Mehran Mehr; Ali D. Mehrabi (Discret. Comput. Geom., 2020)

Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons. - Mark de Berg; Christian Knauer (J. Comput. Geom., 2020)

A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak; Dániel Marx; Tom C. van der Zanden (SIAM J. Comput., 2020)

Rectilinear Steiner Trees in Narrow Strips. - Henk Alkema; Mark de Berg (SoCG, 2021)

k-Center Clustering with Outliers in the Sliding-Window Model. - Mark de Berg; Morteza Monemizadeh; Yu Zhong (ESA, 2021)

Maximum-Weight Matching in Sliding Windows and Beyond. - Leyla Biabani; Mark de Berg; Morteza Monemizadeh (ISAAC, 2021)

A Novel Algorithm for Region-to-Region Tractography in Diffusion Tensor Imaging. - Lars Smolders; Rick Sengers; Andrea Fuster; Mark de Berg; Luc Florack (CDMRI@MICCAI, 2021)

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. - Peyman Afshani; Mark de Berg; Kevin Buchin; Jie Gao 001; Maarten Löffler; Amir Nayyeri; Benjamin Raichel; Rik Sarkar; Haotian Wang 002; Hao-Tsung Yang (WAFR, 2021)

Removing Depth-Order Cycles Among Triangles: An Algorithm Generating Triangular Fragments. - Mark de Berg (Discret. Comput. Geom., 2021)

On β-Plurality Points in Spatial Voting Games. - Boris Aronov; Mark de Berg; Joachim Gudmundsson; Michael Horton 001 (ACM Trans. Algorithms, 2021)

Fine-grained Complexity Analysis of Two Classic TSP Variants. - Mark de Berg; Kevin Buchin; Bart M. P. Jansen; Gerhard J. Woeginger (ACM Trans. Algorithms, 2021)

On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. - Peyman Afshani; Mark de Berg; Kevin Buchin; Jie Gao 001; Maarten Löffler; Amir Nayyeri; Benjamin Raichel; Rik Sarkar; Haotian Wang 002; Hao-Tsung Yang (SoCG, 2022)

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. - Bahareh Banyassady; Mark de Berg; Karl Bringmann; Kevin Buchin; Henning Fernau; Dan Halperin; Irina Kostitsyna; Yoshio Okamoto; Stijn Slot (SoCG, 2022)

TSP in a Simple Polygon. - Henk Alkema; Mark de Berg; Morteza Monemizadeh; Leonidas Theocharous (ESA, 2022)

Computing Smallest Convex Intersecting Polygons. - Antonios Antoniadis 001; Mark de Berg; Sándor Kisfaludi-Bak; Antonis Skarlatos (ESA, 2022)

Preclustering Algorithms for Imprecise Points. - Mohammad Ali Abam; Mark de Berg; Sina Farahzad; Mir Omid Haji Mirsadeghi; Morteza Saghafian (Algorithmica, 2022)

k-Center Clustering with Outliers in the MPC and Streaming Model. - Mark de Berg; Leyla Biabani; Morteza Monemizadeh (IPDPS, 2023)

Clustering in Polygonal Domains. - Mark de Berg; Leyla Biabani; Morteza Monemizadeh; Leonidas Theocharous (ISAAC, 2023)

Finding Diverse Minimum s-t Cuts. - Mark de Berg; Andrés López Martínez; Frits C. R. Spieksma (ISAAC, 2023)

Improved Bounds for Discrete Voronoi Games. - Mark de Berg; Geert van Wordragen (WADS, 2023)

Partitioning Axis-Parallel Lines in 3D. - Boris Aronov; Abdul Basit 001; Mark de Berg; Joachim Gudmundsson (Comput. Geom. Topol., 2023)

A Note on Reachability and Distance Oracles for Transmission Graphs. - Mark de Berg (Comput. Geom. Topol., 2023)

Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. - Boris Aronov; Mark de Berg; Jean Cardinal; Esther Ezra; John Iacono; Micha Sharir (Comput. Geom., 2023)

Clique-Based Separators for Geometric Intersection Graphs. - Mark de Berg; Sándor Kisfaludi-Bak; Morteza Monemizadeh; Leonidas Theocharous (Algorithmica, 2023)

An ETH-Tight Exact Algorithm for Euclidean TSP. - Mark de Berg; Hans L. Bodlaender; Sándor Kisfaludi-Bak; Sudeshna Kolay (SIAM J. Comput., 2023)

The Online Broadcast Range-Assignment Problem. - Mark de Berg; Aleksandar Markovic 001; Seeun William Umboh (Algorithmica, 2023)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ². - Boris Aronov; Mark de Berg; Leonidas Theocharous (SoCG, 2024)

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon. - Mark de Berg; Leonidas Theocharous (SoCG, 2024)

Stable and Dynamic Minimum Cuts. - Mark de Berg; Andrés López Martínez; Frits C. R. Spieksma (WALCOM, 2024)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R2. - Boris Aronov; Mark de Berg; Leonidas Theocharous (CoRR, 2024)

Truthful Budget Aggregation: Beyond Moving-Phantom Mechanisms. - Mark de Berg; Rupert Freeman; Ulrike Schmidt-Kraepelin; Markus Utke (CoRR, 2024)

On Stable Approximation Algorithms for Geometric Coverage Problems. - Mark de Berg; Arpan Sadhukhan (CoRR, 2024)

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. - Mark de Berg; Arpan Sadhukhan; Frits C. R. Spieksma (SIAM J. Discret. Math., 2024)

Euclidean TSP in Narrow Strips. - Henk Alkema; Mark de Berg; Remco van der Hofstad; Sándor Kisfaludi-Bak (Discret. Comput. Geom., 2024)

Optimal Motion Planning for Two Square Robots in a Rectilinear Environment. - Pankaj K. Agarwal; Mark de Berg; Benjamin Holmgren; Alex Steiger; Martijn Struijs (SoCG, 2025)

Geometric TSP on sets. - Henk Alkema; Mark de Berg (Comput. Geom., 2025)

Stable Approximation Algorithms for Dominating Set and Independent Set. - Mark de Berg; Arpan Sadhukhan; Frits C. R. Spieksma (SIAM J. Discret. Math., 2025)

Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure. - Mark de Berg; Andrés López Martínez; Frits C. R. Spieksma (CoRR, 2025)

An O(n log n) Algorithm for Single-Source Shortest Paths in Disk Graphs. - Mark de Berg; Sergio Cabello (CoRR, 2025)

The Price of Diversity of the Traveling Salesman Problem. - Mark de Berg; Andrés López Martínez; Frits C. R. Spieksma (CoRR, 2025)