| Publication | Date of Publication | Type |
|---|
| Snakes and Ladders: A Treewidth Story | 2024-05-03 | Paper |
| Sequence Hypergraphs: Paths, Flows, and Cuts | 2023-06-30 | Paper |
| Sequential solutions in machine scheduling games | 2023-03-21 | Paper |
| Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005158 | 2021-08-04 | Paper |
| Collaborative delivery on a fixed path with homogeneous energy-constrained agents | 2021-05-10 | Paper |
| Tree Nash Equilibria in the Network Creation Game | 2021-04-26 | Paper |
| Near-gathering of energy-constrained mobile agents | 2020-12-15 | Paper |
| Near-gathering of energy-constrained mobile agents | 2020-03-03 | Paper |
| Collaborative delivery on a fixed path with homogeneous energy-constrained agents | 2020-03-03 | Paper |
| Collaborative delivery with energy-constrained mobile robots | 2020-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240197 | 2019-10-24 | Paper |
| Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences | 2019-09-17 | Paper |
| Improved bounds on equilibria solutions in the network design game | 2018-12-28 | 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 |
| On a fixed haplotype variant of the minimum error correction problem | 2018-10-04 | Paper |
| Computing and listing \(st\)-paths in public transportation networks | 2018-06-01 | 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 |
| Robust optimization in the presence of uncertainty | 2017-05-16 | Paper |
| Sequence Hypergraphs | 2016-12-22 | Paper |
| Mapping a Polygon with Holes Using a Compass | 2016-12-19 | Paper |
| Collaborative delivery with energy-constrained mobile robots | 2016-12-01 | Paper |
| Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores | 2016-11-30 | Paper |
| Bribeproof Mechanisms for Two-Values Domains | 2016-09-29 | Paper |
| Computing and Listing st-Paths in Public Transportation Networks | 2016-07-25 | Paper |
| Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs | 2016-05-03 | Paper |
| Approximately counting approximately-shortest paths in directed acyclic graphs | 2016-03-21 | Paper |
| Multicast Network Design Game on a Ring | 2016-02-05 | 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 |
| Tree Nash Equilibria in the Network Creation Game | 2015-01-13 | Paper |
| Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games | 2014-12-02 | Paper |
| An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games | 2014-10-14 | 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 |
| The price of anarchy in network creation games is (mostly) constant | 2013-10-21 | Paper |
| Interval Selection with Machine-Dependent Intervals | 2013-08-12 | Paper |
| Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games | 2013-06-07 | Paper |
| Mapping simple polygons: how robots benefit from looking back | 2013-03-05 | Paper |
| Track Allocation in Freight-Train Classification with Mixed Tracks | 2012-09-28 | Paper |
| Vertex Disjoint Paths for Dispatching in Railways. | 2012-09-28 | Paper |
| Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games | 2012-09-25 | Paper |
| Reconstructing visibility graphs with simple robots | 2012-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113680 | 2012-01-23 | Paper |
| Maximum Independent Set in 2-Direction Outersegment Graphs | 2011-12-16 | Paper |
| How to guard a graph? | 2011-12-14 | Paper |
| A polygon is determined by its angles | 2011-08-02 | Paper |
| On the Complexity of the Metric TSP under Stability Considerations | 2011-02-15 | Paper |
| The Price of Anarchy in Network Creation Games Is (Mostly) Constant | 2010-10-19 | Paper |
| Reconstructing a Simple Polygon from Its Angles | 2010-06-22 | Paper |
| How Simple Robots Benefit from Looking Back | 2010-05-28 | Paper |
| A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs | 2010-05-11 | Paper |
| Discovery of network properties with all-shortest-paths queries | 2010-04-06 | Paper |
| Reconstructing Visibility Graphs with Simple Robots | 2010-02-24 | Paper |
| Shunting for Dummies: An Introductory Algorithmic Survey | 2009-12-03 | Paper |
| Approximate Discovery of Random Graphs | 2009-03-05 | Paper |
| How to Guard a Graph? | 2009-01-29 | Paper |
| Simple Robots in Polygonal Environments: A Hierarchy | 2009-01-22 | Paper |
| Angle Optimization in Target Tracking | 2008-07-15 | Paper |
| Discovery of Network Properties with All-Shortest-Paths Queries | 2008-07-10 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs | 2007-08-28 | Paper |
| An algorithmic view on OVSF code assignment | 2007-04-26 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
