| Publication | Date of Publication | Type |
|---|
| Approximating power node-deletion problems | 2024-08-27 | Paper |
| Approximating power node-deletion problems | 2023-10-04 | Paper |
| Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs | 2023-03-21 | Paper |
| Eternal connected vertex cover problem | 2022-12-22 | Paper |
| On approximation properties of the Independent set problem for degree 3 graphs | 2022-12-16 | Paper |
| A note on approximations of directed edge dominating set | 2022-10-28 | Paper |
| On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem | 2022-10-19 | Paper |
| The Fewest Clues Problem of Picross 3D | 2020-08-11 | Paper |
| Approximating Partially Bounded Degree Deletion on Directed Graphs | 2019-10-25 | Paper |
| A primal-dual approach to approximation of node-deletion problems for matroidal properties | 2018-07-04 | Paper |
| On approximability of connected path vertex cover | 2018-06-22 | Paper |
| Approximating partially bounded degree deletion on directed graphs | 2018-06-15 | Paper |
| On approximating (connected) 2-edge dominating set by a tree | 2018-06-01 | Paper |
| A unified local ratio approximation of node-deletion problems | 2017-12-05 | Paper |
| Approximating Bounded Degree Deletion via Matroid Matching | 2017-07-21 | Paper |
| On Approximating (Connected) 2-Edge Dominating Set by a Tree | 2016-07-25 | Paper |
| Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers | 2016-05-03 | Paper |
| Multi-rooted greedy approximation of directed Steiner trees with applications | 2016-03-29 | Paper |
| On the best possible competitive ratio for the multislope ski-rental problem | 2016-02-23 | Paper |
| Online Weight Balancing on the Unit Circle | 2015-09-14 | Paper |
| How to trim a MST | 2014-09-09 | Paper |
| On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem | 2014-09-02 | Paper |
| How to guard a graph against tree moves | 2014-04-14 | Paper |
| Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications | 2012-11-06 | Paper |
| On the Best Possible Competitive Ratio for Multislope Ski Rental | 2011-12-16 | Paper |
| A 2-approximation NC algorithm for connected vertex cover and tree cover | 2009-07-21 | Paper |
| How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover | 2009-03-12 | Paper |
| A primal-dual method for approximating tree cover with two weights | 2008-01-11 | Paper |
| A Primal-Dual Method for Approximating Tree Cover with Two Weights | 2007-05-29 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| A modified greedy algorithm for dispersively weighted 3-set cover | 2006-06-09 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| On combinatorial approximation of covering 0-1 integer programs and partial set cover | 2005-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472438 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474132 | 2004-08-04 | Paper |
| On approximability of the independent/connected edge dominating set problems | 2002-07-14 | Paper |
| A 2-approximation algorithm for the minimum weight edge dominating set problem | 2002-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753930 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761859 | 2001-02-21 | Paper |
| A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem | 2001-01-01 | Paper |
| Approximating minimum feedback vertex sets in hypergraphs | 2000-10-31 | Paper |
| On approximation of the submodular set cover problem | 2000-06-14 | Paper |
| Approximating Node-Deletion Problems for Matroidal Properties | 2000-01-12 | Paper |
| A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268441 | 1999-10-31 | Paper |
| On approximation properties of the independent set problem for low degree graphs | 1999-03-22 | Paper |
| A unified approximation algorithm for node-deletion problems | 1999-01-25 | Paper |
| A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach | 1997-02-27 | Paper |
