Christos Levcopoulos

ORCID

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 24

Top Venues

CoRR

ISAAC

J. Comput. Syst. Sci.

Algorithmica

Publications

Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. 139 (2024)
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. CoRR (2024)
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CCCG (2023)
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CoRR (2023)
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
Online and Approximate Network Construction from Bounded Connectivity Constraints. Int. J. Found. Comput. Sci. 34 (5) (2023)
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
Local Routing in Sparse and Lightweight Geometric Graphs. Algorithmica 84 (5) (2022)
Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
Perpetual maintenance of machines with different urgency requirements. CoRR (2022)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
Efficient Assignment of Identities in Anonymous Populations. OPODIS (2021)
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
Online and Approximate Network Construction from Bounded Connectivity Constraints. CIAC (2021)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos
Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019). J. Comput. Syst. Sci. 120 (2021)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
Efficient Assignment of Identities in Anonymous Populations. CoRR (2021)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. J. Comput. Syst. Sci. 118 (2021)
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. FAW (2019)
Rolf Klein, Elmar Langetepe, Barbara Schwarzwald, Christos Levcopoulos, Andrzej Lingas
On a Fire Fighter's Problem. Int. J. Found. Comput. Sci. 30 (2) (2019)
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
Local Routing in Sparse and Lightweight Geometric Graphs. ISAAC (2019)
Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
Shortcuts for the circle. Comput. Geom. 79 (2019)
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
Local Routing in Sparse and Lightweight Geometric Graphs. CoRR (2019)
Rolf Klein, Christos Levcopoulos, Andrzej Lingas
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. Algorithms 11 (4) (2018)
Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
3D Rectangulations and Geometric Matrix Multiplication. Algorithmica 80 (1) (2018)
Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
Shortcuts for the Circle. ISAAC (2017)
Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). SOFSEM (2017)
Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama
Efficiently Correcting Matrix Products. Algorithmica 79 (2) (2017)
Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
Shortcuts for the Circle. CoRR (2016)
Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama
Efficiently Correcting Matrix Products. CoRR (2016)
Rolf Klein, Elmar Langetepe, Christos Levcopoulos
A Fire Fighter's Problem. SoCG (2015)
Rolf Klein, Christos Levcopoulos, Andrzej Lingas
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. LATIN (2014)
Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
3D Rectangulations and Geometric Matrix Multiplication. ISAAC (2014)
Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos
Quickest path queries on transportation network. Comput. Geom. 47 (7) (2014)
Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas
Efficiently Correcting Matrix Products. ISAAC (2014)
Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski
Clearing Connections by Few Agents. FUN (2014)
Christos Levcopoulos, Andrzej Lingas
A note on a QPTAS for maximum weight triangulation of planar point sets. Inf. Process. Lett. 114 (8) (2014)
Rolf Klein, Elmar Langetepe, Christos Levcopoulos
A Fire Fighter's Problem. CoRR (2014)
Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos
Quickest Path Queries on Transportation Network. CATS (2012)
Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos
Quickest Path Queries on Transportation Network CoRR (2010)
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
Restricted Mesh Simplification Using Edge Contractions. Int. J. Comput. Geom. Appl. 19 (3) (2009)
Magdalene G. Borgelt, Christian Borgelt, Christos Levcopoulos
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem. Int. J. Comput. Geom. Appl. 18 (3) (2008)
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
Approximate distance oracles for geometric spanners. ACM Trans. Algorithms 4 (1) (2008)
Joachim Gudmundsson, Christos Levcopoulos
Minimum weight pseudo-triangulations. Comput. Geom. 38 (3) (2007)
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
Approximate distance oracles for graphs with dense clusters. Comput. Geom. 37 (3) (2007)
Magdalene Grantson, Christos Levcopoulos
Covering a Set of Points with a Minimum Number of Lines. CIAC (2006)
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. 34 (1) (2006)
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
Restricted Mesh Simplification Using Edge Contractions. COCOON (2006)
Magdalene Grantson, Christos Levcopoulos
Bounds on optimally triangulating connected subsets of the minimum weight convex partition. EuroCG (2005)
Magdalene Grantson, Christian Borgelt, Christos Levcopoulos
Minimum Weight Triangulation by Cutting Out Triangles. ISAAC (2005)
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 57 (1) (2005)
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
Chips on wafers, or packing rectangles into grids. Comput. Geom. 30 (2) (2005)
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
Approximate Distance Oracles for Graphs with Dense Clusters. ISAAC (2004)
Joachim Gudmundsson, Christos Levcopoulos
Minimum Weight Pseudo-Triangulations. FSTTCS (2004)
Magdalene Grantson, Christos Levcopoulos
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem. JCDCG (2004)
Magdalene Grantson, Christos Levcopoulos
Tight Time Bounds for the Minimum Local Convex Partition Problem. JCDCG (2004)
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
Chips on Wafers. WADS (2003)
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geom. Appl. 13 (4) (2003)
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)
Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. SWAT (2002)
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31 (5) (2002)
Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos
Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81 (3) (2002)
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
Approximate distance oracles for geometric graphs. SODA (2002)
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
Approximate Distance Oracles Revisited. ISAAC (2002)
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) (2002)
Drago Krznaric, Christos Levcopoulos
Optimal algorithms for complete linkage clustering in d dimensions. Theor. Comput. Sci. 286 (1) (2002)
Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica 32 (1) (2002)
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
Approximating a Minimum Manhattan Network. Nord. J. Comput. 8 (2) (2001)
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. SWAT (2000)
Joachim Gudmundsson, Christos Levcopoulos
A Parallel Approximation Algorithm for Minimum Weight Triangulation. Nord. J. Comput. 7 (1) (2000)
Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
Minimum Spanning Trees in d Dimensions. Nord. J. Comput. 6 (4) (1999)
Joachim Gudmundsson, Christos Levcopoulos
A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. COCOON (1999)
Joachim Gudmundsson, Christos Levcopoulos
A Fast Approximation Algorithm for TSP with Neighborhoods. Nord. J. Comput. 6 (4) (1999)
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
Approximating Minimum Manhattan Networks. RANDOM-APPROX (1999)
Joachim Gudmundsson, Christos Levcopoulos
Close Approximations of Minimum Rectangular Coverings. J. Comb. Optim. 3 (4) (1999)
Christos Levcopoulos, Drago Krznaric
The greedy triangulation can be computed from the Delaunay triangulation in linear time. Comput. Geom. 14 (4) (1999)
Joachim Gudmundsson, Christos Levcopoulos
A Parallel Approximation Algorithm for Minimum Weight Triangulation. FSTTCS (1998)
Christos Levcopoulos, Drago Krznaric
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. J. Algorithms 27 (2) (1998)
Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. STOC (1998)
Drago Krznaric, Christos Levcopoulos
Fast Algorithms for Complete Linkage Clustering. Discret. Comput. Geom. 19 (1) (1998)
Drago Krznaric, Christos Levcopoulos
Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time. Nord. J. Comput. 5 (1) (1998)
Christos Levcopoulos, Drago Krznaric
A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons. Algorithmica 21 (3) (1998)
Christos Levcopoulos, Drago Krznaric
A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract). SODA (1997)
Christos Levcopoulos, Joachim Gudmundsson
Approximation Algorithms for Covering Polygons with Squares and Similar Problems. RANDOM (1997)
Christos Levcopoulos, Joachim Gudmundsson
A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). FCT (1997)
Drago Krznaric, Christos Levcopoulos
Optimal Algorithms for Complete Linkage Clustering in d Dimensions. MFCS (1997)
Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
Dimensions. ESA (1997)
Christos Levcopoulos, Drago Krznaric
Tight Lower Bounds for Minimum Weight-Triangulation Heuristics. Inf. Process. Lett. 57 (3) (1996)
Christos Levcopoulos, Drago Krznaric
A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract). SWAT (1996)
Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind
On 2-QBF Truth Testing in Parallel. Inf. Process. Lett. 57 (2) (1996)
Christos Levcopoulos, Ola Petersson
Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. Theor. Comput. Sci. 163 (1&2) (1996)
Christos Levcopoulos, Anna Östlin
Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). SWAT (1996)
Christos Levcopoulos, Drago Krznaric
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. SODA (1996)
Christos Levcopoulos, Joachim Gudmundsson
Close Approximation of Minimum Rectangular Coverings. FSTTCS (1996)
Christos Levcopoulos, Andrzej Lingas, Cao Wang
On Parallel Complexity of Planar Triangulations. FSTTCS (1995)
Drago Krznaric, Christos Levcopoulos
Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time. FSTTCS (1995)
Drago Krznaric, Christos Levcopoulos
The First Subquadratic Algorithm for Complete Linkage Clustering. ISAAC (1995)
Christos Levcopoulos, Ola Petersson
Sorting Shuffled Monotone Sequences Inf. Comput. 112 (1) (1994)
Christos Levcopoulos, Teresa M. Przytycka
A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem. Parallel Process. Lett. 4 (1994)
Christos Levcopoulos, Ola Petersson
Adaptive Heapsort. J. Algorithms 14 (3) (1993)
Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
Space-Efficient Parallel Merging. RAIRO Theor. Informatics Appl. 27 (4) (1993)
Svante Carlsson, Christos Levcopoulos, Ola Petersson
Sublinear Merging and Natural Mergesort. Algorithmica 9 (6) (1993)
Christos Levcopoulos, Andrzej Lingas
C-sensitive Triangulations Approximate the MinMax Length Triangulation. FSTTCS (1992)
Jingsen Chen, Christos Levcopoulos
Improved Parallel Sorting of Presorted Sequences. CONPAR (1992)
Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
Space-Efficient Parallel Merging. PARLE (1992)
Christos Levcopoulos, Andrzej Lingas
There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees. Algorithmica 8 (3) (1992)

Christos Levcopoulos.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christos Levcopoulos