| Publication | Date of Publication | Type |
|---|
| On the structure of a smallest counterexample and a new class verifying the 2-Decomposition Conjecture | 2023-09-17 | Paper |
| Balanced connected partitions of graphs: approximation, parameterization and lower bounds | 2023-08-02 | Paper |
| Tree 3-spanners on generalized prisms of graphs | 2023-07-26 | Paper |
| Approximation and parameterized algorithms for balanced connected partition problems | 2023-05-08 | Paper |
| Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs | 2023-02-01 | Paper |
| Techniques and results on approximation algorithms for packing circles | 2022-09-30 | Paper |
| Minimum \(t\)-spanners on subcubic graphs | 2022-07-13 | Paper |
| A tight lower bound for the online bounded space hypercube bin packing problem | 2022-01-27 | Paper |
| Partitioning a graph into balanced connected classes: formulations, separation and experiments | 2021-06-07 | Paper |
| Cut and flow formulations for the balanced connected \(k\)-partition problem | 2021-02-04 | Paper |
| Strong intractability results for generalized convex recoloring problems | 2020-05-29 | Paper |
| A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game | 2020-02-12 | Paper |
| Nontrivial path covers of graphs: existence, minimization and maximization | 2020-02-03 | Paper |
| Prices of Anarchy of Selfish 2D Bin Packing Games | 2019-06-21 | Paper |
| On path-cycle decompositions of triangle-free graphs | 2018-12-10 | Paper |
| Covering a graph with nontrivial vertex-disjoint paths: existence and optimization | 2018-11-22 | Paper |
| Decomposing highly connected graphs into paths of length five | 2018-05-24 | Paper |
| Strong intractability of generalized convex recoloring problems | 2018-04-09 | Paper |
| The \(k\)-hop connected dominating set problem: approximation and hardness | 2017-11-09 | Paper |
| Decomposing regular graphs with prescribed girth into paths of given length | 2017-09-11 | Paper |
| Decomposing highly edge-connected graphs into paths of any given length | 2016-11-25 | Paper |
| Polynomial-time approximation schemes for circle and other packing problems | 2016-10-21 | Paper |
| The \(k\)-hop connected dominating set problem: hardness and polyhedra | 2016-10-17 | Paper |
| Decompositions of highly connected graphs into paths of length five | 2016-10-17 | Paper |
| Path decompositions of regular graphs with prescribed girth | 2016-10-14 | Paper |
| Decompositions of highly connected graphs into paths of any given length | 2016-10-14 | Paper |
| The convex recoloring problem: polyhedra, facets and computational experiments | 2016-04-04 | Paper |
| Algorithms for Scheduling Sensors to Maximize Coverage Time | 2015-07-22 | Paper |
| Decompositions of triangle-free 5-regular graphs into paths of length five | 2015-06-29 | Paper |
| On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns | 2015-06-23 | Paper |
| Packing in generalized kernel systems: a framework that generalizes packing of branchings | 2015-02-09 | Paper |
| Polynomial-Time Approximation Schemes for Circle Packing Problems | 2014-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5420032 | 2014-06-11 | Paper |
| Convex recoloring of paths | 2014-05-05 | Paper |
| Hardness and inapproximability of convex recoloring problems | 2014-04-16 | Paper |
| Intersecting longest paths | 2014-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857437 | 2013-11-01 | Paper |
| Convex Recoloring of Paths | 2013-07-23 | Paper |
| Selfish Square Packing | 2013-07-23 | Paper |
| On the Complexity of Solving or Approximating Convex Recoloring Problems | 2013-06-11 | Paper |
| Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing | 2012-11-15 | Paper |
| A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem | 2012-06-29 | Paper |
| Approximating a class of combinatorial problems with rational objective function | 2010-09-16 | Paper |
| Repetition-free longest common subsequence | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576699 | 2010-07-30 | Paper |
| Approximation algorithms and hardness results for the clique packing problem | 2009-06-30 | Paper |
| The maximum agreement forest problem: Approximation algorithms and computational experiments | 2009-06-22 | Paper |
| Three-dimensional packings with rotations | 2009-05-19 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width | 2009-03-04 | Paper |
| Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation | 2008-06-24 | Paper |
| Approximation algorithms and hardness results for the clique packing problem | 2008-06-05 | Paper |
| Repetition-free longest common subsequence | 2008-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387695 | 2008-05-27 | Paper |
| A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant | 2008-04-15 | Paper |
| Packing triangles in low degree graphs and indifference graphs | 2008-03-18 | Paper |
| A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs | 2008-02-20 | Paper |
| Approximating Rational Objectives Is as Easy as Approximating Linear Ones | 2007-09-07 | Paper |
| A note on the approximability of cutting stock problems | 2007-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439698 | 2007-05-29 | Paper |
| Two- and three-dimensional parametric packing | 2007-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708519 | 2005-11-18 | Paper |
| Multidimensional cube packing | 2005-02-11 | Paper |
| Parametric on-line algorithms for packing rectangles and boxes. | 2003-08-25 | Paper |
| Cube packing. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407451 | 2003-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780791 | 2002-11-21 | Paper |
| Note on a min-max conjecture of Woodall | 2002-08-28 | Paper |
| On the Circuit Cover Problem for Mixed Graphs | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766482 | 2002-01-28 | Paper |
| Rearrangement of DNA fragments: a branch-and-cut algorithm. | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741480 | 2001-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508363 | 2000-10-03 | Paper |
| Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839006 | 1998-12-10 | Paper |
| Adjacency of vertices of the complete pre-order polytope | 1998-01-26 | Paper |
| An algorithm for the three-dimensional packing problem with asymptotic performance analysis | 1997-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3991025 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972001 | 1992-06-25 | Paper |
| Facets of the clique partitioning polytope | 1990-01-01 | Paper |
| A cutting plane algorithm for a clustering problem | 1989-01-01 | Paper |
| On k-leaf-connected graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745273 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318807 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3331234 | 1984-01-01 | Paper |
| On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets | 1981-01-01 | Paper |
| On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3875956 | 1980-01-01 | Paper |
| Hypotraceable digraphs | 1980-01-01 | Paper |
