| Publication | Date of Publication | Type |
|---|
| Covering segments on a line with drones | 2025-01-14 | Paper |
| Constructing red-black spanners for mixed-charging vehicular networks | 2024-12-12 | Paper |
| Computing random \(r\)-orthogonal Latin squares | 2024-09-16 | Paper |
| Red-black spanners for mixed-charging vehicular networks | 2024-08-22 | Paper |
| Connectivity and stochastic robustness of synchronized multi-drone systems | 2024-04-02 | Paper |
| Computing balanced convex partitions of lines | 2023-08-17 | Paper |
| Constructing order type graphs using an axiomatic approach | 2023-03-21 | Paper |
| Improved Bounds for Permutation Arrays Under Chebyshev Distance | 2023-02-24 | Paper |
| Bounds for Permutation Arrays under Kendall Tau Metric | 2023-01-26 | Paper |
| On maximum-sum matchings of points | 2023-01-19 | Paper |
| Computation of new diagonal graph Ramsey numbers | 2022-11-29 | Paper |
| Computing balanced convex partitions of lines | 2022-10-13 | Paper |
| Algorithms for Radon partitions with tolerance | 2022-08-04 | Paper |
| New algorithms and bounds for halving pseudolines | 2022-08-04 | Paper |
| Using permutation rational functions to obtain permutation arrays with large Hamming distance | 2022-07-13 | Paper |
| Failure and communication in a synchronized multi-drone system | 2022-03-24 | Paper |
| Improved lower bounds for permutation arrays using permutation rational functions | 2021-10-04 | Paper |
| New algorithms and bounds for halving pseudolines | 2020-07-21 | Paper |
| Algorithms for Radon partitions with tolerance | 2020-07-21 | Paper |
| New lower bounds for Tverberg partitions with tolerance in the plane | 2020-06-29 | Paper |
| On the robustness of a synchronized multi-robot system | 2020-04-27 | Paper |
| Constructing permutation arrays using partition and extension | 2020-01-31 | Paper |
| A lower bound on permutation codes of distance \(n-1\) | 2020-01-09 | Paper |
| Equivalence Relations for Computing Permutation Polynomials | 2019-11-28 | Paper |
| Computing melodic templates in oral music traditions | 2019-11-25 | Paper |
| New lower bounds for permutation arrays using contraction | 2019-09-12 | Paper |
| On some matching problems under the color-spanning model | 2019-08-20 | Paper |
| A construction of product blocks with a fixed block size | 2019-07-24 | Paper |
| On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model | 2019-04-26 | Paper |
| Computing the \(k\)-resilience of a synchronized multi-robot system | 2018-07-20 | Paper |
| Monadic Decomposition | 2018-05-17 | Paper |
| Optimizing squares covering a set of points | 2018-05-17 | Paper |
| Constructing permutation arrays from groups | 2018-04-16 | Paper |
| Certifying and constructing minimally rigid graphs in the plane | 2017-10-20 | Paper |
| Curvature-bounded traversals of narrow corridors | 2017-10-20 | Paper |
| The lifting model for reconfiguration | 2017-10-20 | Paper |
| Guarding a terrain by two watchtowers | 2017-10-20 | Paper |
| Node Overlap Removal by Growing a Tree | 2017-10-12 | Paper |
| A new algorithmic framework for basic problems on binary images | 2017-05-12 | Paper |
| Extending permutation arrays: improving MOLS bounds | 2017-04-12 | Paper |
| Node Overlap Removal by Growing a Tree | 2017-02-21 | Paper |
| On the 2-Center Problem Under Convex Polyhedral Distance Function | 2017-02-01 | Paper |
| Representing permutations with few moves | 2016-10-20 | Paper |
| Edge routing with ordered bundles | 2016-05-17 | Paper |
| Resilience of a synchronized multi-agent system | 2016-04-29 | Paper |
| Optimizing some constructions with bars: new geometric knapsack problems | 2016-04-13 | Paper |
| On the edge crossing properties of Euclidean minimum weight Laman graphs | 2016-01-18 | Paper |
| Colored Non-crossing Euclidean Steiner Forest | 2016-01-11 | Paper |
| EMBEDDING THE DOUBLE CIRCLE IN A SQUARE GRID OF MINIMUM SIZE | 2015-04-22 | Paper |
| On balanced 4-holes in bichromatic point sets | 2014-12-23 | Paper |
| Balanced partitions of 3-colored geometric sets in the plane | 2014-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417734 | 2014-05-22 | Paper |
| On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs | 2014-01-14 | Paper |
| Drawing Permutations with Few Corners | 2013-12-20 | Paper |
| Compatible Geometric Matchings | 2013-06-28 | Paper |
| Drawing the double circle on a grid of minimum size | 2013-05-29 | Paper |
| A New Framework for Connected Components Labeling of Binary Images | 2013-04-04 | Paper |
| Small Work Space Algorithms for Some Basic Problems on Binary Images | 2013-04-04 | Paper |
| On the coarseness of bicolored point sets | 2012-10-12 | Paper |
| Computing generalized ham-sandwich cuts | 2012-07-25 | Paper |
| Balanced line for a 3-colored point set in the plane | 2012-06-12 | Paper |
| The class cover problem with boxes | 2012-05-18 | Paper |
| The maximum box problem for moving points in the plane | 2012-04-04 | Paper |
| Edge Routing with Ordered Bundles | 2012-03-09 | Paper |
| On the red/blue spanning tree problem | 2011-05-18 | Paper |
| VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE | 2010-09-30 | Paper |
| Guarding a terrain by two watchtowers | 2010-09-16 | Paper |
| MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS | 2010-05-28 | Paper |
| On covering problems of Rado | 2010-05-19 | Paper |
| On characterizations of rigid graphs in the plane using spanning trees | 2009-12-09 | Paper |
| Finding Nearest Larger Neighbors | 2009-11-12 | Paper |
| Compatible geometric matchings | 2009-07-27 | Paper |
| Transforming pseudo-triangulations | 2009-07-21 | Paper |
| On the Red/Blue Spanning Tree Problem | 2009-06-03 | Paper |
| Robust Point-Location in Generalized Voronoi Diagrams | 2009-05-20 | Paper |
| Traversing a set of points with a minimum number of turns | 2009-05-06 | Paper |
| A PTAS for cutting out polygons with lines | 2009-04-29 | Paper |
| Orthogonal equipartitions | 2009-03-09 | Paper |
| SLIDING DISKS IN THE PLANE | 2009-03-02 | Paper |
| Traversing a set of points with a minimum number of turns | 2009-02-12 | Paper |
| Clustered SplitsNetworks | 2009-01-27 | Paper |
| Transforming Graphs with the Same Degree Sequence | 2009-01-13 | Paper |
| Matching points with rectangles and squares | 2008-11-19 | Paper |
| On Covering Problems of Rado | 2008-07-15 | Paper |
| Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance | 2008-07-10 | Paper |
| On Some City Guarding Problems | 2008-07-10 | Paper |
| Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance | 2008-04-15 | Paper |
| Efficient algorithms for the \(d\)-dimensional rigidity matroid of sparse graphs | 2008-03-26 | Paper |
| Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs | 2008-03-18 | Paper |
| Sliding Disks in the Plane | 2008-03-18 | Paper |
| Straightening Drawings of Clustered Hierarchical Graphs | 2008-03-07 | Paper |
| On finding widest empty curved corridors | 2007-10-12 | Paper |
| RNA multiple structural alignment with longest common subsequences | 2007-10-12 | Paper |
| A PTAS for Cutting Out Polygons with Lines | 2007-09-10 | Paper |
| Wiener indices of balanced binary trees | 2007-03-08 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| The lifting model for reconfiguration | 2006-08-11 | Paper |
| Equitable subdivisions within polygonal regions | 2006-04-28 | Paper |
| Moving coins | 2006-04-28 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| AN APPROXIMATE MORPHING BETWEEN POLYLINES | 2005-08-23 | Paper |
| Equipartitions of measures by 2-fans | 2005-08-17 | Paper |
| Enumerating pseudo-triangulations in the plane | 2005-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4664095 | 2005-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4661876 | 2005-03-30 | Paper |
| A conjecture on Wiener indices in combinatorial chemistry | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4820866 | 2004-10-01 | Paper |
| CYLINDRICAL HIERARCHY FOR DEFORMING NECKLACES | 2004-09-29 | Paper |
| Computing random $r$-orthogonal Latin squares | N/A | Paper |
