default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark de Berg
Person information
- affiliation: Eindhoven University of Technology, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j132]Henk Alkema
, Mark de Berg, Remco van der Hofstad, Sándor Kisfaludi-Bak:
Euclidean TSP in Narrow Strips. Discret. Comput. Geom. 71(4): 1456-1506 (2024)- [j131]Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma:
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SIAM J. Discret. Math. 38(1): 790-827 (2024) - [c158]Boris Aronov, Mark de Berg, Leonidas Theocharous:
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ². SoCG 2024: 9:1-9:15 - [c157]Mark de Berg, Leonidas Theocharous:
A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon. SoCG 2024: 16:1-16:16 - [c156]Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Stable and Dynamic Minimum Cuts. WALCOM 2024: 273-287 - [i51]Mark de Berg, Leonidas Theocharous:
A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon. CoRR abs/2403.04513 (2024) - [i50]Boris Aronov, Mark de Berg, Leonidas Theocharous:
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R2. CoRR abs/2403.04905 (2024) - [i49]Mark de Berg, Rupert Freeman, Ulrike Schmidt-Kraepelin, Markus Utke:
Truthful Budget Aggregation: Beyond Moving-Phantom Mechanisms. CoRR abs/2405.20303 (2024) - [i48]Mark de Berg, Arpan Sadhukhan:
On Stable Approximation Algorithms for Geometric Coverage Problems. CoRR abs/2412.13357 (2024) - [i47]Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma:
Stable Approximation Algorithms for Dominating Set and Independent Set. CoRR abs/2412.13358 (2024) - 2023
- [j130]Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous:
Clique-Based Separators for Geometric Intersection Graphs. Algorithmica 85(6): 1652-1678 (2023) - [j129]Mark de Berg, Aleksandar Markovic, Seeun William Umboh:
The Online Broadcast Range-Assignment Problem. Algorithmica 85(12): 3928-3956 (2023) - [j128]Mark de Berg:
A Note on Reachability and Distance Oracles for Transmission Graphs. Comput. Geom. Topol. 2(1): 4:1-4:15 (2023) - [j127]Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson:
Partitioning Axis-Parallel Lines in 3D. Comput. Geom. Topol. 2(1): 9:1-9:20 (2023) - [j126]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. 109: 101945 (2023) - [j125]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. SIAM J. Comput. 52(3): 740-760 (2023) - [c155]Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma:
Stable Approximation Algorithms for Dominating Set and Independent Set. APPROX/RANDOM 2023: 27:1-27:19 - [c154]Mark de Berg, Leyla Biabani, Morteza Monemizadeh:
k-Center Clustering with Outliers in the MPC and Streaming Model. IPDPS 2023: 853-863 - [c153]Henk Alkema, Mark de Berg:
Geometric TSP on Sets. ISAAC 2023: 6:1-6:19 - [c152]Mark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous:
Clustering in Polygonal Domains. ISAAC 2023: 23:1-23:15 - [c151]Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Finding Diverse Minimum s-t Cuts. ISAAC 2023: 24:1-24:17 - [c150]Mark de Berg, Geert van Wordragen:
Improved Bounds for Discrete Voronoi Games. WADS 2023: 291-308 - [i46]Mark de Berg, Leyla Biabani, Morteza Monemizadeh:
k-Center Clustering with Outliers in the MPC and Streaming Model. CoRR abs/2302.12811 (2023) - [i45]Mark de Berg, Andrés López Martínez, Frits C. R. Spieksma:
Finding Diverse Minimum s-t Cuts. CoRR abs/2303.07290 (2023) - 2022
- [j124]Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian:
Preclustering Algorithms for Imprecise Points. Algorithmica 84(6): 1467-1489 (2022) - [c149]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. SoCG 2022: 2:1-2:14 - [c148]Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot:
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. SoCG 2022: 12:1-12:16 - [c147]Henk Alkema, Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous:
TSP in a Simple Polygon. ESA 2022: 5:1-5:14 - [c146]Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos:
Computing Smallest Convex Intersecting Polygons. ESA 2022: 9:1-9:13 - [c145]Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma:
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SWAT 2022: 15:1-15:21 - [i44]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. CoRR abs/2203.07280 (2022) - [i43]Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson:
Partitioning axis-parallel lines in 3D. CoRR abs/2204.01772 (2022) - [i42]Bahareh Banyassady, Mark de Berg, Karl Bringmann, Kevin Buchin, Henning Fernau, Dan Halperin, Irina Kostitsyna, Yoshio Okamoto, Stijn Slot:
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds. CoRR abs/2205.07777 (2022) - [i41]Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos:
Computing Smallest Convex Intersecting Polygons. CoRR abs/2208.07567 (2022) - [i40]Mark de Berg:
A Note on Reachability and Distance Oracles for Transmission Graphs. CoRR abs/2210.05788 (2022) - 2021
- [j123]Mark de Berg:
Removing Depth-Order Cycles Among Triangles: An Algorithm Generating Triangular Fragments. Discret. Comput. Geom. 65(2): 450-469 (2021) - [j122]Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger:
Fine-grained Complexity Analysis of Two Classic TSP Variants. ACM Trans. Algorithms 17(1): 5:1-5:29 (2021) - [j121]Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On β-Plurality Points in Spatial Voting Games. ACM Trans. Algorithms 17(3): 24:1-24:21 (2021) - [c144]Henk Alkema, Mark de Berg:
Rectilinear Steiner Trees in Narrow Strips. SoCG 2021: 9:1-9:16 - [c143]Mark de Berg, Morteza Monemizadeh, Yu Zhong:
k-Center Clustering with Outliers in the Sliding-Window Model. ESA 2021: 13:1-13:13 - [c142]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC 2021: 3:1-3:15 - [c141]Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous:
Clique-Based Separators for Geometric Intersection Graphs. ISAAC 2021: 22:1-22:15 - [c140]Leyla Biabani, Mark de Berg, Morteza Monemizadeh:
Maximum-Weight Matching in Sliding Windows and Beyond. ISAAC 2021: 73:1-73:16 - [c139]Lars Smolders, Rick Sengers, Andrea Fuster, Mark de Berg, Luc Florack:
A Novel Algorithm for Region-to-Region Tractography in Diffusion Tensor Imaging. CDMRI@MICCAI 2021: 71-81 - [c138]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. WAFR 2021: 107-123 - [i39]Henk Alkema, Mark de Berg:
Rectilinear Steiner Trees in Narrow Strips. CoRR abs/2103.08354 (2021) - [i38]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR abs/2109.07587 (2021) - [i37]Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous:
Clique-Based Separators for Geometric Intersection Graphs. CoRR abs/2109.09874 (2021) - [i36]Mark de Berg, Morteza Monemizadeh, Yu Zhong:
k-Center Clustering with Outliers in the Sliding-Window Model. CoRR abs/2109.11853 (2021) - [i35]Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma:
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. CoRR abs/2112.05426 (2021) - 2020
- [j120]Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces. Algorithmica 82(5): 1081-1100 (2020) - [j119]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. Discret. Comput. Geom. 63(2): 483-505 (2020) - [j118]Mark de Berg, Christian Knauer:
Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons. J. Comput. Geom. 11(1): 653-655 (2020) - [j117]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. SIAM J. Comput. 49(6): 1291-1331 (2020) - [c137]Mark de Berg, Sándor Kisfaludi-Bak:
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs. Treewidth, Kernels, and Algorithms 2020: 31-48 - [c136]Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak:
Euclidean TSP in Narrow Strips. SoCG 2020: 4:1-4:16 - [c135]Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On β-Plurality Points in Spatial Voting Games. SoCG 2020: 7:1-7:15 - [c134]Mark de Berg, Aleksandar Markovic, Seeun William Umboh:
The Online Broadcast Range-Assignment Problem. ISAAC 2020: 60:1-60:15 - [c133]Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian:
Preclustering Algorithms for Imprecise Points. SWAT 2020: 3:1-3:12 - [i34]Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On beta-Plurality Points in Spatial Voting Games. CoRR abs/2003.07513 (2020) - [i33]Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak:
Euclidean TSP in Narrow Strip. CoRR abs/2003.09948 (2020) - [i32]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. CoRR abs/2005.02530 (2020) - [i31]Mark de Berg, Aleksandar Markovic, Seeun William Umboh:
The Online Broadcast Range-Assignment Problem. CoRR abs/2009.14473 (2020)
2010 – 2019
- 2019
- [j116]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. Algorithmica 81(7): 2934-2962 (2019) - [j115]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds. Algorithmica 81(7): 2963-2990 (2019) - [j114]Mark de Berg, Aleksandar Markovic:
Dynamic conflict-free colorings in the plane. Comput. Geom. 78: 61-73 (2019) - [j113]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the circle. Comput. Geom. 79: 37-54 (2019) - [j112]Mark de Berg, Ade Gunawan, Marcel Roeloffzen:
Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces. Int. J. Comput. Geom. Appl. 29(1): 21-47 (2019) - [j111]Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger:
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. Int. J. Comput. Geom. Appl. 29(1): 49-72 (2019) - [j110]Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer:
Covering many points with a small-area box. J. Comput. Geom. 10(1): 207-222 (2019) - [j109]Mohammad Ali Abam, Mark de Berg, Mohammad Javad Rezaei Seraji:
Geodesic Spanners for Points on a Polyhedral Terrain. SIAM J. Comput. 48(6): 1796-1810 (2019) - [j108]Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger:
The complexity of Dominating Set in geometric intersection graphs. Theor. Comput. Sci. 769: 18-31 (2019) - [c132]Mark de Berg, Corrie Jacobien Carstens, Michel Mandjes:
Throughput and Packet Displacements of Dynamic Broadcasting Algorithms. ALGOSENSORS 2019: 158-174 - [c131]Mark de Berg:
ETH-Tight Algorithms for Geometric Network Problems Using Geometric Separators. CCCG 2019: 225 - [c130]Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr:
On One-Round Discrete Voronoi Games. ISAAC 2019: 37:1-37:17 - [i30]Mark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr:
On One-Round Discrete Voronoi Games. CoRR abs/1902.09234 (2019) - 2018
- [j107]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
Finding Pairwise Intersections Inside a Query Range. Algorithmica 80(11): 3253-3269 (2018) - [j106]Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent-set reconfiguration thresholds of hereditary graph classes. Discret. Appl. Math. 250: 165-182 (2018) - [j105]Peyman Afshani, Mark de Berg, Henri Casanova, Ben Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis:
An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization. ACM J. Exp. Algorithmics 23 (2018) - [j104]Mark de Berg, Joachim Gudmundsson, Mehran Mehr:
Faster Algorithms for Computing Plurality Points. ACM Trans. Algorithms 14(3): 36:1-36:23 (2018) - [c129]Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. COCOON 2018: 567-578 - [c128]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. FOCS 2018: 450-461 - [c127]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. STOC 2018: 574-586 - [i29]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs. CoRR abs/1803.10633 (2018) - [i28]Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger:
Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. CoRR abs/1805.02538 (2018) - [i27]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR abs/1807.06933 (2018) - 2017
- [j103]Farnaz Sheikhi, Ali Mohades, Mark de Berg, Ali D. Mehrabi:
Separability of imprecise points. Comput. Geom. 61: 24-37 (2017) - [j102]Mark de Berg, Adrian Dumitrescu, Khaled M. Elbassioni:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 27(1-2): 1-2 (2017) - [j101]Mark de Berg, Stephane Durocher, Saeed Mehrabi:
Guarding monotone art galleries with sliding cameras in linear time. J. Discrete Algorithms 44: 39-47 (2017) - [j100]Helmut Alt, Mark de Berg, Christian Knauer:
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. J. Comput. Geom. 8(1): 1-10 (2017) - [c126]Peyman Afshani, Mark de Berg, Henri Casanova, Benjamin Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis:
An Efficient Algorithm for the 1D Total Visibility-Index Problem. ALENEX 2017: 218-231 - [c125]Mark de Berg, Ali D. Mehrabi, Tim Ophelders:
Data Structures for Fréchet Queries in Trajectory Data. CCCG 2017: 214-219 - [c124]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. SoCG 2017: 4:1-4:15 - [c123]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Range-Clustering Queries. SoCG 2017: 5:1-5:16 - [c122]Mark de Berg:
Removing Depth-Order Cycles among Triangles: An Efficient Algorithm Generating Triangular Fragments. FOCS 2017: 272-282 - [c121]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
A Dynamic Data Structure for Approximate Proximity Queries in Trajectory Data. SIGSPATIAL/GIS 2017: 48:1-48:4 - [c120]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the Circle. ISAAC 2017: 9:1-9:13 - [c119]Mark de Berg, Ade Gunawan, Marcel Roeloffzen:
Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces. ISAAC 2017: 25:1-25:13 - [c118]Mark de Berg, Tim Leijsen, Aleksandar Markovic, André van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger:
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. ISAAC 2017: 26:1-26:13 - [c117]Mark de Berg, Aleksandar Markovic:
Dynamic Conflict-Free Colorings in the Plane. ISAAC 2017: 27:1-27:13 - [c116]Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger:
The Dominating Set Problem in Geometric Intersection Graphs. IPEC 2017: 14:1-14:12 - [c115]Mohammad Ali Abam, Mark de Berg, Mohammad Javad Rezaei Seraji:
Geodesic Spanners for Points on a Polyhedral Terrain. SODA 2017: 2434-2442 - [c114]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips. WADS 2017: 289-300 - [i26]Mark de Berg:
Removing Depth-Order Cycles Among Triangles: An Efficient Algorithm Generating Triangular Fragments. CoRR abs/1701.00679 (2017) - [i25]Mark de Berg, Tim Leijsen, André van Renssen, Marcel Roeloffzen, Aleksandar Markovic, Gerhard J. Woeginger:
Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. CoRR abs/1701.03388 (2017) - [i24]Mark de Berg, Ade Gunawan, Marcel Roeloffzen:
Faster DB-scan and HDB-scan in Low-Dimensional Euclidean Spaces. CoRR abs/1702.08607 (2017) - [i23]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Minimum Perimeter-Sum Partitions in the Plane. CoRR abs/1703.05549 (2017) - [i22]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips. CoRR abs/1705.01465 (2017) - [i21]Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr, Ali D. Mehrabi:
Range-Clustering Queries. CoRR abs/1705.06242 (2017) - [i20]Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger:
The Dominating Set Problem in Geometric Intersection Graphs. CoRR abs/1709.05182 (2017) - [i19]Mark de Berg, Aleksandar Markovic:
Dynamic Conflict-Free Colorings in the Plane. CoRR abs/1709.10466 (2017) - 2016
- [j99]Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann:
Distance-sensitive planar point location. Comput. Geom. 54: 17-31 (2016) - [j98]Mark de Berg, Ali D. Mehrabi:
Straight-path queries in trajectory data. J. Discrete Algorithms 36: 27-38 (2016) - [c113]Mark de Berg, Joachim Gudmundsson, Mehran Mehr:
Faster Algorithms for Computing Plurality Points. SoCG 2016: 32:1-32:15 - [c112]Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. FSTTCS 2016: 34:1-34:15 - [c111]Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger:
Fine-Grained Complexity Analysis of Two Classic TSP Variants. ICALP 2016: 5:1-5:14 - [r2]Mark de Berg:
Hierarchical Space Decompositions for Low-Density Scenes. Encyclopedia of Algorithms 2016: 909-914 - [i18]Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann:
Distance-Sensitive Planar Point Location. CoRR abs/1602.00767 (2016) - [i17]Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger:
Fine-Grained Complexity Analysis of Two Classic TSP Variants. CoRR abs/1607.02725 (2016) - [i16]Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent Set Reconfiguration Thresholds of Hereditary Graph Classes. CoRR abs/1610.03766 (2016) - [i15]Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer:
Covering many points with a small-area box. CoRR abs/1612.02149 (2016) - [i14]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the Circle. CoRR abs/1612.02412 (2016) - 2015
- [j97]Farnaz Sheikhi, Ali Mohades, Mark de Berg, Mansoor Davoodi:
Separating bichromatic point sets by L-shapes. Comput. Geom. 48(9): 673-687 (2015) - [j96]Sander P. A. Alewijnse, Timur M. Bagautdinov, Mark de Berg, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin, Michel A. Westenberg:
Progressive geometric algorithms. J. Comput. Geom. 6(2): 72-92 (2015) - [j95]Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey:
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons. IEEE Trans Autom. Sci. Eng. 12(4): 1309-1317 (2015) - [c110]Helmut Alt, Mark de Berg, Christian Knauer:
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons. ESA 2015: 25-34 - [c109]Mark de Berg, Constantinos Tsirogiannis, Bryan T. Wilkinson:
Fast computation of categorical richness on raster data sets and related problems. SIGSPATIAL/GIS 2015: 18:1-18:10 - [c108]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
Finding Pairwise Intersections Inside a Query Range. WADS 2015: 236-248 - [c107]Mark de Berg, Ali D. Mehrabi:
Straight-Path Queries in Trajectory Data. WALCOM 2015: 101-112 - [i13]Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi:
Finding Pairwise Intersections Inside a Query Range. CoRR abs/1502.06079 (2015) - [i12]Mohammad Ali Abam, Mark de Berg, Mohammad Javad Rezaei Seraji:
Geodesic Spanners for Points on a Polyhedral Terrain. CoRR abs/1511.01612 (2015) - 2014
- [j94]Mark de Berg, Bettina Speckmann, Vincent van der Weele:
Treemaps with bounded aspect ratio. Comput. Geom. 47(6): 683-693 (2014) - [j93]Boris Aronov, Mark de Berg, Esther Ezra, Micha Sharir:
Improved Bounds for the Union of Locally Fat Objects in the Plane. SIAM J. Comput. 43(2): 543-572 (2014) - [c106]Mark de Berg, Stephane Durocher, Saeed Mehrabi:
Guarding Monotone Art Galleries with Sliding Cameras in Linear Time. COCOA 2014: 113-125 - [c105]Sander P. A. Alewijnse, Timur M. Bagautdinov, Mark de Berg, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin, Michel A. Westenberg:
Progressive Geometric Algorithms. SoCG 2014: 50 - [c104]Mark de Berg, Ali D. Mehrabi, Farnaz Sheikhi:
Separability of Imprecise Points. SWAT 2014: 146-157 - [c103]Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey:
Efficient Multi-robot Motion Planning for Unlabeled Discs in Simple Polygons. WAFR 2014: 1-17 - 2013
- [j92]Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson:
Fast Fréchet queries. Comput. Geom. 46(6): 747-755 (2013) - [j91]Mark de Berg, Dirk H. P. Gerrits:
Computing Push Plans for Disk-shaped Robots. Int. J. Comput. Geom. Appl. 23(1): 29-48 (2013) - [j90]Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos:
Fat Polygonal Partitions with Applications to Visualization and Embeddings. J. Comput. Geom. 4(1): 212-239 (2013) - [c102]Mark de Berg, Marcel Roeloffzen, Bettina Speckmann:
Kinetic 2-centers in the black-box model. SoCG 2013: 145-154 - [c101]Mark de Berg, Dirk H. P. Gerrits:
Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap. ESA 2013: 373-384 - [c100]Boris Aronov, Mark de Berg, Marcel Roeloffzen, Bettina Speckmann:
Distance-Sensitive Planar Point Location. WADS 2013: 49-60 - [i11]Aviv Adler, Mark de Berg, Dan Halperin, Kiril Solovey:
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons. CoRR abs/1312.1038 (2013) - 2012
- [j89]Mark de Berg:
Guest Editorial. Algorithmica 63(4): 731-732 (2012) - [j88]Mark de Berg, Dirk H. P. Gerrits:
Approximation algorithms for free-label maximization. Comput. Geom. 45(4): 153-168 (2012) - [j87]Boris Aronov, Mark de Berg:
Unions of Fat Convex Polytopes Have Short Skeletons. Discret. Comput. Geom. 48(1): 53-64 (2012) - [j86]Mark de Berg, Amirali Khosravi:
Optimal Binary Space Partitions for Segments in the Plane. Int. J. Comput. Geom. Appl. 22(3): 187-206 (2012) - [j85]Mark de Berg, Marcel Roeloffzen, Bettina Speckmann:
Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model. J. Comput. Geom. 3(1): 222-249 (2012) - [c99]Mark de Berg, Marcel Roeloffzen, Bettina Speckmann:
Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes. ESA 2012: 383-394 - 2011
- [j84]Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu:
Out-of-Order Event Processing in Kinetic Data Structures. Algorithmica 60(2): 250-273 (2011) - [j83]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid:
Geometric Spanners for Weighted Point Sets. Algorithmica 61(1): 207-225 (2011) - [j82]Mohammad Ali Abam, Mark de Berg:
Kinetic Spanners in ℝd. Discret. Comput. Geom. 45(4): 723-736 (2011) - [c98]Mark de Berg, Marcel Roeloffzen, Bettina Speckmann:
Kinetic convex hulls and delaunay triangulations in the black-box model. SCG 2011: 244-253 - [c97]Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi:
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. SCG 2011: 407-416 - [c96]Mark de Berg, Constantinos P. Tsirogiannis:
Exact and approximate computations of watersheds on triangulated terrains. GIS 2011: 74-83 - [c95]Mark de Berg, Wouter Meulemans, Bettina Speckmann:
Delineating imprecise regions via shortest-path graphs. GIS 2011: 271-280 - [c94]Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson:
Fast Fréchet Queries. ISAAC 2011: 240-249 - [c93]Mark de Berg, Bettina Speckmann, Vincent van der Weele:
Treemaps with Bounded Aspect Ratio. ISAAC 2011: 260-270 - [c92]Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures. SODA 2011: 285-296 - [c91]Mark de Berg, Atlas F. Cook:
Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves. TAPAS 2011: 81-91 - [c90]Mohammad Ali Abam, Mark de Berg, Amirali Khosravi:
Piecewise-Linear Approximations of Uncertain Functions. WADS 2011: 1-12 - [c89]Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele:
On Rectilinear Partitions with Minimum Stabbing Number. WADS 2011: 302-313 - 2010
- [j81]Mark de Berg, Chris Gray:
Decompositions and boundary coverings of non-convex fat polyhedra. Comput. Geom. 43(2): 73-83 (2010) - [j80]Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson:
A simple and efficient kinetic spanner. Comput. Geom. 43(3): 251-256 (2010) - [j79]Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma:
The complexity of flow on fat terrains and its i/o-efficient computation. Comput. Geom. 43(4): 331-356 (2010) - [j78]Mark de Berg, Chris Gray:
Computing the visibility map of fat objects. Comput. Geom. 43(4): 410-418 (2010) - [j77]Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma:
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Comput. Geom. 43(5): 493-513 (2010) - [j76]Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei:
Streaming Algorithms for Line Simplification. Discret. Comput. Geom. 43(3): 497-515 (2010) - [j75]Mark de Berg, Elena Mumford, Bettina Speckmann:
Optimal BSPs and Rectilinear Cartograms. Int. J. Comput. Geom. Appl. 20(2): 203-222 (2010) - [j74]Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Visibility Maps of Realistic Terrains have Linear Smoothed Complexity. J. Comput. Geom. 1(1): 57-71 (2010) - [c88]Farnaz Sheikhi, Mark de Berg, Ali Mohades, Mansoor Davoodi Monfared:
Finding monochromatic l-shapes in bichromatic point sets. CCCG 2010: 269-272 - [c87]Mark de Berg, Amirali Khosravi:
Optimal Binary Space Partitions in the Plane. COCOON 2010: 216-225 - [c86]Mark de Berg:
Better bounds on the union complexity of locally fat objects. SCG 2010: 39-47 - [c85]Mark de Berg, Dirk H. P. Gerrits:
Computing push plans for disk-shaped robots. ICRA 2010: 4487-4492 - [c84]Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg:
The Traveling Salesman Problem under Squared Euclidean Distances. STACS 2010: 239-250 - [c83]Mark de Berg, Dirk H. P. Gerrits:
Approximation Algorithms for Free-Label Maximization. SWAT 2010: 297-308 - [e2]Mark de Berg, Ulrich Meyer:
Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I. Lecture Notes in Computer Science 6346, Springer 2010, ISBN 978-3-642-15774-5 [contents] - [e1]Mark de Berg, Ulrich Meyer:
Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II. Lecture Notes in Computer Science 6347, Springer 2010, ISBN 978-3-642-15780-6 [contents] - [i10]Mark de Berg, Jörg-Rüdiger Sack, Bettina Speckmann, Anne Driemel, Maike Buchin, Monika Sester, Marc J. van Kreveld:
10491 Results of the break-out group: Aggregation. Representation, Analysis and Visualization of Moving Objects 2010 - [i9]Emiel van Loon, Jörg-Rüdiger Sack, Kevin Buchin, Maike Buchin, Mark de Berg, Marc J. van Kreveld, Joachim Gudmundsson, David M. Mountain:
10491 Results of the break-out group: Gulls Data. Representation, Analysis and Visualization of Moving Objects 2010 - [i8]Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff:
The Traveling Salesman Problem Under Squared Euclidean Distances. CoRR abs/1001.0236 (2010) - [i7]Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos:
Fat Polygonal Partitions with Applications to Visualization and Embeddings. CoRR abs/1009.1866 (2010) - [i6]Mark de Berg, Bettina Speckmann, Vincent van der Weele:
Treemaps with Bounded Aspect Ratio. CoRR abs/1012.1749 (2010)
2000 – 2009
- 2009
- [j73]Lars Arge, Mark de Berg, Herman J. Haverkort:
Cache-Oblivious R-Trees. Algorithmica 53(1): 50-68 (2009) - [j72]Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann:
Kinetic Collision Detection for Convex Fat Objects. Algorithmica 53(4): 457-473 (2009) - [j71]Mark de Berg, Herman J. Haverkort, Micha Streppel:
Efficient c-oriented range searching with DOP-trees. Comput. Geom. 42(3): 250-267 (2009) - [j70]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson:
Region-Fault Tolerant Geometric Spanners. Discret. Comput. Geom. 41(4): 556-582 (2009) - [j69]Mark de Berg, Elena Mumford, Bettina Speckmann:
On rectilinear duals for vertex-weighted plane graphs. Discret. Math. 309(7): 1794-1812 (2009) - [j68]Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp:
Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Int. J. Comput. Geom. Appl. 19(6): 533-556 (2009) - [j67]Mark de Berg, Sergio Cabello, Sariel Har-Peled:
Covering Many or Few Points with Unit Disks. Theory Comput. Syst. 45(3): 446-469 (2009) - [j66]Mohammad Ali Abam, Mark de Berg, Bettina Speckmann:
Kinetic kd-Trees and Longest-Side kd-Trees. SIAM J. Comput. 39(4): 1219-1232 (2009) - [c82]Mohammad Ali Abam, Mark de Berg:
Kinetic spanners in Rd. SCG 2009: 43-50 - [c81]Mark de Berg, Fred van Nijnatten, Bettina Speckmann, Kevin Verbeek:
Rectangular cartograms: the game. SCG 2009: 96-97 - [c80]Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis:
Visibility maps of realistic terrains have linear smoothed complexity. SCG 2009: 163-168 - [c79]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid:
Geometric Spanners for Weighted Point Sets. ESA 2009: 190-202 - [c78]Mark de Berg, Peter Hachenberger:
Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy. SEA 2009: 63-75 - 2008
- [b5]Mark de Berg, Otfried Cheong, Marc J. van Kreveld, Mark H. Overmars:
Computational geometry: algorithms and applications, 3rd Edition. Springer 2008, ISBN 9783540779735, pp. I-XII, 1-386 - [j65]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008) - [j64]Boris Aronov, Mark de Berg, Chris Gray:
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. Comput. Geom. 41(1-2): 68-76 (2008) - [j63]Mark de Berg:
Improved Bounds on the Union Complexity of Fat Objects. Discret. Comput. Geom. 40(1): 127-140 (2008) - [j62]Mark de Berg, Shripad Thite:
Cache-oblivious selection in sorted X. Inf. Process. Lett. 109(2): 87-92 (2008) - [j61]Mark de Berg, Chris Gray:
Vertical Ray Shooting and Computing Depth Orders for Fat Objects. SIAM J. Comput. 38(1): 257-275 (2008) - [j60]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Trans. Algorithms 4(1): 9:1-9:30 (2008) - [c77]Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon:
Fault-Tolerant Conflict-Free Coloring. CCCG 2008 - [c76]Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson:
A simple and efficient kinetic spanner. SCG 2008: 306-310 - [c75]Boris Aronov, Mark de Berg, Shripad Thite:
The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. ESA 2008: 100-111 - [c74]Mark de Berg, Chris Gray:
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra. ESA 2008: 173-184 - [c73]Patrick Laube, Mark de Berg, Marc J. van Kreveld:
Spatial Support and Spatial Confidence for Spatial Association Rules. SDH 2008: 575-593 - [c72]Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford:
Cutting cycles of rods in space: hardness and approximation. SODA 2008: 1241-1248 - [i5]Mohammad Ali Abam, Mark de Berg, Bettina Speckmann:
Kinetic kd-Trees and Longest-Side kd-Trees. Data Structures 2008 - [i4]Mark de Berg, Shripad Thite:
Cache-Oblivious Selection in Sorted X+Y Matrices. CoRR abs/0804.0936 (2008) - 2007
- [j59]Mark de Berg, Joachim Gudmundsson, René van Oostrum, Bettina Speckmann:
Editorial. Comput. Geom. 36(1): 1 (2007) - [j58]Mark de Berg, Dan Halperin, Mark H. Overmars:
An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3): 159-165 (2007) - [j57]Mohammad Ali Abam, Mark de Berg:
Kinetic sorting and kinetic convex hulls. Comput. Geom. 37(1): 16-26 (2007) - [c71]Mohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei:
Streaming algorithms for line simplification. SCG 2007: 175-183 - [c70]Mohammad Ali Abam, Mark de Berg, Bettina Speckmann:
Kinetic KD-trees and longest-side KD-trees. SCG 2007: 364-372 - [c69]Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma:
I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. ISAAC 2007: 500-511 - [c68]Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson:
Region-fault tolerant geometric spanners. SODA 2007: 1-10 - [c67]Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma:
I/O-Efficient Flow Modeling on Fat Terrains. WADS 2007: 239-250 - [c66]Mark de Berg, Chris Gray:
Computing the Visibility Map of Fat Objects. WADS 2007: 251-262 - [i3]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron:
Sparse geometric graphs with small dilation. CoRR abs/cs/0702080 (2007) - 2006
- [j56]Mark de Berg, Micha Streppel:
Approximate range searching using binary space partitions. Comput. Geom. 33(3): 139-151 (2006) - [c65]Boris Aronov, Mark de Berg, Chris Gray:
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. SCG 2006: 88-94 - [c64]Mohammad Ali Abam, Mark de Berg, Sheung-Hung Poon, Bettina Speckmann:
Kinetic Collision Detection for Convex Fat Objects. ESA 2006: 4-15 - [c63]Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu:
Out-of-Order Event Processing in Kinetic Data Structures. ESA 2006: 624-635 - [c62]Mark de Berg, Elena Mumford, Bettina Speckmann:
Optimal BSPs and rectilinear cartograms. GIS 2006: 19-26 - [c61]Mark de Berg, Chris Gray:
Vertical ray shooting and computing depth orders for fat objects. SODA 2006: 494-503 - [c60]Mark de Berg, Sergio Cabello, Sariel Har-Peled:
Covering Many or Few Points with Unit Disks. WAOA 2006: 55-68 - 2005
- [j55]Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff:
Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005) - [j54]Sergio Cabello, Mark de Berg, Marc J. van Kreveld:
Schematization of networks. Comput. Geom. 30(3): 223-228 (2005) - [j53]Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
TSP with neighborhoods of varying size. J. Algorithms 57(1): 22-36 (2005) - [c59]Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled:
Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. CCCG 2005: 43-46 - [c58]Lars Arge, Mark de Berg, Herman J. Haverkort:
Cache-oblivious r-trees. SCG 2005: 170-179 - [c57]Mohammad Ali Abam, Mark de Berg:
Kinetic sorting and kinetic convex hulls. SCG 2005: 190-197 - [c56]Mark de Berg:
Vertical ray shooting for fat objects. SCG 2005: 288-295 - [c55]Mark de Berg, Herman J. Haverkort, Micha Streppel:
Efficient c-Oriented Range Searching with DOP-Trees. ESA 2005: 508-519 - [c54]Mark de Berg:
Improved Bounds on the Union Complexity of Fat Objects. FSTTCS 2005: 116-127 - [c53]Mark de Berg, Elena Mumford, Bettina Speckmann:
On Rectilinear Duals for Vertex-Weighted Plane Graphs. GD 2005: 61-72 - [c52]Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron:
Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59 - [c51]Mark de Berg, Xavier Goaoc, A. Frank van der Stappen:
A Polynomial-time Algorithm to Design Push Plans for Sensorless Parts Sorting. Robotics: Science and Systems 2005: 89-96 - [i2]Mohammad Ali Abam, Mark de Berg:
Lower bounds for kinetic sorting. EuroCG 2005: 171-174 - 2004
- [j52]Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin:
On simplifying dot maps. Comput. Geom. 27(1): 43-62 (2004) - [j51]Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson:
Box-trees for collision checking in industrial installations. Comput. Geom. 28(2-3): 113-135 (2004) - [j50]Mark de Berg:
Guest Editor's Foreword. Discret. Comput. Geom. 32(2): 165-166 (2004) - [j49]Steven van Dijk, Dirk Thierens, Mark de Berg:
On the Design and Analysis of Competent Selecto-recombinative GAs. Evol. Comput. 12(2): 243-267 (2004) - [c50]Mark de Berg, Micha Streppel:
Approximate Range Searching Using Binary Space Partitions. FSTTCS 2004: 110-121 - [c49]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference 2004: 347-358 - [c48]Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp:
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. SWAT 2004: 138-149 - [r1]Mark de Berg, Bettina Speckmann:
Computational Geometry. Handbook of Data Structures and Applications 2004 - [i1]Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi:
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Cache-Oblivious and Cache-Aware Algorithms 2004 - 2003
- [j48]Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars:
On R-trees with low query complexity. Comput. Geom. 24(3): 179-195 (2003) - [j47]Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Guarding scenes against invasive hypercubes. Comput. Geom. 26(2): 99-117 (2003) - [j46]Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki:
Spanning Trees Crossing Few Barriers. Discret. Comput. Geom. 30(4): 591-606 (2003) - [c47]Mark de Berg:
Kinetic Dictionaries: How to Shoot a Moving Target. ESA 2003: 172-183 - [c46]Mark de Berg, Herman J. Haverkort:
Significant-Presence Range Queries in Categorical Data. WADS 2003: 462-473 - 2002
- [j45]Mark de Berg, A. Frank van der Stappen, Jules Vleugels, Matthew J. Katz:
Realistic Input Models for Geometric Algorithms. Algorithmica 34(1): 81-97 (2002) - [j44]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an object from its cast. Comput. Aided Des. 34(8): 547-559 (2002) - [j43]Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Models and motion planning. Comput. Geom. 23(1): 53-68 (2002) - [j42]Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold:
Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. 23(2): 195-207 (2002) - [j41]Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort:
Box-Trees and R-Trees with Near-Optimal Query Time. Discret. Comput. Geom. 28(3): 291-312 (2002) - [j40]Steven van Dijk, Dirk Thierens, Mark de Berg:
Using Genetic Algorithms for Solving Hard Problems in GIS. GeoInformatica 6(4): 381-413 (2002) - [j39]Mark de Berg, Stefan Schirra:
Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 12(1-2): 1-2 (2002) - [j38]Mark de Berg, A. Frank van der Stappen:
On the fatness of Minkowski sums. Inf. Process. Lett. 81(5): 259-264 (2002) - [c45]Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson:
Box-trees for collision checking in industrial installations. SCG 2002: 53-62 - [c44]Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
TSP with Neighborhoods of Varying Size. ESA 2002: 187-199 - 2001
- [c43]Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk:
Schematization of road networks. SCG 2001: 33-39 - [c42]Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort:
Box-trees and R-trees with near-optimal query time. SCG 2001: 124-133 - [c41]Mark de Berg, João Comba, Leonidas J. Guibas:
A segment-tree based kinetic BSP. SCG 2001: 134-140 - [c40]Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold:
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. WADS 2001: 122-134 - 2000
- [b4]Mark de Berg:
Computational geometry: algorithms and applications, 2nd Edition. Springer 2000, ISBN 3540656200, pp. I-XII, 1-367 - [j37]Mark de Berg:
Linear Size Binary Space Partitions for Uncluttered Scenes. Algorithmica 28(3): 353-366 (2000) - [j36]Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger:
Lower Bounds for Kinetic Planar Subdivisions. Discret. Comput. Geom. 24(4): 721-733 (2000) - [c39]Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars:
On R-trees with Low Stabbing Number. ESA 2000: 167-178 - [c38]Steven van Dijk, Dirk Thierens, Mark de Berg:
Scalability and Efficiency of Genetic Algorithms for Geometrical Applications. PPSN 2000: 683-692
1990 – 1999
- 1999
- [j35]Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels:
Motion Planning for Multiple Robots. Discret. Comput. Geom. 22(4): 505-525 (1999) - [c37]Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki:
Spanning Trees Crossing Few Barriers. SCG 1999: 41-48 - [c36]Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger:
Lower Bounds for Kinetic Planar Subdivisions. SCG 1999: 247-254 - [c35]Steven van Dijk, Dirk Thierens, Mark de Berg:
On The Design of Genetic Algorithms for Geographical Applications. GECCO 1999: 188-195 - [c34]Paolo Ferragina, S. Muthukrishnan, Mark de Berg:
Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. STOC 1999: 483-491 - 1998
- [j34]Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong:
Computing constrained minimum-width annuli of point sets. Comput. Aided Des. 30(4): 267-275 (1998) - [j33]Mark de Berg, Hazel Everett, Leonidas J. Guibas:
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. Comput. Geom. 11(2): 69-81 (1998) - [j32]Mark de Berg, Katrin Dobrindt:
On Levels of Detail in Terrains. Graph. Model. Image Process. 60(1): 1-12 (1998) - [j31]A. Frank van der Stappen, Mark H. Overmars, Mark de Berg, Jules Vleugels:
Motion Planning in Environments with Low Obstacle Density. Discret. Comput. Geom. 20(4): 561-587 (1998) - [j30]Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong:
Computing the Angularity Tolerance. Int. J. Comput. Geom. Appl. 8(4): 467-482 (1998) - [j29]Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud:
Computing the Maximum Overlap of Two Convex Polygons under Translations. Theory Comput. Syst. 31(5): 613-628 (1998) - [j28]Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SIAM J. Comput. 27(3): 654-667 (1998) - [c33]Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan:
Recovering lines with fixed linear probes. CCCG 1998 - [c32]Boris Aronov, Mark de Berg, A. Frank van der Stappen, Petr Svestka, Jules Vleugels:
Motion Planning for Multiple Robots. SCG 1998: 374-382 - [c31]Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Models and Motion Planning. SWAT 1998: 83-94 - [c30]Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Guarding Scenes against Invasive Hypercubes. WAE 1998: 110-120 - 1997
- [b3]Mark de Berg:
Computational geometry: algorithms and applications. Springer 1997, ISBN 354061270X, pp. I-XII, 1-365 - [j27]Mark de Berg, Marc J. van Kreveld:
Trekking in the Alps Without Freezing or Getting Tired. Algorithmica 18(3): 306-323 (1997) - [j26]Mark de Berg:
Trends and Developments in Computational Geometry. Comput. Graph. Forum 16(1): 3-30 (1997) - [j25]Mark de Berg, Marko de Groot, Mark H. Overmars:
Perfect Binary Space Partitions. Comput. Geom. 7: 81-91 (1997) - [j24]Mark de Berg, Marko de Groot, Mark H. Overmars:
New Results on Binary Space Partitions in the Plane. Comput. Geom. 8: 317-333 (1997) - [j23]Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars:
Simple Traversal of a Subdivision Without Extra Storage. Int. J. Geogr. Inf. Sci. 11(4): 359-373 (1997) - [j22]Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld:
Sparse Arrangements and the Number of Views of Polyhedral Scenes. Int. J. Comput. Geom. Appl. 7(3): 175-195 (1997) - [j21]Mark de Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf:
Computing a Single Cell in the Overlay of Two Simple Polygons. Inf. Process. Lett. 63(4): 215-219 (1997) - [c29]Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf:
Separating an Object from its Cast. SCG 1997: 221-230 - [c28]Mark de Berg, Matthew J. Katz, A. Frank van der Stappen, Jules Vleugels:
Realistic Input Models for Geometric Algorithms. SCG 1997: 294-303 - [c27]Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong:
Computing Constrained Minimum-Width Annuli of Point Sets. WADS 1997: 392-401 - 1996
- [j20]Mark de Berg:
Computing Half-plane and Strip Discrepancy of Planar Point Sets. Comput. Geom. 6: 69-83 (1996) - [j19]Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink:
Point Location in Zones of K-flats in Arrangements. Comput. Geom. 6: 131-143 (1996) - [j18]Mark de Berg, Leonidas J. Guibas, Dan Halperin:
Vertical Decompositions for Triangles in 3-Space. Discret. Comput. Geom. 15(1): 35-61 (1996) - [c26]Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu:
The Complexity of Rivers in Triangulated Terrains. CCCG 1996: 325-330 - [c25]Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong:
Computing the Angularity Tolerance. CCCG 1996: 331-336 - [c24]Mark de Berg, René van Oostrum, Mark H. Overmars:
Simple Traversal of a Subdivision Without Extra Storage. SCG 1996: C-5-C-6 - [c23]Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud:
Computing the Maximum Overlap of Two Convex Polygons Under Translations. ISAAC 1996: 126-135 - [c22]Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir:
Efficient Generation of k-Directional Assembly Sequences. SODA 1996: 122-131 - [p1]Mark de Berg:
Visualization of TINs. Algorithmic Foundations of Geographic Information Systems 1996: 79-97 - 1995
- [j17]Mark de Berg:
Generalized Hidden Surface Removal. Comput. Geom. 5: 249-276 (1995) - [j16]Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Piecewise Linear Paths Among Convex Obstacles. Discret. Comput. Geom. 14(1): 9-29 (1995) - [j15]Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf:
On Lazy Randomized Incremental Construction. Discret. Comput. Geom. 14(3): 261-286 (1995) - [j14]Mark de Berg, Hazel Everett, Hubert Wagener:
Translation queries for sets of polygons. Int. J. Comput. Geom. Appl. 5(3): 221-242 (1995) - [j13]Mark de Berg, Otfried Schwarzkopf:
Cuttings and applications. Int. J. Comput. Geom. Appl. 5(4): 343-355 (1995) - [j12]Mark de Berg, Marc J. van Kreveld, Jack Snoeyink:
Two- and Three-Dimensional Point Location in Rectangular Subdivisions. J. Algorithms 18(2): 256-277 (1995) - [j11]Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud:
Reaching a Goal with Directional Uncertainty. Theor. Comput. Sci. 140(2): 301-317 (1995) - [c21]Mark de Berg, Katrin Dobrindt:
On Levels of Detail in Terrains. SCG 1995: C26-C27 - [c20]Mark de Berg:
Linear Size Binary Space Partitions for Fat Objects. ESA 1995: 252-263 - [c19]Mark de Berg, Marc J. van Kreveld, René van Oostrum, Mark H. Overmars:
Simple Traversal of a Subdivision Without Extra Storage. ACM-GIS 1995: 77- - 1994
- [j10]Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld:
Efficient Ray Shooting and Hidden Surface Removal. Algorithmica 12(1): 30-53 (1994) - [j9]Mark de Berg, Marc J. van Kreveld:
Rectilinear Decompositions with Low Stabbing Number. Inf. Process. Lett. 52(4): 215-221 (1994) - [j8]Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf:
Computing and Verifying Depth Orders. SIAM J. Comput. 23(2): 437-446 (1994) - [c18]Mark de Berg, Leonidas J. Guibas, Dan Halperin:
Vertical Decompositions for Triangles in 3-Space. SCG 1994: 1-10 - [c17]Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. SCG 1994: 67-75 - [c16]Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf:
On lazy randomized incremental construction. STOC 1994: 105-114 - [c15]Mark de Berg, Marko de Groot, Mark H. Overmars:
New Results on Binary Space Partitions in the Plane (Extended Abstract). SWAT 1994: 61-72 - 1993
- [b2]Mark de Berg:
Ray Shooting, Depth Orders and Hidden Surface Removal. Lecture Notes in Computer Science 703, Springer 1993, ISBN 3-540-57020-9 - [c14]Mark de Berg, Marko de Groot, Mark H. Overmars:
Perfect Binary Space Partitions. CCCG 1993: 109-114 - [c13]Mark de Berg:
Generalized Hidden Surface Removal. SCG 1993: 1-10 - [c12]Mark de Berg, Marc J. van Kreveld:
Trekking in the Alps Without Freezing or Getting Tired. ESA 1993: 121-132 - [c11]Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir:
Reaching a Goal with Directional Uncertainty. ISAAC 1993: 1-10 - [c10]Mark de Berg, Jirí Matousek, Otfried Schwarzkopf:
Piecewise linear paths among convex obstacles. STOC 1993: 505-514 - 1992
- [b1]Mark de Berg:
Efficient algorithms for ray shooting and hidden surface removal. Universität Utrecht, 1992, pp. I-VIII, 1-225 - [j7]Mark de Berg:
Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra. Comput. Geom. 2: 119-140 (1992) - [j6]Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars:
Shortest path queries in rectilinear worlds. Int. J. Comput. Geom. Appl. 2(3): 287-309 (1992) - [j5]Mark de Berg, Svante Carlsson, Mark H. Overmars:
A General Approach to Dominance in the Plane. J. Algorithms 13(2): 274-296 (1992) - [c9]Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf:
Computing and Verifying Depth Orders. SCG 1992: 138-145 - [c8]Mark de Berg, Marc J. van Kreveld, Jack Snoeyink:
Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). SWAT 1992: 352-363 - 1991
- [j4]Marc J. van Kreveld, Mark de Berg:
Finding Squares and Rectangles in Sets of Points. BIT 31(2): 202-219 (1991) - [j3]Mark de Berg:
On Rectilinear Link Distance. Comput. Geom. 1: 13-34 (1991) - [j2]Mark de Berg, Mark H. Overmars:
Hidden Surface Removal for C-oriented Polyhedra. Comput. Geom. 1: 247-268 (1991) - [c7]Mark de Berg, Dan Halperin, Mark H. Overmars, Jack Snoeyink, Marc J. van Kreveld:
Efficient Ray Shooting and Hidden Surface Removal. SCG 1991: 21-30 - [c6]Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson:
Shortest Path Queries in Rectilinear Worlds of Higher Dimension (Extended Abstract). SCG 1991: 51-60 - 1990
- [j1]Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld:
Maintaining Range Trees in Secondary Memory. Part I: Partitions. Acta Informatica 27(5): 423-452 (1990) - [c5]Mark de Berg, Mark H. Overmars:
Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract). FOCS 1990: 252-261 - [c4]Mark de Berg:
Translating Polygons with Applications to Hidden Surface Removal. SWAT 1990: 60-70 - [c3]Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars:
Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. SWAT 1990: 213-224
1980 – 1989
- 1989
- [c2]Marc J. van Kreveld, Mark de Berg:
Finding Squares and Rectangles in Sets of Points. WG 1989: 341-355 - 1988
- [c1]Mark de Berg, Mark H. Overmars:
Dominance in the Presence of Obstracles. WG 1988: 190-201
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-03 01:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
