| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147300 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147358 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065468 | 2023-11-14 | Paper |
| The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. | 2023-11-13 | Paper |
| Planarizing graphs and their drawings by vertex splitting | 2023-08-16 | Paper |
| Constant Congestion Brambles | 2023-05-30 | Paper |
| The complexity of routing problems in forbidden-transition graphs and edge-colored graphs | 2023-04-28 | Paper |
| Threshold Treewidth and Hypertree Width | 2022-08-30 | Paper |
| Cluster Editing in Multi-Layer and Temporal Graphs. | 2022-07-21 | Paper |
| On (coalitional) exchange-stable matching | 2022-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075765 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075819 | 2022-05-11 | Paper |
| Constant Congestion Brambles in Directed Graphs | 2022-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009615 | 2021-08-04 | Paper |
| How hard is it to satisfy (almost) all roommates | 2021-07-28 | Paper |
| Your rugby mates don't need to know your colleagues: triadic closure with edge colors | 2021-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3386631 | 2021-01-05 | Paper |
| The Parameterized Complexity of Centrality Improvement in Networks | 2020-10-21 | Paper |
| Solving Partition Problems Almost Always Requires Pushing Many Vertices Around | 2020-03-11 | Paper |
| Your rugby mates don't need to know your colleagues: triadic closure with edge colors | 2020-02-06 | Paper |
| Efficient algorithms for measuring the funnel-likeness of DAGs | 2020-02-03 | Paper |
| Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems | 2019-10-24 | Paper |
| The parameterized complexity of the minimum shared edges problem | 2019-08-30 | Paper |
| Packing Directed Cycles Quarter- and Half-Integrally | 2019-07-04 | Paper |
| The complexity of routing with collision avoidance | 2019-05-03 | Paper |
| The minimum feasible tileset problem | 2019-03-11 | Paper |
| Computational complexity aspects of point visibility graphs | 2019-02-08 | Paper |
| The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs | 2019-01-14 | Paper |
| Constant-factor approximations for capacitated arc routing without triangle inequality | 2018-09-28 | Paper |
| Efficient algorithms for measuring the funnel-likeness of DAGs | 2018-08-17 | Paper |
| h-Index Manipulation by Undoing Merges | 2018-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634388 | 2018-04-10 | Paper |
| The complexity of routing with few collisions | 2017-11-22 | Paper |
| Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs | 2017-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369516 | 2017-10-17 | Paper |
| On kernelization and approximation for the vector connectivity problem | 2017-10-10 | Paper |
| On Kernelization and Approximation for the Vector Connectivity Problem | 2017-09-29 | Paper |
| Assessing the Computational Complexity of Multi-layer Subgraph Detection | 2017-07-21 | Paper |
| The Parameterized Complexity of the Minimum Shared Edges Problem | 2017-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5271449 | 2017-07-11 | Paper |
| Twins in Subdivision Drawings of Hypergraphs | 2017-02-21 | Paper |
| \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments | 2016-10-21 | Paper |
| Exploiting hidden structure in selecting dimensions that distinguish vectors | 2015-12-30 | Paper |
| Polynomial-Time Data Reduction for the Subset Interconnection Design Problem | 2015-11-27 | Paper |
| The minimum feasible tileset problem | 2015-11-20 | Paper |
| On the parameterized complexity of computing balanced partitions in graphs | 2015-09-04 | Paper |
| An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems | 2015-07-24 | Paper |
| Well-Formed Separator Sequences, with an Application to Hypergraph Drawing | 2015-07-08 | Paper |
| A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments | 2015-06-18 | Paper |
| Finding Highly Connected Subgraphs | 2015-02-20 | Paper |
| Exploiting a hypergraph model for finding Golomb rulers | 2014-11-14 | Paper |
| Effective and Efficient Data Reduction for the Subset Interconnection Design Problem | 2014-01-14 | Paper |
| On the Parameterized Complexity of Computing Graph Bisections | 2013-12-06 | Paper |
| A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems | 2013-09-20 | Paper |
| A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs | 2013-06-27 | Paper |
| A new view on rural postman based on Eulerian extension and matching | 2013-01-18 | Paper |
| Finding Dense Subgraphs of Sparse Graphs | 2013-01-07 | Paper |
| Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes | 2013-01-03 | Paper |
| Exploiting a Hypergraph Model for Finding Golomb Rulers | 2012-11-02 | Paper |
| A New View on Rural Postman Based on Eulerian Extension and Matching | 2012-01-13 | Paper |
| From Few Components to an Eulerian Graph by Adding Arcs | 2011-12-16 | Paper |
