Stop the war!Остановите войну!
for scientists:
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
- 2023
[j128]Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous
:
Clique-Based Separators for Geometric Intersection Graphs. Algorithmica 85(6): 1652-1678 (2023)- [j127]Mark de Berg, Aleksandar Markovic, Seeun William Umboh:
The Online Broadcast Range-Assignment Problem. Algorithmica 85(12): 3928-3956 (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]