| Publication | Date of Publication | Type |
|---|
| Sequence Hypergraphs: Paths, Flows, and Cuts | 2023-06-30 | Paper |
| Balanced distributed search trees do not exist | 2022-12-16 | Paper |
| Relaxed balance through standard rotations | 2022-08-19 | Paper |
| Enclosing many boxes by an optimal pair of boxes | 2022-08-18 | Paper |
| Time is not a healer | 2022-08-16 | Paper |
| Space filling curves and their use in the design of geometric data structures | 2022-08-16 | Paper |
| Mapping Simple Polygons | 2018-10-30 | Paper |
| Polygon-constrained motion planning problems | 2018-10-17 | Paper |
| Data delivery by energy-constrained mobile agents | 2018-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643884 | 2018-05-29 | Paper |
| Selecting vertex disjoint paths in plane graphs | 2018-05-23 | Paper |
| Improved bounds for the conflict-free chromatic art gallery problem | 2018-04-23 | Paper |
| Robust optimization in the presence of uncertainty: a generic approach | 2018-04-18 | Paper |
| A better scoring model for de novo peptide sequencing: the symmetric difference between explained and measured masses | 2018-03-23 | Paper |
| Algorithmen und Datenstrukturen | 2017-12-04 | Paper |
| An inherent bottleneck in distributed counting | 2017-09-29 | Paper |
| Robust optimization in the presence of uncertainty | 2017-05-16 | Paper |
| Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty | 2017-02-20 | Paper |
| Sequence Hypergraphs | 2016-12-22 | Paper |
| Mapping a Polygon with Holes Using a Compass | 2016-12-19 | Paper |
| Bribeproof Mechanisms for Two-Values Domains | 2016-09-29 | Paper |
| Finding the detour-critical edge of a shortest path between two nodes | 2016-06-09 | Paper |
| Approximately counting approximately-shortest paths in directed acyclic graphs | 2016-03-21 | Paper |
| Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods | 2015-10-16 | Paper |
| Recurring Comparison Faults: Sorting and Finding the Minimum | 2015-09-29 | Paper |
| An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs | 2015-03-02 | Paper |
| Mapping a polygon with holes using a compass | 2014-09-18 | Paper |
| Counting Approximately-Shortest Paths in Directed Acyclic Graphs | 2014-09-02 | Paper |
| Data Delivery by Energy-Constrained Mobile Agents on a Line | 2014-07-01 | Paper |
| Simple agents learn to find their way: an introduction on mapping polygons | 2014-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5397839 | 2014-02-24 | Paper |
| Interval Selection with Machine-Dependent Intervals | 2013-08-12 | Paper |
| Corner cuts are close to optimal: from solid grids to polygons and back | 2013-04-25 | Paper |
| Mapping simple polygons: how robots benefit from looking back | 2013-03-05 | Paper |
| Vertex Disjoint Paths for Dispatching in Railways. | 2012-09-28 | Paper |
| Reconstructing visibility graphs with simple robots | 2012-08-10 | Paper |
| Computing all the best swap edges distributively | 2012-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113680 | 2012-01-23 | Paper |
| Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons | 2011-12-16 | Paper |
| Maximum Independent Set in 2-Direction Outersegment Graphs | 2011-12-16 | Paper |
| How to guard a graph? | 2011-12-14 | Paper |
| An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs | 2011-09-16 | Paper |
| A polygon is determined by its angles | 2011-08-02 | Paper |
| On robust online scheduling algorithms | 2011-05-30 | Paper |
| Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol | 2011-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3079180 | 2011-03-01 | Paper |
| Computing All Best Swaps for Minimum-Stretch Tree Spanners | 2011-02-16 | Paper |
| On the Complexity of the Metric TSP under Stability Considerations | 2011-02-15 | Paper |
| Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids | 2011-01-08 | Paper |
| Algorithmen und Datenstrukturen | 2010-12-22 | Paper |
| Rendezvous of Mobile Agents in Directed Graphs | 2010-09-10 | Paper |
| Reconstructing a Simple Polygon from Its Angles | 2010-06-22 | Paper |
| Approximate shortest paths guided by a small index | 2010-05-28 | Paper |
| How Simple Robots Benefit from Looking Back | 2010-05-28 | Paper |
| Discovery of network properties with all-shortest-paths queries | 2010-04-06 | Paper |
| Reconstructing Visibility Graphs with Simple Robots | 2010-02-24 | Paper |
| Stability of Networks in Stretchable Graphs | 2010-02-24 | Paper |
| Shunting for Dummies: An Introductory Algorithmic Survey | 2009-12-03 | Paper |
| Online Train Disposition: To Wait or Not to Wait? | 2009-12-03 | Paper |
| Single machine batch scheduling with release times | 2009-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396008 | 2009-09-15 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection | 2009-07-23 | Paper |
| Strongly polynomial-time truthful mechanisms in one shot | 2009-04-29 | Paper |
| On the Robustness of Graham’s Algorithm for Online Scheduling | 2009-02-17 | Paper |
| Approximate Shortest Paths Guided by a Small Index | 2009-02-17 | Paper |
| Reoptimization of Weighted Graph and Covering Problems | 2009-02-12 | Paper |
| How to Guard a Graph? | 2009-01-29 | Paper |
| Computing Best Swaps in Optimal Tree Spanners | 2009-01-29 | Paper |
| Simple Robots in Polygonal Environments: A Hierarchy | 2009-01-22 | Paper |
| Arbitrary pattern formation by asynchronous, anonymous, oblivious robots | 2008-11-18 | Paper |
| A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree | 2008-09-02 | Paper |
| Angle Optimization in Target Tracking | 2008-07-15 | Paper |
| Reoptimization of Steiner Trees | 2008-07-15 | Paper |
| Discovery of Network Properties with All-Shortest-Paths Queries | 2008-07-10 | Paper |
| Locating Facilities on a Network to Minimize Their Average Service Radius | 2008-05-27 | Paper |
| Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii | 2008-04-24 | Paper |
| On the Hardness of Reoptimization | 2008-03-07 | Paper |
| Agreement in synchronous networks with ubiquitous faults | 2007-10-02 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Online Single Machine Batch Scheduling | 2007-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5755525 | 2007-08-13 | Paper |
| An algorithmic view on OVSF code assignment | 2007-04-26 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Gathering of asynchronous robots with limited visibility | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4680533 | 2005-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673403 | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673408 | 2005-04-29 | Paper |
| Distributed search trees: fault tolerance in an asynchronous environment | 2005-02-11 | Paper |
| The counting pyramid: an adaptive distributed counting scheme | 2004-10-04 | Paper |
| Nearly linear time minimum spanning tree maintenance for transient node failures | 2004-10-01 | Paper |
| Amortized Complexity of Bulk Updates in AVL-Trees | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474107 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448359 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437514 | 2003-12-02 | Paper |
| Finding the most vital node of a shortest path. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413803 | 2003-07-21 | Paper |
| An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee | 2003-06-19 | Paper |
| Swapping a failing edge of a single source shortest paths tree is good and fast | 2003-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796708 | 2003-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551366 | 2002-09-05 | Paper |
| A faster computation of the most vital edge of a shortest path | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2782238 | 2002-04-14 | Paper |
| Relaxed balance using standard rotations | 2002-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762510 | 2002-01-09 | Paper |
| Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures | 2002-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753951 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729100 | 2001-10-23 | Paper |
| Inapproximability results for guarding polygons and terrains | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721983 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708233 | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938662 | 2001-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945518 | 2000-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252023 | 2000-03-13 | Paper |
| Class Steiner trees and VLSI-design | 1999-04-11 | Paper |
| An inherent bottleneck in distributed counting | 1998-08-20 | Paper |
| Space-filling curves and their use in the design of geometric data structures | 1998-07-22 | Paper |
| Enclosing a Set of Objects by Two Minimum Area Rectangles | 1997-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336276 | 1997-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4894115 | 1996-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4861481 | 1996-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4313071 | 1995-07-13 | Paper |
| \(k\)-violation linear programming | 1995-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694138 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694752 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694757 | 1993-06-29 | Paper |
| Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4692465 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035743 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035749 | 1993-05-18 | Paper |
| On graphs preserving rectilinear shortest paths in the presence of obstacles | 1992-06-27 | Paper |
| On the power of safe locking | 1990-01-01 | Paper |
| A Simple Proof of the Steiner Ratio Conjecture for Five Points | 1989-01-01 | Paper |
| Hole Problems for Rectangles in the Plane | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796717 | 1988-01-01 | Paper |
| Time-and space-optimal contour computation for a set of rectangles | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785980 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3711731 | 1986-01-01 | Paper |
| Pre-analysis locking | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785929 | 1986-01-01 | Paper |
| A fast algorithm for the Boolean masking problem | 1985-01-01 | Paper |
| A worst-case efficient algorithm for hidden-line elimination† | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727415 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3666227 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959468 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959474 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959475 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959476 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959477 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933767 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3881885 | 1980-01-01 | Paper |
