Christos Levcopoulos

发表

Improved Bounds for Covering General Polygons with Rectangles

Christos Levcopoulos, C. Levcopoulos, 1987, FSTTCS.

Approximating Minimum Manhattan Networks

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 1999, RANDOM-APPROX.

Approximate distance oracles for geometric spanners

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2008, TALG.

Restricted Mesh Simplification Using Edge Contractions

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2006, COCOON.

Approximate Distance Oracles Revisited

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2002, ISAAC.

A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons

Christos Levcopoulos, Drago Krznaric, 1998, Algorithmica.

A balanced search tree with O(1) worst-case update time

Mark H. Overmars, Christos Levcopoulos, 2004, Acta Informatica.

An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams

Andrzej Lingas, Christos Levcopoulos, Jyrki Katajainen, 1988, SWAT.

On approximation behavior of the greedy triangulation for convex polygons

Andrzej Lingas, Christos Levcopoulos, 2005, Algorithmica.

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

Andrzej Lingas, Rolf Klein, Christos Levcopoulos, 2006, Comput. Geom..

A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem

Christos Levcopoulos, Magdalene G. Borgelt, 2004, JCDCG.

Minimum Weight Pseudo-Triangulations

Joachim Gudmundsson, Christos Levcopoulos, 2004, FSTTCS.

Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms

Christos Levcopoulos, Ola Petersson, 1996, Theor. Comput. Sci..

Fast Algorithms for Greedy Triangulation

Andrzej Lingas, Christos Levcopoulos, 1990, SWAT.

Lower bounds for approximate polygon decomposition and minimum gap

Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos, 2002, Inf. Process. Lett..

Efficiently Correcting Matrix Products

Andrzej Lingas, Takeshi Tokuyama, Rasmus Pagh, 2014, Algorithmica.

Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract)

Jörg-Rüdiger Sack, Andrzej Lingas, Christos Levcopoulos, 1987, ICALP.

A sublogarithmic convex hull algorithm

Christos Levcopoulos, Jyrki Katajainen, Ola Petersson, 1990, BIT Comput. Sci. Sect..

C-sensitive Triangulations Approximate the MinMax Length Triangulation

Andrzej Lingas, Christos Levcopoulos, 1992, FSTTCS.

Minimum Weight Triangulation

Christos Levcopoulos, 2016, Encyclopedia of Algorithms.

Fast Algorithms for Complete Linkage Clustering

Christos Levcopoulos, Drago Krznaric, C. Levcopoulos, 1998, Discret. Comput. Geom..

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

Andrzej Lingas, Leszek Gasieniec, Christos Levcopoulos, 2019, FAW.

A Fast Approximation Algorithm for TSP with Neighborhoods

Joachim Gudmundsson, Christos Levcopoulos, Joachim Gudmundsson, 1999, Nord. J. Comput..

Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time

Christos Levcopoulos, Drago Krznaric, C. Levcopoulos, 1998, Nord. J. Comput..

Improved Greedy Algorithms for Constructing Sparse Geometric Spanners

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 2000, SWAT.

Efficient algorithms for constructing fault-tolerant geometric spanners

Giri Narasimhan, Michiel H. M. Smid, Christos Levcopoulos, 1998, STOC '98.

3D Rectangulations and Geometric Matrix Multiplication

Andrzej Lingas, Christos Levcopoulos, Peter Floderus, 2014, Algorithmica.

Fast algorithms for greedy triangulation

Andrzej Lingas, Christos Levcopoulos, 1992, BIT Comput. Sci. Sect..

On 2-QBF Truth Testing in Parallel

Andrzej Lingas, Bengt Aspvall, Christos Levcopoulos, 1996, Inf. Process. Lett..

Matching Parentheses in Parallel

Christos Levcopoulos, Ola Petersson, C. Levcopoulos, 1992, Discret. Appl. Math..

Minimum Weight Triangulation by Cutting Out Triangles

Christian Borgelt, Christos Levcopoulos, Magdalene G. Borgelt, 2005, ISAAC.

Approximation Algorithms for Covering Polygons with Squares and Similar Problems

