| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos |
Quickest Path Queries on Transportation Network  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos |
Restricted Mesh Simplification Using Edge Contractions. |
Int. J. Comput. Geometry Appl. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
Approximate distance oracles for geometric spanners. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithm, computational geometry, Shortest paths, spanners, geometric graphs |
| 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 Geometric Spanning Trees. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos |
Minimum Weight Triangulation. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos |
Approximate distance oracles for graphs with dense clusters. |
Comput. Geom. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos |
Minimum weight pseudo-triangulations. |
Comput. Geom. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Klein, Christos Levcopoulos, Andrzej Lingas |
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation. |
Comput. Geom. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos |
Restricted Mesh Simplification Using Edge Contractions. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Magdalene Grantson, Christos Levcopoulos |
Covering a Set of Points with a Minimum Number of Lines. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen |
TSP with neighborhoods of varying size. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos |
Chips on wafers, or packing rectangles into grids. |
Comput. Geom. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Magdalene Grantson, Christos Levcopoulos |
Bounds on optimally triangulating connected subsets of the minimum weight convex partition. |
EuroCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Magdalene Grantson, Christian Borgelt, Christos Levcopoulos |
Minimum Weight Triangulation by Cutting Out Triangles. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos |
Approximate Distance Oracles for Graphs with Dense Clusters. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos |
Minimum Weight Pseudo-Triangulations. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Magdalene Grantson, Christos Levcopoulos |
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem. |
JCDCG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Magdalene Grantson, Christos Levcopoulos |
Tight Time Bounds for the Minimum Local Convex Partition Problem. |
JCDCG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan |
Balanced Partition of Minimum Spanning Trees. |
Int. J. Comput. Geometry Appl. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos |
Chips on Wafers. |
WADS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos |
Lower bounds for approximate polygon decomposition and minimum gap. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Drago Krznaric, Christos Levcopoulos |
Optimal algorithms for complete linkage clustering in d dimensions. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
Improved Algorithms for Constructing Fault-Tolerant Spanners. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Well-separated pairs, Fault-tolerance, Computational geometry, Spanners |
| 1 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan |
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen |
TSP with Neighborhoods of Varying Size. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
Approximate distance oracles for geometric graphs. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan |
Balanced Partition of Minimum Spanning Trees. |
International Conference on Computational Science |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell |
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
Approximate Distance Oracles Revisited. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan |
Approximating a Minimum Manhattan Network. |
Nord. J. Comput. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos |
A Parallel Approximation Algorithm for Minimum Weight Triangulation. |
Nord. J. Comput. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan |
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos |
Close Approximations of Minimum Rectangular Coverings. |
J. Comb. Optim. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Drago Krznaric |
The greedy triangulation can be computed from the Delaunay triangulation in linear time. |
Comput. Geom. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson |
Minimum Spanning Trees in d Dimensions. |
Nord. J. Comput. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos |
A Fast Approximation Algorithm for TSP with Neighborhoods. |
Nord. J. Comput. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos |
A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan |
Approximating Minimum Manhattan Networks. |
RANDOM-APPROX |
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 | Drago Krznaric, Christos Levcopoulos |
Fast Algorithms for Complete Linkage Clustering. |
Discrete & Computational Geometry |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Drago Krznaric, Christos Levcopoulos |
Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time. |
Nord. J. Comput. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Joachim Gudmundsson, Christos Levcopoulos |
A Parallel Approximation Algorithm for Minimum Weight Triangulation. |
FSTTCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson |
Minimum Spanning Trees in d Dimensions. |
ESA |
1997 |
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 | Drago Krznaric, Christos Levcopoulos |
Optimal Algorithms for Complete Linkage Clustering in d Dimensions. |
MFCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Joachim Gudmundsson |
A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). |
FCT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Joachim Gudmundsson |
Approximation Algorithms for Covering Polygons with Squares and Similar Problems. |
RANDOM |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind |
On 2-QBF Truth Testing in Parallel. |
Inf. Process. Lett. |
1996 |
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, Ola Petersson |
Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. |
Theor. Comput. Sci. |
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 | Christos Levcopoulos, Drago Krznaric |
A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract). |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Anna Östlin |
Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Joachim Gudmundsson |
Close Approximation of Minimum Rectangular Coverings. |
FSTTCS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Drago Krznaric, Christos Levcopoulos |
The First Subquadratic Algorithm for Complete Linkage Clustering. |
ISAAC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Drago Krznaric, Christos Levcopoulos |
Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time. |
FSTTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas, Cao Wang |
On Parallel Complexity of Planar Triangulations. |
FSTTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Ola Petersson |
Sorting Shuffled Monotone Sequences |
Inf. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Teresa M. Przytycka |
A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem. |
Parallel Processing Letters |
1994 |
DBLP BibTeX RDF |
|
| 1 | Jyrki Katajainen, Christos Levcopoulos, Ola Petersson |
Space-Efficient Parallel Merging. |
ITA |
1993 |
DBLP BibTeX RDF |
|
| 1 | Svante Carlsson, Christos Levcopoulos, Ola Petersson |
Sublinear Merging and Natural Mergesort. |
Algorithmica |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Ola Petersson |
Adaptive Heapsort. |
J. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas |
There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees. |
Algorithmica |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Ola Petersson |
Matching Parentheses in Parallel. |
Discrete Applied Mathematics |
1992 |
DBLP BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas |
Fast Algorithms for Greedy Triangulation. |
BIT |
1992 |
DBLP BibTeX RDF |
|
| 1 | Jyrki Katajainen, Christos Levcopoulos, Ola Petersson |
Space-Efficient Parallel Merging. |
PARLE |
1992 |
DBLP DOI BibTeX RDF |
Direct Connection Machine, merging, PRAM, space efficiency |
| 1 | Jingsen Chen, Christos Levcopoulos |
Improved Parallel Sorting of Presorted Sequences. |
CONPAR |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas |
C-sensitive Triangulations Approximate the MinMax Length Triangulation. |
FSTTCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Ola Petersson |
Splitsort - An Adaptive Sorting Algorithm. |
Inf. Process. Lett. |
1991 |
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, Ola Petersson |
An Optimal Adaptive In-place Sorting Algorithm. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson |
A Sublogarithmic Convex Hull Algorithm. |
BIT |
1990 |
DBLP BibTeX RDF |
|
| 1 | Christos Levcopoulos, Ola Petersson |
Splitsort - An Adaptive Sorting Algorithm. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Carlsson, Christos Levcopoulos, Ola Petersson |
Sublinear Merging and Natural Merge Sort. |
SIGAL International Symposium on Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Ola Petersson |
Sorting Shuffled Monotone Sequences. |
SWAT |
1990 |
DBLP DOI BibTeX RDF |
presortedness, shuffled sequences, optimality, measures, sorting algorithm |
| 1 | Christos Levcopoulos, Andrzej Lingas |
Fast Algorithms for Greedy Triangulation. |
SWAT |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter |
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. |
FSTTCS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Ola Petersson |
A Note on Adaptive Parallel Sorting. |
Inf. Process. Lett. |
1989 |
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 | Christos Levcopoulos, Andrzej Lingas |
Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees. |
Optimal Algorithms |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jyrki Katajainen, Christos Levcopoulos, Ola Petersson |
Local Insertion Sort Revisited. |
Optimal Algorithms |
1989 |
DBLP DOI BibTeX RDF |
presortedness, local insertion sort, finger search trees, measures, sorting algorithm, geometric interpretation |
| 1 | Christos Levcopoulos, Ola Petersson |
Heapsort - Adapted for Presorted Files. |
WADS |
1989 |
DBLP BibTeX RDF |
|
| 1 | Christos Levcopoulos, Mark H. Overmars |
A Balanced Search Tree with O (1) Worst-case Update Time. |
Acta Inf. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas |
An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. |
SWAT |
1988 |
DBLP DOI BibTeX RDF |
bucket method, cell technique, parallel algorithms, computational geometry, Voronoi diagram |
| 1 | Christos Levcopoulos |
On Optimal Parallel Algorithm for Sorting Presorted Files. |
FSTTCS |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos |
An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation. |
Inf. Process. Lett. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas |
On Approximation Behavior of the Greedy Triangulation for Convex Polygons. |
Algorithmica |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack |
Algorithms for Minimum Length Partitions of Polygons. |
BIT |
1987 |
DBLP BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack |
Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). |
ICALP |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos |
Improved Bounds for Covering General Polygons with Rectangles. |
FSTTCS |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos |
Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. |
Symposium on Computational Geometry |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos |
A fast heuristic for covering polygons by rectangles. |
FCT |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas |
Covering Polygons with Minimum Number of Rectangles. |
STACS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Andrzej Lingas |
Bounds on the Length of Convex Partitions of Polygons. |
FSTTCS |
1984 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")