Bounds on the Length of Convex Partitions of Polygons. - Christos Levcopoulos; Andrzej Lingas (FSTTCS, 1984)

Covering Polygons with Minimum Number of Rectangles. - Christos Levcopoulos; Andrzej Lingas (STACS, 1984)

A fast heuristic for covering polygons by rectangles. - Christos Levcopoulos (FCT, 1985)

Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. - Christos Levcopoulos (SCG, 1986)

Improved Bounds for Covering General Polygons with Rectangles. - Christos Levcopoulos (FSTTCS, 1987)

Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). - Christos Levcopoulos; Andrzej Lingas; Jörg-Rüdiger Sack (ICALP, 1987)

On Approximation Behavior of the Greedy Triangulation for Convex Polygons. - Christos Levcopoulos; Andrzej Lingas (Algorithmica, 1987)

Algorithms for Minimum Length Partitions of Polygons. - Andrzej Lingas; Christos Levcopoulos; Jörg-Rüdiger Sack (BIT, 1987)

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

On Optimal Parallel Algorithm for Sorting Presorted Files. - Christos Levcopoulos (FSTTCS, 1988)

An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. - Christos Levcopoulos; Jyrki Katajainen; Andrzej Lingas (SWAT, 1988)

A Balanced Search Tree with O (1) Worst-case Update Time. - Christos Levcopoulos; Mark H. Overmars (Acta Informatica, 1988)

Local Insertion Sort Revisited. - Jyrki Katajainen; Christos Levcopoulos; Ola Petersson (Optimal Algorithms, 1989)

Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees. - Christos Levcopoulos; Andrzej Lingas (Optimal Algorithms, 1989)

Heapsort - Adapted for Presorted Files. - Christos Levcopoulos; Ola Petersson (WADS, 1989)

A Note on Adaptive Parallel Sorting. - Christos Levcopoulos; Ola Petersson (Inf. Process. Lett., 1989)

Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. - Christos Levcopoulos; Andrzej Lingas; Jörg-Rüdiger Sack (Theor. Comput. Sci., 1989)

Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. - Christos Levcopoulos; Andrzej Lingas; Ola Petersson; Wojciech Rytter (FSTTCS, 1990)

Sublinear Merging and Natural Merge Sort. - Svante Carlsson; Christos Levcopoulos; Ola Petersson (SIGAL International Symposium on Algorithms, 1990)

A Sublogarithmic Convex Hull Algorithm. - Per-Olof Fjällström; Jyrki Katajainen; Christos Levcopoulos; Ola Petersson (BIT, 1990)

An Optimal Adaptive In-place Sorting Algorithm. - Christos Levcopoulos; Ola Petersson (FCT, 1991)

Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. - Christos Levcopoulos; Andrzej Lingas (ICCI, 1991)

Splitsort - An Adaptive Sorting Algorithm. - Christos Levcopoulos; Ola Petersson (Inf. Process. Lett., 1991)

Improved Parallel Sorting of Presorted Sequences. - Jingsen Chen; Christos Levcopoulos (CONPAR, 1992)

C-sensitive Triangulations Approximate the MinMax Length Triangulation. - Christos Levcopoulos; Andrzej Lingas (FSTTCS, 1992)

There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees. - Christos Levcopoulos; Andrzej Lingas (Algorithmica, 1992)

Fast Algorithms for Greedy Triangulation. - Christos Levcopoulos; Andrzej Lingas (BIT, 1992)

Matching Parentheses in Parallel. - Christos Levcopoulos; Ola Petersson (Discret. Appl. Math., 1992)

Sublinear Merging and Natural Mergesort. - Svante Carlsson; Christos Levcopoulos; Ola Petersson (Algorithmica, 1993)

Space-Efficient Parallel Merging. - Jyrki Katajainen; Christos Levcopoulos; Ola Petersson (RAIRO Theor. Informatics Appl., 1993)

Adaptive Heapsort. - Christos Levcopoulos; Ola Petersson (J. Algorithms, 1993)

A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem. - Christos Levcopoulos; Teresa M. Przytycka (Parallel Process. Lett., 1994)

Sorting Shuffled Monotone Sequences - Christos Levcopoulos; Ola Petersson (Inf. Comput., 1994)

Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time. - Drago Krznaric; Christos Levcopoulos (FSTTCS, 1995)

On Parallel Complexity of Planar Triangulations. - Christos Levcopoulos; Andrzej Lingas; Cao Wang (FSTTCS, 1995)

The First Subquadratic Algorithm for Complete Linkage Clustering. - Drago Krznaric; Christos Levcopoulos (ISAAC, 1995)

Close Approximation of Minimum Rectangular Coverings. - Christos Levcopoulos; Joachim Gudmundsson (FSTTCS, 1996)