Joachim Gudmundsson, Christos Levcopoulos, Joachim Gudmundsson, 1997, RANDOM.

Approximate distance oracles for geometric graphs

Joachim Gudmundsson, Giri Narasimhan, Michiel H. M. Smid, 2002, SODA '02.

Algorithms for minimum length partitions of polygons

Jörg-Rüdiger Sack, Andrzej Lingas, Christos Levcopoulos, 1987, BIT Comput. Sci. Sect..

Local Insertion Sort Revisited

Christos Levcopoulos, Jyrki Katajainen, Ola Petersson, 1989, Optimal Algorithms.

Minimum Geometric Spanning Trees

Christos Levcopoulos, 2016, Encyclopedia of Algorithms.

Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract)

Anna Pagh, Christos Levcopoulos, 1996, SWAT.

Minimum Spanning Trees in d Dimensions

Bengt J. Nilsson, Christos Levcopoulos, Drago Krznaric, 1999, Nord. J. Comput..

Close Approximation of Minimum Rectangular Coverings

Joachim Gudmundsson, Christos Levcopoulos, Joachim Gudmundsson, 1996, FSTTCS.

Efficiently Correcting Matrix Products

Andrzej Lingas, Leszek Gasieniec, Christos Levcopoulos, 2014, ISAAC.

Optimal Algorithms for Complete Linkage Clustering in d Dimensions

Christos Levcopoulos, Drago Krznaric, 1997, MFCS.

Close Approximations of Minimum Rectangular Coverings

Joachim Gudmundsson, Christos Levcopoulos, 1999, J. Comb. Optim..

Minimum Weight Triangulation

Christos Levcopoulos, 2008, Encyclopedia of Algorithms.

Minimum Spanning Trees

Andrzej Lingas, Christos Levcopoulos, A. Lingas, 2022 .

On Parallel Complexity of Planar Triangulations

Andrzej Lingas, Cao Wang, Christos Levcopoulos, 1995, FSTTCS.

A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract)

Christos Levcopoulos, Drago Krznaric, 1996, SWAT.

TSP with Neighborhoods of Varying Size

Joachim Gudmundsson, Mark de Berg, Matthew J. Katz, 2002, ESA.

Chips on Wafers

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2003, WADS.

Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case

Andrzej Lingas, Christos Levcopoulos, 1991, ICCI.

A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract)

Joachim Gudmundsson, Christos Levcopoulos, Joachim Gudmundsson, 1997, FCT.

Quasi-greedy triangulations approximating the minimum weight triangulation

Christos Levcopoulos, Drago Krznaric, C. Levcopoulos, 1996, SODA '96.

Approximating a Minimum Manhattan Network

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 2001, Nord. J. Comput..

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

Andrzej Lingas, Christos Levcopoulos, 2014, Inf. Process. Lett..

An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation

Christos Levcopoulos, 1987, Inf. Process. Lett..

Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem

Christian Borgelt, Christos Levcopoulos, Magdalene G. Borgelt, 2008, Int. J. Comput. Geom. Appl..

Shortcuts for the Circle

Sang Won Bae, Joachim Gudmundsson, Mark de Berg, 2017, ISAAC.

Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs

Wojciech Rytter, Andrzej Lingas, Christos Levcopoulos, 1990, FSTTCS.

Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains

Joseph S. B. Mitchell, Andrzej Lingas, Christos Levcopoulos, 2002, SWAT.

Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems

Andrzej Lingas, Rolf Klein, Christos Levcopoulos, 2018, Algorithms.

TSP with neighborhoods of varying size

Joachim Gudmundsson, Mark de Berg, Matthew J. Katz, 2005, J. Algorithms.

Efficiently Correcting Matrix Products (arXiv 2016)

Andrzej Lingas, Rasmus Pagh, Leszek Gasieniec, 2016 .

Improved Parallel Sorting of Presorted Sequences

Christos Levcopoulos, Jingsen Chen, 1992, CONPAR.

Optimal Algorithms for Complete Linkage Clustering in d Dimensions

