Personal information

Biography

Studied at Linköping University, worked at Lund University, Sweden

Activities

Employment (2)

Lund University: Lund, SE

Employment
Source: check_circle
Lund University

Lunds Universitet: Lund, SE

1989-07-01 to present
Employment
Source: Self-asserted source
Christos Levcopoulos

Education and qualifications (1)

Linköpings Universitet: Linköping, SE

1978-01-08 to 1987-02-21 | PhD
Education
Source: Self-asserted source
Christos Levcopoulos

Works (50 of 63)

Items per page:
Page 1 of 2

Efficient assignment of identities in anonymous populations

Information and Computation
2025 | Journal article | Author
SOURCE-WORK-ID:

8dd6132f-9d76-42b2-8aa5-6f1c65d9c214

EID:

2-s2.0-85214705267

Contributors: Leszek Gasieniec; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas
Source: check_circle
Lund University

Perpetual maintenance of machines with different urgency requirements

Journal of Computer and System Sciences
2024 | Journal article | Author
SOURCE-WORK-ID:

dcec6d5b-a860-4ec4-8148-58ae7c98aa69

EID:

2-s2.0-85170649660

Contributors: Leszek Gasieniec; Tomasz Jurdziński; Ralf Klasing; Christos Levcopoulos; Andrzej Lingas; Jie Min; Tomasz Radzik
Source: check_circle
Lund University

Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique.

Proceedings of the 35th Canadian Conference on Computational Geometry, CCCG 2023, Concordia University, Montreal, Quebec, Canada, July 31 - August 4, 2023.
2023 | Conference paper | Author
SOURCE-WORK-ID:

4adf32be-356c-4f6f-b543-e34fbb2959bf

Contributors: Jesper Jansson; Christos Levcopoulos; Andrzej Lingas
Source: check_circle
Lund University

Online and Approximate Network Construction from Bounded Connectivity Constraints

International Journal of Foundations of Computer Science
2023 | Journal article | Author
SOURCE-WORK-ID:

9366de5b-711e-4ab3-87b0-298dc9fdcced

EID:

2-s2.0-85146304091

Contributors: Jesper Jansson; Christos Levcopoulos; Andrzej Lingas
Source: check_circle
Lund University

Efficient Assignment of Identities in Anonymous Populations

25th International Conference on Principles of Distributed Systems (OPODIS 2021)
2022 | Conference paper | Author
SOURCE-WORK-ID:

a22f1cd9-7271-4b5b-a7e7-de80f8bda353

EID:

2-s2.0-85127423813

Part of ISBN: 978-3-95977-219-8
Contributors: Leszek Gasieniec; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas
Source: check_circle
Lund University

Perpetual maintenance of machines with different urgency requirements

2022 | Report | Author
SOURCE-WORK-ID:

7331d644-2cb2-49c6-ab96-be3e5cdb8c0e

Contributors: Leszek Gasieniec; Ralf Klasing; Christos Levcopoulos; Andrzej Lingas; Jie Min; Tomasz Radzik
Source: check_circle
Lund University

Local Routing in Sparse and Lightweight Geometric Graphs

Algorithmica
2022-01-25 | Journal article | Author
SOURCE-WORK-ID:

0a4370b8-879d-431d-868f-2985b0dbcfb7

EID:

2-s2.0-85123504940

Contributors: Vikrant Ashvinkumar; Joachim Gudmundsson; Christos Levcopoulos; Bengt J. Nilsson; André van Renssen
Source: check_circle
Lund University

Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019)

Journal of Computer and System Sciences
2021 | Journal article | Author
SOURCE-WORK-ID:

d801b614-0957-4471-b1f5-2b4791b5c228

EID:

2-s2.0-85127768019

Contributors: Leszek Gasieniec; Jesper Jansson; Christos Levcopoulos
Source: check_circle
Lund University

Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases

Journal of Computer and System Sciences
2021-06 | Journal article | Author
SOURCE-WORK-ID:

e72af51a-5533-4e76-ab42-a2c7d94bf3bc

EID:

2-s2.0-85099348676

Contributors: Leszek Gasieniec; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas; Mia Persson
Source: check_circle
Lund University

Online and Approximate Network Construction from Bounded Connectivity Constraints

