Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
The traveling salesman problem with distances one and two
Mathematics of Operations Research
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
An approximation scheme for planar graph TSP
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Information and Computation
Preprocessing an undirected planar network to enable fast approximate distance queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Light spanners and approximate TSP in weighted graphs with forbidden minors
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate TSP in Graphs with Forbidden Minors
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A linear-time approximation scheme for planar weighted TSP
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A subset spanner for Planar graphs,: with application to subset TSP
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Geometric spanners with applications in wireless networks
Computational Geometry: Theory and Applications
Good triangulations yield good tours
Computers and Operations Research
Approximation algorithms via contraction decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for Steiner tree in planar graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Discrete Applied Mathematics
Traveling salesman problem of segments
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
How to use planarity efficiently: new tree-decomposition based algorithms
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Contraction decomposition in h-minor-free graphs and algorithmic applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
TSP on cubic and subcubic graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The asymmetric traveling salesman problem on graphs with bounded genus
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
GD'04 Proceedings of the 12th international conference on Graph Drawing
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Operations Research Letters
Exploiting planarity in separation routines for the symmetric traveling salesman problem
Discrete Optimization
An improved upper bound for the TSP in cubic 3-edge-connected graphs
Operations Research Letters
Light spanners in bounded pathwidth graphs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Minimum weight 2-edge-connected spanning subgraphs in planar graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |