| Publication | Date of Publication | Type |
|---|
| Parameterized algorithms for the Steiner arborescence problem on a hypercube | 2025-01-10 | Paper |
| Exactly hittable interval graphs | 2024-09-06 | Paper |
| Succinct data structure for path graphs | 2024-01-18 | Paper |
| Parameterized complexity of minimum membership dominating set | 2023-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168446 | 2023-08-08 | Paper |
| Trade-offs in dynamic coloring for bipartite and general graphs | 2023-04-11 | Paper |
| Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs | 2023-02-07 | Paper |
| Parameterized complexity of minimum membership dominating set | 2022-07-13 | Paper |
| The connected domination number of grids | 2022-03-24 | Paper |
| The Connected Domination Number of Grids | 2020-11-23 | Paper |
| Lazy or eager dynamic matching may not be fast | 2020-10-07 | Paper |
| Dynamic data structures for interval coloring | 2020-09-01 | Paper |
| Exact algorithms for allocation problems | 2020-07-07 | Paper |
| Data structures for incremental interval coloring | 2020-02-24 | Paper |
| On the complexity landscape of connected \(f\)-factor problems | 2019-05-17 | Paper |
| Facility location on planar graphs with unreliable links | 2018-11-28 | Paper |
| Faster Parameterized Algorithms Using Linear Programming | 2018-10-30 | Paper |
| Minimum membership hitting sets of axis parallel segments | 2018-10-04 | Paper |
| Approximability of clique transversal in perfect graphs | 2018-07-25 | Paper |
| Approximation algorithms for connected graph factors of minimum weight | 2018-04-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608602 | 2018-03-21 | Paper |
| Hitting Set for hypergraphs of low VC-dimension | 2018-03-02 | Paper |
| Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs | 2017-07-17 | Paper |
| A Refined Analysis of Online Path Coloring in Trees | 2017-04-04 | Paper |
| Connected (s,t)-Vertex Separator Parameterized by Chordality | 2015-11-25 | Paper |
| Approximation and Exact Algorithms for Special Cases of Connected f-Factors | 2015-10-20 | Paper |
| Tree \(t\)-spanners in outerplanar graphs via supply demand partition | 2015-09-21 | Paper |
| Block Sorting Is APX-Hard | 2015-09-21 | Paper |
| Characterization of minimum cycle basis in weighted partial 2-trees | 2015-08-18 | Paper |
| Obtaining matrices with the consecutive ones property by row deletions | 2015-05-04 | Paper |
| On minimum average stretch spanning trees in polygonal 2-trees | 2015-04-01 | Paper |
| Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs | 2015-02-27 | Paper |
| Tree Path Labeling of Hypergraphs – A Generalization of the Consecutive Ones Property | 2015-02-19 | Paper |
| LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs | 2014-10-08 | Paper |
| Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments | 2014-09-02 | Paper |
| Approximability of Connected Factors | 2014-09-02 | Paper |
| Another disjoint compression algorithm for odd cycle transversal | 2014-04-14 | Paper |
| On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees | 2014-02-18 | Paper |
| A Dirac-type characterization of \(k\)-chordal graphs | 2014-01-27 | Paper |
| Solving min ones 2-SAT as fast as vertex cover | 2014-01-16 | Paper |
| FPT Algorithms for Consecutive Ones Submatrix Problems | 2013-12-10 | Paper |
| A unified framework for bi(tri)connectivity and chordal augmentation | 2013-07-30 | Paper |
| On the structure of contractible vertex pairs in chordal graphs | 2013-07-04 | Paper |
| Dominating set based exact algorithms for \(3\)-coloring | 2013-04-04 | Paper |
| Parameterized Algorithms for (r,l)-Partization | 2013-03-19 | Paper |
| LP can be a cure for parameterized problems | 2012-08-23 | Paper |
| Generalized Above Guarantee Vertex Cover and r-Partization | 2012-06-08 | Paper |
| Hardness of subgraph and supergraph problems in \(c\)-tournaments | 2011-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3011746 | 2011-06-29 | Paper |
| A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs | 2011-02-20 | Paper |
| Solving minones-2-sat as Fast as vertex cover | 2010-09-03 | Paper |
| A new characterization of matrices with the consecutive ones property | 2010-04-28 | Paper |
| A note on the Hadwiger number of circular arc graphs | 2010-03-24 | Paper |
| On the structure of contractible edges in \(k\)-connected partial \(k\)-trees | 2010-01-18 | Paper |
| A note on first-fit coloring of interval graphs | 2008-06-03 | Paper |
| Sequences Characterizing k-Trees | 2007-09-10 | Paper |
| An improved algorithm for online coloring of intervals with bandwidth | 2007-01-09 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736846 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708587 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551371 | 2002-09-05 | Paper |
| A faster algorithm for Vertex Cover parameterized by solution size | N/A | Paper |
