| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 3 | Jan Remy, Angelika Steger |
A quasi-polynomial time approximation scheme for minimum weight triangulation.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, Minimum weight triangulation |
| 3 | Jan Remy, Angelika Steger |
A quasi-polynomial time approximation scheme for minimum weight triangulation.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, minimum weight triangulation |
| 2 | Wolfgang Mulzer, Günter Rote |
Minimum-weight triangulation is NP-hard.  |
J. ACM  |
2008 |
DBLP DOI BibTeX RDF |
Optimal triangulations, PLANAR 1-IN-3-SAT |
| 2 | Christian Knauer, Andreas Spillner |
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators.  |
WG  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Wolfgang Mulzer, Günter Rote |
Minimum weight triangulation is NP-hard.  |
Symposium on Computational Geometry  |
2006 |
DBLP DOI BibTeX RDF |
PLANAR-1-IN-3-SAT, optimal triangulations |
| 2 | Magdalene Grantson, Christian Borgelt, Christos Levcopoulos |
Minimum Weight Triangulation by Cutting Out Triangles.  |
ISAAC  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Michael Hoffmann, Yoshio Okamoto |
The Minimum Weight Triangulation Problem with Few Inner Points.  |
IWPEC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang |
Triangulations without Minimum-Weight Drawing.  |
CIAC  |
2000 |
DBLP DOI BibTeX RDF |
Graph drawing, Minimum-weight triangulation |
| 2 | Kerry Capp, Bryant A. Julstrom |
A weight-coded genetic algorithm for the minimum weight triangulation problem.  |
SAC  |
1998 |
DBLP DOI BibTeX RDF |
the minimum weight triangulation problem, weighted codings, computational geometry, triangulations |
| 2 | Matthew Dickerson, J. Mark Keil, Mark H. Montague |
A Large Subgraph of the Minimum Weight Triangulation.  |
Discrete & Computational Geometry  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Arman Yousefi, Neal E. Young |
On a linear program for minimum-weight triangulation.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Arman Yousefi, Neal E. Young |
On a Linear Program for Minimum-Weight Triangulation  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shiyan Hu |
A new asymmetric inclusion region for minimum weight triangulation.  |
J. Global Optimization  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz Aurenhammer, Yinfeng Xu |
Optimal Triangulations.  |
Encyclopedia of Optimization  |
2009 |
DBLP DOI BibTeX RDF |
Greedy triangulation, ?-skeleton, LMT-skeleton, Computational complexity, Delaunay triangulation, Minimum weight triangulation |
| 1 | Magdalene G. Borgelt, Christian Borgelt, Christos Levcopoulos |
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem.  |
Int. J. Comput. Geometry Appl.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos |
Minimum Weight Triangulation.  |
Encyclopedia of Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Aaron Lee, Michiel H. M. Smid |
On Generalized Diamond Spanners.  |
WADS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Mulzer, Günter Rote |
Minimum-weight triangulation is NP-hard  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Hoffmann, Yoshio Okamoto |
The minimum weight triangulation problem with few inner points.  |
Comput. Geom.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani |
On earthmover distance, metric labeling, and 0-extension.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Spillner |
A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner Points.  |
ACiD  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Siu-Wing Cheng, Yin-Feng Xu |
On beta-skeleton as a subgraph of the minimum weight triangulation.  |
Theor. Comput. Sci.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivana Kolingerová, Andrej Ferko |
Multicriteria-optimized triangulations.  |
The Visual Computer  |
2001 |
DBLP DOI BibTeX RDF |
Computational geometry, Computer graphics, Delaunay triangulation, Genetic optimization, Minimum weight triangulation |
| 1 | Joachim Gudmundsson, Christos Levcopoulos |
A Parallel Approximation Algorithm for Minimum Weight Triangulation.  |
Nord. J. Comput.  |
2000 |
DBLP BibTeX RDF |
|
| 1 | William Lenhart, Giuseppe Liotta |
Minimum Weight Drawings of Maximal Triangulations (Extended Abstract).  |
Graph Drawing  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz |
Online Routing in Convex Subdivisions.  |
ISAAC  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Cao An Wang, Bo-Ting Yang |
A Tight Bound for ß-SKeleton of Minimum Weight Triangulations.  |
WADS  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Drago Krznaric |
A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons.  |
Algorithmica  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Drago Krznaric |
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.  |
J. Algorithms  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald Beirouti, Jack Snoeyink |
Implementations of the LMT Heuristic for Minimum Weight Triangulation.  |
Symposium on Computational Geometry  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos |
A Parallel Approximation Algorithm for Minimum Weight Triangulation.  |
FSTTCS  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Drago Krznaric |
A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract).  |
SODA  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiaki Kyoda, Keiko Imai, Fumihiko Takeuchi, Akira Tajima |
A Branch-and-Cut Approach for Minimum Weight Triangulation.  |
ISAAC  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Drago Krznaric |
Tight Lower Bounds for Minimum Weight-Triangulation Heuristics.  |
Inf. Process. Lett.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Drago Krznaric |
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.  |
SODA  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Siu-Wing Cheng, Yin-Feng Xu |
Approaching the Largest beta-Skeleton within a Minimum Weight Triangulation.  |
Symposium on Computational Geometry  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Dickerson, Mark H. Montague |
A (Usually?) Connected Subgraph of the Minimum Weight Triangulation.  |
Symposium on Computational Geometry  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Drago Krznaric |
A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract).  |
SWAT  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Cao An Wang, Francis Y. L. Chin, Yin-Feng Xu |
A New Subgraph of Minimum Weight Triangulations.  |
ISAAC  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu |
Triangulations Intersect Nicely.  |
Discrete & Computational Geometry  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo-Ting Yang |
A Better Subgraph of the Minimum Weight Triangulation.  |
Inf. Process. Lett.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Dickerson, Scott A. McElfresh, Mark H. Montague |
New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics (Extended Abstract).  |
Symposium on Computational Geometry  |
1995 |
DBLP DOI BibTeX RDF |
Smalltalk |
| 1 | Bo-Ting Yang |
A Better Subgraph of the Minimum Weight Triangulation.  |
COCOON  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Lenwood S. Heath, Sriram V. Pemmaraju |
New Results for the Minimum Weight Triangulation Problem.  |
Algorithmica  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil |
Computing a Subgraph of the Minimum Weight Triangulation.  |
Comput. Geom.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Efthymios Anagnostou, Derek G. Corneil |
Polynomial-time Instances of the Minimum Weight Triangulation Problem.  |
Comput. Geom.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, David Rappaport |
Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points.  |
Inf. Process. Lett.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein |
Approximating the Minimum Weight Triangulation.  |
SODA  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas |
Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case.  |
ICCI  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack |
Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems.  |
Theor. Comput. Sci.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Gautam Das, Deborah Joseph |
Which Triangulations Approximate the Complete Graph?.  |
Optimal Algorithms  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Lingas |
On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets.  |
Symposium on Computational Geometry  |
1986 |
DBLP DOI BibTeX RDF |
|