Fast heuristics for minimum length rectangular partitions of polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
Heuristics for minimum decompositions of polygons
Heuristics for minimum decompositions of polygons
Information Processing Letters
Beyond Steiner's problem: a VLSI oriented generalization
WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Approximation algorithms for planar traveling salesman tours and minimum-length triangulations
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Approximating the minimum weight triangulation
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Optimal binary space partitions for orthogonal objects
Journal of Algorithms
The complexity of computing minimum separating polygons
Pattern Recognition Letters - Special issue on computational geometry
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A constant-factor approximation for the k-MST problem in the plane
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Surface approximation and geometric partitions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Finding the Shortest Watchman Route in a Simple Polygon
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Bounds on the Length of Convex Partitions of Polygons
Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science
On Shortest Networks for Classes of Points in the Plane
CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
Cylindrical static and kinetic binary space partitions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Resource-constrained geometric network optimization
Proceedings of the fourteenth annual symposium on Computational geometry
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for TSP with neighborhoods in the plane
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A fast approximation algorithm for TSP with neighborhoods
Nordic Journal of Computing
Balanced Partition of Minimum Spanning Trees
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Budget Constrained Minimum Cost Connected Medians
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
TSP with Neighborhoods of Varying Size
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Service-constrained network design problems
Nordic Journal of Computing
Building bridges between convex regions
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Information Processing Letters
On a Minimum Linear Classification Problem
Journal of Global Optimization
Approximation algorithms for the watchman route and zookeeper's problems
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Approximation algorithms for TSP with neighborhoods in the plane
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
TSP with neighborhoods of varying size
Journal of Algorithms
On the complexity of approximating tsp with neighborhoods and related problems
Computational Complexity
On a Minimum Linear Classification Problem
Journal of Global Optimization
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Approximating a Shortest Watchman Route
Fundamenta Informaticae
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A PTAS for TSP with neighborhoods among fat regions in the plane
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding the Optimal Path in 3D Spaces Using EDAs --- The Wireless Sensor Networks Scenario
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Minimum Spanning Tree with Neighborhoods
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Binary plane partitions for disjoint line segments
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry: Theory and Applications
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
TSP with neighborhoods of varying size
Journal of Algorithms
Traveling salesman problem of segments
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Approximation schemes for degree-restricted MST and red-blue separation problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A fast approximation algorithm for TSP with neighborhoods and red-blue separation
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
An approximate algorithm for solving the watchman route problem
RobVis'08 Proceedings of the 2nd international conference on Robot vision
Theoretical Computer Science
Proceedings of the twenty-sixth annual symposium on Computational geometry
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Fast track article: Designing hierarchical sensor networks with mobile data collectors
Pervasive and Mobile Computing
Approximation algorithms for euclidean group TSP
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On approximating the TSP with intersecting neighborhoods
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the minimum corridor connection problem and other generalized geometric problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Complexity of minimum corridor guarding problems
Information Processing Letters
Watchman routes for lines and segments
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Approximating a Shortest Watchman Route
Fundamenta Informaticae
How Ants Can Efficiently Solve Generalized Watchman Route Problem
International Journal of Swarm Intelligence Research
Parameterized algorithms for generalized traveling salesman problems in road networks
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Watchman routes for lines and line segments
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |