The SCEAS System
| |||||||

## Search the dblp DataBase
Drago Krznaric:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
**Minimum Spanning Trees in**[Citation Graph (0, 0)][DBLP]*d*Dimensions. ESA, 1997, pp:341-349 [Conf] - Drago Krznaric, Christos Levcopoulos
**Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1995, pp:443-455 [Conf] - Drago Krznaric, Christos Levcopoulos
**The First Subquadratic Algorithm for Complete Linkage Clustering.**[Citation Graph (0, 0)][DBLP] ISAAC, 1995, pp:392-401 [Conf] - Drago Krznaric, Christos Levcopoulos
**Optimal Algorithms for Complete Linkage Clustering in d Dimensions.**[Citation Graph (0, 0)][DBLP] MFCS, 1997, pp:368-377 [Conf] - Christos Levcopoulos, Drago Krznaric
**A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract).**[Citation Graph (0, 0)][DBLP] SODA, 1997, pp:518-527 [Conf] - Christos Levcopoulos, Drago Krznaric
**Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.**[Citation Graph (0, 0)][DBLP] SODA, 1996, pp:392-401 [Conf] - Christos Levcopoulos, Drago Krznaric
**A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract).**[Citation Graph (0, 0)][DBLP] SWAT, 1996, pp:296-308 [Conf] - Christos Levcopoulos, Drago Krznaric
**A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1998, v:21, n:3, pp:285-311 [Journal] - Christos Levcopoulos, Drago Krznaric
**The greedy triangulation can be computed from the Delaunay triangulation in linear time.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1999, v:14, n:4, pp:197-220 [Journal] - Drago Krznaric, Christos Levcopoulos
**Fast Algorithms for Complete Linkage Clustering.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1998, v:19, n:1, pp:131-145 [Journal] - Christos Levcopoulos, Drago Krznaric
**Tight Lower Bounds for Minimum Weight-Triangulation Heuristics.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:57, n:3, pp:129-135 [Journal] - Christos Levcopoulos, Drago Krznaric
**Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1998, v:27, n:2, pp:303-338 [Journal] - Drago Krznaric, Christos Levcopoulos
**Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time.**[Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1998, v:5, n:1, pp:- [Journal] - Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
**Minimum Spanning Trees in d Dimensions.**[Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1999, v:6, n:4, pp:446-461 [Journal] - Drago Krznaric, Christos Levcopoulos
**Optimal algorithms for complete linkage clustering in d dimensions.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:286, n:1, pp:139-149 [Journal]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |