Mark de Berg - RankMe

369 papers A* 28A 25B 39C 6Misc 2Journal 191Unranked 68

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Disjoint Tours and the Price of Diversity. WALCOM Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2026	J	`jnl`	Improved Bounds for Discrete Voronoi Games. CoRR Mark de Berg, Geert van Wordragen
2026	J	`jnl`	Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs. CoRR Mark de Berg, Sándor Kisfaludi-Bak
2026	J	`jnl`	Optimal Motion Planning for Two Square Robots in a Rectilinear Environment. CoRR Pankaj K. Agarwal, Mark de Berg, Benjamin Holmgren, Alex Steiger, Martijn Struijs
2026	J	`jnl`	Stable and Dynamic Minimum Cuts. J. Graph Algorithms Appl. Andrés López Martínez, Mark de Berg, Frits C. R. Spieksma
2025	J	`jnl`	A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb {R}^2$. Algorithmica Boris Aronov, Mark de Berg, Leonidas Theocharous
2025	J	`jnl`	An O(n log n) Algorithm for Single-Source Shortest Paths in Disk Graphs. CoRR Mark de Berg, Sergio Cabello
2025	A	`conf`	An O(nlog n) Algorithm for Single-Source Shortest Paths in Disk Graphs. ESA Mark de Berg, Sergio Cabello
2025	J	`jnl`	Computing smallest convex intersecting polygons. J. Comput. Geom. Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos
2025	B	`conf`	Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure. ISAAC Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2025	J	`jnl`	Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure. CoRR Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2025	J	`jnl`	Geometric TSP on sets. Comput. Geom. Henk Alkema, Mark de Berg
2025	J	`jnl`	On the Diameter of Arrangements of Topological Disks. CoRR Aida Abiad, Boris Aronov, Mark de Berg, Julian Golak, Alexander Grigoriev, Freija van Lent
2025	A*	`conf`	Optimal Motion Planning for Two Square Robots in a Rectilinear Environment. SoCG Pankaj K. Agarwal, Mark de Berg, Benjamin Holmgren, Alex Steiger, Martijn Struijs
2025	J	`jnl`	Stable Approximation Algorithms for Dominating Set and Independent Set. SIAM J. Discret. Math. Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2025	B	`conf`	Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments. ISAAC Mark de Berg, Bart M. P. Jansen, Jeroen S. K. Lamme
2025	J	`jnl`	Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments. CoRR Mark de Berg, Bart M. P. Jansen, Jeroen S. K. Lamme
2025	J	`jnl`	The Price of Diversity of the Traveling Salesman Problem. CoRR Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2024	J	`jnl`	A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R CoRR Boris Aronov, Mark de Berg, Leonidas Theocharous
2024	A*	`conf`	A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ². SoCG Boris Aronov, Mark de Berg, Leonidas Theocharous
2024	A*	`conf`	A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon. SoCG Mark de Berg, Leonidas Theocharous
2024	J	`jnl`	A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon. CoRR Mark de Berg, Leonidas Theocharous
2024	J	`jnl`	Euclidean TSP in Narrow Strips. Discret. Comput. Geom. Henk Alkema, Mark de Berg, Remco van der Hofstad, Sándor Kisfaludi-Bak
2024	J	`jnl`	On Stable Approximation Algorithms for Geometric Coverage Problems. CoRR Mark de Berg, Arpan Sadhukhan
2024	J	`jnl`	Stable Approximation Algorithms for Dominating Set and Independent Set. CoRR Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2024	J	`jnl`	Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SIAM J. Discret. Math. Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2024	B	`conf`	Stable and Dynamic Minimum Cuts. WALCOM Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2024	J	`jnl`	Truthful Budget Aggregation: Beyond Moving-Phantom Mechanisms. CoRR Mark de Berg, Rupert Freeman, Ulrike Schmidt-Kraepelin, Markus Utke
2023	J	`jnl`	A Note on Reachability and Distance Oracles for Transmission Graphs. Comput. Geom. Topol. Mark de Berg
2023	J	`jnl`	An ETH-Tight Exact Algorithm for Euclidean TSP. SIAM J. Comput. Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2023	J	`jnl`	Clique-Based Separators for Geometric Intersection Graphs. Algorithmica Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
2023	B	`conf`	Clustering in Polygonal Domains. ISAAC Mark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous
2023	B	`conf`	Finding Diverse Minimum s-t Cuts. ISAAC Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2023	J	`jnl`	Finding Diverse Minimum s-t Cuts. CoRR Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma
2023	B	`conf`	Geometric TSP on Sets. ISAAC Henk Alkema, Mark de Berg
2023	B	`conf`	Improved Bounds for Discrete Voronoi Games. WADS Mark de Berg, Geert van Wordragen
2023	J	`jnl`	Partitioning Axis-Parallel Lines in 3D. Comput. Geom. Topol. Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson
2023	A	`conf`	Stable Approximation Algorithms for Dominating Set and Independent Set. APPROX/RANDOM Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2023	J	`jnl`	Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2023	J	`jnl`	The Online Broadcast Range-Assignment Problem. Algorithmica Mark de Berg, Aleksandar Markovic, Seeun William Umboh
2023	A	`conf`	k-Center Clustering with Outliers in the MPC and Streaming Model. IPDPS Mark de Berg, Leyla Biabani, Morteza Monemizadeh
2023	J	`jnl`	k-Center Clustering with Outliers in the MPC and Streaming Model. CoRR Mark de Berg, Leyla Biabani, Morteza Monemizadeh
2022	J	`jnl`	A Note on Reachability and Distance Oracles for Transmission Graphs. CoRR Mark de Berg
2022	A	`conf`	Computing Smallest Convex Intersecting Polygons. ESA Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos
2022	J	`jnl`	Computing Smallest Convex Intersecting Polygons. CoRR Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos
2022	A*	`conf`	On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. SoCG Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
2022	J	`jnl`	On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. CoRR Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
2022	J	`jnl`	Partitioning axis-parallel lines in 3D. CoRR Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson
2022	J	`jnl`	Preclustering Algorithms for Imprecise Points. Algorithmica Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian
2022	—	`conf`	Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SWAT Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2022	A	`conf`	TSP in a Simple Polygon. ESA Henk Alkema, Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous
2022	A*	`conf`	Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. SoCG Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
2022	J	`jnl`	Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. CoRR Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot
2021	—	`conf`	A Novel Algorithm for Region-to-Region Tractography in Diffusion Tensor Imaging. CDMRI@MICCAI Lars Smolders, Rick Sengers, Andrea Fuster, Mark de Berg, Luc Florack
2021	C	`conf`	Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. WAFR Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
2021	B	`conf`	Clique-Based Separators for Geometric Intersection Graphs. ISAAC Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
2021	J	`jnl`	Clique-Based Separators for Geometric Intersection Graphs. CoRR Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
2021	J	`jnl`	Fine-grained Complexity Analysis of Two Classic TSP Variants. ACM Trans. Algorithms Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
2021	B	`conf`	Maximum-Weight Matching in Sliding Windows and Beyond. ISAAC Leyla Biabani, Mark de Berg, Morteza Monemizadeh
2021	J	`jnl`	On β-Plurality Points in Spatial Voting Games. ACM Trans. Algorithms Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton
2021	A*	`conf`	Rectilinear Steiner Trees in Narrow Strips. SoCG Henk Alkema, Mark de Berg
2021	J	`jnl`	Rectilinear Steiner Trees in Narrow Strips. CoRR Henk Alkema, Mark de Berg
2021	J	`jnl`	Removing Depth-Order Cycles Among Triangles: An Algorithm Generating Triangular Fragments. Discret. Comput. Geom. Mark de Berg
2021	J	`jnl`	Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. CoRR Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2021	B	`conf`	Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2021	J	`jnl`	Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
2021	A	`conf`	k-Center Clustering with Outliers in the Sliding-Window Model. ESA Mark de Berg, Morteza Monemizadeh, Yu Zhong
2021	J	`jnl`	k-Center Clustering with Outliers in the Sliding-Window Model. CoRR Mark de Berg, Morteza Monemizadeh, Yu Zhong
2020	J	`jnl`	A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. SIAM J. Comput. Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2020	J	`jnl`	Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. CoRR Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
2020	J	`jnl`	Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons. J. Comput. Geom. Mark de Berg, Christian Knauer
2020	J	`jnl`	Euclidean TSP in Narrow Strip. CoRR Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak
2020	A*	`conf`	Euclidean TSP in Narrow Strips. SoCG Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak
2020	—	`conf`	Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs. Treewidth, Kernels, and Algorithms Mark de Berg, Sándor Kisfaludi-Bak
2020	J	`jnl`	Minimum Perimeter-Sum Partitions in the Plane. Discret. Comput. Geom. Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi
2020	J	`jnl`	Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces. Algorithmica Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger
2020	J	`jnl`	On beta-Plurality Points in Spatial Voting Games. CoRR Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton
2020	A*	`conf`	On β-Plurality Points in Spatial Voting Games. SoCG Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton
2020	—	`conf`	Preclustering Algorithms for Imprecise Points. SWAT Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian
2020	B	`conf`	The Online Broadcast Range-Assignment Problem. ISAAC Mark de Berg, Aleksandar Markovic, Seeun William Umboh
2020	J	`jnl`	The Online Broadcast Range-Assignment Problem. CoRR Mark de Berg, Aleksandar Markovic, Seeun William Umboh
2019	J	`jnl`	Covering many points with a small-area box. J. Comput. Geom. Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer
2019	J	`jnl`	Dynamic conflict-free colorings in the plane. Comput. Geom. Mark de Berg, Aleksandar Markovic
2019	—	`conf`	ETH-Tight Algorithms for Geometric Network Problems Using Geometric Separators. CCCG Mark de Berg
2019	J	`jnl`	Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces. Int. J. Comput. Geom. Appl. Mark de Berg, Ade Gunawan, Marcel Roeloffzen
2019	J	`jnl`	Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. Int. J. Comput. Geom. Appl. Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger
2019	J	`jnl`	Geodesic Spanners for Points on a Polyhedral Terrain. SIAM J. Comput. Mohammad Ali Abam, Mark de Berg, Mohammad Javad Rezaei Seraji
2019	B	`conf`	On One-Round Discrete Voronoi Games. ISAAC Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr
2019	J	`jnl`	On One-Round Discrete Voronoi Games. CoRR Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr
2019	J	`jnl`	Shortcuts for the circle. Comput. Geom. Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
2019	J	`jnl`	The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. Algorithmica Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2019	J	`jnl`	The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds. Algorithmica Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2019	J	`jnl`	The complexity of Dominating Set in geometric intersection graphs. Theor. Comput. Sci. Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
2019	C	`conf`	Throughput and Packet Displacements of Dynamic Broadcasting Algorithms. ALGOSENSORS Mark de Berg, Corrie Jacobien Carstens, Michel Mandjes
2018	A*	`conf`	A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. STOC Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2018	A*	`conf`	An ETH-Tight Exact Algorithm for Euclidean TSP. FOCS Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2018	J	`jnl`	An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2018	J	`jnl`	An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization. ACM J. Exp. Algorithmics Peyman Afshani, Mark de Berg, Henri Casanova, Ben Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis
2018	J	`jnl`	Faster Algorithms for Computing Plurality Points. ACM Trans. Algorithms Mark de Berg, Joachim Gudmundsson, Mehran Mehr
2018	J	`jnl`	Finding Pairwise Intersections Inside a Query Range. Algorithmica Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi
2018	J	`jnl`	Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs. CoRR Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2018	J	`jnl`	Independent-set reconfiguration thresholds of hereditary graph classes. Discret. Appl. Math. Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee
2018	J	`jnl`	Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. CoRR Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger
2018	Misc	`conf`	Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. COCOON Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger
2017	—	`conf`	A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data. SIGSPATIAL/GIS Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi
2017	A	`conf`	An Efficient Algorithm for the 1D Total Visibility-Index Problem. ALENEX Peyman Afshani, Mark de Berg, Henri Casanova, Benjamin Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis
2017	J	`jnl`	Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. J. Comput. Geom. Helmut Alt, Mark de Berg, Christian Knauer
2017	—	`conf`	Data Structures for Fréchet Queries in Trajectory Data. CCCG Mark de Berg, Ali D. Mehrabi, Tim Ophelders
2017	B	`conf`	Dynamic Conflict-Free Colorings in the Plane. ISAAC Mark de Berg, Aleksandar Markovic
2017	J	`jnl`	Dynamic Conflict-Free Colorings in the Plane. CoRR Mark de Berg, Aleksandar Markovic
2017	J	`jnl`	Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. CoRR Mark de Berg, Tim Leijsen, André van Renssen, Marcel Roeloffzen, Aleksandar Markovic, Gerhard J. Woeginger
2017	J	`jnl`	Faster DB-scan and HDB-scan in Low-Dimensional Euclidean Spaces. CoRR Mark de Berg, Ade Gunawan, Marcel Roeloffzen
2017	B	`conf`	Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces. ISAAC Mark de Berg, Ade Gunawan, Marcel Roeloffzen
2017	B	`conf`	Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. ISAAC Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger
2017	A*	`conf`	Geodesic Spanners for Points on a Polyhedral Terrain. SODA Mohammad Ali Abam, Mark de Berg, Mohammad Javad Rezaei Seraji
2017	J	`jnl`	Guarding monotone art galleries with sliding cameras in linear time. J. Discrete Algorithms Mark de Berg, Stephane Durocher, Saeed Mehrabi
2017	J	`jnl`	Guest Editors' Foreword. Int. J. Comput. Geom. Appl. Mark de Berg, Adrian Dumitrescu, Khaled M. Elbassioni
2017	A*	`conf`	Minimum Perimeter-Sum Partitions in the Plane. SoCG Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi
2017	J	`jnl`	Minimum Perimeter-Sum Partitions in the Plane. CoRR Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi
2017	A*	`conf`	Range-Clustering Queries. SoCG Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi
2017	J	`jnl`	Range-Clustering Queries. CoRR Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi
2017	J	`jnl`	Removing Depth-Order Cycles Among Triangles: An Efficient Algorithm Generating Triangular Fragments. CoRR Mark de Berg
2017	A*	`conf`	Removing Depth-Order Cycles among Triangles: An Efficient Algorithm Generating Triangular Fragments. FOCS Mark de Berg
2017	J	`jnl`	Separability of imprecise points. Comput. Geom. Farnaz Sheikhi, Ali Mohades, Mark de Berg, Ali D. Mehrabi
2017	B	`conf`	Shortcuts for the Circle. ISAAC Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
2017	B	`conf`	The Dominating Set Problem in Geometric Intersection Graphs. IPEC Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
2017	J	`jnl`	The Dominating Set Problem in Geometric Intersection Graphs. CoRR Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger
2017	B	`conf`	The Homogeneous Broadcast Problem in Narrow and Wide Strips. WADS Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2017	J	`jnl`	The Homogeneous Broadcast Problem in Narrow and Wide Strips. CoRR Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2016	J	`jnl`	Covering many points with a small-area box. CoRR Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer
2016	J	`jnl`	Distance-Sensitive Planar Point Location. CoRR Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann
2016	J	`jnl`	Distance-sensitive planar point location. Comput. Geom. Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann
2016	A*	`conf`	Faster Algorithms for Computing Plurality Points. SoCG Mark de Berg, Joachim Gudmundsson, Mehran Mehr
2016	A*	`conf`	Fine-Grained Complexity Analysis of Two Classic TSP Variants. ICALP Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
2016	J	`jnl`	Fine-Grained Complexity Analysis of Two Classic TSP Variants. CoRR Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger
2016	—	`ch.`	Hierarchical Space Decompositions for Low-Density Scenes. Encyclopedia of Algorithms Mark de Berg
2016	J	`jnl`	Independent Set Reconfiguration Thresholds of Hereditary Graph Classes. CoRR Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee
2016	—	`conf`	Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. FSTTCS Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee
2016	J	`jnl`	Shortcuts for the Circle. CoRR Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
2016	J	`jnl`	Straight-path queries in trajectory data. J. Discrete Algorithms Mark de Berg, Ali D. Mehrabi
2015	A	`conf`	Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. ESA Helmut Alt, Mark de Berg, Christian Knauer
2015	J	`jnl`	Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons. IEEE Trans Autom. Sci. Eng. Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey
2015	—	`conf`	Fast computation of categorical richness on raster data sets and related problems. SIGSPATIAL/GIS Mark de Berg, Constantinos Tsirogiannis, Bryan T. Wilkinson
2015	B	`conf`	Finding Pairwise Intersections Inside a Query Range. WADS Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi
2015	J	`jnl`	Finding Pairwise Intersections Inside a Query Range. CoRR Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi
2015	J	`jnl`	Geodesic Spanners for Points on a Polyhedral Terrain. CoRR Mohammad Ali Abam, Mark de Berg, Mohammad Javad Rezaei Seraji
2015	J	`jnl`	Progressive geometric algorithms. J. Comput. Geom. Sander P. A. Alewijnse, Timur M. Bagautdinov, Mark de Berg, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin, Michel A. Westenberg
2015	J	`jnl`	Separating bichromatic point sets by L-shapes. Comput. Geom. Farnaz Sheikhi, Ali Mohades, Mark de Berg, Mansoor Davoodi
2015	B	`conf`	Straight-Path Queries in Trajectory Data. WALCOM Mark de Berg, Ali D. Mehrabi
2014	C	`conf`	Efficient Multi-robot Motion Planning for Unlabeled Discs in Simple Polygons. WAFR Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey
2014	C	`conf`	Guarding Monotone Art Galleries with Sliding Cameras in Linear Time. COCOA Mark de Berg, Stephane Durocher, Saeed Mehrabi
2014	J	`jnl`	Improved Bounds for the Union of Locally Fat Objects in the Plane. SIAM J. Comput. Boris Aronov, Mark de Berg, Esther Ezra, Micha Sharir
2014	A*	`conf`	Progressive Geometric Algorithms. SoCG Sander P. A. Alewijnse, Timur M. Bagautdinov, Mark de Berg, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin, Michel A. Westenberg
2014	—	`conf`	Separability of Imprecise Points. SWAT Mark de Berg, Ali D. Mehrabi, Farnaz Sheikhi
2014	J	`jnl`	Treemaps with bounded aspect ratio. Comput. Geom. Mark de Berg, Bettina Speckmann, Vincent van der Weele
2013	J	`jnl`	Computing Push Plans for Disk-shaped Robots. Int. J. Comput. Geom. Appl. Mark de Berg, Dirk H. P. Gerrits
2013	B	`conf`	Distance-Sensitive Planar Point Location. WADS Boris Aronov, Mark de Berg, Marcel Roeloffzen, Bettina Speckmann
2013	J	`jnl`	Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons. CoRR Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey
2013	J	`jnl`	Fast Fréchet queries. Comput. Geom. Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson
2013	J	`jnl`	Fat Polygonal Partitions with Applications to Visualization and Embeddings. J. Comput. Geom. Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos
2013	A*	`conf`	Kinetic 2-centers in the black-box model. SoCG Mark de Berg, Marcel Roeloffzen, Bettina Speckmann
2013	A	`conf`	Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap. ESA Mark de Berg, Dirk H. P. Gerrits
2012	J	`jnl`	Approximation algorithms for free-label maximization. Comput. Geom. Mark de Berg, Dirk H. P. Gerrits
2012	J	`jnl`	Guest Editorial. Algorithmica Mark de Berg
2012	A	`conf`	Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes. ESA Mark de Berg, Marcel Roeloffzen, Bettina Speckmann
2012	J	`jnl`	Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model. J. Comput. Geom. Mark de Berg, Marcel Roeloffzen, Bettina Speckmann
2012	J	`jnl`	Optimal Binary Space Partitions for Segments in the Plane. Int. J. Comput. Geom. Appl. Mark de Berg, Amirali Khosravi
2012	J	`jnl`	Unions of Fat Convex Polytopes Have Short Skeletons. Discret. Comput. Geom. Boris Aronov, Mark de Berg
2011	—	`conf`	Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. SCG Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi
2011	—	`conf`	Delineating imprecise regions via shortest-path graphs. GIS Mark de Berg, Wouter Meulemans, Bettina Speckmann
2011	—	`conf`	Exact and approximate computations of watersheds on triangulated terrains. GIS Mark de Berg, Constantinos P. Tsirogiannis
2011	B	`conf`	Fast Fréchet Queries. ISAAC Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson
2011	J	`jnl`	Geometric Spanners for Weighted Point Sets. Algorithmica Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid
2011	—	`conf`	Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves. TAPAS Mark de Berg, Atlas F. Cook
2011	A*	`conf`	Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures. SODA Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis
2011	J	`jnl`	Kinetic Spanners in ℝ Discret. Comput. Geom. Mohammad Ali Abam, Mark de Berg
2011	—	`conf`	Kinetic convex hulls and delaunay triangulations in the black-box model. SCG Mark de Berg, Marcel Roeloffzen, Bettina Speckmann
2011	B	`conf`	On Rectilinear Partitions with Minimum Stabbing Number. WADS Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele
2011	J	`jnl`	Out-of-Order Event Processing in Kinetic Data Structures. Algorithmica Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu
2011	B	`conf`	Piecewise-Linear Approximations of Uncertain Functions. WADS Mohammad Ali Abam, Mark de Berg, Amirali Khosravi
2011	B	`conf`	Treemaps with Bounded Aspect Ratio. ISAAC Mark de Berg, Bettina Speckmann, Vincent van der Weele
2010	—	`conf`	10491 Results of the break-out group: Aggregation. Representation, Analysis and Visualization of Moving Objects Mark de Berg, Jörg-Rüdiger Sack, Bettina Speckmann, Anne Driemel, Maike Buchin, Monika Sester, Marc J. van Kreveld
2010	—	`conf`	10491 Results of the break-out group: Gulls Data. Representation, Analysis and Visualization of Moving Objects Emiel van Loon, Jörg-Rüdiger Sack, Kevin Buchin, Maike Buchin, Mark de Berg, Marc J. van Kreveld, Joachim Gudmundsson, David M. Mountain
2010	J	`jnl`	A simple and efficient kinetic spanner. Comput. Geom. Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson
2010	—	`ed.`	Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I ESA (1) Mark de Berg, Ulrich Meyer
2010	—	`ed.`	Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II ESA (2) Mark de Berg, Ulrich Meyer
2010	—	`conf`	Approximation Algorithms for Free-Label Maximization. SWAT Mark de Berg, Dirk H. P. Gerrits
2010	—	`conf`	Better bounds on the union complexity of locally fat objects. SCG Mark de Berg
2010	A*	`conf`	Computing push plans for disk-shaped robots. ICRA Mark de Berg, Dirk H. P. Gerrits
2010	J	`jnl`	Computing the visibility map of fat objects. Comput. Geom. Mark de Berg, Chris Gray
2010	J	`jnl`	Decompositions and boundary coverings of non-convex fat polyhedra. Comput. Geom. Mark de Berg, Chris Gray
2010	J	`jnl`	Fat Polygonal Partitions with Applications to Visualization and Embeddings CoRR Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos
2010	—	`conf`	Finding monochromatic l-shapes in bichromatic point sets. CCCG Farnaz Sheikhi, Mark de Berg, Ali Mohades, Mansoor Davoodi Monfared
2010	J	`jnl`	Optimal BSPs and Rectilinear Cartograms. Int. J. Comput. Geom. Appl. Mark de Berg, Elena Mumford, Bettina Speckmann
2010	Misc	`conf`	Optimal Binary Space Partitions in the Plane. COCOON Mark de Berg, Amirali Khosravi
2010	J	`jnl`	Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Comput. Geom. Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma
2010	J	`jnl`	Streaming Algorithms for Line Simplification. Discret. Comput. Geom. Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei
2010	J	`jnl`	The Traveling Salesman Problem Under Squared Euclidean Distances CoRR Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff
2010	A	`conf`	The Traveling Salesman Problem under Squared Euclidean Distances. STACS Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg
2010	J	`jnl`	The complexity of flow on fat terrains and its i/o-efficient computation. Comput. Geom. Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma
2010	J	`jnl`	Treemaps with Bounded Aspect Ratio CoRR Mark de Berg, Bettina Speckmann, Vincent van der Weele
2010	J	`jnl`	Visibility Maps of Realistic Terrains have Linear Smoothed Complexity. J. Comput. Geom. Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis
2009	J	`jnl`	Cache-Oblivious R-Trees. Algorithmica Lars Arge, Mark de Berg, Herman J. Haverkort
2009	J	`jnl`	Covering Many or Few Points with Unit Disks. Theory Comput. Syst. Mark de Berg, Sergio Cabello, Sariel Har-Peled
2009	J	`jnl`	Efficient c-oriented range searching with DOP-trees. Comput. Geom. Mark de Berg, Herman J. Haverkort, Micha Streppel
2009	A	`conf`	Geometric Spanners for Weighted Point Sets. ESA Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid
2009	J	`jnl`	Kinetic Collision Detection for Convex Fat Objects. Algorithmica Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann
2009	J	`jnl`	Kinetic kd-Trees and Longest-Side kd-Trees. SIAM J. Comput. Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
2009	—	`conf`	Kinetic spanners in R SCG Mohammad Ali Abam, Mark de Berg
2009	J	`jnl`	Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Int. J. Comput. Geom. Appl. Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp
2009	J	`jnl`	On rectilinear duals for vertex-weighted plane graphs. Discret. Math. Mark de Berg, Elena Mumford, Bettina Speckmann
2009	—	`conf`	Rectangular cartograms: the game. SCG Mark de Berg, Fred van Nijnatten, Bettina Speckmann, Kevin Verbeek
2009	J	`jnl`	Region-Fault Tolerant Geometric Spanners. Discret. Comput. Geom. Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson
2009	B	`conf`	Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy. SEA Mark de Berg, Peter Hachenberger
2009	—	`conf`	Visibility maps of realistic terrains have linear smoothed complexity. SCG Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis
2008	—	`conf`	A simple and efficient kinetic spanner. SCG Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson
2008	J	`jnl`	Cache-Oblivious Selection in Sorted X+Y Matrices CoRR Mark de Berg, Shripad Thite
2008	J	`jnl`	Cache-oblivious selection in sorted X. Inf. Process. Lett. Mark de Berg, Shripad Thite
2008	—	`book`	Computational geometry: algorithms and applications, 3rd Edition. Mark de Berg, Otfried Cheong, Marc J. van Kreveld, Mark H. Overmars
2008	A*	`conf`	Cutting cycles of rods in space: hardness and approximation. SODA Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford
2008	A	`conf`	Decompositions and Boundary Coverings of Non-convex Fat Polyhedra. ESA Mark de Berg, Chris Gray
2008	—	`conf`	Fault-Tolerant Conflict-Free Coloring. CCCG Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon
2008	J	`jnl`	Improved Bounds on the Union Complexity of Fat Objects. Discret. Comput. Geom. Mark de Berg
2008	—	`conf`	Kinetic kd-Trees and Longest-Side kd-Trees. Data Structures Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
2008	J	`jnl`	Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Comput. Geom. Boris Aronov, Mark de Berg, Chris Gray
2008	J	`jnl`	Sparse geometric graphs with small dilation. Comput. Geom. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
2008	C	`conf`	Spatial Support and Spatial Confidence for Spatial Association Rules. SDH Patrick Laube, Mark de Berg, Marc J. van Kreveld
2008	A	`conf`	The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. ESA Boris Aronov, Mark de Berg, Shripad Thite
2008	J	`jnl`	The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Trans. Algorithms Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
2008	J	`jnl`	Vertical Ray Shooting and Computing Depth Orders for Fat Objects. SIAM J. Comput. Mark de Berg, Chris Gray
2007	J	`jnl`	An intersection-sensitive algorithm for snap rounding. Comput. Geom. Mark de Berg, Dan Halperin, Mark H. Overmars
2007	B	`conf`	Computing the Visibility Map of Fat Objects. WADS Mark de Berg, Chris Gray
2007	J	`jnl`	Editorial. Comput. Geom. Mark de Berg, Joachim Gudmundsson, René van Oostrum, Bettina Speckmann
2007	B	`conf`	I/O-Efficient Flow Modeling on Fat Terrains. WADS Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma
2007	B	`conf`	I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. ISAAC Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma
2007	—	`conf`	Kinetic KD-trees and longest-side KD-trees. SCG Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
2007	J	`jnl`	Kinetic sorting and kinetic convex hulls. Comput. Geom. Mohammad Ali Abam, Mark de Berg
2007	A*	`conf`	Region-fault tolerant geometric spanners. SODA Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson
2007	J	`jnl`	Sparse geometric graphs with small dilation CoRR Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
2007	—	`conf`	Streaming algorithms for line simplification. SCG Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei
2006	J	`jnl`	Approximate range searching using binary space partitions. Comput. Geom. Mark de Berg, Micha Streppel
2006	B	`conf`	Covering Many or Few Points with Unit Disks. WAOA Mark de Berg, Sergio Cabello, Sariel Har-Peled
2006	A	`conf`	Kinetic Collision Detection for Convex Fat Objects. ESA Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann
2006	—	`conf`	Optimal BSPs and rectilinear cartograms. GIS Mark de Berg, Elena Mumford, Bettina Speckmann
2006	A	`conf`	Out-of-Order Event Processing in Kinetic Data Structures. ESA Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu
2006	—	`conf`	Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. SCG Boris Aronov, Mark de Berg, Chris Gray
2006	A*	`conf`	Vertical ray shooting and computing depth orders for fat objects. SODA Mark de Berg, Chris Gray
2005	—	`conf`	A Polynomial-time Algorithm to Design Push Plans for Sensorless Parts Sorting. Robotics: Science and Systems Mark de Berg, Xavier Goaoc, A. Frank van der Stappen
2005	—	`conf`	Cache-oblivious r-trees. SCG Lars Arge, Mark de Berg, Herman J. Haverkort
2005	A	`conf`	Efficient c-Oriented Range Searching with DOP-Trees. ESA Mark de Berg, Herman J. Haverkort, Micha Streppel
2005	—	`conf`	Improved Bounds on the Union Complexity of Fat Objects. FSTTCS Mark de Berg
2005	—	`conf`	Kinetic sorting and kinetic convex hulls. SCG Mohammad Ali Abam, Mark de Berg
2005	C	`conf`	Lower bounds for kinetic sorting. EuroCG Mohammad Ali Abam, Mark de Berg
2005	A	`conf`	On Rectilinear Duals for Vertex-Weighted Plane Graphs. GD Mark de Berg, Elena Mumford, Bettina Speckmann
2005	J	`jnl`	Optimal spanners for axis-aligned rectangles. Comput. Geom. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff
2005	J	`jnl`	Schematization of networks. Comput. Geom. Sergio Cabello, Mark de Berg, Marc J. van Kreveld
2005	B	`conf`	Sparse Geometric Graphs with Small Dilation. ISAAC Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron
2005	—	`conf`	Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. CCCG Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled
2005	J	`jnl`	TSP with neighborhoods of varying size. J. Algorithms Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
2005	—	`conf`	Vertical ray shooting for fat objects. SCG Mark de Berg
2004	—	`conf`	Approximate Range Searching Using Binary Space Partitions. FSTTCS Mark de Berg, Micha Streppel
2004	J	`jnl`	Box-trees for collision checking in industrial installations. Comput. Geom. Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson
2004	—	`ch.`	Computational Geometry. Handbook of Data Structures and Applications Mark de Berg, Bettina Speckmann
2004	J	`jnl`	Guest Editor's Foreword. Discret. Comput. Geom. Mark de Berg
2004	—	`conf`	Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. SWAT Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp
2004	J	`jnl`	On simplifying dot maps. Comput. Geom. Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin
2004	J	`jnl`	On the Design and Analysis of Competent Selecto-recombinative GAs. Evol. Comput. Steven van Dijk, Dirk Thierens, Mark de Berg
2004	—	`conf`	The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
2004	—	`conf`	The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Cache-Oblivious and Cache-Aware Algorithms Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
2003	J	`jnl`	Guarding scenes against invasive hypercubes. Comput. Geom. Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
2003	A	`conf`	Kinetic Dictionaries: How to Shoot a Moving Target. ESA Mark de Berg
2003	J	`jnl`	On R-trees with low query complexity. Comput. Geom. Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
2003	B	`conf`	Significant-Presence Range Queries in Categorical Data. WADS Mark de Berg, Herman J. Haverkort
2003	J	`jnl`	Spanning Trees Crossing Few Barriers. Discret. Comput. Geom. Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
2002	J	`jnl`	Box-Trees and R-Trees with Near-Optimal Query Time. Discret. Comput. Geom. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
2002	—	`conf`	Box-trees for collision checking in industrial installations. SCG Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson
2002	J	`jnl`	Guest Editor's Foreword. Int. J. Comput. Geom. Appl. Mark de Berg, Stefan Schirra
2002	J	`jnl`	Models and motion planning. Comput. Geom. Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
2002	J	`jnl`	On the fatness of Minkowski sums. Inf. Process. Lett. Mark de Berg, A. Frank van der Stappen
2002	J	`jnl`	Realistic Input Models for Geometric Algorithms. Algorithmica Mark de Berg, A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz
2002	J	`jnl`	Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
2002	J	`jnl`	Separating an object from its cast. Comput. Aided Des. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
2002	A	`conf`	TSP with Neighborhoods of Varying Size. ESA Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
2002	J	`jnl`	Using Genetic Algorithms for Solving Hard Problems in GIS. GeoInformatica Steven van Dijk, Dirk Thierens, Mark de Berg
2001	—	`conf`	A segment-tree based kinetic BSP. SCG Mark de Berg, João Comba, Leonidas J. Guibas
2001	—	`conf`	Box-trees and R-trees with near-optimal query time. SCG Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
2001	B	`conf`	Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. WADS Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
2001	—	`conf`	Schematization of road networks. SCG Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk
2000	—	`book`	Computational geometry: algorithms and applications, 2nd Edition. Mark de Berg
2000	J	`jnl`	Linear Size Binary Space Partitions for Uncluttered Scenes. Algorithmica Mark de Berg
2000	J	`jnl`	Lower Bounds for Kinetic Planar Subdivisions. Discret. Comput. Geom. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger
2000	A	`conf`	On R-trees with Low Stabbing Number. ESA Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars
2000	A	`conf`	Scalability and Efficiency of Genetic Algorithms for Geometrical Applications. PPSN Steven van Dijk, Dirk Thierens, Mark de Berg
1999	—	`conf`	Lower Bounds for Kinetic Planar Subdivisions. SCG Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger
1999	J	`jnl`	Motion Planning for Multiple Robots. Discret. Comput. Geom. Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels
1999	A*	`conf`	Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. STOC Paolo Ferragina, S. Muthukrishnan, Mark de Berg
1999	A	`conf`	On The Design of Genetic Algorithms for Geographical Applications. GECCO Steven van Dijk, Dirk Thierens, Mark de Berg
1999	—	`conf`	Spanning Trees Crossing Few Barriers. SCG Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki
1998	J	`jnl`	Computing constrained minimum-width annuli of point sets. Comput. Aided Des. Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
1998	J	`jnl`	Computing the Angularity Tolerance. Int. J. Comput. Geom. Appl. Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
1998	J	`jnl`	Computing the Maximum Overlap of Two Convex Polygons under Translations. Theory Comput. Syst. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud
1998	J	`jnl`	Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SIAM J. Comput. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
1998	—	`conf`	Guarding Scenes against Invasive Hypercubes. WAE Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
1998	—	`conf`	Models and Motion Planning. SWAT Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
1998	—	`conf`	Motion Planning for Multiple Robots. SCG Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels
1998	J	`jnl`	Motion Planning in Environments with Low Obstacle Density. Discret. Comput. Geom. A. Frank van der Stappen, Mark H. Overmars, Mark de Berg, Jules Vleugels
1998	J	`jnl`	On Levels of Detail in Terrains. Graph. Model. Image Process. Mark de Berg, Katrin Dobrindt
1998	—	`conf`	Recovering lines with fixed linear probes. CCCG Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan
1998	J	`jnl`	The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. Comput. Geom. Mark de Berg, Hazel Everett, Leonidas J. Guibas
1997	—	`book`	Computational geometry: algorithms and applications. Mark de Berg
1997	B	`conf`	Computing Constrained Minimum-Width Annuli of Point Sets. WADS Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong
1997	J	`jnl`	Computing a Single Cell in the Overlay of Two Simple Polygons. Inf. Process. Lett. Mark de Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf
1997	J	`jnl`	New Results on Binary Space Partitions in the Plane. Comput. Geom. Mark de Berg, Marko de Groot, Mark H. Overmars
1997	J	`jnl`	Perfect Binary Space Partitions. Comput. Geom. Mark de Berg, Marko de Groot, Mark H. Overmars
1997	—	`conf`	Realistic Input Models for Geometric Algorithms. SCG Mark de Berg, Matthew J. Katz, A. Frank van der Stappen, Jules Vleugels
1997	—	`conf`	Separating an Object from its Cast. SCG Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
1997	J	`jnl`	Simple Traversal of a Subdivision Without Extra Storage. Int. J. Geogr. Inf. Sci. Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars
1997	J	`jnl`	Sparse Arrangements and the Number of Views of Polyhedral Scenes. Int. J. Comput. Geom. Appl. Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld
1997	J	`jnl`	Trekking in the Alps Without Freezing or Getting Tired. Algorithmica Mark de Berg, Marc J. van Kreveld
1997	J	`jnl`	Trends and Developments in Computational Geometry. Comput. Graph. Forum Mark de Berg
1996	J	`jnl`	Computing Half-plane and Strip Discrepancy of Planar Point Sets. Comput. Geom. Mark de Berg
1996	—	`conf`	Computing the Angularity Tolerance. CCCG Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong
1996	B	`conf`	Computing the Maximum Overlap of Two Convex Polygons Under Translations. ISAAC Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud
1996	A*	`conf`	Efficient Generation of k-Directional Assembly Sequences. SODA Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir
1996	J	`jnl`	Point Location in Zones of K-flats in Arrangements. Comput. Geom. Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink
1996	—	`conf`	Simple Traversal of a Subdivision Without Extra Storage. SCG Mark de Berg, René van Oostrum, Mark H. Overmars
1996	—	`conf`	The Complexity of Rivers in Triangulated Terrains. CCCG Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu
1996	J	`jnl`	Vertical Decompositions for Triangles in 3-Space. Discret. Comput. Geom. Mark de Berg, Leonidas J. Guibas, Dan Halperin
1996	—	`ch.`	Visualization of TINs. Algorithmic Foundations of Geographic Information Systems Mark de Berg
1995	J	`jnl`	Cuttings and applications. Int. J. Comput. Geom. Appl. Mark de Berg, Otfried Schwarzkopf
1995	J	`jnl`	Generalized Hidden Surface Removal. Comput. Geom. Mark de Berg
1995	A	`conf`	Linear Size Binary Space Partitions for Fat Objects. ESA Mark de Berg
1995	J	`jnl`	On Lazy Randomized Incremental Construction. Discret. Comput. Geom. Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf
1995	—	`conf`	On Levels of Detail in Terrains. SCG Mark de Berg, Katrin Dobrindt
1995	J	`jnl`	Piecewise Linear Paths Among Convex Obstacles. Discret. Comput. Geom. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
1995	J	`jnl`	Reaching a Goal with Directional Uncertainty. Theor. Comput. Sci. Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud
1995	—	`conf`	Simple Traversal of a Subdivision Without Extra Storage. ACM-GIS Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars
1995	J	`jnl`	Translation queries for sets of polygons. Int. J. Comput. Geom. Appl. Mark de Berg, Hazel Everett, Hubert Wagener
1995	J	`jnl`	Two- and Three-Dimensional Point Location in Rectangular Subdivisions. J. Algorithms Mark de Berg, Marc J. van Kreveld, Jack Snoeyink
1994	J	`jnl`	Computing and Verifying Depth Orders. SIAM J. Comput. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf
1994	—	`conf`	Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SCG Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
1994	J	`jnl`	Efficient Ray Shooting and Hidden Surface Removal. Algorithmica Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
1994	—	`conf`	New Results on Binary Space Partitions in the Plane (Extended Abstract). SWAT Mark de Berg, Marko de Groot, Mark H. Overmars
1994	A*	`conf`	On lazy randomized incremental construction. STOC Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf
1994	J	`jnl`	Rectilinear Decompositions with Low Stabbing Number. Inf. Process. Lett. Mark de Berg, Marc J. van Kreveld
1994	—	`conf`	Vertical Decompositions for Triangles in 3-Space. SCG Mark de Berg, Leonidas J. Guibas, Dan Halperin
1993	—	`conf`	Generalized Hidden Surface Removal. SCG Mark de Berg
1993	—	`conf`	Perfect Binary Space Partitions. CCCG Mark de Berg, Marko de Groot, Mark H. Overmars
1993	A*	`conf`	Piecewise linear paths among convex obstacles. STOC Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
1993	—	`book`	Ray Shooting, Depth Orders and Hidden Surface Removal Mark de Berg
1993	B	`conf`	Reaching a Goal with Directional Uncertainty. ISAAC Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir
1993	A	`conf`	Trekking in the Alps Without Freezing or Getting Tired. ESA Mark de Berg, Marc J. van Kreveld
1992	J	`jnl`	A General Approach to Dominance in the Plane. J. Algorithms Mark de Berg, Svante Carlsson, Mark H. Overmars
1992	—	`conf`	Computing and Verifying Depth Orders. SCG Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf
1992	J	`jnl`	Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra. Comput. Geom. Mark de Berg
1992	—	`—`	Efficient algorithms for ray shooting and hidden surface removal. Mark de Berg
1992	J	`jnl`	Shortest path queries in rectilinear worlds. Int. J. Comput. Geom. Appl. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
1992	—	`conf`	Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). SWAT Mark de Berg, Marc J. van Kreveld, Jack Snoeyink
1991	—	`conf`	Efficient Ray Shooting and Hidden Surface Removal. SCG Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld
1991	J	`jnl`	Finding Squares and Rectangles in Sets of Points. BIT Marc J. van Kreveld, Mark de Berg
1991	J	`jnl`	Hidden Surface Removal for C-oriented Polyhedra. Comput. Geom. Mark de Berg, Mark H. Overmars
1991	J	`jnl`	On Rectilinear Link Distance. Comput. Geom. Mark de Berg
1991	—	`conf`	Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). SCG Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson
1990	—	`conf`	Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. SWAT Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
1990	A*	`conf`	Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract) FOCS Mark de Berg, Mark H. Overmars
1990	J	`jnl`	Maintaining Range Trees in Secondary Memory. Part I: Partitions. Acta Informatica Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld
1990	—	`conf`	Translating Polygons with Applications to Hidden Surface Removal. SWAT Mark de Berg
1989	B	`conf`	Finding Squares and Rectangles in Sets of Points. WG Marc J. van Kreveld, Mark de Berg
1988	B	`conf`	Dominance in the Presence of Obstracles. WG Mark de Berg, Mark H. Overmars