| Publication | Date of Publication | Type |
|---|
| The mutual visibility problem for fat robots | 2024-01-16 | Paper |
| Approximating the discrete center line segment in linear time | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147291 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147552 | 2024-01-15 | Paper |
| Approximating the Packedness of Polygonal Curves | 2023-11-14 | Paper |
| On β-Plurality Points in Spatial Voting Games. | 2023-11-02 | Paper |
| Improving the Dilation of a Metric Graph by Adding Edges | 2023-10-31 | Paper |
| Algorithms for radius-optimally augmenting trees in a metric space | 2023-07-31 | Paper |
| Augmenting graphs to minimize the radius | 2023-07-12 | Paper |
| Covering a set of line segments with a few squares | 2023-03-22 | Paper |
| Local Routing in Sparse and Lightweight Geometric Graphs | 2023-02-03 | Paper |
| A linear-time heuristic for minimum rectangular coverings (Extended abstract) | 2022-12-09 | Paper |
| Barrier Coverage with Uniform Radii in 2D | 2022-12-09 | Paper |
| Local routing in a tree metric \(1\)-spanner | 2022-10-18 | Paper |
| Approximating the packedness of polygonal curves | 2022-10-06 | Paper |
| Covering a set of line segments with a few squares | 2022-06-13 | Paper |
| Local routing in sparse and lightweight geometric graphs | 2022-05-03 | Paper |
| Algorithms for radius-optimally augmenting trees in a metric space | 2022-03-25 | Paper |
| On β-Plurality Points in Spatial Voting Games | 2022-02-16 | Paper |
| Translation invariant Fréchet distance queries | 2021-11-19 | Paper |
| Bounded-degree light approximate shortest-path trees in doubling metrics | 2021-10-21 | Paper |
| Local routing in a tree metric 1-spanner | 2021-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136224 | 2020-11-25 | Paper |
| Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136262 | 2020-11-25 | Paper |
| When is red-blue nonblocker fixed-parameter tractable? | 2020-02-12 | Paper |
| Approximating (k, ℓ)-center clustering for curves | 2019-10-15 | Paper |
| Fast Fréchet Distance Between Curves with Long Edges | 2019-09-24 | Paper |
| Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees | 2019-06-24 | Paper |
| Shortcuts for the circle | 2019-03-20 | Paper |
| Turbocharging treewidth heuristics | 2019-02-14 | Paper |
| Finding pairwise intersections inside a query range | 2019-01-11 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2019-01-11 | Paper |
| Box-trees for collision checking in industrial installations | 2018-11-23 | Paper |
| Faster Algorithms for Computing Plurality Points | 2018-11-13 | Paper |
| Approximate distance oracles for geometric spanners | 2018-11-05 | Paper |
| Compact Flow Diagrams for State Sequences | 2018-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634396 | 2018-04-10 | Paper |
| Faster Algorithms for Computing Plurality Points | 2018-01-30 | Paper |
| Finding the best shortcut in a geometric network | 2017-10-20 | Paper |
| Box-trees and R-trees with near-optimal query time | 2017-09-29 | Paper |
| SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs | 2016-06-10 | Paper |
| Increasing-Chord Graphs On Point Sets | 2016-01-07 | Paper |
| Finding Pairwise Intersections Inside a Query Range | 2015-10-30 | Paper |
| Fast Algorithms for Diameter-Optimally Augmenting Paths | 2015-10-27 | Paper |
| Augmenting graphs to minimize the diameter | 2015-09-02 | Paper |
| Fast algorithms for approximate Fréchet matching queries in geometric trees | 2015-06-17 | Paper |
| A generalization of the convex Kakeya problem | 2015-01-19 | Paper |
| Increasing-Chord Graphs On Point Sets | 2015-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934575 | 2014-12-18 | Paper |
| A fast algorithm for data collection along a fixed track | 2014-10-06 | Paper |
| On the number of upward planar orientations of maximal planar graphs | 2014-07-07 | Paper |
| Quickest path queries on transportation network | 2014-06-27 | Paper |
| Notes on large angle crossing graphs | 2014-05-06 | Paper |
| Planar visibility | 2014-04-03 | Paper |
| Experimental study of geometric t -spanners | 2014-04-01 | Paper |
| Augmenting graphs to minimize the diameter | 2014-01-14 | Paper |
| SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs | 2014-01-14 | Paper |
| Fast query structures in anisotropic media | 2014-01-10 | Paper |
| Fréchet Queries in Geometric Trees | 2013-09-17 | Paper |
| A Fast Algorithm for Data Collection along a Fixed Track | 2013-06-11 | Paper |
| Fast Fréchet queries | 2013-04-29 | Paper |
| On the Number of Upward Planar Orientations of Maximal Planar Graphs | 2013-03-21 | Paper |
| Approximate one-to-one point pattern matching | 2012-09-13 | Paper |
| A generalization of the convex Kakeya problem | 2012-06-29 | Paper |
| Fast Fréchet Queries | 2011-12-16 | Paper |
| DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES | 2011-08-23 | Paper |
| Geometric spanners for weighted point sets | 2011-08-16 | Paper |
| Quickest Paths in Anisotropic Media | 2011-08-12 | Paper |
| Algorithms for marketing-mix optimization | 2011-07-01 | Paper |
| Farthest-polygon Voronoi diagrams | 2011-03-25 | Paper |
| Finding the Most Relevant Fragments in Networks | 2011-02-16 | Paper |
| Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies | 2010-08-18 | Paper |
| Detecting Areas Visited Regularly | 2010-07-20 | Paper |
| On the expected maximum degree of Gabriel and Yao graphs | 2010-05-11 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| FINDING POPULAR PLACES | 2010-03-19 | Paper |
| A simple and efficient kinetic spanner | 2009-11-16 | Paper |
| Geometric Spanners for Weighted Point Sets | 2009-10-29 | Paper |
| Compressing spatio-temporal trajectories | 2009-08-14 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM | 2009-07-20 | Paper |
| RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS | 2009-07-20 | Paper |
| Region-fault tolerant geometric spanners | 2009-05-06 | Paper |
| ON SPANNERS OF GEOMETRIC GRAPHS | 2009-04-14 | Paper |
| Improving the Stretch Factor of a Geometric Network by Edge Augmentation | 2009-03-16 | Paper |
| Aperture-angle and Hausdorff-approximation of convex figures | 2009-02-12 | Paper |
| A simple and efficient kinetic spanner | 2009-02-12 | Paper |
| Region-restricted clustering for geographic data mining | 2009-02-12 | Paper |
| Detecting Commuting Patterns by Clustering Subtrajectories | 2009-01-29 | Paper |
| Aperture-angle and Hausdorff-approximation of convex figures | 2008-12-02 | Paper |
| Farthest-Polygon Voronoi Diagrams | 2008-09-25 | Paper |
| Reporting flock patterns | 2008-09-19 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2008-09-18 | Paper |
| Constructing minimum-interference networks | 2008-06-18 | Paper |
| Sparse geometric graphs with small dilation | 2008-06-18 | Paper |
| Compressing Spatio-temporal Trajectories | 2008-05-27 | Paper |
| Finding Popular Places | 2008-05-27 | Paper |
| I/O-Efficiently Pruning Dense Spanners | 2008-03-18 | Paper |
| Region-Restricted Clustering for Geographic Data Mining | 2008-03-11 | Paper |
| Reporting Flock Patterns | 2008-03-11 | Paper |
| Experimental Study of Geometric t-Spanners: A Running Time Comparison | 2008-01-02 | Paper |
| Minimum weight pseudo-triangulations | 2007-10-12 | Paper |
| Restricted Mesh Simplification Using Edge Contractions | 2007-09-10 | Paper |
| A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem | 2007-09-10 | Paper |
| On Spanners of Geometric Graphs | 2007-09-07 | Paper |
| Schematisation of Tree Drawings | 2007-08-28 | Paper |
| Path Simplification for Metro Map Layout | 2007-08-28 | Paper |
| Approximate distance oracles for graphs with dense clusters | 2007-06-04 | Paper |
| Distance-preserving approximations of polygonal paths | 2007-02-19 | Paper |
| Area-preserving approximations of polygonal paths | 2007-02-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Constructing plane spanners of bounded degree and low weight | 2006-03-21 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| TSP with neighborhoods of varying size | 2005-11-16 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Constrained higher order Delaunay triangulations | 2005-05-12 | Paper |
| Chips on wafers, or packing rectangles into grids | 2005-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829019 | 2004-11-29 | Paper |
| BALANCED PARTITION OF MINIMUM SPANNING TREES | 2004-09-29 | Paper |
| Balanced Partition of Minimum Spanning Trees | 2004-08-12 | Paper |
| Ordered theta graphs | 2004-08-06 | Paper |
| Facility location and the geometric minimum-diameter spanning tree. | 2004-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427857 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411358 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411362 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411284 | 2003-07-07 | Paper |
| On R-trees with low query complexity | 2003-04-28 | Paper |
| Box-trees and R-trees with near-optimal query time | 2002-12-01 | Paper |
| Fast Greedy Algorithms for Constructing Sparse Geometric Spanners | 2002-09-29 | Paper |
| Higher order Delaunay triangulations | 2002-09-03 | Paper |
| Lower bounds for approximate polygon decomposition and minimum gap | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753933 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753939 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2748154 | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721991 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500844 | 2001-03-25 | Paper |
| Close approximations of minimum rectangular coverings | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4948735 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247271 | 2000-01-18 | Paper |