A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract). - Christos Levcopoulos; Drago Krznaric (SWAT, 1996)

Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). - Christos Levcopoulos; Anna Östlin (SWAT, 1996)

On 2-QBF Truth Testing in Parallel. - Bengt Aspvall; Christos Levcopoulos; Andrzej Lingas; Robert Storlind (Inf. Process. Lett., 1996)

Tight Lower Bounds for Minimum Weight-Triangulation Heuristics. - Christos Levcopoulos; Drago Krznaric (Inf. Process. Lett., 1996)

Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. - Christos Levcopoulos; Ola Petersson (Theor. Comput. Sci., 1996)

Minimum Spanning Trees in d Dimensions. - Drago Krznaric; Christos Levcopoulos; Bengt J. Nilsson (ESA, 1997)

A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). - Christos Levcopoulos; Joachim Gudmundsson (FCT, 1997)

Approximation Algorithms for Covering Polygons with Squares and Similar Problems. - Christos Levcopoulos; Joachim Gudmundsson (RANDOM, 1997)

A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract). - Christos Levcopoulos; Drago Krznaric (SODA, 1997)

Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. - Christos Levcopoulos; Giri Narasimhan; Michiel H. M. Smid (STOC, 1998)

A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons. - Christos Levcopoulos; Drago Krznaric (Algorithmica, 1998)

Fast Algorithms for Complete Linkage Clustering. - Drago Krznaric; Christos Levcopoulos (Discret. Comput. Geom., 1998)

Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. - Christos Levcopoulos; Drago Krznaric (J. Algorithms, 1998)

Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time. - Drago Krznaric; Christos Levcopoulos (Nord. J. Comput., 1998)

A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. - Joachim Gudmundsson; Christos Levcopoulos (COCOON, 1999)

Approximating Minimum Manhattan Networks. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan (RANDOM-APPROX, 1999)

The greedy triangulation can be computed from the Delaunay triangulation in linear time. - Christos Levcopoulos; Drago Krznaric (Comput. Geom., 1999)

Close Approximations of Minimum Rectangular Coverings. - Joachim Gudmundsson; Christos Levcopoulos (J. Comb. Optim., 1999)

A Fast Approximation Algorithm for TSP with Neighborhoods. - Joachim Gudmundsson; Christos Levcopoulos (Nord. J. Comput., 1999)

Minimum Spanning Trees in d Dimensions. - Drago Krznaric; Christos Levcopoulos; Bengt J. Nilsson (Nord. J. Comput., 1999)

Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan (SWAT, 2000)

A Parallel Approximation Algorithm for Minimum Weight Triangulation. - Joachim Gudmundsson; Christos Levcopoulos (Nord. J. Comput., 2000)

Approximating a Minimum Manhattan Network. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan (Nord. J. Comput., 2001)

Approximate Distance Oracles Revisited. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan; Michiel H. M. Smid (ISAAC, 2002)

Approximate distance oracles for geometric graphs. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan; Michiel H. M. Smid (SODA, 2002)

Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. - Christos Levcopoulos; Andrzej Lingas; Joseph S. B. Mitchell (SWAT, 2002)

Improved Algorithms for Constructing Fault-Tolerant Spanners. - Christos Levcopoulos; Giri Narasimhan; Michiel H. M. Smid (Algorithmica, 2002)

Lower bounds for approximate polygon decomposition and minimum gap. - Joachim Gudmundsson; Thore Husfeldt; Christos Levcopoulos (Inf. Process. Lett., 2002)

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan (SIAM J. Comput., 2002)

Optimal algorithms for complete linkage clustering in d dimensions. - Drago Krznaric; Christos Levcopoulos (Theor. Comput. Sci., 2002)

Chips on Wafers. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (WADS, 2003)

Balanced Partition of Minimum Spanning Trees. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan (Int. J. Comput. Geom. Appl., 2003)

A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem. - Magdalene Grantson; Christos Levcopoulos (JCDCG, 2004)

Tight Time Bounds for the Minimum Local Convex Partition Problem. - Magdalene Grantson; Christos Levcopoulos (JCDCG, 2004)

Bounds on optimally triangulating connected subsets of the minimum weight convex partition. - Magdalene Grantson; Christos Levcopoulos (EuroCG, 2005)

Minimum Weight Triangulation by Cutting Out Triangles. - Magdalene Grantson; Christian Borgelt; Christos Levcopoulos (ISAAC, 2005)

Chips on wafers, or packing rectangles into grids. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2005)

TSP with neighborhoods of varying size. - Mark de Berg; Joachim Gudmundsson; Matthew J. Katz; Christos Levcopoulos; Mark H. Overmars; A. Frank van der Stappen (J. Algorithms, 2005)

