| Publication | Date of Publication | Type |
|---|
| Reconfiguration of non-crossing spanning trees | 2024-12-19 | Paper |
| Rolling polyhedra on tessellations | 2024-05-16 | Paper |
| Upper Clique Transversals in Graphs | 2024-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126509 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065436 | 2023-11-14 | Paper |
| Packing cube nets into rectangles with \(O(1)\) holes | 2023-03-31 | Paper |
| Linear-time recognition of double-threshold graphs | 2022-12-21 | Paper |
| Linear-time recognition of double-threshold graphs | 2022-03-22 | Paper |
| Settlement Fund Circulation Problem | 2020-11-25 | Paper |
| Symmetric assembly puzzles are hard, beyond a few pieces | 2020-10-23 | Paper |
| Twenty years of progress of \(\mathrm{JCDCG}^3\) | 2020-04-03 | Paper |
| Reconfiguring undirected paths | 2020-01-16 | Paper |
| Linear-Time Recognition of Double-Threshold Graphs | 2019-09-20 | Paper |
| Settlement fund circulation problem | 2019-07-17 | Paper |
| An integer programming approach to solving Tantrix on fixed boards | 2019-03-26 | Paper |
| Threes!, Fives, 1024!, and 2048 are hard | 2018-11-23 | Paper |
| Parameterized edge Hamiltonicity | 2018-09-17 | Paper |
| Subexponential fixed-parameter algorithms for partial vector domination | 2018-05-24 | Paper |
| Swapping colored tokens on graphs | 2018-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5282800 | 2017-07-17 | Paper |
| Threes!, Fives, 1024!, and 2048 are Hard | 2017-07-17 | Paper |
| Hanabi is NP-hard, even for cheaters who look at their cards | 2017-05-12 | Paper |
| Morpion solitaire 5D: a new upper bound of 121 on the maximum score | 2017-02-21 | Paper |
| Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces | 2017-02-01 | Paper |
| Mining preserving structures in a graph sequence | 2016-11-24 | Paper |
| (Total) vector domination for graphs with bounded branchwidth | 2016-06-01 | Paper |
| Folding a paper strip to minimize thickness | 2016-02-18 | Paper |
| A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares | 2016-01-18 | Paper |
| Swapping Colored Tokens on Graphs | 2015-10-30 | Paper |
| Mining Preserving Structures in a Graph Sequence | 2015-10-29 | Paper |
| Subexponential Fixed-Parameter Algorithms for Partial Vector Domination | 2015-10-16 | Paper |
| Parameterized edge Hamiltonicity | 2015-09-09 | Paper |
| Folding a Paper Strip to Minimize Thickness | 2015-02-27 | Paper |
| A 4.31-approximation for the geometric unique coverage problem on unit disks | 2014-07-07 | Paper |
| Approximating the path-distance-width for AT-free graphs and graphs in related classes | 2014-04-02 | Paper |
| (Total) Vector Domination for Graphs with Bounded Branchwidth | 2014-03-31 | Paper |
| UNO is hard, even for a single player | 2014-01-22 | Paper |
| On Complexity of Flooding Games on Graphs with Interval Representations | 2013-12-06 | Paper |
| A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques | 2013-11-28 | Paper |
| A linear time algorithm for \(L(2,1)\)-labeling of trees | 2013-06-25 | Paper |
| A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks | 2013-03-21 | Paper |
| A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs | 2012-09-13 | Paper |
| A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares | 2012-08-14 | Paper |
| The \((p,q)\)-total labeling problem for trees | 2012-03-29 | Paper |
| Approximability of the Path-Distance-Width for AT-free Graphs | 2011-12-16 | Paper |
| Contracted Webgraphs: Structure Mining and Scale-Freeness | 2011-06-03 | Paper |
| The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 | 2011-05-19 | Paper |
| On the complexity of reconfiguration problems | 2011-03-14 | Paper |
| ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES | 2011-01-06 | Paper |
| The (p,q)-total Labeling Problem for Trees | 2010-12-09 | Paper |
| A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques | 2010-02-09 | Paper |
| A Linear Time Algorithm for L(2,1)-Labeling of Trees | 2009-10-29 | Paper |
| An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees | 2009-09-10 | Paper |
| Laminar structure of ptolemaic graphs with applications | 2009-06-30 | Paper |
| On the Complexity of Reconfiguration Problems | 2009-01-29 | Paper |
| Web Structure Mining by Isolated Stars | 2008-08-19 | Paper |
| An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees | 2008-07-15 | Paper |
| Minimum edge ranking spanning trees of split graphs | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427863 | 2003-09-14 | Paper |
| On Minimum Edge Ranking Spanning Trees | 2001-07-23 | Paper |
| Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem | N/A | Paper |