Christos Levcopoulos, Drago Krznaric, C. Levcopoulos, 2002, MFCS.

The First Subquadratic Algorithm for Complete Linkage Clustering

Christos Levcopoulos, Drago Krznaric, C. Levcopoulos, 1995, ISAAC.

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

Andrzej Lingas, Ralf Klasing, Leszek Gasieniec, 2017, SOFSEM.

Shortcuts for the circle

Sang Won Bae, Joachim Gudmundsson, Mark de Berg, 2019, Comput. Geom..

Tight Lower Bounds for Minimum Weight-Triangulation Heuristics

Christos Levcopoulos, Drago Krznaric, 1996, Inf. Process. Lett..

Covering a Set of Points with a Minimum Number of Lines

Christos Levcopoulos, Magdalene G. Borgelt, C. Levcopoulos, 2006, CIAC.

Sublinear Merging and Natural Merge Sort

Svante Carlsson, Christos Levcopoulos, Ola Petersson, 1990, SIGAL International Symposium on Algorithms.

Balanced Partition of Minimum Spanning Trees

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 2002, International Conference on Computational Science.

A Fire Fighter's Problem pdf

Rolf Klein, Elmar Langetepe, Christos Levcopoulos, 2015, Symposium on Computational Geometry.

Sublinear merging and natural mergesort

Svante Carlsson, Christos Levcopoulos, Ola Petersson, 2005, Algorithmica.

A Note on Adaptive Parallel Sorting

Christos Levcopoulos, Ola Petersson, C. Levcopoulos, 1989, Inf. Process. Lett..

The greedy triangulation can be computed from the Delaunay triangulation in linear time

Christos Levcopoulos, Drago Krznaric, C. Levcopoulos, 1999, Comput. Geom..

Clearing Connections by Few Agents

Andrzej Lingas, Pawel Zylinski, Bengt J. Nilsson, 2014, FUN.

Bounds on the Length of Convex Partitions of Polygons

Andrzej Lingas, Christos Levcopoulos, A. Lingas, 1984, FSTTCS.

A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem

Teresa M. Przytycka, Christos Levcopoulos, 1994, Parallel Process. Lett..

A fast heuristic for covering polygons by rectangles

Christos Levcopoulos, 1985, FCT.

A Parallel Approximation Algorithm for Minimum Weight Triangulation

Joachim Gudmundsson, Christos Levcopoulos, 1998, Nord. J. Comput..

Chips on wafers, or packing rectangles into grids

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2005, Comput. Geom..

Fast heuristics for minimum length rectangular partitions of polygons

Christos Levcopoulos, 1986, SCG '86.

Balanced Partition of Minimum Spanning Trees

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 2002, Int. J. Comput. Geom. Appl..

Bounds on optimally triangulating connected subsets of the minimum weight convex partition

Christos Levcopoulos, Magdalene G. Borgelt, 2005, EuroCG.

An Optimal Adaptive In-place Sorting Algorithm

Christos Levcopoulos, Ola Petersson, 1991, FCT.

Space-Efficient Parallel Merging

Christos Levcopoulos, Jyrki Katajainen, Ola Petersson, 1992, RAIRO Theor. Informatics Appl..

Minimum weight pseudo-triangulations

Joachim Gudmundsson, Christos Levcopoulos, 2007, Comput. Geom..

3D Rectangulations and Geometric Matrix Multiplication

Andrzej Lingas, Christos Levcopoulos, Peter Floderus, 2014, ISAAC.

Splitsort - An Adaptive Sorting Algorithm

Christos Levcopoulos, Ola Petersson, 1990, MFCS.

Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems

Andrzej Lingas, Rolf Klein, Christos Levcopoulos, 2014, LATIN.

Quickest Path Queries on Transportation Network

Joachim Gudmundsson, Christos Levcopoulos, Radwa El Shawi, 2012, CATS.

Adaptive Heapsort

Christos Levcopoulos, Ola Petersson, 1993, J. Algorithms.

Tight Time Bounds for the Minimum Local Convex Partition Problem

