The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christos Levcopoulos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Magdalene Grantson, Christos Levcopoulos
    Covering a Set of Points with a Minimum Number of Lines. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:6-17 [Conf]
  2. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Restricted Mesh Simplification Using Edge Contractions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:196-204 [Conf]
  3. Joachim Gudmundsson, Christos Levcopoulos
    A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:473-482 [Conf]
  4. Christos Levcopoulos
    Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:100-108 [Conf]
  5. Jingsen Chen, Christos Levcopoulos
    Improved Parallel Sorting of Presorted Sequences. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1992, pp:539-544 [Conf]
  6. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
    TSP with Neighborhoods of Varying Size. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:187-199 [Conf]
  7. Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
    Minimum Spanning Trees in d Dimensions. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:341-349 [Conf]
  8. Christos Levcopoulos, Joachim Gudmundsson
    A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1997, pp:305-316 [Conf]
  9. Christos Levcopoulos
    A fast heuristic for covering polygons by rectangles. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:269-278 [Conf]
  10. Christos Levcopoulos, Ola Petersson
    An Optimal Adaptive In-place Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:329-338 [Conf]
  11. Joachim Gudmundsson, Christos Levcopoulos
    Minimum Weight Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:299-310 [Conf]
  12. Joachim Gudmundsson, Christos Levcopoulos
    A Parallel Approximation Algorithm for Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:233-244 [Conf]
  13. 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]
  14. Christos Levcopoulos
    Improved Bounds for Covering General Polygons with Rectangles. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1987, pp:95-102 [Conf]
  15. Christos Levcopoulos
    On Optimal Parallel Algorithm for Sorting Presorted Files. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:154-160 [Conf]
  16. Christos Levcopoulos, Joachim Gudmundsson
    Close Approximation of Minimum Rectangular Coverings. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:135-146 [Conf]
  17. Christos Levcopoulos, Andrzej Lingas
    Bounds on the Length of Convex Partitions of Polygons. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1984, pp:279-295 [Conf]
  18. Christos Levcopoulos, Andrzej Lingas
    C-sensitive Triangulations Approximate the MinMax Length Triangulation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:104-115 [Conf]
  19. Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter
    Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:204-214 [Conf]
  20. Christos Levcopoulos, Andrzej Lingas, Cao Wang
    On Parallel Complexity of Planar Triangulations. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:413-427 [Conf]
  21. Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack
    Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:376-385 [Conf]
  22. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Balanced Partition of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2002, pp:26-35 [Conf]
  23. Christos Levcopoulos, Andrzej Lingas
    Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:139-148 [Conf]
  24. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Approximate Distance Oracles for Graphs with Dense Clusters. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:53-64 [Conf]
  25. Magdalene Grantson, Christian Borgelt, Christos Levcopoulos
    Minimum Weight Triangulation by Cutting Out Triangles. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:984-994 [Conf]
  26. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Approximate Distance Oracles Revisited. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:357-368 [Conf]
  27. Drago Krznaric, Christos Levcopoulos
    The First Subquadratic Algorithm for Complete Linkage Clustering. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:392-401 [Conf]
  28. Magdalene Grantson, Christos Levcopoulos
    A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:83-94 [Conf]
  29. Magdalene Grantson, Christos Levcopoulos
    Tight Time Bounds for the Minimum Local Convex Partition Problem. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:95-105 [Conf]
  30. Drago Krznaric, Christos Levcopoulos
    Optimal Algorithms for Complete Linkage Clustering in d Dimensions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:368-377 [Conf]
  31. Christos Levcopoulos, Ola Petersson
    Splitsort - An Adaptive Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:416-422 [Conf]
  32. Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
    Local Insertion Sort Revisited. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:239-253 [Conf]
  33. Christos Levcopoulos, Andrzej Lingas
    Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:9-13 [Conf]
  34. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Approximating Minimum Manhattan Networks. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:28-38 [Conf]
  35. Christos Levcopoulos, Joachim Gudmundsson
    Approximation Algorithms for Covering Polygons with Squares and Similar Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:27-41 [Conf]
  36. Svante Carlsson, Christos Levcopoulos, Ola Petersson
    Sublinear Merging and Natural Merge Sort. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:251-260 [Conf]
  37. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Approximate distance oracles for geometric graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:828-837 [Conf]
  38. 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]
  39. Christos Levcopoulos, Drago Krznaric
    Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:392-401 [Conf]
  40. Christos Levcopoulos, Andrzej Lingas
    Covering Polygons with Minimum Number of Rectangles. [Citation Graph (0, 0)][DBLP]
    STACS, 1984, pp:63-72 [Conf]
  41. Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:186-195 [Conf]
  42. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:314-327 [Conf]
  43. 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]
  44. Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas
    An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:190-198 [Conf]
  45. Christos Levcopoulos, Andrzej Lingas
    Fast Algorithms for Greedy Triangulation. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:238-250 [Conf]
  46. Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell
    Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:80-89 [Conf]
  47. Christos Levcopoulos, Anna Östlin
    Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:271-283 [Conf]
  48. Christos Levcopoulos, Ola Petersson
    Sorting Shuffled Monotone Sequences. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:181-191 [Conf]
  49. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Chips on Wafers. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:412-423 [Conf]
  50. Christos Levcopoulos, Ola Petersson
    Heapsort - Adapted for Presorted Files. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:499-509 [Conf]
  51. Christos Levcopoulos, Mark H. Overmars
    A Balanced Search Tree with O (1) Worst-case Update Time. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1988, v:26, n:3, pp:269-277 [Journal]
  52. Svante Carlsson, Christos Levcopoulos, Ola Petersson
    Sublinear Merging and Natural Mergesort. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:629-648 [Journal]
  53. 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]
  54. Christos Levcopoulos, Andrzej Lingas
    On Approximation Behavior of the Greedy Triangulation for Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:15-193 [Journal]
  55. Christos Levcopoulos, Andrzej Lingas
    There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:3, pp:251-256 [Journal]
  56. Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Improved Algorithms for Constructing Fault-Tolerant Spanners. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:1, pp:144-156 [Journal]
  57. Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
    A Sublogarithmic Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    BIT, 1990, v:30, n:3, pp:378-384 [Journal]
  58. Christos Levcopoulos, Andrzej Lingas
    Fast Algorithms for Greedy Triangulation. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:280-296 [Journal]
  59. Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack
    Algorithms for Minimum Length Partitions of Polygons. [Citation Graph (0, 0)][DBLP]
    BIT, 1987, v:27, n:4, pp:474-479 [Journal]
  60. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Chips on wafers, or packing rectangles into grids. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:2, pp:95-111 [Journal]
  61. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:28-34 [Journal]
  62. 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]
  63. Christos Levcopoulos, Ola Petersson
    Matching Parentheses in Parallel. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:4, pp:423-431 [Journal]
  64. 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]
  65. Christos Levcopoulos, Ola Petersson
    Sorting Shuffled Monotone Sequences [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:112, n:1, pp:37-50 [Journal]
  66. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Balanced Partition of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:4, pp:303-316 [Journal]
  67. Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind
    On 2-QBF Truth Testing in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:2, pp:89-93 [Journal]
  68. Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos
    Lower bounds for approximate polygon decomposition and minimum gap. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:3, pp:137-141 [Journal]
  69. Christos Levcopoulos
    An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:4, pp:247-251 [Journal]
  70. 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]
  71. Christos Levcopoulos, Ola Petersson
    A Note on Adaptive Parallel Sorting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:4, pp:187-191 [Journal]
  72. Christos Levcopoulos, Ola Petersson
    Splitsort - An Adaptive Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:4, pp:205-211 [Journal]
  73. Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
    Space-Efficient Parallel Merging. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:4, pp:295-310 [Journal]
  74. Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
    TSP with neighborhoods of varying size. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:57, n:1, pp:22-36 [Journal]
  75. 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]
  76. Christos Levcopoulos, Ola Petersson
    Adaptive Heapsort. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:3, pp:395-413 [Journal]
  77. Joachim Gudmundsson, Christos Levcopoulos
    Close Approximations of Minimum Rectangular Coverings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:4, pp:437-452 [Journal]
  78. Joachim Gudmundsson, Christos Levcopoulos
    A Parallel Approximation Algorithm for Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:1, pp:32-57 [Journal]
  79. Joachim Gudmundsson, Christos Levcopoulos
    A Fast Approximation Algorithm for TSP with Neighborhoods. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1999, v:6, n:4, pp:469-0 [Journal]
  80. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Approximating a Minimum Manhattan Network. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2001, v:8, n:2, pp:219-232 [Journal]
  81. 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]
  82. 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]
  83. Christos Levcopoulos, Teresa M. Przytycka
    A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:37-43 [Journal]
  84. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1479-1500 [Journal]
  85. 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]
  86. Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack
    Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:2, pp:181-203 [Journal]
  87. Christos Levcopoulos, Ola Petersson
    Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:211-238 [Journal]
  88. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Approximate distance oracles for graphs with dense clusters. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:3, pp:142-154 [Journal]
  89. Joachim Gudmundsson, Christos Levcopoulos
    Minimum weight pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:3, pp:139-153 [Journal]

  90. Bounds on optimally triangulating connected subsets of the minimum weight convex partition. [Citation Graph (, )][DBLP]


Search in 0.127secs, Finished in 0.134secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002