| Publication | Date of Publication | Type |
|---|
| The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs | 2023-05-23 | Paper |
| On the complexity of Dominating Set for graphs with fixed diameter | 2023-04-19 | Paper |
| New sufficient conditions on the degree sequences of uniform hypergraphs | 2021-05-10 | Paper |
| The complexity of the Perfect Matching-Cut problem | 2020-11-06 | Paper |
| On the vertices belonging to all, some, none minimum dominating set | 2020-11-02 | Paper |
| Complexity and algorithms for constant diameter augmentation problems | 2020-10-01 | Paper |
| Partition of graphs with maximum degree ratio | 2020-07-24 | Paper |
| Minimal graphs for 2-factor extension | 2020-06-05 | Paper |
| On Minimum Dominating Sets in cubic and (claw,H)-free graphs | 2020-02-27 | Paper |
| The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs | 2020-01-21 | Paper |
| Minimal graphs for hamiltonian extension | 2019-12-10 | Paper |
| On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition | 2019-10-16 | Paper |
| On graceful difference labelings of disjoint unions of circuits | 2019-08-29 | Paper |
| Critical vertices and edges in \(H\)-free graphs | 2019-03-11 | Paper |
| Contraction and deletion blockers for perfect graphs and \(H\)-free graphs | 2018-09-27 | Paper |
| Reducing the chromatic number by vertex or edge deletions | 2018-04-09 | Paper |
| Minimal graphs for matching extensions | 2017-12-20 | Paper |
| Adaptive Network Flow with $k$-Arc Destruction | 2017-11-02 | Paper |
| Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions | 2017-05-19 | Paper |
| Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions | 2016-11-30 | Paper |
| Contraction Blockers for Graphs with Forbidden Induced Paths | 2015-09-21 | Paper |
| Blockers for the stability number and the chromatic number | 2015-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857332 | 2013-11-01 | Paper |
| Characterization of the degree sequences of (quasi) regular uniform hypergraphs | 2013-09-30 | Paper |
| \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs | 2013-06-24 | Paper |
| On the Degree Sequences of Uniform Hypergraphs | 2013-05-31 | Paper |
| How to Decompose a Binary Matrix into Three hv-convex Polyominoes | 2013-05-31 | Paper |
| Minimum decomposition into convex binary matrices | 2012-05-30 | Paper |
| On the NP-completeness of the perfect matching free subgraph problem | 2012-05-14 | Paper |
| Minimum \(d\)-blockers and \(d\)-transversals in graphs | 2012-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109939 | 2012-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059309 | 2010-12-08 | Paper |
| A note on a conjecture on maximum matching in almost regular graphs | 2010-11-19 | Paper |
| Complexity results for the horizontal bar packing problem | 2010-06-09 | Paper |
| On the use of graphs in discrete tomography | 2010-05-10 | Paper |
| Finding induced trees | 2010-04-28 | Paper |
| The four-in-a-tree problem in triangle-free graphs | 2010-01-18 | Paper |
| Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid | 2009-12-15 | Paper |
| Blockers and transversals | 2009-12-10 | Paper |
| Graph coloring with cardinality constraints on the neighborhoods | 2009-11-23 | Paper |
| Degree-constrained edge partitioning in graphs arising from discrete tomography | 2009-05-19 | Paper |
| Locally boundedk-colorings of trees | 2009-04-23 | Paper |
| Reconstruction of binary matrices under fixed size neighborhood constraints | 2008-11-12 | Paper |
| On the use of graphs in discrete tomography | 2008-09-04 | Paper |
| Addendum to ``Bicolored matchings in some classes of graphs | 2008-08-20 | Paper |
| On a graph coloring problem arising from discrete tomography | 2008-07-29 | Paper |
| Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem | 2008-04-24 | Paper |
| Approximating hv-Convex Binary Matrices and Images from Discrete Projections | 2008-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5434302 | 2008-01-04 | Paper |
| Reconstructing a binary matrix under timetabling constraints | 2007-05-29 | Paper |
| Reconstruction of binary matrices under adjacency constraints | 2007-05-29 | Paper |
| Bicolored matchings in some classes of graphs | 2007-05-29 | Paper |
| Bicolored matchings in some classes of graphs | 2007-04-26 | Paper |
| An acyclic days-off scheduling problem | 2007-01-24 | Paper |
| The shortest multipaths problem in a capacitated dense channel | 2007-01-16 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Reconstruction of convex polyominoes from orthogonal projections of their contours | 2006-01-10 | Paper |
| Using graphs for some discrete tomography problems | 2006-01-10 | Paper |
| A solvable case of image reconstruction in discrete tomography | 2005-08-05 | Paper |
| Reconstruction of domino tiling from its two orthogonal projections | 2001-08-20 | Paper |
| Worst-case analysis of fast heuristics for packing squares into a square | 1997-09-10 | Paper |
| New complexity results on scheduling with small communication delays | 1996-04-16 | Paper |
| Complexity of the hamiltonian cycle in regular graph problem | 1995-03-20 | Paper |
