Christos Levcopoulos

136 papers A* 6A 3B 19C 4Misc 5Journal 65Unranked 30
YearRankTypeTitle / Venue / Authors
2025 J jnl
Deterministic protocols for Voronoi diagrams and triangulations of planar point sets on the congested clique.
Theor. Comput. Sci.
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Valentin Polishchuk, Quan Xue
2025 J jnl
Efficient assignment of identities in anonymous populations.
Inf. Comput.
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2024 J jnl
Perpetual maintenance of machines with different urgency requirements.
J. Comput. Syst. Sci.
Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2024 — conf
The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique.
COCOON (2)
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Quan Xue
2024 J jnl
The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique.
CoRR
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2023 — conf
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique.
CCCG
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2023 J jnl
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique.
CoRR
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2023 J jnl
Online and Approximate Network Construction from Bounded Connectivity Constraints.
Int. J. Found. Comput. Sci.
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2022 J jnl
Local Routing in Sparse and Lightweight Geometric Graphs.
Algorithmica
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
2022 J jnl
Perpetual maintenance of machines with different urgency requirements.
CoRR
Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2021 B conf
Efficient Assignment of Identities in Anonymous Populations.
OPODIS
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2021 J jnl
Efficient Assignment of Identities in Anonymous Populations.
CoRR
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2021 J jnl
Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019).
J. Comput. Syst. Sci.
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos
2021 C conf
Online and Approximate Network Construction from Bounded Connectivity Constraints.
CIAC
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas
2021 J jnl
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases.
J. Comput. Syst. Sci.
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
2019 B ed.
Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings
FCT
Leszek Antoni Gasieniec, Jesper Jansson, Christos Levcopoulos
2019 B conf
Local Routing in Sparse and Lightweight Geometric Graphs.
ISAAC
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
2019 J jnl
Local Routing in Sparse and Lightweight Geometric Graphs.
CoRR
Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
2019 J jnl
On a Fire Fighter's Problem.
Int. J. Found. Comput. Sci.
Rolf Klein, Elmar Langetepe, Barbara Schwarzwald, Christos Levcopoulos, Andrzej Lingas
2019 Misc conf
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases.
FAW
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson
2019 J jnl
Shortcuts for the circle.
Comput. Geom.
Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
2018 J jnl
3D Rectangulations and Geometric Matrix Multiplication.
Algorithmica
Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
2018 J jnl
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems.
Algorithms
Rolf Klein, Christos Levcopoulos, Andrzej Lingas
2017 B conf
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors).
SOFSEM
Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik
2017 J jnl
Efficiently Correcting Matrix Products.
Algorithmica
Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama
2017 B conf
Shortcuts for the Circle.
ISAAC
Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
2016 J jnl
Efficiently Correcting Matrix Products.
CoRR
Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama
2016 — ch.
Minimum Geometric Spanning Trees.
Encyclopedia of Algorithms
Christos Levcopoulos
2016 — ch.
Minimum Weight Triangulation.
Encyclopedia of Algorithms
Christos Levcopoulos
2016 J jnl
Shortcuts for the Circle.
CoRR
Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos
2015 A* conf
A Fire Fighter's Problem.
SoCG
Rolf Klein, Elmar Langetepe, Christos Levcopoulos
2014 B conf
3D Rectangulations and Geometric Matrix Multiplication.
ISAAC
Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
2014 J jnl
A Fire Fighter's Problem.
CoRR
Rolf Klein, Elmar Langetepe, Christos Levcopoulos
2014 J jnl
A note on a QPTAS for maximum weight triangulation of planar point sets.
Inf. Process. Lett.
Christos Levcopoulos, Andrzej Lingas
2014 B conf
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems.
LATIN
Rolf Klein, Christos Levcopoulos, Andrzej Lingas
2014 Misc conf
Clearing Connections by Few Agents.
FUN
Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski
2014 B conf
Efficiently Correcting Matrix Products.
ISAAC
Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas
2014 J jnl
Quickest path queries on transportation network.
Comput. Geom.
Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos
2012 — conf
Quickest Path Queries on Transportation Network.
CATS
Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos
2010 J jnl
Quickest Path Queries on Transportation Network
CoRR
Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos
2009 J jnl
Restricted Mesh Simplification Using Edge Contractions.
Int. J. Comput. Geom. Appl.
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2008 J jnl
Approximate distance oracles for geometric spanners.
ACM Trans. Algorithms
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
2008 J jnl
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem.
Int. J. Comput. Geom. Appl.
Magdalene G. Borgelt, Christian Borgelt, Christos Levcopoulos
2008 — ch.
Minimum Geometric Spanning Trees.
Encyclopedia of Algorithms
Christos Levcopoulos
2008 — ch.
Minimum Weight Triangulation.
Encyclopedia of Algorithms
Christos Levcopoulos
2007 J jnl
Approximate distance oracles for graphs with dense clusters.
Comput. Geom.
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2007 J jnl
Minimum weight pseudo-triangulations.
Comput. Geom.
Joachim Gudmundsson, Christos Levcopoulos
2006 J jnl
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation.
Comput. Geom.
Rolf Klein, Christos Levcopoulos, Andrzej Lingas
2006 C conf
Covering a Set of Points with a Minimum Number of Lines.
CIAC
Magdalene Grantson, Christos Levcopoulos
2006 Misc conf
Restricted Mesh Simplification Using Edge Contractions.
COCOON
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2005 C conf
Bounds on optimally triangulating connected subsets of the minimum weight convex partition.
EuroCG
Magdalene Grantson, Christos Levcopoulos
2005 J jnl
Chips on wafers, or packing rectangles into grids.
Comput. Geom.
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2005 B conf
Minimum Weight Triangulation by Cutting Out Triangles.
ISAAC
Magdalene Grantson, Christian Borgelt, Christos Levcopoulos
2005 J jnl
TSP with neighborhoods of varying size.
J. Algorithms
Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
2004 — conf
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem.
JCDCG
Magdalene Grantson, Christos Levcopoulos
2004 B conf
Approximate Distance Oracles for Graphs with Dense Clusters.
ISAAC
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2004 — conf
Minimum Weight Pseudo-Triangulations.
FSTTCS
Joachim Gudmundsson, Christos Levcopoulos
2004 — conf
Tight Time Bounds for the Minimum Local Convex Partition Problem.
JCDCG
Magdalene Grantson, Christos Levcopoulos
2003 J jnl
Balanced Partition of Minimum Spanning Trees.
Int. J. Comput. Geom. Appl.
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
2003 B conf
Chips on Wafers.
WADS
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
2002 — conf
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.
SWAT
Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell
2002 B conf
Approximate Distance Oracles Revisited.
ISAAC
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
2002 A* conf
Approximate distance oracles for geometric graphs.
SODA
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
2002 Misc conf
Balanced Partition of Minimum Spanning Trees.
International Conference on Computational Science (3)
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
2002 J jnl
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners.
SIAM J. Comput.
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
2002 J jnl
Improved Algorithms for Constructing Fault-Tolerant Spanners.
Algorithmica
Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
2002 J jnl
Lower bounds for approximate polygon decomposition and minimum gap.
Inf. Process. Lett.
Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos
2002 J jnl
Optimal algorithms for complete linkage clustering in d dimensions.
Theor. Comput. Sci.
Drago Krznaric, Christos Levcopoulos
2002 A conf
TSP with Neighborhoods of Varying Size.
ESA
Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen
2001 J jnl
Approximating a Minimum Manhattan Network.
Nord. J. Comput.
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
2000 J jnl
A Parallel Approximation Algorithm for Minimum Weight Triangulation.
Nord. J. Comput.
Joachim Gudmundsson, Christos Levcopoulos
2000 — conf
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners.
SWAT
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
1999 Misc conf
A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation.
COCOON
Joachim Gudmundsson, Christos Levcopoulos
1999 J jnl
A Fast Approximation Algorithm for TSP with Neighborhoods.
Nord. J. Comput.
Joachim Gudmundsson, Christos Levcopoulos
1999 — conf
Approximating Minimum Manhattan Networks.
RANDOM-APPROX
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
1999 J jnl
Close Approximations of Minimum Rectangular Coverings.
J. Comb. Optim.
Joachim Gudmundsson, Christos Levcopoulos
1999 J jnl
Minimum Spanning Trees in d Dimensions.
Nord. J. Comput.
Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
1999 J jnl
The greedy triangulation can be computed from the Delaunay triangulation in linear time.
Comput. Geom.
Christos Levcopoulos, Drago Krznaric
1998 J jnl
A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons.
Algorithmica
Christos Levcopoulos, Drago Krznaric
1998 — conf
A Parallel Approximation Algorithm for Minimum Weight Triangulation.
FSTTCS
Joachim Gudmundsson, Christos Levcopoulos
1998 J jnl
Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time.
Nord. J. Comput.
Drago Krznaric, Christos Levcopoulos
1998 A* conf
Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners.
STOC
Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
1998 J jnl
Fast Algorithms for Complete Linkage Clustering.
Discret. Comput. Geom.
Drago Krznaric, Christos Levcopoulos
1998 J jnl
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.
J. Algorithms
Christos Levcopoulos, Drago Krznaric
1997 B conf
A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract).
FCT
Christos Levcopoulos, Joachim Gudmundsson
1997 A* conf
A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract).
SODA
Christos Levcopoulos, Drago Krznaric
1997 — conf
Approximation Algorithms for Covering Polygons with Squares and Similar Problems.
RANDOM
Christos Levcopoulos, Joachim Gudmundsson
1997 A conf
Minimum Spanning Trees in
ESA
Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
1997 B conf
Optimal Algorithms for Complete Linkage Clustering in d Dimensions.
MFCS
Drago Krznaric, Christos Levcopoulos
1996 — conf
A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract).
SWAT
Christos Levcopoulos, Drago Krznaric
1996 — conf
Close Approximation of Minimum Rectangular Coverings.
FSTTCS
Christos Levcopoulos, Joachim Gudmundsson
1996 J jnl
Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms.
Theor. Comput. Sci.
Christos Levcopoulos, Ola Petersson
1996 — conf
Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract).
SWAT
Christos Levcopoulos, Anna Östlin
1996 J jnl
On 2-QBF Truth Testing in Parallel.
Inf. Process. Lett.
Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind
1996 A* conf
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.
SODA
Christos Levcopoulos, Drago Krznaric
1996 J jnl
Tight Lower Bounds for Minimum Weight-Triangulation Heuristics.
Inf. Process. Lett.
Christos Levcopoulos, Drago Krznaric
1995 — conf
Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time.
FSTTCS
Drago Krznaric, Christos Levcopoulos
1995 — conf
On Parallel Complexity of Planar Triangulations.
FSTTCS
Christos Levcopoulos, Andrzej Lingas, Cao Wang
1995 B conf
The First Subquadratic Algorithm for Complete Linkage Clustering.
ISAAC
Drago Krznaric, Christos Levcopoulos
1994 J jnl
A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem.
Parallel Process. Lett.
Christos Levcopoulos, Teresa M. Przytycka
1994 J jnl
Sorting Shuffled Monotone Sequences
Inf. Comput.
Christos Levcopoulos, Ola Petersson
1993 J jnl
Adaptive Heapsort.
J. Algorithms
Christos Levcopoulos, Ola Petersson
1993 J jnl
Space-Efficient Parallel Merging.
RAIRO Theor. Informatics Appl.
Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
1993 J jnl
Sublinear Merging and Natural Mergesort.
Algorithmica
Svante Carlsson, Christos Levcopoulos, Ola Petersson
1992 — conf
C-sensitive Triangulations Approximate the MinMax Length Triangulation.
FSTTCS
Christos Levcopoulos, Andrzej Lingas
1992 J jnl
Fast Algorithms for Greedy Triangulation.
BIT
Christos Levcopoulos, Andrzej Lingas
1992 — conf
Improved Parallel Sorting of Presorted Sequences.
CONPAR
Jingsen Chen, Christos Levcopoulos
1992 J jnl
Matching Parentheses in Parallel.
Discret. Appl. Math.
Christos Levcopoulos, Ola Petersson
1992 — conf
Space-Efficient Parallel Merging.
PARLE
Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
1992 J jnl
There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees.
Algorithmica
Christos Levcopoulos, Andrzej Lingas
1991 B conf
An Optimal Adaptive In-place Sorting Algorithm.
FCT
Christos Levcopoulos, Ola Petersson
1991 C conf
Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case.
ICCI
Christos Levcopoulos, Andrzej Lingas
1991 J jnl
Splitsort - An Adaptive Sorting Algorithm.
Inf. Process. Lett.
Christos Levcopoulos, Ola Petersson
1990 J jnl
A Sublogarithmic Convex Hull Algorithm.
BIT
Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
1990 — conf
Fast Algorithms for Greedy Triangulation.
SWAT
Christos Levcopoulos, Andrzej Lingas
1990 — conf
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs.
FSTTCS
Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter
1990 — conf
Sorting Shuffled Monotone Sequences.
SWAT
Christos Levcopoulos, Ola Petersson
1990 B conf
Splitsort - An Adaptive Sorting Algorithm.
MFCS
Christos Levcopoulos, Ola Petersson
1990 — conf
Sublinear Merging and Natural Merge Sort.
SIGAL International Symposium on Algorithms
Svante Carlsson, Christos Levcopoulos, Ola Petersson
1989 J jnl
A Note on Adaptive Parallel Sorting.
Inf. Process. Lett.
Christos Levcopoulos, Ola Petersson
1989 B conf
Heapsort - Adapted for Presorted Files.
WADS
Christos Levcopoulos, Ola Petersson
1989 J jnl
Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems.
Theor. Comput. Sci.
Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack
1989 — conf
Local Insertion Sort Revisited.
Optimal Algorithms
Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
1989 — conf
Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees.
Optimal Algorithms
Christos Levcopoulos, Andrzej Lingas
1988 J jnl
A Balanced Search Tree with
Acta Informatica
Christos Levcopoulos, Mark H. Overmars
1988 — conf
An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams.
SWAT
Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas
1988 — conf
On Optimal Parallel Algorithm for Sorting Presorted Files.
FSTTCS
Christos Levcopoulos
1987 J jnl
Algorithms for Minimum Length Partitions of Polygons.
BIT
Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack
1987 J jnl
An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation.
Inf. Process. Lett.
Christos Levcopoulos
1987 — conf
Improved Bounds for Covering General Polygons with Rectangles.
FSTTCS
Christos Levcopoulos
1987 A* conf
Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract).
ICALP
Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack
1987 J jnl
On Approximation Behavior of the Greedy Triangulation for Convex Polygons.
Algorithmica
Christos Levcopoulos, Andrzej Lingas
1986 — conf
Fast Heuristics for Minimum Length Rectangular Partitions of Polygons.
SCG
Christos Levcopoulos
1985 B conf
A fast heuristic for covering polygons by rectangles.
FCT
Christos Levcopoulos
1984 — conf
Bounds on the Length of Convex Partitions of Polygons.
FSTTCS
Christos Levcopoulos, Andrzej Lingas
1984 A conf
Covering Polygons with Minimum Number of Rectangles.
STACS
Christos Levcopoulos, Andrzej Lingas