Christos Levcopoulos

According to our database1, Christos Levcopoulos
  • authored at least 112 papers between 1984 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Efficiently Correcting Matrix Products.
Algorithmica, 2017

Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors).
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2016
Minimum Weight Triangulation.
Encyclopedia of Algorithms, 2016

Minimum Geometric Spanning Trees.
Encyclopedia of Algorithms, 2016

Efficiently Correcting Matrix Products.
CoRR, 2016

Shortcuts for the Circle.
CoRR, 2016

2015
A Fire Fighter's Problem.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
A note on a QPTAS for maximum weight triangulation of planar point sets.
Inf. Process. Lett., 2014

A Fire Fighter's Problem.
CoRR, 2014

Quickest path queries on transportation network.
Comput. Geom., 2014

Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Efficiently Correcting Matrix Products.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

3D Rectangulations and Geometric Matrix Multiplication.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Clearing Connections by Few Agents.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2012
Quickest Path Queries on Transportation Network.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2010
Quickest Path Queries on Transportation Network
CoRR, 2010

2009
Restricted Mesh Simplification Using Edge Contractions.
Int. J. Comput. Geometry Appl., 2009

2008
Minimum Weight Triangulation.
Proceedings of the Encyclopedia of Algorithms, 2008

Minimum Geometric Spanning Trees.
Proceedings of the Encyclopedia of Algorithms, 2008

Approximate distance oracles for geometric spanners.
ACM Trans. Algorithms, 2008

Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem.
Int. J. Comput. Geometry Appl., 2008

2007
Minimum weight pseudo-triangulations.
Comput. Geom., 2007

Approximate distance oracles for graphs with dense clusters.
Comput. Geom., 2007

2006
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation.
Comput. Geom., 2006

Restricted Mesh Simplification Using Edge Contractions.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Covering a Set of Points with a Minimum Number of Lines.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005
TSP with neighborhoods of varying size.
J. Algorithms, 2005

Chips on wafers, or packing rectangles into grids.
Comput. Geom., 2005

Minimum Weight Triangulation by Cutting Out Triangles.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Bounds on optimally triangulating connected subsets of the minimum weight convex partition.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004
Tight Time Bounds for the Minimum Local Convex Partition Problem.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Approximate Distance Oracles for Graphs with Dense Clusters.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Minimum Weight Pseudo-Triangulations.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003
Balanced Partition of Minimum Spanning Trees.
Int. J. Comput. Geometry Appl., 2003

Chips on Wafers.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002
Optimal algorithms for complete linkage clustering in d dimensions.
Theor. Comput. Sci., 2002

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners.
SIAM J. Comput., 2002

Lower bounds for approximate polygon decomposition and minimum gap.
Inf. Process. Lett., 2002

Improved Algorithms for Constructing Fault-Tolerant Spanners.
Algorithmica, 2002

Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.
Proceedings of the Algorithm Theory, 2002

Approximate distance oracles for geometric graphs.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Approximate Distance Oracles Revisited.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Balanced Partition of Minimum Spanning Trees.
Proceedings of the Computational Science - ICCS 2002, 2002

TSP with Neighborhoods of Varying Size.
Proceedings of the Algorithms, 2002

2001
Approximating a Minimum Manhattan Network.
Nord. J. Comput., 2001

2000
A Parallel Approximation Algorithm for Minimum Weight Triangulation.
Nord. J. Comput., 2000

Improved Greedy Algorithms for Constructing Sparse Geometric Spanners.
Proceedings of the Algorithm Theory, 2000

1999
Minimum Spanning Trees in d Dimensions.
Nord. J. Comput., 1999

A Fast Approximation Algorithm for TSP with Neighborhoods.
Nord. J. Comput., 1999

Close Approximations of Minimum Rectangular Coverings.
J. Comb. Optim., 1999

The greedy triangulation can be computed from the Delaunay triangulation in linear time.
Comput. Geom., 1999

Approximating Minimum Manhattan Networks.
Proceedings of the Randomization, 1999

A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time.
Nord. J. Comput., 1998

Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.
J. Algorithms, 1998

Fast Algorithms for Complete Linkage Clustering.
Discrete & Computational Geometry, 1998

A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons.
Algorithmica, 1998

Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

A Parallel Approximation Algorithm for Minimum Weight Triangulation.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997
A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Approximation Algorithms for Covering Polygons with Squares and Similar Problems.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Optimal Algorithms for Complete Linkage Clustering in d Dimensions.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Minimum Spanning Trees in d Dimensions.
Proceedings of the Algorithms, 1997

1996
Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms.
Theor. Comput. Sci., 1996

Tight Lower Bounds for Minimum Weight-Triangulation Heuristics.
Inf. Process. Lett., 1996

On 2-QBF Truth Testing in Parallel.
Inf. Process. Lett., 1996

Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract).
Proceedings of the Algorithm Theory, 1996

A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract).
Proceedings of the Algorithm Theory, 1996

Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Close Approximation of Minimum Rectangular Coverings.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995
The First Subquadratic Algorithm for Complete Linkage Clustering.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

On Parallel Complexity of Planar Triangulations.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

1994
Sorting Shuffled Monotone Sequences
Inf. Comput., July, 1994

A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem.
Parallel Processing Letters, 1994

1993
Adaptive Heapsort.
J. Algorithms, 1993

Space-Efficient Parallel Merging.
ITA, 1993

Sublinear Merging and Natural Mergesort.
Algorithmica, 1993

1992
Matching Parentheses in Parallel.
Discrete Applied Mathematics, 1992

Fast Algorithms for Greedy Triangulation.
BIT, 1992

There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees.
Algorithmica, 1992

Space-Efficient Parallel Merging.
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

C-sensitive Triangulations Approximate the MinMax Length Triangulation.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

Improved Parallel Sorting of Presorted Sequences.
Proceedings of the Parallel Processing: CONPAR 92, 1992

1991
Splitsort - An Adaptive Sorting Algorithm.
Inf. Process. Lett., 1991

Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case.
Proceedings of the Advances in Computing and Information, 1991

An Optimal Adaptive In-place Sorting Algorithm.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
A Sublogarithmic Convex Hull Algorithm.
BIT, 1990

Sorting Shuffled Monotone Sequences.
Proceedings of the SWAT 90, 1990

Fast Algorithms for Greedy Triangulation.
Proceedings of the SWAT 90, 1990

Sublinear Merging and Natural Merge Sort.
Proceedings of the Algorithms, 1990

Splitsort - An Adaptive Sorting Algorithm.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1989
Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems.
Theor. Comput. Sci., 1989

A Note on Adaptive Parallel Sorting.
Inf. Process. Lett., 1989

Heapsort - Adapted for Presorted Files.
Proceedings of the Algorithms and Data Structures, 1989

Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Local Insertion Sort Revisited.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

1988
A Balanced Search Tree with O (1) Worst-case Update Time.
Acta Inf., 1988

An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams.
Proceedings of the SWAT 88, 1988

On Optimal Parallel Algorithm for Sorting Presorted Files.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

1987
An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation.
Inf. Process. Lett., 1987

Algorithms for Minimum Length Partitions of Polygons.
BIT, 1987

On Approximation Behavior of the Greedy Triangulation for Convex Polygons.
Algorithmica, 1987

Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Improved Bounds for Covering General Polygons with Rectangles.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986
Fast Heuristics for Minimum Length Rectangular Partitions of Polygons.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
A fast heuristic for covering polygons by rectangles.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Covering Polygons with Minimum Number of Rectangles.
Proceedings of the STACS 84, 1984

Bounds on the Length of Convex Partitions of Polygons.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984


  Loading...