| Publication | Date of Publication | Type |
|---|
| Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems | 2023-05-19 | Paper |
| How to get a degree-anonymous graph using minimum number of edge rotations | 2023-03-21 | Paper |
| Weighted amplifiers and inapproximability results for travelling salesman problem | 2022-07-18 | Paper |
| Colourful components in \(k\)-caterpillars and planar graphs | 2021-11-18 | Paper |
| Degree-anonymization using edge rotations | 2021-06-22 | Paper |
| Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs | 2020-02-25 | Paper |
| Approximation hardness of Travelling Salesman via weighted amplifiers | 2020-02-24 | Paper |
| Complexity of scheduling for DARP with soft ride times | 2020-02-06 | Paper |
| Graphs without a partition into two proportionally dense subgraphs | 2019-12-19 | Paper |
| Proportionally dense subgraph of maximum size: complexity and approximation | 2019-11-06 | Paper |
| Structural and algorithmic properties of 2-community structures | 2018-06-01 | Paper |
| The firefighter problem: further steps in understanding its complexity | 2017-05-11 | Paper |
| New Insight into 2-Community Structures in Graphs with Applications in Social Networks | 2016-02-05 | Paper |
| The Firefighter Problem: A Structural Analysis | 2015-09-15 | Paper |
| Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes | 2014-10-13 | Paper |
| Connection between conjunctive capacity and structural properties of graphs | 2014-10-06 | Paper |
| On the Conjunctive Capacity of Graphs | 2013-06-11 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Hardness of approximation for orthogonal rectangle packing and covering problems | 2009-06-24 | Paper |
| Approximation hardness of dominating set problems in bounded degree graphs | 2008-12-03 | Paper |
| The Steiner tree problem on graphs: inapproximability results | 2008-11-12 | Paper |
| A characterization of some graph classes using excluded minors | 2008-10-22 | Paper |
| The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes | 2008-03-28 | Paper |
| Crown reductions for the minimum weighted vertex cover problem | 2008-02-26 | Paper |
| The \(d\)-precoloring problem for \(k\)-degenerate graphs | 2007-06-26 | Paper |
| Approximation hardness of edge dominating set problems | 2007-06-21 | Paper |
| Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations | 2007-05-02 | Paper |
| Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover | 2007-02-19 | Paper |
| Hard coloring problems in low degree planar bipartite graphs | 2006-09-28 | Paper |
| Assign ranges in general ad-hoc networks | 2006-08-04 | Paper |
| Complexity of approximating bounded variants of optimization problems | 2006-04-28 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046489 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437505 | 2003-12-02 | Paper |
| Partial \(k\)-trees with maximum chromatic number | 2003-03-16 | Paper |
| The structure of obstructions to treewidth and pathwidth | 2002-08-29 | Paper |
| The structure of obstructions to treewidth and pathwidth | 2001-09-23 | Paper |
| Approximating the Maximally Balanced Connected Partition Problem in graphs | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4838483 | 1995-07-12 | Paper |
