| Publication | Date of Publication | Type |
|---|
| Nonplanar Graph Drawings with k Vertices per Face | 2024-05-03 | Paper |
| Stabbing pairwise intersecting disks by four points | 2023-12-21 | Paper |
| Sparse universal graphs for planarity | 2023-12-02 | Paper |
| Local certification of geometric graph classes | 2023-11-28 | Paper |
| Graph product structure for non-minor-closed classes | 2023-08-10 | Paper |
| The grid-minor theorem revisited | 2023-07-06 | Paper |
| Proof of the Clustered Hadwiger Conjecture | 2023-06-09 | Paper |
| Separating layered treewidth and row treewidth | 2023-05-30 | Paper |
| Clustered 3-colouring graphs of bounded degree | 2023-03-31 | Paper |
| Dual circumference and collinear sets | 2023-01-23 | Paper |
| Drawing graphs as spanners | 2022-12-21 | Paper |
| Adjacency Labelling for Planar Graphs (and Beyond) | 2022-12-08 | Paper |
| Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure | 2022-12-05 | Paper |
| Geodesic obstacle representation of graphs | 2022-11-16 | Paper |
| Drawing graphs as spanners | 2022-09-16 | Paper |
| \(2\times n\) grids have unbounded anagram-free chromatic number | 2022-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088959 | 2022-07-18 | Paper |
| Stack-number is not bounded by queue-number | 2022-06-30 | Paper |
| Odd Colourings of Graph Products | 2022-02-25 | Paper |
| An Optimal Algorithm for Product Structure in Planar Graphs | 2022-02-17 | Paper |
| Approximating maximum diameter-bounded subgraph in unit disk graphs | 2021-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002693 | 2021-07-28 | Paper |
| Every collinear set in a planar graph is free | 2021-04-29 | Paper |
| A fast algorithm for the product structure of planar graphs | 2021-04-19 | Paper |
| Two Results on Layered Pathwidth and Linear Layouts | 2021-01-19 | Paper |
| Planar Graphs Have Bounded Queue-Number | 2020-11-11 | Paper |
| Stack-number is not bounded by queue-number | 2020-11-09 | Paper |
| Minor-Closed Graph Classes with Bounded Layered Pathwidth | 2020-10-28 | Paper |
| Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs | 2020-08-18 | Paper |
| Asymptotically Optimal Vertex Ranking of Planar Graphs | 2020-07-13 | Paper |
| A Fast Algorithm for the Product Structure of Planar Graphs | 2020-04-06 | Paper |
| Clustered 3-Colouring Graphs of Bounded Degree | 2020-02-26 | Paper |
| Notes on growing a tree in a graph | 2019-11-07 | Paper |
| Every collinear set in a planar graph is free | 2019-10-15 | Paper |
| On the Average Number of Edges in Theta Graphs | 2019-09-17 | Paper |
| A Characterization of the degree sequences of 2-trees | 2019-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633858 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633875 | 2019-05-06 | Paper |
| More Turán-type theorems for triangles in convex point sets | 2019-03-05 | Paper |
| EPG-representations with Small Grid-Size | 2019-02-20 | Paper |
| Queue Layouts of Graphs with Bounded Degree and Bounded Genus | 2019-01-16 | Paper |
| Spanning trees in multipartite geometric graphs | 2019-01-11 | Paper |
| Corrigendum: Orthogonal Tree Decompositions of Graphs | 2018-12-19 | Paper |
| Anagram-free chromatic number is not pathwidth-bounded | 2018-11-22 | Paper |
| Dual Circumference and Collinear Sets | 2018-11-08 | Paper |
| Array Layouts for Comparison-Based Searching | 2018-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643834 | 2018-05-29 | Paper |
| Orthogonal Tree Decompositions of Graphs | 2018-04-11 | Paper |
| A note on interference in random networks | 2018-02-12 | Paper |
| Anagram-Free Chromatic Number is not Pathwidth-Bounded | 2018-02-05 | Paper |
| New bounds for facial nonrepetitive colouring | 2017-10-11 | Paper |
| Compatible Connectivity-Augmentation of Planar Disconnected Graphs | 2017-10-05 | Paper |
| Geodesic ham-sandwich cuts | 2017-09-29 | Paper |
| Layered separators in minor-closed graph classes with applications | 2017-09-29 | Paper |
| The Price of Order | 2017-05-19 | Paper |
| Biased predecessor search | 2016-12-21 | Paper |
| Reprint of: Approximating majority depth | 2016-01-29 | Paper |
| Towards tight bounds on theta-graphs: more is not always better | 2016-01-21 | Paper |
| Compatible connectivity augmentation of planar disconnected graphs | 2015-12-02 | Paper |
| The Price of Order | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2941395 | 2015-08-28 | Paper |
| On obstacle numbers | 2015-08-27 | Paper |
| Average stretch factor: how low does it go? | 2015-04-16 | Paper |
| The \(\varTheta_5\)-graph is a spanner | 2015-03-06 | Paper |
| Robust Geometric Spanners | 2015-02-17 | Paper |
| Randomized rendezvous with limited memory | 2014-09-09 | Paper |
| Succinct geometric indexes supporting point location queries | 2014-09-09 | Paper |
| Entropy, triangulation, and point location in planar subdivisions | 2014-09-09 | Paper |
| Crossings in grid drawings | 2014-09-04 | Paper |
| Notes on large angle crossing graphs | 2014-05-06 | Paper |
| Planar visibility | 2014-04-03 | Paper |
| Biased predecessor search | 2014-03-31 | Paper |
| The θ 5-Graph is a Spanner | 2013-12-06 | Paper |
| Robust Geometric Spanners | 2013-11-14 | Paper |
| A History of Distribution-Sensitive Data Structures | 2013-09-13 | Paper |
| Approximating majority depth | 2013-09-03 | Paper |
| A Polynomial Bound for Untangling Geometric Planar Graphs | 2013-06-28 | Paper |
| GHOST CHIMNEYS | 2013-06-24 | Paper |
| Coverage with \(k\)-transmitters in the presence of obstacles | 2013-03-25 | Paper |
| Absolute approximation of Tukey depth: theory and experiments | 2013-03-12 | Paper |
| Oja centers and centers of gravity | 2012-12-04 | Paper |
| Fast local searches and updates in bounded universes | 2012-12-04 | Paper |
| Skip lift: a probabilistic alternative to red-black trees | 2012-09-13 | Paper |
| Memoryless routing in convex subdivisions: random walks are optimal | 2012-05-18 | Paper |
| A distribution-sensitive dictionary with low space overhead | 2012-05-11 | Paper |
| Biased range trees | 2012-04-26 | Paper |
| A generalized Winternitz theorem | 2012-01-13 | Paper |
| Common Unfoldings of Polyominoes and Polycubes | 2011-11-11 | Paper |
| Preprocessing imprecise points for Delaunay triangulation: simplified and extended | 2011-11-07 | Paper |
| Algorithms for marketing-mix optimization | 2011-07-01 | Paper |
| Skip Lift: A Probabilistic Alternative to Red-Black Trees | 2011-05-19 | Paper |
| Coverage with k-Transmitters in the Presence of Obstacles | 2011-01-10 | Paper |
| Simultaneous diagonal flips in plane triangulations | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579416 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575444 | 2010-07-27 | Paper |
| Improved Methods For Generating Quasi-gray Codes | 2010-06-22 | Paper |
| On the false-positive rate of Bloom filters | 2010-06-09 | Paper |
| On the expected maximum degree of Gabriel and Yao graphs | 2010-05-11 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Sigma-local graphs | 2010-02-26 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| A polynomial bound for untangling geometric planar graphs | 2009-12-14 | Paper |
| Spanners of Complete k-Partite Geometric Graphs | 2009-11-06 | Paper |
| Clamshell casting | 2009-10-23 | Paper |
| Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing | 2009-10-20 | Paper |
| A Distribution-Sensitive Dictionary with Low Space Overhead | 2009-10-20 | Paper |
| Delaunay Triangulation of Imprecise Points Simplified and Extended | 2009-10-20 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms for optimal outlier removal | 2009-06-24 | Paper |
| Rotationally monotone polygons | 2009-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619930 | 2009-04-14 | Paper |
| Distinct distances in graph drawings | 2009-04-07 | Paper |
| Cuckoo hashing: Further analysis | 2009-03-23 | Paper |
| Realizing partitions respecting full and partial order information | 2008-11-18 | Paper |
| A Characterization of the degree sequences of 2-trees | 2008-09-04 | Paper |
| Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D | 2008-04-16 | Paper |
| Spanners of Complete k-Partite Geometric Graphs | 2008-04-15 | Paper |
| Randomized Rendez-Vous with Limited Memory | 2008-04-15 | Paper |
| An optimal randomized algorithm for \(d\)-variate zonoid depth | 2008-03-13 | Paper |
| Algorithms for bivariate zonoid depth | 2007-10-19 | Paper |
| Edge-unfolding nested polyhedral bands | 2007-10-19 | Paper |
| Space-efficient geometric divide-and-conquer algorithms | 2007-06-04 | Paper |
| Simultaneous diagonal flips in plane triangulations | 2007-05-11 | Paper |
| Reconfiguring triangulations with edge flips and point moves | 2007-05-10 | Paper |
| Geodesic ham-sandwich cuts | 2007-04-26 | Paper |
| Packing two disks into a polygonal environment. | 2007-04-25 | Paper |
| Three-Dimensional 1-Bend Graph Drawings | 2006-04-03 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5705139 | 2005-11-08 | Paper |
| Layout of Graphs with Bounded Tree-Width | 2005-09-16 | Paper |
| Covering things with things | 2005-08-02 | Paper |
| Output-sensitive algorithms for computing nearest-neighbour decision boundaries | 2005-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024771 | 2005-07-04 | Paper |
| The Maximum Number of Edges in a Three-Dimensional Grid-Drawing | 2005-05-25 | Paper |
| The geometry of carpentry and joinery | 2005-02-23 | Paper |
| On Worst-Case Robin Hood Hashing | 2005-02-21 | Paper |
| Online Routing in Triangulations | 2005-02-21 | Paper |
| Asymmetric communication protocols via hotlink assignments | 2005-02-11 | Paper |
| Testing the quality of manufactured disks and balls | 2004-12-02 | Paper |
| Competitive online routing in geometric graphs | 2004-11-23 | Paper |
| ONLINE ROUTING IN CONVEX SUBDIVISIONS | 2004-09-29 | Paper |
| AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE | 2004-09-29 | Paper |
| COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736844 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044350 | 2004-08-11 | Paper |
| Space-efficient planar convex hull algorithms | 2004-08-10 | Paper |
| Ordered theta graphs | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472479 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472518 | 2004-08-04 | Paper |
| On simplifying dot maps. | 2004-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422261 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411399 | 2003-07-08 | Paper |
| Translating a regular grid over a point set | 2003-05-19 | Paper |
| Fast approximations for sums of distances, clustering and the Fermat-Weber problem | 2003-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778553 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551356 | 2002-09-05 | Paper |
| Routing with guaranteed delivery in ad hoc wireless networks | 2002-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525052 | 2001-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511220 | 2000-10-30 | Paper |
| An Optimal Algorithm for Product Structure in Planar Graphs | 0001-01-03 | Paper |
| Linear versus centred chromatic numbers | 0001-01-03 | Paper |
| Product structure extension of the Alon--Seymour--Thomas theorem | 0001-01-03 | Paper |
| The Excluded Tree Minor Theorem Revisited | 0001-01-03 | Paper |
| Connected Dominating Sets in Triangulations | 0001-01-03 | Paper |
| Grid Minors and Products | 0001-01-03 | Paper |
| Patricia's Bad Distributions | 0001-01-03 | Paper |
| Tight bound for the Erd\H{o}s-P\'osa property of tree minors | 0001-01-03 | Paper |
| Free Sets in Planar Graphs: History and Applications | 0001-01-03 | Paper |
| Vertex Ranking of Degenerate Graphs | 0001-01-03 | Paper |
