Wavelength conversion in optical networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On local search and placement of meters in networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Minimum feedback vertex set and acyclic coloring
Information Processing Letters
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Combinatorial algorithms for feedback problems in directed graphs
Information Processing Letters
On approximability of linear ordering and related NP-optimization problems on graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
A linear time algorithm for the minimum weighted feedback vertex set on diamonds
Information Processing Letters
A constraint programming approach to cutset problems
Computers and Operations Research
Approximating the minimum weight weak vertex cover
Theoretical Computer Science - Computing and combinatorics
Approximation algorithms and hardness results for cycle packing problems
ACM Transactions on Algorithms (TALG)
Randomized algorithms for the loop cutset problem
Journal of Artificial Intelligence Research
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds
Information Processing Letters
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Random algorithms for the loop cutset problem
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Disjoint cycles: integrality gap, hardness, and approximation
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
On the feedback vertex set polytope of a series-parallel graph
Discrete Optimization
Disjoint cycles intersecting a set of vertices
Journal of Combinatorial Theory Series B
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs
Information and Computation
| Hi-index | 0.00 |