Algorithms and Complexity
2021-05-04 | Conference paper | Author
SOURCE-WORK-ID:

bd12f4dc-5cdf-47d8-8d23-8ff3b35569fd

EID:

2-s2.0-85106145907

Part of ISBN: 978-3-030-75242-2
Part of ISBN: 978-3-030-75241-5
Contributors: Jesper Jansson; Christos Levcopoulos; Andrzej Lingas
Source: check_circle
Lund University

On a Fire Fighter’s Problem

International Journal of Foundations of Computer Science
2019 | Journal article | Author
SOURCE-WORK-ID:

42b46030-41f7-4cb6-8a09-e2a6a236f190

EID:

2-s2.0-85062887663

Contributors: Rolf Klein; Elmar Langetepe; Christos Levcopoulos; Andrzej Lingas; Barbara Schwarzwald
Source: check_circle
Lund University

Local Routing in Sparse and Lightweight Geometric Graphs

30th International Symposium on Algorithms and Computation (ISAAC 2019)
2019-11-28 | Conference paper | Author
SOURCE-WORK-ID:

9c337412-5ee0-4e9e-88e2-8998e82af91e

EID:

2-s2.0-85076347211

Part of ISBN: 978-3-95977-130-6
Contributors: Vikrant Ashvinkumar; Joachim Gudmundsson; Christos Levcopoulos; Bengt J. Nilsson; André van Renssen
Source: check_circle
Lund University

Fundamentals of Computation Theory

22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, Copenhagen, Denmark, 2019/08/22
2019-08-01 | Book | Editor
SOURCE-WORK-ID:

584f6a33-eaf5-4820-a0cc-51574e6c6063

EID:

2-s2.0-85070644960

Contributors: Leszek GÄ…sieniec; Jesper Jansson; Christos Levcopoulos
Source: check_circle
Lund University

Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases

Frontiers in Algorithmics
2019-04-09 | Conference paper | Author
SOURCE-WORK-ID:

fc31a0f2-8539-4908-b28b-72e546e84bc3

EID:

2-s2.0-85065315076

Part of ISBN: 978-3-030-18126-0
Part of ISBN: 978-3-030-18125-3
Contributors: Leszek Gasieniec; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas; Mia Persson
Source: check_circle
Lund University

Shortcuts for the circle

Computational Geometry: Theory and Applications
2019-01-24 | Journal article | Author
SOURCE-WORK-ID:

d533f46b-e837-47b6-8933-2eca244db820

EID:

2-s2.0-85060736146

Contributors: Sang Won Bae; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University

Preface

Fundamentals of Computation Theory
2019-01-01 | Other | Author
SOURCE-WORK-ID:

e9fa9f63-1c5f-48c7-a3bb-7b4291ae578a

EID:

2-s2.0-85070628926

Part of ISBN: 978-3-030-25027-0
Part of ISBN: 978-3-030-25026-3
Contributors: Leszek Antoni GÄ…sieniec; Jesper Jansson; Christos Levcopoulos
Source: check_circle
Lund University

Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems

Algorithms
2018-04-11 | Journal article | Author
SOURCE-WORK-ID:

a8bb4fed-75be-4c72-8695-f8942448194a

EID:

2-s2.0-85069868840

Contributors: Rolf Klein; Christos Levcopoulos; Andrzej Lingas
Source: check_circle
Lund University

3D Rectangulations and Geometric Matrix Multiplication

Algorithmica
2018-01 | Journal article | Author
SOURCE-WORK-ID:

619ce54b-f063-406e-aa3e-f8d4cbe1d825

EID:

2-s2.0-84995503471

Contributors: PETER SAVONEN FLODERUS; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas; DZMITRY SLEDNEU
Source: check_circle
Lund University

Shortcuts for the circle

28th International Symposium on Algorithms and Computation, ISAAC 2017
2017-12-01 | Conference paper | Author
SOURCE-WORK-ID:

c0a5779e-788d-4ba9-82e3-d0babcb0f36a

EID:

2-s2.0-85038563025

Part of ISBN: 9783959770545
Contributors: Sang Won Bae; Mark De Berg; Otfried Cheong; Joachim Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University

Efficiently Correcting Matrix Products

