| Publication | Date of Publication | Type |
|---|
| The rotation distance of brooms | 2024-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187787 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065434 | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059184 | 2023-11-02 | Paper |
| Competitive Online Search Trees on Trees | 2023-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075911 | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075910 | 2023-09-20 | Paper |
| Combinatorial Generation via Permutation Languages. V. Acyclic Orientations | 2023-08-10 | Paper |
| Colouring bottomless rectangles and arborescences | 2023-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6104076 | 2023-06-05 | Paper |
| Drawing graphs as spanners | 2022-12-21 | Paper |
| Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model | 2022-11-16 | Paper |
| Diameter estimates for graph associahedra | 2022-11-07 | Paper |
| Geometric pattern matching reduces to \(k\)-SUM | 2022-09-16 | Paper |
| Drawing graphs as spanners | 2022-09-16 | Paper |
| Combinatorial generation via permutation languages. IV. Elimination trees | 2021-06-30 | Paper |
| Competitive Online Search Trees on Trees | 2021-02-02 | Paper |
| Flip distances between graph orientations | 2021-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115787 | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111870 | 2020-05-27 | Paper |
| Solving and sampling with many solutions | 2020-04-01 | Paper |
| Flip distances between graph orientations | 2020-02-24 | Paper |
| Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect | 2020-01-16 | Paper |
| Subquadratic encodings for point configurations | 2020-01-13 | Paper |
| Making Octants Colorful and Related Covering Decomposition Problems | 2019-06-20 | Paper |
| Subquadratic algorithms for algebraic 3SUM | 2019-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633837 | 2019-05-06 | Paper |
| Dynamic graph coloring | 2019-04-25 | Paper |
| Finding a Maximum-Weight Convex Set in a Chordal Graph | 2019-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4626293 | 2019-02-27 | Paper |
| Information-theoretic lower bounds for quantum sorting | 2019-02-18 | Paper |
| A Note on Flips in Diagonal Rectangulations | 2018-12-10 | Paper |
| On the shelling antimatroids of split graphs | 2018-11-26 | Paper |
| On the diameter of tree associahedra | 2018-10-30 | Paper |
| Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect | 2018-10-04 | Paper |
| Intersection Graphs of Rays and Grounded Segments | 2018-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580085 | 2018-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606294 | 2018-03-02 | Paper |
| Intersection graphs of rays and grounded segments | 2018-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368684 | 2017-10-10 | Paper |
| Dynamic graph coloring | 2017-09-22 | Paper |
| Entropy-Constrained Index Assignments for Multiple Description Quantizers | 2017-09-08 | Paper |
| General position subsets and independent hyperplanes in \(d\)-space | 2017-05-22 | Paper |
| Reconstructing Point Set Order Types from Radial Orderings | 2017-05-19 | Paper |
| Making triangles colorful | 2017-03-09 | Paper |
| Ramsey-type theorems for lines in 3-space | 2017-03-03 | Paper |
| Recognition and complexity of point visibility graphs | 2017-02-24 | Paper |
| Topological Drawings of Complete Bipartite Graphs | 2017-02-21 | Paper |
| On the shelling antimatroids of split graphs | 2017-02-14 | Paper |
| Covering partial cubes with zones | 2015-11-02 | Paper |
| Covering partial cubes with zones | 2015-09-14 | Paper |
| Reconstructing Point Set Order Typesfrom Radial Orderings | 2015-09-11 | Paper |
| Hitting all maximal independent sets of a bipartite graph | 2015-07-10 | Paper |
| The Complexity of Simultaneous Geometric Graph Embedding | 2015-05-18 | Paper |
| Making Octants Colorful and Related Covering Decomposition Problems | 2015-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5173163 | 2015-02-09 | Paper |
| An efficient algorithm for partial order production | 2015-02-04 | Paper |
| Sorting under partial information (without the ellipsoid algorithm). | 2014-08-13 | Paper |
| The Price of Connectivity for Vertex Cover | 2014-05-02 | Paper |
| Sorting under partial information (without the ellipsoid algorithm). | 2014-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747414 | 2014-02-14 | Paper |
| Draining a polygon-or-rolling a ball out of a polygon | 2014-01-22 | Paper |
| The clique problem in ray intersection graphs | 2013-11-06 | Paper |
| Helly numbers of polyominoes | 2013-09-26 | Paper |
| On Generalized Comparison-Based Sorting Problems | 2013-09-13 | Paper |
| Coloring planar homothets and three-dimensional hypergraphs | 2013-09-03 | Paper |
| Approximating Subdense Instances of Covering Problems | 2013-07-23 | Paper |
| The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs | 2013-04-08 | Paper |
| Minimum entropy combinatorial optimization problems | 2012-12-07 | Paper |
| Non-crossing matchings of points with geometric objects | 2012-10-12 | Paper |
| The Clique Problem in Ray Intersection Graphs | 2012-09-25 | Paper |
| Approximating vertex cover in dense hypergraphs | 2012-09-13 | Paper |
| Coloring Planar Homothets and Three-Dimensional Hypergraphs | 2012-06-29 | Paper |
| Colorful strips | 2012-01-24 | Paper |
| Algorithmic folding complexity | 2012-01-24 | Paper |
| An Efficient Algorithm for Partial Order Production | 2011-04-04 | Paper |
| The Stackelberg minimum spanning tree game | 2011-03-02 | Paper |
| Decomposition of multiple coverings into more parts | 2010-11-08 | Paper |
| Minimum sum edge colorings of multicycles | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576754 | 2010-08-02 | Paper |
| Minimum Entropy Combinatorial Optimization Problems | 2010-07-28 | Paper |
| Connected vertex covers in dense graphs | 2010-06-07 | Paper |
| Colorful Strips | 2010-04-27 | Paper |
| Matching Points with Things | 2010-04-27 | Paper |
| Non-cooperative facility location and covering games | 2010-04-15 | Paper |
| PRICING GEOMETRIC TRANSPORTATION NETWORKS | 2010-02-12 | Paper |
| Algorithmic Folding Complexity | 2009-12-17 | Paper |
| Highway hull revisited | 2009-11-16 | Paper |
| Coloring geometric range spaces | 2009-05-13 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Minimum entropy coloring | 2009-05-04 | Paper |
| Improved approximation bounds for edge dominating set in dense graphs | 2009-03-17 | Paper |
| The Stackelberg Minimum Spanning Tree Game | 2009-02-17 | Paper |
| Empty region graphs | 2009-02-12 | Paper |
| Minimum entropy orientations | 2009-01-09 | Paper |
| Reconciliation of a Quantum-Distributed Gaussian Key | 2008-12-21 | Paper |
| Connected Vertex Covers in Dense Graphs | 2008-11-27 | Paper |
| Optimal location of transportation devices | 2008-09-19 | Paper |
| Chromatic Edge Strength of Some Multigraphs | 2008-06-05 | Paper |
| Tight results on minimum entropy set cover | 2008-05-27 | Paper |
| Coloring Geometric Range Spaces | 2008-04-15 | Paper |
| Improved Approximation Bounds for Edge Dominating Set in Dense Graphs | 2008-02-21 | Paper |
| Local properties of geometric graphs | 2007-10-19 | Paper |
| Tight Results on Minimum Entropy Set Cover | 2007-08-28 | Paper |
| Juggling with pattern matching | 2007-02-13 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Designing small keyboards is hard | 2005-04-06 | Paper |
| Fast fractal compression of greyscale images | 2003-10-15 | Paper |
| Tree-structured multiple description coding | 2003-08-25 | Paper |
| Complexity-constrained tree-structured vector quantizers | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495265 | 2001-04-26 | Paper |
