| Publication | Date of Publication | Type |
|---|
| Approximations for the Steiner multicycle problem | 2024-11-07 | Paper |
| Finding large planar subgraphs and large subgraphs of a given genus | 2024-01-29 | Paper |
| Separating path systems in complete graphs | 2023-12-22 | Paper |
| Independent dominating sets in planar triangulations | 2023-08-04 | Paper |
| Approximations for the Steiner multicycle problem | 2023-07-26 | Paper |
| How heavy independent sets help to find arborescences with many leaves in DAGs | 2023-04-21 | Paper |
| Complexity and approximability of minimum path-collection exact covers | 2022-12-21 | Paper |
| Period collapse in Ehrhart quasi-polynomials of \(\{1,3\}\)-graphs | 2022-11-23 | Paper |
| Leafy spanning arborescences in DAGs | 2022-11-02 | Paper |
| Leafy spanning arborescences in DAGs | 2022-10-13 | Paper |
| Leafy spanning \(k\)-forests | 2022-08-19 | Paper |
| On edge-magic labelings of forests | 2022-04-27 | Paper |
| On the period collapse of a family of Ehrhart quasi-polynomials | 2021-04-22 | Paper |
| Cubic graphs, their Ehrhart quasi-polynomials, and a scissors congruence phenomenon | 2021-01-29 | Paper |
| Prices of Anarchy of Selfish 2D Bin Packing Games | 2019-06-21 | Paper |
| Counting Hamiltonian cycles in the matroid basis graph | 2019-05-03 | Paper |
| Approximation algorithms for the max-buying problem with limited supply | 2019-01-11 | Paper |
| On minimum bisection and related cut problems in trees and tree‐like graphs | 2018-10-31 | Paper |
| The online multicommodity connected facility location problem | 2018-06-22 | Paper |
| The envy-free pricing problem, unit-demand markets and connections with the network pricing problem | 2018-05-24 | Paper |
| Improved approximation algorithms for capacitated fault-tolerant \(k\)-center | 2018-04-11 | Paper |
| Edge-magic labelings for constellations and armies of caterpillars | 2017-08-15 | Paper |
| Nonempty intersection of longest paths in series-parallel graphs | 2016-12-22 | Paper |
| Trajectory clustering of points in \(\mathbb{R}\) | 2016-10-17 | Paper |
| Approximating minimum \(k\)-section in trees with linear diameter | 2016-10-17 | Paper |
| On minimum bisection and related partition problems in graphs with bounded tree width | 2016-10-14 | Paper |
| Kinetic clustering of points on the line | 2016-06-30 | Paper |
| Repetition-free longest common subsequence of random sequences | 2016-06-22 | Paper |
| Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center | 2016-05-03 | Paper |
| A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems | 2015-10-19 | Paper |
| Spanning trees with nonseparating paths | 2015-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501842 | 2015-08-14 | Paper |
| Geodesic stability for memoryless binary long-lived consensus | 2015-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419980 | 2014-06-11 | Paper |
| Second-price ad auctions with binary bids and markets with good competition | 2014-06-06 | Paper |
| A MILP model for an extended version of the flexible job shop problem | 2014-04-30 | Paper |
| Approximation Algorithms for the Max-Buying Problem with Limited Supply | 2014-03-31 | Paper |
| Intersecting longest paths | 2014-01-20 | Paper |
| Intersection of longest paths in a graph | 2013-11-01 | Paper |
| Selfish square packing | 2013-07-23 | Paper |
| Stability in geodesics for memoryless binary long-lived consensus | 2013-07-23 | Paper |
| A concurrent implementation of skip graphs | 2013-07-19 | Paper |
| A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems | 2012-11-02 | Paper |
| Second-Price Ad Auctions with Binary Bids and Markets with Good Competition | 2012-11-02 | Paper |
| Maximum series-parallel subgraph | 2012-04-26 | Paper |
| Edge-coloring series-parallel multigraphs | 2011-07-26 | 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/Q3575437 | 2010-07-27 | Paper |
| Primal-dual approximation algorithms for the prize-collecting Steiner tree problem | 2010-03-24 | Paper |
| Maximum Series-Parallel Subgraph | 2010-01-21 | Paper |
| Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width | 2009-03-04 | Paper |
| Repetition-free longest common subsequence | 2008-06-05 | Paper |
| A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant | 2008-04-15 | 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 |
| From monomials to words to graphs. | 2004-08-06 | Paper |
| Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width | 2004-03-14 | Paper |
| A new approximation algorithm for finding heavy planar subgraphs | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762509 | 2002-01-09 | Paper |
| Multicuts in unweighted digraphs with bounded degree and bounded tree-width | 2001-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840353 | 1999-04-08 | Paper |
| A Better Approximation Algorithm for Finding Planar Subgraphs | 1998-01-01 | Paper |
| A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875164 | 1996-06-16 | Paper |