Covering a Set of Points with a Minimum Number of Lines. - Magdalene Grantson; Christos Levcopoulos (CIAC, 2006)

A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation. - Rolf Klein; Christos Levcopoulos; Andrzej Lingas (Comput. Geom., 2006)

Approximate distance oracles for graphs with dense clusters. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2007)

Minimum weight pseudo-triangulations. - Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2007)

Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem. - Magdalene G. Borgelt; Christian Borgelt; Christos Levcopoulos (Int. J. Comput. Geom. Appl., 2008)

Approximate distance oracles for geometric spanners. - Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan; Michiel H. M. Smid (ACM Trans. Algorithms, 2008)

Minimum Geometric Spanning Trees. - Christos Levcopoulos (Encyclopedia of Algorithms, 2008)

Minimum Weight Triangulation. - Christos Levcopoulos (Encyclopedia of Algorithms, 2008)

Restricted Mesh Simplification Using Edge Contractions. - Mattias Andersson 002; Joachim Gudmundsson; Christos Levcopoulos (Int. J. Comput. Geom. Appl., 2009)

Clearing Connections by Few Agents. - Christos Levcopoulos; Andrzej Lingas; Bengt J. Nilsson; Pawel Zylinski (FUN, 2014)

Efficiently Correcting Matrix Products. - Leszek Gasieniec; Christos Levcopoulos; Andrzej Lingas (ISAAC, 2014)

Quickest path queries on transportation network. - Radwa El Shawi; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2014)

A note on a QPTAS for maximum weight triangulation of planar point sets. - Christos Levcopoulos; Andrzej Lingas (Inf. Process. Lett., 2014)

A Fire Fighter's Problem. - Rolf Klein; Elmar Langetepe; Christos Levcopoulos (SoCG, 2015)

Minimum Geometric Spanning Trees. - Christos Levcopoulos (Encyclopedia of Algorithms, 2016)

Minimum Weight Triangulation. - Christos Levcopoulos (Encyclopedia of Algorithms, 2016)

Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). - Leszek Gasieniec; Ralf Klasing; Christos Levcopoulos; Andrzej Lingas; Jie Min; Tomasz Radzik (SOFSEM, 2017)

Efficiently Correcting Matrix Products. - Leszek Gasieniec; Christos Levcopoulos; Andrzej Lingas; Rasmus Pagh; Takeshi Tokuyama (Algorithmica, 2017)

3D Rectangulations and Geometric Matrix Multiplication. - Peter Floderus; Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas; Dzmitry Sledneu (Algorithmica, 2018)

Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. - Rolf Klein; Christos Levcopoulos; Andrzej Lingas (Algorithms, 2018)

Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. - Leszek Gasieniec; Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas; Mia Persson (FAW, 2019)

Shortcuts for the circle. - Sang Won Bae 001; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Christos Levcopoulos (Comput. Geom., 2019)

On a Fire Fighter's Problem. - Rolf Klein; Elmar Langetepe; Barbara Schwarzwald; Christos Levcopoulos; Andrzej Lingas (Int. J. Found. Comput. Sci., 2019)

Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019). - Leszek Gasieniec; Jesper Jansson 001; Christos Levcopoulos (J. Comput. Syst. Sci., 2021)

Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. - Leszek Gasieniec; Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas; Mia Persson (J. Comput. Syst. Sci., 2021)

Local Routing in Sparse and Lightweight Geometric Graphs. - Vikrant Ashvinkumar; Joachim Gudmundsson; Christos Levcopoulos; Bengt J. Nilsson; André van Renssen (Algorithmica, 2022)

Perpetual maintenance of machines with different urgency requirements. - Leszek Gasieniec; Ralf Klasing; Christos Levcopoulos; Andrzej Lingas; Jie Min; Tomasz Radzik (CoRR, 2022)

Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. - Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas (CCCG, 2023)

Online and Approximate Network Construction from Bounded Connectivity Constraints. - Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas (Int. J. Found. Comput. Sci., 2023)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. - Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas; Quan Xue (COCOON (2), 2024)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. - Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas (CoRR, 2024)

Perpetual maintenance of machines with different urgency requirements. - Leszek Gasieniec; Tomasz Jurdzinski; Ralf Klasing; Christos Levcopoulos; Andrzej Lingas; Jie Min; Tomasz Radzik (J. Comput. Syst. Sci., 2024)

Efficient assignment of identities in anonymous populations. - Leszek Gasieniec; Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas (Inf. Comput., 2025)

Deterministic protocols for Voronoi diagrams and triangulations of planar point sets on the congested clique. - Jesper Jansson 001; Christos Levcopoulos; Andrzej Lingas; Valentin Polishchuk; Quan Xue (Theor. Comput. Sci., 2025)