| Publication | Date of Publication | Type |
|---|
| Optimal algorithms for separating a polyhedron from its single-part mold | 2024-11-18 | Paper |
| Pursuit-evasion in graphs: zombies, lazy zombies and a survivor | 2024-11-09 | Paper |
| Improved spanning ratio of the Theta-5 graph | 2024-10-18 | Paper |
| Pursuit-evasion in graphs: zombies, lazy zombies and a survivor | 2024-09-11 | Paper |
| Routing on heavy path WSPD spanners | 2024-09-10 | Paper |
| A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes | 2024-05-08 | Paper |
| On the spanning and routing ratio of the directed theta-four graph | 2024-04-02 | Paper |
| Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon | 2024-01-16 | Paper |
| On Separating Path and Tree Systems in Graphs | 2023-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059175 | 2023-11-02 | Paper |
| Bounded-Angle Minimum Spanning Trees | 2023-11-02 | Paper |
| Competitive Online Search Trees on Trees | 2023-10-23 | Paper |
| Improved routing on the Delaunay triangulation | 2023-10-12 | Paper |
| Simple linear time algorithms for piercing pairwise intersecting disks | 2023-07-31 | Paper |
| Local routing algorithms on Euclidean spanners with small diameter | 2023-07-26 | Paper |
| Piercing pairwise intersecting convex shapes in the plane | 2023-07-26 | Paper |
| On the zombie number of various graph classes | 2023-07-26 | Paper |
| On approximating shortest paths in weighted triangular tessellations | 2023-06-27 | Paper |
| Separating layered treewidth and row treewidth | 2023-05-30 | Paper |
| The Minimum Moving Spanning Tree Problem | 2023-03-30 | Paper |
| Fragile complexity of adaptive algorithms | 2023-03-22 | Paper |
| No quadrangulation is extremely odd | 2023-03-21 | Paper |
| Pattern matching for permutations | 2023-01-18 | Paper |
| Filling polyhedral molds | 2023-01-18 | Paper |
| Drawing graphs as spanners | 2022-12-21 | Paper |
| Geodesic obstacle representation of graphs | 2022-11-16 | Paper |
| On the restricted \(k\)-Steiner tree problem | 2022-10-18 | Paper |
| Flips in higher order Delaunay triangulations | 2022-10-13 | Paper |
| Drawing graphs as spanners | 2022-09-16 | Paper |
| Computing constrained minimum-width annuli of point sets | 2022-08-19 | Paper |
| On approximating shortest paths in weighted triangular tessellations | 2022-07-13 | Paper |
| On the spanning and routing ratios of the directed \(\Theta_6\)-graph | 2022-06-13 | Paper |
| Fragile complexity of adaptive algorithms | 2022-05-10 | Paper |
| Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor | 2022-04-25 | Paper |
| Computing maximum independent set on outerstring graphs and their relatives | 2022-04-08 | Paper |
| On the spanning and routing ratios of the directed \(\varTheta_6\)-graph | 2022-03-25 | Paper |
| The minimum moving spanning tree problem | 2022-03-25 | Paper |
| Improved bounds on the spanning ratio of the theta-5-graph | 2022-03-25 | Paper |
| Routing on heavy-path WSPD-spanners | 2022-03-25 | Paper |
| An Optimal Algorithm for Product Structure in Planar Graphs | 2022-02-17 | Paper |
| Bounded-angle minimum spanning trees | 2022-02-01 | Paper |
| Parameterized complexity of two-interval pattern problem | 2022-01-18 | Paper |
| Affine invariant triangulations | 2022-01-12 | Paper |
| Faster multi-sided one-bend boundary labelling | 2021-10-04 | Paper |
| Piercing pairwise intersecting geodesic disks | 2021-09-17 | Paper |
| Attraction-convexity and normal visibility | 2021-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009579 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002693 | 2021-07-28 | Paper |
| Computing the \(k\)-visibility region of a point in a polygon | 2021-06-11 | Paper |
| On the restricted 1-Steiner tree problem | 2021-04-21 | Paper |
| Local routing in WSPD-based spanners | 2021-03-17 | Paper |
| Constrained routing between non-visible vertices | 2021-03-09 | Paper |
| Local Routing in Convex Subdivisions | 2021-02-11 | Paper |
| Competitive Online Search Trees on Trees | 2021-02-02 | Paper |
| Routing on the visibility graph | 2020-11-25 | Paper |
| Faster algorithms for some optimization problems on collinear points | 2020-11-12 | Paper |
| Hamiltonicity for convex shape Delaunay and Gabriel graphs | 2020-10-23 | Paper |
| Gathering by repulsion | 2020-10-23 | Paper |
| Boundary Labeling for Rectangular Diagrams | 2020-08-25 | Paper |
| Gathering by Repulsion. | 2020-08-25 | Paper |
| Improved bounds for guarding plane graphs with edges | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115775 | 2020-08-18 | Paper |
| Power domination on triangular grids with triangular and hexagonal shape | 2020-07-29 | Paper |
| Asymptotically Optimal Vertex Ranking of Planar Graphs | 2020-07-13 | Paper |
| Self-approaching paths in simple polygons | 2020-04-22 | Paper |
| Optimal art gallery localization is NP-hard | 2020-03-23 | Paper |
| Computing the \(k\)-crossing visibility region of a point in a polygon | 2020-02-25 | Paper |
| Computing maximum independent set on outerstring graphs and their relatives | 2020-01-16 | Paper |
| Hamiltonicity for convex shape Delaunay and Gabriel graphs | 2020-01-16 | Paper |
| Reconstructing a convex Polygon from its \(\omega\)-cloud | 2019-10-22 | Paper |
| On the Spanning and Routing Ratio of Theta-Four | 2019-10-15 | Paper |
| Spanning Properties of Yao and đ-Graphs in the Presence of Constraints | 2019-09-24 | Paper |
| A Characterization of the degree sequences of 2-trees | 2019-09-16 | Paper |
| Pole Dancing: 3D Morphs for Tree Drawings | 2019-09-16 | Paper |
| A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon | 2019-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743479 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633875 | 2019-05-06 | Paper |
| Improved bounds for guarding plane graphs with edges | 2019-05-03 | Paper |
| Maximum plane trees in multipartite geometric graphs | 2019-04-25 | Paper |
| On plane constrained bounded-degree spanners | 2019-04-25 | Paper |
| Routing on the Visibility Graph | 2019-02-27 | Paper |
| Pole dancing: 3D morphs for tree drawings | 2019-02-15 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2019-01-11 | Paper |
| Spanning trees in multipartite geometric graphs | 2019-01-11 | Paper |
| Constrained generalized Delaunay graphs are plane spanners | 2018-10-31 | Paper |
| Pole Dancing: 3D Morphs for Tree Drawings | 2018-08-31 | Paper |
| Self-approaching paths in simple polygons | 2018-08-13 | Paper |
| Plane bichromatic trees of low degree | 2018-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5745388 | 2018-06-05 | Paper |
| New and Improved Spanning Ratios for Yao Graphs | 2018-04-23 | Paper |
| Towards Plane Spanners of Degree 3 | 2018-04-19 | Paper |
| Improved spanning ratio for low degree plane spanners | 2018-04-11 | Paper |
| Competitive Online Routing on Delaunay Triangulations | 2018-02-22 | Paper |
| Flipping edge-labelled triangulations | 2018-02-19 | Paper |
| Continuous Yao graphs | 2018-02-12 | Paper |
| Flips in edge-labelled pseudo-triangulations | 2018-01-22 | Paper |
| Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon | 2018-01-19 | Paper |
| A general framework for searching on a line | 2017-11-07 | Paper |
| Constrained routing between non-visible vertices | 2017-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369527 | 2017-10-17 | Paper |
| New bounds for facial nonrepetitive colouring | 2017-10-11 | Paper |
| Upper and lower bounds for online routing on Delaunay triangulations | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368689 | 2017-10-10 | Paper |
| Geodesic ham-sandwich cuts | 2017-09-29 | Paper |
| Local routing in spanners based on WSPDs | 2017-09-22 | Paper |
| Maximum plane trees in multipartite geometric graphs | 2017-09-22 | Paper |
| The Price of Order | 2017-05-19 | Paper |
| Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem | 2017-05-16 | Paper |
| Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon | 2017-05-05 | Paper |
| Essential Constraints of Edge-Constrained Proximity Graphs | 2017-04-05 | Paper |
| New and improved spanning ratios for Yao graphs | 2017-03-30 | Paper |
| A plane 1.88-spanner for points in convex position | 2017-03-30 | Paper |
| Towards plane spanners of degree 3 | 2017-03-30 | Paper |
| On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere | 2017-03-30 | Paper |
| Switching to directional antennas with constant increase in radius and hop distance | 2017-03-27 | Paper |
| On the stretch factor of convex Delaunay graphs | 2017-03-09 | Paper |
| Network farthest-point diagrams | 2017-03-09 | Paper |
| Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition | 2017-02-21 | Paper |
| Biased predecessor search | 2016-12-21 | Paper |
| The power and limitations of static binary search trees with lazy finger | 2016-12-21 | Paper |
| A linear-time algorithm for the geodesic center of a simple polygon | 2016-12-20 | Paper |
| Probing convex polygons with a wedge | 2016-11-14 | Paper |
| Plane bichromatic trees of low degree | 2016-09-29 | Paper |
| Essential Constraints of Edge-Constrained Proximity Graphs | 2016-09-29 | Paper |
| Pattern matching for permutations | 2016-06-09 | Paper |
| A General Framework for Searching on a Line | 2016-05-03 | Paper |
| Improved spanning ratio for low degree plane spanners | 2016-05-03 | Paper |
| Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon | 2016-04-01 | Paper |
| Towards tight bounds on theta-graphs: more is not always better | 2016-01-21 | Paper |
| Competitive Local Routing with Constraints | 2016-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3455035 | 2015-12-03 | Paper |
| Upper and Lower Bounds for Online Routing on Delaunay Triangulations | 2015-11-19 | Paper |
| Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles | 2015-11-18 | Paper |
| The power and limitations of static binary search trees with lazy finger | 2015-09-11 | Paper |
| The Price of Order | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2941395 | 2015-08-28 | Paper |
| The Shadows of a Cycle Cannot All Be Paths | 2015-07-08 | Paper |
| Reprint of: Theta-3 is connected | 2015-04-27 | Paper |
| The \(\varTheta_5\)-graph is a spanner | 2015-03-06 | Paper |
| Local Routing in Convex Subdivisions | 2015-02-20 | Paper |
| Robust geometric spanners | 2015-02-17 | Paper |
| Searching on a line: a complete characterization of the optimal solution | 2015-01-28 | Paper |
| Optimal Data Structures for Farthest-Point Queries in Cactus Networks | 2015-01-27 | Paper |
| Succinct geometric indexes supporting point location queries | 2014-09-09 | Paper |
| Competitive Online Routing on Delaunay Triangulations | 2014-09-02 | Paper |
| Theta-3 is connected | 2014-08-13 | Paper |
| Bounding the locality of distributed routing algorithms | 2014-07-23 | Paper |
| Biased predecessor search | 2014-03-31 | Paper |
| Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs | 2014-03-31 | Paper |
| Optimal Algorithms for Constrained 1-Center Problems | 2014-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747414 | 2014-02-14 | Paper |
| Making triangulations 4-connected using flips | 2014-01-22 | Paper |
| Triangulating and guarding realistic polygons | 2014-01-22 | Paper |
| Minimum-area enclosing triangle with a fixed angle | 2014-01-08 | Paper |
| The θ 5-Graph is a Spanner | 2013-12-06 | Paper |
| Robust geometric spanners | 2013-11-14 | Paper |
| Isoperimetric triangular enclosures with a fixed angle | 2013-10-30 | Paper |
| Revisiting the Problem of Searching on a Line | 2013-09-17 | Paper |
| A History of Distribution-Sensitive Data Structures | 2013-09-13 | Paper |
| On plane geometric spanners: a survey and open problems | 2013-08-22 | Paper |
| On the Stretch Factor of the Theta-4 Graph | 2013-08-12 | Paper |
| On the Spanning Ratio of Theta-Graphs | 2013-08-12 | Paper |
| De-amortizing Binary Search Trees | 2013-08-12 | Paper |
| A Polynomial Bound for Untangling Geometric Planar Graphs | 2013-06-28 | Paper |
| Bounding the locality of distributed routing algorithms | 2013-06-25 | Paper |
| PROXIMITY GRAPHS: E, δ, Î, Ď AND Ď | 2013-06-24 | Paper |
| MORPHING OF TRIANGULAR MESHES IN SHAPE SPACE | 2013-06-06 | Paper |
| Coverage with \(k\)-transmitters in the presence of obstacles | 2013-03-25 | Paper |
| A History of Flips in Combinatorial Triangulations | 2013-01-07 | Paper |
| Stable roommates spanner | 2012-12-04 | Paper |
| Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs | 2012-12-04 | Paper |
| Fast local searches and updates in bounded universes | 2012-12-04 | Paper |
| Ď/2-ANGLE YAO GRAPHS ARE SPANNERS | 2012-11-23 | Paper |
| On bounded degree plane strong geometric spanners | 2012-09-13 | Paper |
| Skip lift: a probabilistic alternative to red-black trees | 2012-09-13 | Paper |
| On plane constrained bounded-degree spanners | 2012-06-29 | Paper |
| A distribution-sensitive dictionary with low space overhead | 2012-05-11 | Paper |
| Layered working-set trees | 2012-04-26 | Paper |
| Every large point set contains many collinear points or an empty pentagon | 2012-01-24 | Paper |
| A generalized Winternitz theorem | 2012-01-13 | Paper |
| A survey of geodesic paths on 3D surfaces | 2011-12-28 | Paper |
| Common Unfoldings of Polyominoes and Polycubes | 2011-11-11 | Paper |
| Spanners of additively weighted point sets | 2011-08-23 | Paper |
| Switching to Directional Antennas with Constant Increase in Radius and Hop Distance | 2011-08-12 | Paper |
| On a family of strong geometric spanners that admit local routing strategies | 2011-07-20 | Paper |
| ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS | 2011-06-17 | Paper |
| COMPUTING SIGNED PERMUTATIONS OF POLYGONS | 2011-06-17 | Paper |
| Skip Lift: A Probabilistic Alternative to Red-Black Trees | 2011-05-19 | Paper |
| Location-oblivious distributed unit disk graph coloring | 2011-05-10 | Paper |
| Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) | 2011-01-31 | Paper |
| Coverage with k-Transmitters in the Presence of Obstacles | 2011-01-10 | Paper |
| Ď/2-Angle Yao Graphs Are Spanners | 2010-12-09 | Paper |
| Should Static Search Trees Ever Be Unbalanced? | 2010-12-09 | Paper |
| A note on the perimeter of fat objects | 2010-10-15 | Paper |
| Computing the greedy spanner in near-quadratic time | 2010-09-27 | Paper |
| Simultaneous diagonal flips in plane triangulations | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579430 | 2010-08-06 | Paper |
| An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times | 2010-06-22 | Paper |
| Improved Methods For Generating Quasi-gray Codes | 2010-06-22 | Paper |
| On the false-positive rate of Bloom filters | 2010-06-09 | Paper |
| Communication-Efficient Construction of the Plane Localized Delaunay Graph | 2010-04-27 | Paper |
| Layered Working-Set Trees | 2010-04-27 | Paper |
| Sigma-local graphs | 2010-02-26 | Paper |
| ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS | 2010-02-12 | 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 |
| A Distribution-Sensitive Dictionary with Low Space Overhead | 2009-10-20 | Paper |
| Efficient Construction of Near-Optimal Binary and Multiway Search Trees | 2009-10-20 | Paper |
| Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing | 2009-10-20 | Paper |
| DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE | 2009-06-30 | Paper |
| Algorithms for optimal outlier removal | 2009-06-24 | Paper |
| Rotationally monotone polygons | 2009-06-18 | Paper |
| A note on the lower bound of edge guards of polyhedral terrains | 2009-06-02 | Paper |
| Traversing a set of points with a minimum number of turns | 2009-05-06 | Paper |
| Augmented reality on cloth with realistic illumination | 2009-03-30 | Paper |
| A linear-space algorithm for distance preserving graph embedding | 2009-03-09 | Paper |
| On Generalized Diamond Spanners | 2009-02-17 | Paper |
| On a Family of Strong Geometric Spanners That Admit Local Routing Strategies | 2009-02-17 | Paper |
| POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS | 2009-02-12 | Paper |
| Traversing a set of points with a minimum number of turns | 2009-02-12 | Paper |
| On the Stretch Factor of Convex Delaunay Graphs | 2009-01-29 | Paper |
| Geometric spanners with small chromatic number | 2008-11-19 | Paper |
| Flips in planar graphs | 2008-10-22 | Paper |
| Data structures for halfplane proximity queries and incremental Voronoi diagrams | 2008-09-18 | Paper |
| A Characterization of the degree sequences of 2-trees | 2008-09-04 | Paper |
| Computing the Greedy Spanner in Near-Quadratic Time | 2008-07-15 | Paper |
| Spanners of Additively Weighted Point Sets | 2008-07-15 | Paper |
| A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS | 2008-05-20 | Paper |
| Diamond Triangulations Contain Spanners of Bounded Degree | 2008-04-24 | Paper |
| Spanners of Complete k-Partite Geometric Graphs | 2008-04-15 | Paper |
| Weighted Ham-Sandwich Cuts | 2008-03-18 | Paper |
| Geometric Spanners with Small Chromatic Number | 2008-02-20 | Paper |
| On local transformations in plane geometric graphs embedded on small grids | 2007-12-03 | Paper |
| Location Oblivious Distributed Unit Disk Graph Coloring | 2007-11-15 | Paper |
| Computational Science and Its Applications â ICCSA 2004 | 2007-07-19 | Paper |
| Space-efficient geometric divide-and-conquer algorithms | 2007-06-04 | Paper |
| On the Spanning Ratio of Gabriel Graphs and beta-Skeletons | 2007-05-22 | 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 |
| Area-preserving approximations of polygonal paths | 2007-02-14 | Paper |
| On the stabbing number of a random Delaunay triangulation | 2006-12-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480768 | 2006-08-03 | Paper |
| Partitions of complete geometric graphs into plane trees | 2006-05-16 | Paper |
| Equitable subdivisions within polygonal regions | 2006-04-28 | Paper |
| Constructing plane spanners of bounded degree and low weight | 2006-03-21 | Paper |
| GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA | 2006-03-13 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024763 | 2005-07-04 | 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 |
| Optimizing a constrained convex polygonal annulus | 2005-05-04 | Paper |
| PROPERTIES OF ARRANGEMENT GRAPHS | 2005-03-30 | 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 |
| Approximating geometric bottleneck shortest paths | 2004-11-18 | Paper |
| DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND | 2004-09-29 | Paper |
| ONLINE ROUTING IN CONVEX SUBDIVISIONS | 2004-09-29 | Paper |
| AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE | 2004-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044349 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044324 | 2004-08-11 | Paper |
| Light edges in degree-constrained graphs | 2004-08-06 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4472476 | 2004-08-04 | Paper |
| On simplifying dot maps. | 2004-01-23 | Paper |
| Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces | 2003-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418635 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411362 | 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 |
| On embedding an outer-planar graph in a point set | 2003-03-10 | Paper |
| Efficient visibility queries in simple polygons | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778553 | 2002-11-18 | Paper |
| Cutting circles into equal area pieces | 2002-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551356 | 2002-09-05 | Paper |
| Experimental results on quadrangulations of sets of fixed points | 2002-08-13 | Paper |
| Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications. | 2002-02-25 | 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/Q2728847 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728846 | 2001-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729093 | 2001-10-23 | Paper |
| Efficient algorithms for Petersen's matching theorem | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525680 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511220 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252281 | 1999-06-17 | Paper |
| Intersections with random geometric objects | 1998-08-02 | Paper |
| A Visibility Representation for Graphs in Three Dimensions | 1998-07-05 | Paper |
| Characterizing and efficiently computing quadrangulations of planar point sets | 1998-06-30 | Paper |
| Optimal Algorithms to Embed Trees in a Point Set | 1998-04-01 | Paper |
| Filling polyhedral molds. | 1998-01-01 | Paper |
| The Floodlight Problem | 1997-07-27 | Paper |
| Guarding polyhedral terrains | 1997-03-18 | Paper |
| All convex polyhedra can be clamped with parallel jaw grippers | 1996-10-20 | Paper |
| Geometric and computational aspects of gravity casting | 1996-03-05 | Paper |
| Growing a Tree from Its Branches | 1995-09-10 | Paper |
| Linear versus centred chromatic numbers | N/A | Paper |
| Connected Dominating Sets in Triangulations | N/A | Paper |
