| Publication | Date of Publication | Type |
|---|
Approximating power node-deletion problems
Theoretical Computer Science | 2024-08-27 | Paper |
Approximating power node-deletion problems
Lecture Notes in Computer Science | 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
Lecture Notes in Computer Science | 2022-12-16 | Paper |
A note on approximations of directed edge dominating set
Information Processing Letters | 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
Journal of Graph Algorithms and Applications | 2019-10-25 | Paper |
A primal-dual approach to approximation of node-deletion problems for matroidal properties
Automata, Languages and Programming | 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
Theory of Computing Systems | 2018-06-01 | Paper |
A unified local ratio approximation of node-deletion problems
Algorithms — ESA '96 | 2017-12-05 | Paper |
Approximating bounded degree deletion via matroid matching
Lecture Notes in Computer Science | 2017-07-21 | Paper |
On approximating (connected) 2-edge dominating set by a tree
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Fast and simple local algorithms for 2-edge dominating sets and 3-total vertex covers
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Multi-rooted greedy approximation of directed Steiner trees with applications
Algorithmica | 2016-03-29 | Paper |
On the best possible competitive ratio for the multislope ski-rental problem
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
Online weight balancing on the unit circle
Lecture Notes in Computer Science | 2015-09-14 | Paper |
How to trim a MST, a 2-approximation algorithm for minimum cost-tree cover
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 3-edge dominating set problem
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
How to guard a graph against tree moves
Information Processing Letters | 2014-04-14 | Paper |
Multi-rooted greedy approximation of directed Steiner trees with applications
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
On the Best Possible Competitive Ratio for Multislope Ski Rental
Algorithms and Computation | 2011-12-16 | Paper |
A 2-approximation NC algorithm for connected vertex cover and tree cover
Information Processing Letters | 2009-07-21 | Paper |
How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover
Automata, Languages and Programming | 2009-03-12 | Paper |
A primal-dual method for approximating tree cover with two weights
Discrete Optimization | 2008-01-11 | Paper |
A Primal-Dual Method for Approximating Tree Cover with Two Weights
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics | 2006-06-09 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
On combinatorial approximation of covering 0-1 integer programs and partial set cover
Journal of Combinatorial Optimization | 2005-05-13 | Paper |
| scientific article; zbMATH DE number 2080196 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081030 (Why is no real title available?) | 2004-08-04 | Paper |
On approximability of the independent/connected edge dominating set problems
Information Processing Letters | 2002-07-14 | Paper |
A 2-approximation algorithm for the minimum weight edge dominating set problem
Discrete Applied Mathematics | 2002-06-24 | Paper |
| scientific article; zbMATH DE number 1670653 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1568055 (Why is no real title available?) | 2001-02-21 | Paper |
A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem
Journal of Combinatorial Optimization | 2001-01-01 | Paper |
Approximating minimum feedback vertex sets in hypergraphs
Theoretical Computer Science | 2000-10-31 | Paper |
On approximation of the submodular set cover problem
Operations Research Letters | 2000-06-14 | Paper |
Approximating Node-Deletion Problems for Matroidal Properties
Journal of Algorithms | 2000-01-12 | Paper |
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics | 1999-11-23 | Paper |
| scientific article; zbMATH DE number 1354128 (Why is no real title available?) | 1999-10-31 | Paper |
On approximation properties of the independent set problem for low degree graphs
Theory of Computing Systems | 1999-03-22 | Paper |
A unified approximation algorithm for node-deletion problems
Discrete Applied Mathematics | 1999-01-25 | Paper |
A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach
Information Processing Letters | 1997-02-27 | Paper |
