| Publication | Date of Publication | Type |
|---|
| The lawn mowing problem: from algebra to algorithms | 2025-01-06 | Paper |
| What goes around comes around: covering tours and cycle covers with turn costs | 2024-11-12 | Paper |
| Worst-case optimal covering of rectangles by disks | 2024-10-25 | Paper |
| Efficiently reconfiguring a connected swarm of labeled robots | 2024-09-11 | Paper |
| Minimum partition into plane subgraphs: the CG:SHOP challenge 2022 | 2024-07-26 | Paper |
| A closer cut: computing near-optimal lawn mowing tours | 2024-05-24 | Paper |
| Space ants: Episode II -- coordinating connected catoms (media exposition) | 2024-05-14 | Paper |
| Minimum Scan Cover and Variants: Theory and Experiments | 2024-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6124757 | 2024-04-02 | Paper |
| Particle computation: complexity, algorithms, and logic | 2024-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147511 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059992 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059993 | 2023-11-02 | Paper |
| Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition). | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6060030 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6060031 | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6060032 | 2023-11-02 | Paper |
| Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game | 2023-06-20 | Paper |
| Parallel online algorithms for the bin packing problem | 2023-04-21 | Paper |
| Probing a set of trajectories to maximize captured information | 2023-02-07 | Paper |
| Packing disks into disks with optimal worst-case density | 2023-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5044449 | 2022-10-31 | Paper |
| Coordinating Swarms of Objects at Extreme Dimensions | 2022-10-13 | Paper |
| Connected reconfiguration of lattice-based cellular structures by finite-memory robots | 2022-10-06 | Paper |
| Computing Area-Optimal Simple Polygonizations | 2022-09-06 | Paper |
| Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021 | 2022-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088965 | 2022-07-18 | Paper |
| Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) | 2022-07-18 | Paper |
| A new exact algorithm for general orthogonal d-dimensional knapsack problems | 2021-12-20 | Paper |
| Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game | 2021-10-04 | Paper |
| Connected reconfiguration of lattice-based cellular structures by finite-memory robots | 2021-07-08 | Paper |
| Minimum Scan Cover with Angular Transition Costs | 2021-06-28 | Paper |
| CADbots: algorithmic aspects of manipulating programmable matter with finite automata | 2021-02-01 | Paper |
| Folding polyominoes with holes into a cube | 2021-01-07 | Paper |
| Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game | 2020-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136226 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136250 | 2020-11-25 | Paper |
| Existence and hardness of conveyor belts | 2020-11-05 | Paper |
| Parallel online algorithms for the Bin Packing Problem | 2020-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115797 | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116536 | 2020-08-18 | Paper |
| Tilt assembly: algorithms for micro-factories that build objects with uniform external forces | 2020-04-09 | Paper |
| Don't rock the boat: algorithms for balanced dynamic loading and unloading | 2020-02-12 | Paper |
| Covering tours and cycle covers with turn costs: hardness and approximation | 2020-02-06 | Paper |
| Online circle packing | 2020-01-16 | Paper |
| Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch | 2019-12-09 | Paper |
| Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost | 2019-09-13 | Paper |
| Computing MaxMin Edge Length Triangulations | 2019-09-12 | Paper |
| Exact Solutions and Bounds for General Art Gallery Problems | 2019-09-11 | Paper |
| Split packing: algorithms for packing circles with optimal worst-case density | 2019-03-13 | Paper |
| Computing maxmin edge length triangulations | 2019-02-27 | Paper |
| A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees | 2019-01-11 | Paper |
| Conflict-Free Coloring of Graphs | 2018-11-28 | Paper |
| Folding Polyominoes into (Poly)Cubes | 2018-11-26 | Paper |
| Conflict-Free Coloring of Intersection Graphs | 2018-11-26 | Paper |
| Cost-Oblivious Storage Reallocation | 2018-11-05 | Paper |
| Improved Approximation Algorithms for Relay Placement | 2018-10-30 | Paper |
| Reconfiguring massive particle swarms with limited, global control | 2018-10-17 | Paper |
| Universal Guard Problems | 2018-08-02 | Paper |
| Three Colors Suffice: Conflict-Free Coloring of Planar Graphs | 2018-07-16 | Paper |
| Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices | 2018-06-12 | Paper |
| Universal Guard Problems | 2018-04-19 | Paper |
| Geometric hitting set for segments of few orientations | 2018-04-12 | Paper |
| Connecting a set of circles with minimum sum of radii | 2018-02-19 | Paper |
| Distributed vision with smart pixels | 2017-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368669 | 2017-10-10 | Paper |
| Connectivity graphs of uncertainty regions | 2017-10-09 | Paper |
| Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly | 2017-10-05 | Paper |
| On the continuous Weber and k -median problems (extended abstract) | 2017-09-29 | Paper |
| Split packing: packing circles into triangles with optimal worst-case density | 2017-09-22 | Paper |
| New geometric algorithms for fully connected staged self-assembly | 2017-05-18 | Paper |
| Online square-into-square packing | 2017-04-12 | Paper |
| Lower Bounds for Graph Exploration Using Local Policies | 2017-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816022 | 2016-07-01 | Paper |
| Lower Bounds for Graph Exploration Using Local Policies | 2016-05-03 | Paper |
| Geometric hitting set for segments of few orientations | 2016-02-26 | Paper |
| Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability | 2016-01-11 | Paper |
| The geometric maximum traveling salesman problem | 2015-11-12 | Paper |
| The minimum backlog problem | 2015-10-30 | Paper |
| Reallocation problems in scheduling | 2015-10-19 | Paper |
| Facets for art gallery problems | 2015-10-19 | Paper |
| New geometric algorithms for fully connected staged self-assembly | 2015-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501290 | 2015-08-03 | Paper |
| Online square packing with gravity | 2014-12-02 | Paper |
| A survey on relay placement with runtime and approximation guarantees | 2014-10-24 | Paper |
| A competitive strategy for distance-aware online shape allocation | 2014-10-06 | Paper |
| One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile | 2014-07-01 | Paper |
| Exact solutions and bounds for general art gallery problems | 2014-04-01 | Paper |
| Online square-into-square packing | 2013-10-04 | Paper |
| Facets for Art Gallery Problems | 2013-06-11 | Paper |
| Online Exploration and Triangulation in Orthogonal Polygonal Regions | 2013-04-12 | Paper |
| A Competitive Strategy for Distance-Aware Online Shape Allocation | 2013-04-12 | Paper |
| Minimum covering with travel cost | 2012-10-01 | Paper |
| Exploring and Triangulating a Region by a Swarm of Robots | 2011-08-17 | Paper |
| Connecting a set of circles with minimum sum of radii | 2011-08-12 | Paper |
| Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? | 2011-01-31 | Paper |
| Evacuation of Rectilinear Polygons | 2011-01-08 | Paper |
| Connectivity graphs of uncertainty regions | 2010-12-09 | Paper |
| Bild der Mathematik. Mathematiker als Superhelden | 2010-10-19 | Paper |
| Locked and unlocked chains of planar shapes | 2010-09-22 | Paper |
| Deterministic boundary recognition and topology extraction for large sensor networks | 2010-08-16 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Minimum Covering with Travel Cost | 2009-12-17 | Paper |
| Polygon exploration with time-discrete vision | 2009-11-16 | Paper |
| Online Square Packing | 2009-10-20 | Paper |
| Maintaining Arrays of Contiguous Objects | 2009-10-20 | Paper |
| An Exact Algorithm for Higher-Dimensional Orthogonal Packing | 2009-08-13 | Paper |
| Not being (super)thin or solid is hard: A study of grid Hamiltonicity | 2009-07-27 | Paper |
| On the Continuous Fermat-Weber Problem | 2009-07-17 | Paper |
| The complexity of economic equilibria for house allocation markets | 2009-07-09 | Paper |
| Algorithms and Simulation Methods for Topology-Aware Sensor Networks | 2009-07-09 | Paper |
| Two Dimensional Rendezvous Search | 2009-07-03 | Paper |
| A minimization version of a directed subgraph homeomorphism problem | 2009-04-27 | Paper |
| Minimizing the stabbing number of matchings, trees, and triangulations | 2009-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601523 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601572 | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601575 | 2009-02-10 | Paper |
| Improved Approximation Algorithms for Relay Placement | 2008-11-25 | Paper |
| Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues | 2008-09-02 | Paper |
| The Maximum Energy-Constrained Dynamic Flow Problem | 2008-07-15 | Paper |
| Angle-restricted tours in the plane. | 2008-04-25 | Paper |
| Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues | 2008-04-04 | Paper |
| Communication-aware processor allocation for supercomputers: Finding point sets of small average distance | 2008-04-03 | Paper |
| Higher‐Dimensional Packing with Order Constraints | 2007-11-16 | Paper |
| PackLib\(^{2}\): an integrated library of multi-dimensional packing problems | 2007-08-27 | Paper |
| Matching as the Intersection of Matroids | 2007-05-29 | Paper |
| Simultaneous Scheduling, Binding and Routing for Coarse-Grain Reconfigurable Architectures | 2007-05-29 | Paper |
| The freeze-tag problem: How to wake up a swarm of robots | 2006-11-06 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Online searching with turn cost | 2006-09-14 | Paper |
| Optimal Covering Tours with Turn Costs | 2006-06-01 | Paper |
| Online searching with an autonomous robot | 2006-05-16 | Paper |
| Traveling the boundary of Minkowski sums. | 2006-01-17 | Paper |
| A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing | 2005-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692695 | 2005-09-28 | Paper |
| Algorithmic Aspects of Wireless Sensor Networks | 2005-08-25 | Paper |
| Solving a "Hard" problem to approximate an "Easy" one | 2005-08-04 | Paper |
| TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING | 2005-06-10 | Paper |
| The one-round Voronoi game replayed | 2005-01-31 | Paper |
| A general framework for bounds for higher-dimensional orthogonal packing problems. | 2005-01-11 | Paper |
| The freeze-tag problem: How to wake up a swarm of robots | 2004-11-29 | Paper |
| Traveling salesmen in the presence of competition | 2004-10-27 | Paper |
| Maximum dispersion and geometric maximum weight cliques | 2004-09-22 | Paper |
| What is the optimal shape of a city? | 2004-06-15 | Paper |
| Characterizing matchings as the intersection of matroids | 2003-12-16 | Paper |
| An algorithmic study of manufacturing paperclips and other folded structures. | 2003-05-19 | Paper |
| Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems | 2003-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778554 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778564 | 2002-11-18 | Paper |
| Optimization of dynamic hardware reconfigurations | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768284 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2764040 | 2002-01-22 | Paper |
| Approximation of geometric dispersion problems | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753733 | 2001-11-11 | Paper |
| Tree spanners in planar graphs | 2001-04-04 | Paper |
| Approximation algorithms for lawn mowing and milling | 2001-02-22 | Paper |
| New classes of fast lower bounds for bin packing problems | 2001-01-01 | Paper |
| RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252306 | 2000-09-26 | Paper |
| On minimum stars and maximum matchings. | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263469 | 2000-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232796 | 1999-08-17 | Paper |
| The nucleon of cooperative games and an algorithm for matching games | 1999-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840364 | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400845 | 1998-10-25 | Paper |
| A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees | 1998-09-20 | Paper |
| A Visibility Representation for Graphs in Three Dimensions | 1998-07-05 | Paper |
| On the complexity of testing membership in the core of min-cost spanning tree games | 1998-04-22 | Paper |
| On approximately fair cost allocation in Euclidean TSP games | 1998-04-13 | Paper |
