On local search and placement of meters in networks

Easy problems for tree-decomposable graphs

Journal of Algorithms

Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)

On Local Search for Weighted K-Set Packing

Mathematics of Operations Research

New results on the old k-opt algorithm for the TSP

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Analysis of a local search heuristic for facility location problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Wavelength conversion in optical networks

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

The full degree spanning tree problem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Degree-Preserving Forests

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science

Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation

Divide-and-conquer approximation algorithms via spreading metrics

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

Operations Research Letters