| Publication | Date of Publication | Type |
|---|
| Connectivity in the presence of an opponent | 2025-01-06 | Paper |
| An improved approximation algorithm for metric triangle packing | 2024-11-12 | Paper |
| An improved kernel and parameterized algorithm for almost induced matching | 2024-11-12 | Paper |
| Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs | 2024-08-22 | Paper |
| A discharging method: improved kernels for edge triangle packing and covering | 2024-08-22 | Paper |
| Improved approximation algorithms for multidepot capacitated vehicle routing | 2024-08-22 | Paper |
| A deterministic approximation algorithm for metric triangle packing | 2024-08-20 | Paper |
| Improved approximation algorithms for the traveling tournament problem | 2024-08-06 | Paper |
| Improved approximation algorithms for cycle and path packings | 2024-07-19 | Paper |
| Kernelization for edge triangle packing and covering via a discharging method | 2024-06-19 | Paper |
| Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs | 2024-04-24 | Paper |
| Improved parameterized algorithms for mixed domination | 2024-02-23 | Paper |
| Exact algorithms for restricted subset feedback vertex set in chordal and split graphs | 2024-01-02 | Paper |
| Further improvements for SAT in terms of formula length | 2023-09-27 | Paper |
| A parameterized algorithm for subset feedback vertex set in tournaments | 2023-09-21 | Paper |
| Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs | 2023-08-04 | Paper |
| A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem | 2023-07-04 | Paper |
| A \(5k\)-vertex kernel for 3-path vertex cover | 2023-05-12 | Paper |
| Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) | 2023-03-30 | Paper |
| A further improvement on approximating TTP-2 | 2023-03-30 | Paper |
| The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles | 2023-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5873261 | 2023-02-09 | Paper |
| Upper and lower bounds on approximating weighted mixed domination | 2022-11-17 | Paper |
| Parameterized algorithms and complexity for the traveling purchaser problem and its variants | 2022-10-18 | Paper |
| An improved kernel for planar vertex-disjoint triangle packing | 2022-06-13 | Paper |
| A fast algorithm for SAT in terms of formula length | 2022-03-22 | Paper |
| A simple and improved parameterized algorithm for bicluster editing | 2021-12-14 | Paper |
| A Guide to Graph Algorithms | 2021-12-06 | Paper |
| An improved upper bound for SAT | 2021-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002797 | 2021-07-28 | Paper |
| Parameterized algorithms and kernels for almost induced matching | 2020-11-06 | Paper |
| Characterizing star-PCGs | 2020-10-12 | Paper |
| Improved parameterized algorithms and kernels for mixed domination | 2020-04-06 | Paper |
| Upper and lower bounds on approximating weighted mixed domination | 2020-02-24 | Paper |
| Parameterized algorithms for the Traveling Purchaser problem with additional constraints | 2020-02-24 | Paper |
| Some reduction operations to pairwise compatibility graphs | 2019-11-21 | Paper |
| A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing | 2018-12-05 | Paper |
| Characterizing star-PCGs | 2018-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636548 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608653 | 2018-03-21 | Paper |
| A refined algorithm for maximum independent set in degree-4 graphs | 2017-11-16 | Paper |
| Exact algorithms for maximum induced matching | 2017-09-28 | Paper |
| Exact algorithms for maximum independent set | 2017-08-08 | Paper |
| Linear kernels for separating a graph into components of bounded size | 2017-06-30 | Paper |
| Kernelization and Parameterized Algorithms for 3-Path Vertex Cover | 2017-05-19 | Paper |
| Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems | 2017-02-06 | Paper |
| Complexity and kernels for bipartition into degree-bounded induced graphs | 2016-12-23 | Paper |
| Almost Induced Matching: Linear Kernels and Parameterized Algorithms | 2016-12-22 | Paper |
| On a generalization of Nemhauser and Trotter's local optimization theorem | 2016-11-14 | Paper |
| A Parameterized Algorithm for Bounded-Degree Vertex Deletion | 2016-09-02 | Paper |
| An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure | 2016-03-29 | Paper |
| An improved exact algorithm for TSP in graphs of maximum degree 4 | 2016-03-09 | Paper |
| On a generalization of Nemhauser and Trotter's local optimization theorem | 2016-01-11 | Paper |
| An exact algorithm for maximum independent set in degree-5 graphs | 2015-12-10 | Paper |
| Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs | 2015-11-12 | Paper |
| An Improved Exact Algorithm for Maximum Induced Matching | 2015-09-30 | Paper |
| Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs | 2015-09-11 | Paper |
| An improved exact algorithm for undirected feedback vertex set | 2015-07-28 | Paper |
| Exact algorithms for dominating induced matching based on graph partition | 2015-07-06 | Paper |
| New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set | 2015-05-29 | Paper |
| A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler | 2015-05-20 | Paper |
| On the Exact Block Cover Problem | 2015-05-20 | Paper |
| A quadratic vertex kernel for feedback arc set in bipartite tournaments | 2015-03-02 | Paper |
| A refined exact algorithm for edge dominating set | 2014-12-02 | Paper |
| An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs | 2014-04-03 | Paper |
| Exact Algorithms for Maximum Independent Set | 2014-01-14 | Paper |
| New parameterized algorithms for the edge dominating set problem | 2014-01-13 | Paper |
| Parameterized edge dominating set in graphs with degree bounded by 3 | 2013-12-19 | Paper |
| An Improved Exact Algorithm for Undirected Feedback Vertex Set | 2013-12-10 | Paper |
| An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure | 2013-05-28 | Paper |
| Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs | 2013-02-19 | Paper |
| FPTASs for trimming weighted trees | 2013-02-19 | Paper |
| New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set | 2013-01-07 | Paper |
| An Improved Exact Algorithm for TSP in Degree-4 Graphs | 2012-09-25 | Paper |
| A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments | 2012-09-25 | Paper |
| A Refined Exact Algorithm for Edge Dominating Set | 2012-07-16 | Paper |
| Finding minimum 3-way cuts in hypergraphs | 2012-03-19 | Paper |
| An FPT algorithm for edge subset feedback edge set | 2012-03-09 | Paper |
| New Parameterized Algorithms for the Edge Dominating Set Problem | 2011-08-17 | Paper |
| Further Improvement on Maximum Independent Set in Degree-4 Graphs | 2011-08-12 | Paper |
| Parameterized Edge Dominating Set in Cubic Graphs | 2011-06-03 | Paper |
| Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem | 2011-03-30 | Paper |
| Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs | 2011-01-10 | Paper |
| FPTAS’s for Some Cut Problems in Weighted Trees | 2010-09-07 | Paper |
| Simple and improved parameterized algorithms for multiterminal cuts | 2010-08-13 | Paper |
| A Note on Vertex Cover in Graphs with Maximum Degree 3 | 2010-07-20 | Paper |
| A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs | 2010-02-09 | Paper |
| An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts | 2009-01-29 | Paper |
| Algorithms for Multiterminal Cuts | 2008-06-05 | Paper |
| Finding Minimum 3-Way Cuts in Hypergraphs | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5484311 | 2006-08-17 | Paper |