Algorithmica
2017-10 | Journal article | Author
SOURCE-WORK-ID:

07ff6fdc-af95-4109-b547-76926cf9c896

EID:

2-s2.0-84983032223

WOSUID:

000406779100007

Contributors: Leszek Gasieniec; Christos Levcopoulos; Andrzej Lingas; Rasmus Pagh; Takeshi Tokuyama
Source: check_circle
Lund University

Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)

Lecture Notes in Computer Science (LNCS)
2017-01-11 | Conference paper | Author
SOURCE-WORK-ID:

7fc24267-259c-45e5-83d7-3b316e462262

EID:

2-s2.0-85010682314

Part of ISBN: 978-3-319-51963-0
Part of ISBN: 978-3-319-51962-3
Contributors: Christos Levcopoulos; Andrzej Lingas; Leszek GÄ…sieniec; Ralf Klasing; Jie Min; Tomasz Radzik
Source: check_circle
Lund University

Efficiently Correcting Matrix Products (arXiv 2016)

2016 | Report | Author
SOURCE-WORK-ID:

0c31d1c9-8025-4999-a261-b114a50d5755

Contributors: Leszek Gasieniec; Christos Levcopoulos; Andrzej Lingas; Rasmus Pagh; Takeshi Tokuyama
Source: check_circle
Lund University

Minimum Geometric Spanning Trees

Encyclopedia of Algorithms 2016
2016-04-22 | Book chapter | Author
SOURCE-WORK-ID:

9e561c4c-34e1-48f4-b7fa-3a35af53b6d6

Part of ISBN: 978-3-642-27848-8
Contributors: Christos Levcopoulos
Source: check_circle
Lund University

Minimum Weight Triangulation

Encyclopedia of Algorithms 2016
2016-04-22 | Book chapter | Author
SOURCE-WORK-ID:

83d39577-e6b3-4ea6-b296-e3a4eb0d2908

Part of ISBN: 978-1-4939-2864-4
Part of ISBN: 978-1-4939-2863-7
Contributors: Christos Levcopoulos
Source: check_circle
Lund University

A Fire Fighter's Problem.

Leibniz International Proceedings in Informatics (LIPIcs)
2015 | Conference paper | Author
SOURCE-WORK-ID:

fbf23e9f-2ed9-4e5a-8899-435f87902345

EID:

2-s2.0-84958175751

Contributors: Rolf Klein; Elmar Langetepe; Christos Levcopoulos
Source: check_circle
Lund University

3D Rectangulations and Geometric Matrix Multiplication

Algorithms and Computation, ISAAC 2014
2014 | Conference paper | Author
SOURCE-WORK-ID:

2eb02895-55df-4b62-8adc-28a2da61f448

WOSUID:

000354865900006

EID:

2-s2.0-84921641440

Part of ISBN: 978-3-319-13074-3
Contributors: Peter Floderus; Jesper Jansson; Christos Levcopoulos; Andrzej Lingas; Dzmitry Sledneu
Source: check_circle
Lund University

A note on a QPTAS for maximum weight triangulation of planar point sets

Information Processing Letters
2014 | Journal article | Author
SOURCE-WORK-ID:

a6594232-3a7d-425a-b580-5e49bcfaf6e4

WOSUID:

000336699200005

EID:

2-s2.0-84899933387

Contributors: Christos Levcopoulos; Andrzej Lingas
Source: check_circle
Lund University

Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems.

LATIN 2014: Theoretical Informatics /Lecture Notes in Computer Science
2014 | Conference paper | Author
SOURCE-WORK-ID:

d08a53ee-515e-4372-8eb5-24e6b3801eaa

EID:

2-s2.0-84899925143

Contributors: Rolf Klein; Christos Levcopoulos; Andrzej Lingas
Source: check_circle
Lund University

Clearing Connections by Few Agents

Fun with Algorithms/Lecture notes in computer science
2014 | Conference paper | Author
SOURCE-WORK-ID:

45b35cb5-f709-4a2d-927f-6b054fda2510

WOSUID:

000342753700025

EID:

2-s2.0-84903717874

Part of ISBN: 978-3-319-07890-8
Contributors: Christos Levcopoulos; Andrzej Lingas; Bengt J Nilsson; Pawel Zylinski
Source: check_circle
Lund University

