Arboricity and subgraph listing algorithms
SIAM Journal on Computing
Which triangulations approximate the complete graph?
Proceedings of the international symposium on Optimal algorithms
Discrete & Computational Geometry
Computing a subgraph of the minimum weight triangulation
Computational Geometry: Theory and Applications
Triangulations intersect nicely
Proceedings of the eleventh annual symposium on Computational geometry
New algorithms and empirical findings on minimum weight triangulation heuristics (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Fast greedy triangulation algorithms
Computational Geometry: Theory and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Implementations of the LMT heuristic for minimum weight triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
A near-optimal heuristic for minimum weight triangulation of convex polygons
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal point placement for mesh smoothing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The drawability problem for minimum weight triangulations
Theoretical Computer Science
Computing a Minimum Weight Triangulation of a Sparse Point Set
Journal of Global Optimization
The minimum weight triangulation problem with few inner points
Computational Geometry: Theory and Applications
The minimum weight triangulation problem with few inner points
Computational Geometry: Theory and Applications
The minimum stabbing triangulation problem: IP models and computational evaluation
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |