| 2024 | COCOON | The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. | Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Quan Xue |
| 2021 | CIAC | Online and Approximate Network Construction from Bounded Connectivity Constraints. | Jesper Jansson, Christos Levcopoulos, Andrzej Lingas |
| 2021 | OPODIS | Efficient Assignment of Identities in Anonymous Populations. | Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas |
| 2019 | FAW | Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. | Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson |
| 2019 | ISAAC | Local Routing in Sparse and Lightweight Geometric Graphs. | Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, Andr van Renssen |
| 2017 | ISAAC | Shortcuts for the Circle. | Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos |
| 2017 | SOFSEM | 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 |
| 2014 | FUN | Clearing Connections by Few Agents. | Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski |
| 2014 | ISAAC | 3D Rectangulations and Geometric Matrix Multiplication. | Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu |
| 2014 | ISAAC | Efficiently Correcting Matrix Products. | Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas |
| 2014 | LATIN | Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. | Rolf Klein, Christos Levcopoulos, Andrzej Lingas |
| 2006 | CIAC | Covering a Set of Points with a Minimum Number of Lines. | Magdalene Grantson, Christos Levcopoulos |
| 2006 | COCOON | Restricted Mesh Simplification Using Edge Contractions. | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos |
| 2005 | ISAAC | Minimum Weight Triangulation by Cutting Out Triangles. | Magdalene Grantson, Christian Borgelt, Christos Levcopoulos |
| 2004 | ISAAC | Approximate Distance Oracles for Graphs with Dense Clusters. | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos |
| 2003 | WADS | Chips on Wafers. | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos |
| 2002 | ESA | TSP with Neighborhoods of Varying Size. | Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen |
| 2002 | ICCS | Balanced Partition of Minimum Spanning Trees. | Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan |
| 2002 | ISAAC | Approximate Distance Oracles Revisited. | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
| 2002 | SODA | Approximate distance oracles for geometric graphs. | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
| 1999 | COCOON | A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. | Joachim Gudmundsson, Christos Levcopoulos |
| 1998 | STOC | Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. | Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
| 1997 | ESA | Minimum Spanning Trees in | Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson |
| 1997 | FCT | A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). | Christos Levcopoulos, Joachim Gudmundsson |
| 1997 | MFCS | Optimal Algorithms for Complete Linkage Clustering in d Dimensions. | Drago Krznaric, Christos Levcopoulos |
| 1997 | SODA | A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract). | Christos Levcopoulos, Drago Krznaric |
| 1996 | SODA | Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. | Christos Levcopoulos, Drago Krznaric |
| 1995 | ISAAC | The First Subquadratic Algorithm for Complete Linkage Clustering. | Drago Krznaric, Christos Levcopoulos |
| 1991 | FCT | An Optimal Adaptive In-place Sorting Algorithm. | Christos Levcopoulos, Ola Petersson |
| 1991 | ICCI | Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. | Christos Levcopoulos, Andrzej Lingas |
| 1990 | MFCS | Splitsort - An Adaptive Sorting Algorithm. | Christos Levcopoulos, Ola Petersson |
| 1989 | WADS | Heapsort - Adapted for Presorted Files. | Christos Levcopoulos, Ola Petersson |
| 1987 | ICALP | Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). | Christos Levcopoulos, Andrzej Lingas, Jrg-Rdiger Sack |
| 1985 | FCT | A fast heuristic for covering polygons by rectangles. | Christos Levcopoulos |
| 1984 | STACS | Covering Polygons with Minimum Number of Rectangles. | Christos Levcopoulos, Andrzej Lingas |