Efficiently Correcting Matrix Products

Algorithms and Computation, ISAAC 2014
2014 | Conference paper | Author
SOURCE-WORK-ID:

c8bc6915-7898-4773-a7e7-eac9e8a6d793

WOSUID:

000354865900005

EID:

2-s2.0-84921487194

Contributors: Leszek Gasieniec; Christos Levcopoulos; Andrzej Lingas
Source: check_circle
Lund University

Quickest path queries on transportation network

Computational Geometry
2014 | Journal article | Author
SOURCE-WORK-ID:

c8cb6000-ef83-40d1-9bec-09d36662a24d

WOSUID:

000336186100001

EID:

2-s2.0-84897807758

Contributors: Radwa El Shawi; Joachim Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University

Restricted mesh simplification using edge contractions

International Journal of Computational Geometry and Applications
2009 | Journal article | Author
SOURCE-WORK-ID:

f6883800-e775-4f11-991b-15d18d04aea7

WOSUID:

000267510600004

EID:

2-s2.0-68049144811

Contributors: Mattias Andersson; Joachim Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University

Approximate distance oracles for geometric spanners

ACM Transactions on Algorithms
2008 | Journal article | Author
SOURCE-WORK-ID:

acd2dec5-1ee2-44fa-bc99-bab2723cb712

WOSUID:

000265816600010

EID:

2-s2.0-42149179298

Contributors: Joachim Gudmundsson; Christos Levcopoulos; Giri Narasimhan; Michiel Smid
Source: check_circle
Lund University

Fixed parameter algorithms for the minimum weight triangulation problem

International Journal of Computational Geometry and Applications
2008 | Journal article | Author
SOURCE-WORK-ID:

428efced-2903-4f93-9654-a65473b04f26

WOSUID:

000257540600002

EID:

2-s2.0-45749150320

Contributors: Magdalene Grantson Borgelt; Christian Borgelt; Christos Levcopoulos
Source: check_circle
Lund University

Minimum weight triangulation

Encyclopedia of Algorithms
2008 | Book chapter | Author
SOURCE-WORK-ID:

d293cf48-2ef8-4fff-bc06-b77e4dcdc23c

Part of ISBN: 978-0-387-30770-1
Contributors: Christos Levcopoulos
Source: check_circle
Lund University

Approximate distance oracles for graphs with dense clusters

Computational Geometry
2007 | Journal article | Author
SOURCE-WORK-ID:

13bf10d3-b9a9-497d-bc1d-fb2f4dcc9de5

WOSUID:

000247424800002

EID:

2-s2.0-34247549396

Contributors: Mattias Andersson; Joachim Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University

Generalizing the Gap Theorem for Constructing a t-Spanner of Low Weight Fast and Simple

null
2007 | Report | Author
SOURCE-WORK-ID:

e0bcb6c4-02cc-40a2-b021-d6cf54834a4b

Contributors: Mattias Andersson; Joachim Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University

Minimum weight pseudo-triangulations

Computational Geometry
2007 | Journal article | Author
SOURCE-WORK-ID:

97fafa88-bef0-4b9f-b654-a4da7390f451

WOSUID:

000249488900002

EID:

2-s2.0-84867947111

Contributors: Joachim Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University

A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation

Computational Geometry
2006 | Journal article | Author
SOURCE-WORK-ID:

6685d31d-84bc-4197-9163-4a754848fda2

WOSUID:

000236312300005

EID:

2-s2.0-84867964133

Contributors: Rolf Klein; Christos Levcopoulos; Andrzej Lingas
Source: check_circle
Lund University

Covering a set of points with a minimum number of lines

Lecture Notes in Computer Science (Algorithms and Complexity. Proceedings)
2006 | Conference paper | Author
SOURCE-WORK-ID:

15497dcd-27df-419f-b224-bc60f04f716c

WOSUID:

000238119900004

EID:

2-s2.0-33746034919

Part of ISBN: 978-3-540-34375-2
Contributors: Magdalene Grantson Borgelt; Christos Levcopoulos
Source: check_circle
Lund University

Restricted mesh simplification using edge contractions