Christos Levcopoulos, Magdalene G. Borgelt, 2004, JCDCG.

Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees

Andrzej Lingas, Christos Levcopoulos, 1989, Optimal Algorithms.

Local Routing in Sparse and Lightweight Geometric Graphs pdf

Joachim Gudmundsson, Bengt J. Nilsson, Christos Levcopoulos, 2019, ISAAC.

Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems

Jörg-Rüdiger Sack, Andrzej Lingas, Christos Levcopoulos, 1989, Theor. Comput. Sci..

Restricted Mesh Simplification Using Edge Contractions

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2009, Int. J. Comput. Geom. Appl..

Heapsort - Adapted for Presorted Files

Christos Levcopoulos, Ola Petersson, 1989, WADS.

Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings

Christos Levcopoulos, Jesper Jansson, Leszek Antoni Gąsieniec, 2019, FCT.

On Optimal Parallel Algorithm for Sorting Presorted Files

Christos Levcopoulos, 1988, FSTTCS.

Space-Efficient Parallel Merging

Christos Levcopoulos, Jyrki Katajainen, Ola Petersson, 1992, PARLE.

On a Fire Fighter's Problem

Andrzej Lingas, Rolf Klein, Elmar Langetepe, 2019, Int. J. Found. Comput. Sci..

Sorting Shuffled Monotone Sequences

Christos Levcopoulos, Ola Petersson, 1994, Inf. Comput..

Approximate Distance Oracles for Graphs with Dense Clusters

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2004, ISAAC.

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners

Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos, 2002, SIAM J. Comput..

Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time

Christos Levcopoulos, Drago Krznaric, C. Levcopoulos, 1995, FSTTCS.

Improved Algorithms for Constructing Fault-Tolerant Spanners

Giri Narasimhan, Michiel H. M. Smid, Christos Levcopoulos, 2001, Algorithmica.

Splitsort - An Adaptive Sorting Algorithm

Christos Levcopoulos, Ola Petersson, C. Levcopoulos, 1990, Inf. Process. Lett..

Sorting Shuffled Monotone Sequences

Christos Levcopoulos, Ola Petersson, 1990, SWAT.

Approximate distance oracles for graphs with dense clusters

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2007, Comput. Geom..

A near-optimal heuristic for minimum weight triangulation of convex polygons

Christos Levcopoulos, Drago Krznaric, 1997, SODA '97.

Covering Polygons with Minimum Number of Rectangles

Andrzej Lingas, Christos Levcopoulos, 1984, STACS.

Minimum Geometric Spanning Trees

Christos Levcopoulos, 2008, Encyclopedia of Algorithms.

Efficient Assignment of Identities in Anonymous Populations pdf

Andrzej Lingas, Leszek Gasieniec, Christos Levcopoulos, 2021, International Conference on Principles of Distributed Systems.

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

Christos Levcopoulos, Jesper Jansson, Leszek Gąsieniec, 2021, J. Comput. Syst. Sci..

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

Andrzej Lingas, Leszek Gasieniec, Christos Levcopoulos, 2021, Journal of computer and system sciences (Print).

Online and Approximate Network Construction from Bounded Connectivity Constraints

Andrzej Lingas, Christos Levcopoulos, Jesper Jansson, 2021, CIAC.

Restricted mesh simplification using edge contractions

Joachim Gudmundsson, Christos Levcopoulos, Mattias Andersson, 2006 .

Covering a set of points with a minimum number of lines

Christos Levcopoulos, Magdalene Grantson Borgelt, 2006 .

On the maximum q-dependent set problem

Andrzej Lingas, Hristo Djidjev, Christos Levcopoulos, 2007 .

New results about the approximation behavior of the greedy triangulation

Christos Levcopoulos, 1986 .

A Fixed Parameter Algorithm for Minimum Weight Triangulation: Analysis and Experiments

Christian Borgelt, Christos Levcopoulos, Magdalene Grantson, 2005 .

Hardness Result for TSP with Neighborhoods

Joachim Gudmundsson, Christos Levcopoulos, Joachim Gudmundsson, 2000 .