default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristos Levcopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j54]Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. 139: 103476 (2024)- [i10]Jesper Jansson
, Christos Levcopoulos, Andrzej Lingas:
The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(log n) Deterministic Rounds on the Congested Clique. CoRR abs/2404.06068 (2024) - 2023
- [j53]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Online and Approximate Network Construction from Bounded Connectivity Constraints. Int. J. Found. Comput. Sci. 34(5): 453-468 (2023) - [c64]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CCCG 2023: 183-189 - [i9]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. CoRR abs/2305.09987 (2023) - 2022
- [j52]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. Algorithmica 84(5): 1316-1340 (2022) - [i8]Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. CoRR abs/2202.01567 (2022) - 2021
- [j51]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson:
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases. J. Comput. Syst. Sci. 118: 108-118 (2021) - [j50]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos:
Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019). J. Comput. Syst. Sci. 120: 177-178 (2021) - [c63]Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Online and Approximate Network Construction from Bounded Connectivity Constraints. CIAC 2021: 314-325 - [c62]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Efficient Assignment of Identities in Anonymous Populations. OPODIS 2021: 12:1-12:21 - [i7]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Efficient Assignment of Identities in Anonymous Populations. CoRR abs/2105.12083 (2021)
2010 – 2019
- 2019
- [j49]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the circle. Comput. Geom. 79: 37-54 (2019) - [j48]Rolf Klein, Elmar Langetepe, Barbara Schwarzwald, Christos Levcopoulos, Andrzej Lingas:
On a Fire Fighter's Problem. Int. J. Found. Comput. Sci. 30(2): 231-246 (2019) - [c61]Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson:
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases. FAW 2019: 156-169 - [c60]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. ISAAC 2019: 30:1-30:13 - [e1]Leszek Antoni Gasieniec, Jesper Jansson, Christos Levcopoulos:
Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings. Lecture Notes in Computer Science 11651, Springer 2019, ISBN 978-3-030-25026-3 [contents] - [i6]Vikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen:
Local Routing in Sparse and Lightweight Geometric Graphs. CoRR abs/1909.10215 (2019) - 2018
- [j47]Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu:
3D Rectangulations and Geometric Matrix Multiplication. Algorithmica 80(1): 136-154 (2018) - [j46]Rolf Klein, Christos Levcopoulos, Andrzej Lingas:
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. Algorithms 11(4): 45 (2018) - 2017
- [j45]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama:
Efficiently Correcting Matrix Products. Algorithmica 79(2): 428-443 (2017) - [c59]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the Circle. ISAAC 2017: 9:1-9:13 - [c58]Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors). SOFSEM 2017: 229-240 - 2016
- [r4]Christos Levcopoulos:
Minimum Geometric Spanning Trees. Encyclopedia of Algorithms 2016: 1315-1318 - [r3]Christos Levcopoulos:
Minimum Weight Triangulation. Encyclopedia of Algorithms 2016: 1325-1328 - [i5]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas, Rasmus Pagh, Takeshi Tokuyama:
Efficiently Correcting Matrix Products. CoRR abs/1602.00435 (2016) - [i4]Sang Won Bae, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Christos Levcopoulos:
Shortcuts for the Circle. CoRR abs/1612.02412 (2016) - 2015
- [c57]Rolf Klein, Elmar Langetepe, Christos Levcopoulos:
A Fire Fighter's Problem. SoCG 2015: 768-780 - 2014
- [j44]Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos:
Quickest path queries on transportation network. Comput. Geom. 47(7): 695-709 (2014) - [j43]Christos Levcopoulos, Andrzej Lingas:
A note on a QPTAS for maximum weight triangulation of planar point sets. Inf. Process. Lett. 114(8): 414-416 (2014) - [c56]Christos Levcopoulos, Andrzej Lingas, Bengt J. Nilsson, Pawel Zylinski:
Clearing Connections by Few Agents. FUN 2014: 289-300 - [c55]Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas:
Efficiently Correcting Matrix Products. ISAAC 2014: 53-64 - [c54]Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu:
3D Rectangulations and Geometric Matrix Multiplication. ISAAC 2014: 65-78 - [c53]Rolf Klein, Christos Levcopoulos, Andrzej Lingas:
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. LATIN 2014: 261-272 - [i3]Rolf Klein, Elmar Langetepe, Christos Levcopoulos:
A Fire Fighter's Problem. CoRR abs/1412.6065 (2014) - 2012
- [c52]Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos:
Quickest Path Queries on Transportation Network. CATS 2012: 37-46 - 2010
- [i2]Radwa El Shawi, Joachim Gudmundsson, Christos Levcopoulos:
Quickest Path Queries on Transportation Network. CoRR abs/1012.0634 (2010)
2000 – 2009
- 2009
- [j42]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Restricted Mesh Simplification Using Edge Contractions. Int. J. Comput. Geom. Appl. 19(3): 247-265 (2009) - 2008
- [j41]Magdalene G. Borgelt, Christian Borgelt, Christos Levcopoulos:
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem. Int. J. Comput. Geom. Appl. 18(3): 185-220 (2008) - [j40]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate distance oracles for geometric spanners. ACM Trans. Algorithms 4(1): 10:1-10:34 (2008) - [r2]Christos Levcopoulos:
Minimum Geometric Spanning Trees. Encyclopedia of Algorithms 2008 - [r1]Christos Levcopoulos:
Minimum Weight Triangulation. Encyclopedia of Algorithms 2008 - 2007
- [j39]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Approximate distance oracles for graphs with dense clusters. Comput. Geom. 37(3): 142-154 (2007) - [j38]Joachim Gudmundsson, Christos Levcopoulos:
Minimum weight pseudo-triangulations. Comput. Geom. 38(3): 139-153 (2007) - 2006
- [j37]Rolf Klein, Christos Levcopoulos, Andrzej Lingas:
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation. Comput. Geom. 34(1): 28-34 (2006) - [c51]Magdalene Grantson, Christos Levcopoulos:
Covering a Set of Points with a Minimum Number of Lines. CIAC 2006: 6-17 - [c50]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Restricted Mesh Simplification Using Edge Contractions. COCOON 2006: 196-204 - 2005
- [j36]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Chips on wafers, or packing rectangles into grids. Comput. Geom. 30(2): 95-111 (2005) - [j35]Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
TSP with neighborhoods of varying size. J. Algorithms 57(1): 22-36 (2005) - [c49]Magdalene Grantson, Christian Borgelt, Christos Levcopoulos:
Minimum Weight Triangulation by Cutting Out Triangles. ISAAC 2005: 984-994 - [i1]Magdalene Grantson, Christos Levcopoulos:
Bounds on optimally triangulating connected subsets of the minimum weight convex partition. EuroCG 2005: 13-16 - 2004
- [c48]Joachim Gudmundsson, Christos Levcopoulos:
Minimum Weight Pseudo-Triangulations. FSTTCS 2004: 299-310 - [c47]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Approximate Distance Oracles for Graphs with Dense Clusters. ISAAC 2004: 53-64 - [c46]Magdalene Grantson, Christos Levcopoulos:
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem. JCDCG 2004: 83-94 - [c45]Magdalene Grantson, Christos Levcopoulos:
Tight Time Bounds for the Minimum Local Convex Partition Problem. JCDCG 2004: 95-105 - 2003
- [j34]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geom. Appl. 13(4): 303-316 (2003) - [c44]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Chips on Wafers. WADS 2003: 412-423 - 2002
- [j33]Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica 32(1): 144-156 (2002) - [j32]Joachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos:
Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81(3): 137-141 (2002) - [j31]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31(5): 1479-1500 (2002) - [j30]Drago Krznaric, Christos Levcopoulos:
Optimal algorithms for complete linkage clustering in d dimensions. Theor. Comput. Sci. 286(1): 139-149 (2002) - [c43]Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
TSP with Neighborhoods of Varying Size. ESA 2002: 187-199 - [c42]Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002: 26-35 - [c41]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate Distance Oracles Revisited. ISAAC 2002: 357-368 - [c40]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Approximate distance oracles for geometric graphs. SODA 2002: 828-837 - [c39]Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell:
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. SWAT 2002: 80-89 - 2001
- [j29]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Approximating a Minimum Manhattan Network. Nord. J. Comput. 8(2): 219-232 (2001) - 2000
- [j28]Joachim Gudmundsson, Christos Levcopoulos:
A Parallel Approximation Algorithm for Minimum Weight Triangulation. Nord. J. Comput. 7(1): 32-57 (2000) - [c38]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. SWAT 2000: 314-327
1990 – 1999
- 1999
- [j27]Christos Levcopoulos, Drago Krznaric:
The greedy triangulation can be computed from the Delaunay triangulation in linear time. Comput. Geom. 14(4): 197-220 (1999) - [j26]Joachim Gudmundsson, Christos Levcopoulos:
Close Approximations of Minimum Rectangular Coverings. J. Comb. Optim. 3(4): 437-452 (1999) - [j25]Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson:
Minimum Spanning Trees in d Dimensions. Nord. J. Comput. 6(4): 446-461 (1999) - [j24]Joachim Gudmundsson, Christos Levcopoulos:
A Fast Approximation Algorithm for TSP with Neighborhoods. Nord. J. Comput. 6(4): 469- (1999) - [c37]Joachim Gudmundsson, Christos Levcopoulos:
A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. COCOON 1999: 473-482 - [c36]Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Approximating Minimum Manhattan Networks. RANDOM-APPROX 1999: 28-38 - 1998
- [j23]Christos Levcopoulos, Drago Krznaric:
A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons. Algorithmica 21(3): 285-311 (1998) - [j22]Drago Krznaric, Christos Levcopoulos:
Fast Algorithms for Complete Linkage Clustering. Discret. Comput. Geom. 19(1): 131-145 (1998) - [j21]Christos Levcopoulos, Drago Krznaric:
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. J. Algorithms 27(2): 303-338 (1998) - [j20]Drago Krznaric, Christos Levcopoulos:
Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time. Nord. J. Comput. 5(1) (1998) - [c35]Joachim Gudmundsson, Christos Levcopoulos:
A Parallel Approximation Algorithm for Minimum Weight Triangulation. FSTTCS 1998: 233-244 - [c34]Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. STOC 1998: 186-195 - 1997
- [c33]Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson:
Minimum Spanning Trees in d Dimensions. ESA 1997: 341-349 - [c32]Christos Levcopoulos, Joachim Gudmundsson:
A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). FCT 1997: 305-316 - [c31]Drago Krznaric, Christos Levcopoulos:
Optimal Algorithms for Complete Linkage Clustering in d Dimensions. MFCS 1997: 368-377 - [c30]Christos Levcopoulos, Joachim Gudmundsson:
Approximation Algorithms for Covering Polygons with Squares and Similar Problems. RANDOM 1997: 27-41 - [c29]Christos Levcopoulos, Drago Krznaric:
A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract). SODA 1997: 518-527 - 1996
- [j19]Bengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind:
On 2-QBF Truth Testing in Parallel. Inf. Process. Lett. 57(2): 89-93 (1996) - [j18]Christos Levcopoulos, Drago Krznaric:
Tight Lower Bounds for Minimum Weight-Triangulation Heuristics. Inf. Process. Lett. 57(3): 129-135 (1996) - [j17]Christos Levcopoulos, Ola Petersson:
Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. Theor. Comput. Sci. 163(1&2): 211-238 (1996) - [c28]Christos Levcopoulos, Joachim Gudmundsson:
Close Approximation of Minimum Rectangular Coverings. FSTTCS 1996: 135-146 - [c27]Christos Levcopoulos, Drago Krznaric:
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. SODA 1996: 392-401 - [c26]Christos Levcopoulos, Anna Östlin:
Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). SWAT 1996: 271-283 - [c25]Christos Levcopoulos, Drago Krznaric:
A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract). SWAT 1996: 296-308 - 1995
- [c24]Christos Levcopoulos, Andrzej Lingas, Cao Wang:
On Parallel Complexity of Planar Triangulations. FSTTCS 1995: 413-427 - [c23]Drago Krznaric, Christos Levcopoulos:
Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time. FSTTCS 1995: 443-455 - [c22]Drago Krznaric, Christos Levcopoulos:
The First Subquadratic Algorithm for Complete Linkage Clustering. ISAAC 1995: 392-401 - 1994
- [j16]Christos Levcopoulos, Ola Petersson:
Sorting Shuffled Monotone Sequences. Inf. Comput. 112(1): 37-50 (1994) - [j15]Christos Levcopoulos, Teresa M. Przytycka:
A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem. Parallel Process. Lett. 4: 37-43 (1994) - 1993
- [j14]Svante Carlsson, Christos Levcopoulos, Ola Petersson:
Sublinear Merging and Natural Mergesort. Algorithmica 9(6): 629-648 (1993) - [j13]Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
Space-Efficient Parallel Merging. RAIRO Theor. Informatics Appl. 27(4): 295-310 (1993) - [j12]Christos Levcopoulos, Ola Petersson:
Adaptive Heapsort. J. Algorithms 14(3): 395-413 (1993) - 1992
- [j11]Christos Levcopoulos, Andrzej Lingas:
There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees. Algorithmica 8(3): 251-256 (1992) - [j10]Christos Levcopoulos, Andrzej Lingas:
Fast Algorithms for Greedy Triangulation. BIT 32(2): 280-296 (1992) - [j9]Christos Levcopoulos, Ola Petersson:
Matching Parentheses in Parallel. Discret. Appl. Math. 40(4): 423-431 (1992) - [c21]Jingsen Chen, Christos Levcopoulos:
Improved Parallel Sorting of Presorted Sequences. CONPAR 1992: 539-544 - [c20]Christos Levcopoulos, Andrzej Lingas:
C-sensitive Triangulations Approximate the MinMax Length Triangulation. FSTTCS 1992: 104-115 - [c19]Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
Space-Efficient Parallel Merging. PARLE 1992: 37-49 - 1991
- [j8]Christos Levcopoulos, Ola Petersson:
Splitsort - An Adaptive Sorting Algorithm. Inf. Process. Lett. 39(4): 205-211 (1991) - [c18]Christos Levcopoulos, Ola Petersson:
An Optimal Adaptive In-place Sorting Algorithm. FCT 1991: 329-338 - [c17]Christos Levcopoulos, Andrzej Lingas:
Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. ICCI 1991: 139-148 - 1990
- [j7]Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
A Sublogarithmic Convex Hull Algorithm. BIT 30(3): 378-384 (1990) - [c16]Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter:
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS 1990: 204-214 - [c15]Christos Levcopoulos, Ola Petersson:
Splitsort - An Adaptive Sorting Algorithm. MFCS 1990: 416-422 - [c14]Svante Carlsson, Christos Levcopoulos, Ola Petersson:
Sublinear Merging and Natural Merge Sort. SIGAL International Symposium on Algorithms 1990: 251-260 - [c13]Christos Levcopoulos, Ola Petersson:
Sorting Shuffled Monotone Sequences. SWAT 1990: 181-191 - [c12]Christos Levcopoulos, Andrzej Lingas:
Fast Algorithms for Greedy Triangulation. SWAT 1990: 238-250
1980 – 1989
- 1989
- [j6]Christos Levcopoulos, Ola Petersson:
A Note on Adaptive Parallel Sorting. Inf. Process. Lett. 33(4): 187-191 (1989) - [j5]Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack:
Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. Theor. Comput. Sci. 66(2): 181-203 (1989) - [c11]Christos Levcopoulos, Andrzej Lingas:
Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees. Optimal Algorithms 1989: 9-13 - [c10]Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
Local Insertion Sort Revisited. Optimal Algorithms 1989: 239-253 - [c9]Christos Levcopoulos, Ola Petersson:
Heapsort - Adapted for Presorted Files. WADS 1989: 499-509 - 1988
- [j4]Christos Levcopoulos, Mark H. Overmars:
A Balanced Search Tree with O (1) Worst-case Update Time. Acta Informatica 26(3): 269-277 (1988) - [c8]Christos Levcopoulos:
On Optimal Parallel Algorithm for Sorting Presorted Files. FSTTCS 1988: 154-160 - [c7]Christos Levcopoulos, Jyrki Katajainen, Andrzej Lingas:
An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. SWAT 1988: 190-198 - 1987
- [j3]Christos Levcopoulos, Andrzej Lingas:
On Approximation Behavior of the Greedy Triangulation for Convex Polygons. Algorithmica 2: 15-193 (1987) - [j2]Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack:
Algorithms for Minimum Length Partitions of Polygons. BIT 27(4): 474-479 (1987) - [j1]Christos Levcopoulos:
An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation. Inf. Process. Lett. 25(4): 247-251 (1987) - [c6]Christos Levcopoulos:
Improved Bounds for Covering General Polygons with Rectangles. FSTTCS 1987: 95-102 - [c5]Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack:
Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). ICALP 1987: 376-385 - 1986
- [c4]Christos Levcopoulos:
Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. SCG 1986: 100-108 - 1985
- [c3]Christos Levcopoulos:
A fast heuristic for covering polygons by rectangles. FCT 1985: 269-278 - 1984
- [c2]Christos Levcopoulos, Andrzej Lingas:
Bounds on the Length of Convex Partitions of Polygons. FSTTCS 1984: 279-295 - [c1]Christos Levcopoulos, Andrzej Lingas:
Covering Polygons with Minimum Number of Rectangles. STACS 1984: 63-72
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