Computing and combinatorics / Lecture notes in computer science
2006 | Conference paper | Author
SOURCE-WORK-ID:

5324a312-af45-48ed-b005-9a518b00ceb0

WOSUID:

000240077300022

EID:

2-s2.0-33749543046

Part of ISBN: 978-3-540-36925-7
Contributors: Mattias Andersson; Joachim Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University

Chips on wafers, or packing rectangles into grids

Computational Geometry
2005 | Journal article | Author
SOURCE-WORK-ID:

d30225b2-e06d-4c2a-b1f6-7c0108824e1b

WOSUID:

000226155000003

EID:

2-s2.0-10044253053

Contributors: Mattias Andersson; J Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University

Minimum weight triangulation by cutting out triangles

Algorithms and computation / Lecture notes in computer science
2005 | Conference paper | Author
SOURCE-WORK-ID:

2abf8357-d6c1-4be5-b127-ed29343546cb

WOSUID:

000234885900098

EID:

2-s2.0-33744953726

Part of ISBN: 978-3-540-30935-2
Contributors: Magdalene Grantson Borgelt; C Borgelt; Christos Levcopoulos
Source: check_circle
Lund University

TSP with neighborhoods of varying size

Journal of Algorithms
2005 | Journal article | Author
SOURCE-WORK-ID:

cbf6256e-ca25-4a76-8736-0f7e6fbde4be

WOSUID:

000232283200002

EID:

2-s2.0-24944449883

Contributors: M de Berg; J Gudmundsson; MJ Katz; Christos Levcopoulos; MH Overmars; AF van der Stappen
Source: check_circle
Lund University

A fixed parameter algorithm for the minimum number convex partition problem

Discrete and Computational Geometry. Japanese Conference, JCDCG 2004. Revised Selected Papers / Lecture Notes in Computer Science
2004 | Book chapter | Author
SOURCE-WORK-ID:

79cced35-94ed-435d-b551-39e9cd2f5973

EID:

2-s2.0-33646494887

Part of ISBN: 3-540-30467-3
Contributors: Magdalene Grantson Borgelt; Christos Levcopoulos
Source: check_circle
Lund University

Approximate distance oracles for graphs with dense clusters

Algorithms and Computation / Lecture notes in computer science
2004 | Conference paper | Author
SOURCE-WORK-ID:

d49a5b71-6a37-4c94-b7a4-5588830a5082

WOSUID:

000226690300005

EID:

2-s2.0-35048902473

Contributors: Mattias Andersson; J Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University

Minimum weight pseudo-triangulations

FSTTCS 2004 / Lecture notes in computer science
2004 | Conference paper | Author
SOURCE-WORK-ID:

40a1f4d3-bc8b-41d9-8062-2978aa9b9ca0

EID:

2-s2.0-35048822072

Contributors: Joachim Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University

Tight time bounds for the minimum local convex partition problem

Discrete and Computational Geometry. Japanese Conference, JCDCG 2004. Revised Selected Papers / Lecture Notes in Computer Science)
2004 | Book chapter | Author
SOURCE-WORK-ID:

62bdf588-c9be-4d80-a4dc-aad7d66a43ca

EID:

2-s2.0-33646529193

Part of ISBN: 3-540-30467-3
Contributors: Magdalene Grantson Borgelt; Christos Levcopoulos
Source: check_circle
Lund University

Balanced partition of minimum spanning trees

International Journal of Computational Geometry and Applications
2003 | Journal article | Author
SOURCE-WORK-ID:

cfbeecb1-8047-44cd-910f-c876bcb93f6c

WOSUID:

000184726700003

EID:

2-s2.0-0042361974

Contributors: Mattias Andersson; J Gudmundsson; Christos Levcopoulos; G Narasimhan
Source: check_circle
Lund University

Chips on wafers

Algorithms and data structures
2003 | Conference paper | Author
SOURCE-WORK-ID:

750fcc91-48ba-42a3-991a-cf7d1fccc00e

WOSUID:

000185605300036

EID:

2-s2.0-35248817850

Part of ISBN: 978-3-540-40545-0
Contributors: Mattias Andersson; J Gudmundsson; Christos Levcopoulos
Source: check_circle
Lund University
Items per page:
Page 1 of 2