Christos Levcopoulos Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Restricted Mesh Simplification Using Edge Contractions. Int. J. Comput. Geometry Appl. 19(3): 247-265 (2009)
2008
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos: Minimum Geometric Spanning Trees. Encyclopedia of Algorithms 2008
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos: Minimum Weight Triangulation. Encyclopedia of Algorithms 2008
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms 4(1): (2008)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMagdalene G. Borgelt, Christian Borgelt, Christos Levcopoulos: Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem. Int. J. Comput. Geometry Appl. 18(3): 185-220 (2008)
2007
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Approximate distance oracles for graphs with dense clusters. Comput. Geom. 37(3): 142-154 (2007)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos: Minimum weight pseudo-triangulations. Comput. Geom. 38(3): 139-153 (2007)
2006
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMagdalene Grantson, Christos Levcopoulos: Covering a Set of Points with a Minimum Number of Lines. CIAC 2006: 6-17
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Restricted Mesh Simplification Using Edge Contractions. COCOON 2006: 196-204
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRolf 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)
2005
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMagdalene Grantson, Christos Levcopoulos: Bounds on optimally triangulating connected subsets of the minimum weight convex partition. EWCG 2005: 13-16
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMagdalene Grantson, Christian Borgelt, Christos Levcopoulos: Minimum Weight Triangulation by Cutting Out Triangles. ISAAC 2005: 984-994
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Chips on wafers, or packing rectangles into grids. Comput. Geom. 30(2): 95-111 (2005)
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark 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)
2004
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos: Minimum Weight Pseudo-Triangulations. FSTTCS 2004: 299-310
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Approximate Distance Oracles for Graphs with Dense Clusters. ISAAC 2004: 53-64
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMagdalene Grantson, Christos Levcopoulos: A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem. JCDCG 2004: 83-94
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMagdalene Grantson, Christos Levcopoulos: Tight Time Bounds for the Minimum Local Convex Partition Problem. JCDCG 2004: 95-105
2003
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Chips on Wafers. WADS 2003: 412-423
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. Int. J. Comput. Geometry Appl. 13(4): 303-316 (2003)
2002
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark 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
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate Distance Oracles Revisited. ISAAC 2002: 357-368
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Balanced Partition of Minimum Spanning Trees. International Conference on Computational Science (3) 2002: 26-35
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Approximate distance oracles for geometric graphs. SODA 2002: 828-837
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell: Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains. SWAT 2002: 80-89
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica 32(1): 144-156 (2002)
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Thore Husfeldt, Christos Levcopoulos: Lower bounds for approximate polygon decomposition and minimum gap. Inf. Process. Lett. 81(3): 137-141 (2002)
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM J. Comput. 31(5): 1479-1500 (2002)
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDrago Krznaric, Christos Levcopoulos: Optimal algorithms for complete linkage clustering in d dimensions. Theor. Comput. Sci. 286(1): 139-149 (2002)
2001
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating a Minimum Manhattan Network. Nord. J. Comput. 8(2): 219-232 (2001)
2000
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Improved Greedy Algorithms for Constructing Sparse Geometric Spanners. SWAT 2000: 314-327
64no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos: A Parallel Approximation Algorithm for Minimum Weight Triangulation. Nord. J. Comput. 7(1): 32-57 (2000)
1999
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos: A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. COCOON 1999: 473-482
62no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan: Approximating Minimum Manhattan Networks. RANDOM-APPROX 1999: 28-38
61no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Drago Krznaric: The greedy triangulation can be computed from the Delaunay triangulation in linear time. Comput. Geom. 14(4): 197-220 (1999)
60no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos: Close Approximations of Minimum Rectangular Coverings. J. Comb. Optim. 3(4): 437-452 (1999)
59no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDrago Krznaric, Christos Levcopoulos, Bengt J. Nilsson: Minimum Spanning Trees in d Dimensions. Nord. J. Comput. 6(4): 446-461 (1999)
58no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos: A Fast Approximation Algorithm for TSP with Neighborhoods. Nord. J. Comput. 6(4): 469- (1999)
1998
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Christos Levcopoulos: A Parallel Approximation Algorithm for Minimum Weight Triangulation. FSTTCS 1998: 233-244
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid: Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. STOC 1998: 186-195
55no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Drago Krznaric: A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons. Algorithmica 21(3): 285-311 (1998)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDrago Krznaric, Christos Levcopoulos: Fast Algorithms for Complete Linkage Clustering. Discrete & Computational Geometry 19(1): 131-145 (1998)
53no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Drago Krznaric: Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. J. Algorithms 27(2): 303-338 (1998)
52no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDrago Krznaric, Christos Levcopoulos: Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time. Nord. J. Comput. 5(1): (1998)
1997
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDrago Krznaric, Christos Levcopoulos, Bengt J. Nilsson: Minimum Spanning Trees in d Dimensions. ESA 1997: 341-349
50no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Joachim Gudmundsson: A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract). FCT 1997: 305-316
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDrago Krznaric, Christos Levcopoulos: Optimal Algorithms for Complete Linkage Clustering in d Dimensions. MFCS 1997: 368-377
48no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Joachim Gudmundsson: Approximation Algorithms for Covering Polygons with Squares and Similar Problems. RANDOM 1997: 27-41
47no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Drago Krznaric: A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract). SODA 1997: 518-527
1996
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Joachim Gudmundsson: Close Approximation of Minimum Rectangular Coverings. FSTTCS 1996: 135-146
45no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Drago Krznaric: Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. SODA 1996: 392-401
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Anna Östlin: Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). SWAT 1996: 271-283
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Drago Krznaric: A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract). SWAT 1996: 296-308
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBengt Aspvall, Christos Levcopoulos, Andrzej Lingas, Robert Storlind: On 2-QBF Truth Testing in Parallel. Inf. Process. Lett. 57(2): 89-93 (1996)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Drago Krznaric: Tight Lower Bounds for Minimum Weight-Triangulation Heuristics. Inf. Process. Lett. 57(3): 129-135 (1996)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Ola Petersson: Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. Theor. Comput. Sci. 163(1&2): 211-238 (1996)
1995
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Andrzej Lingas, Cao Wang: On Parallel Complexity of Planar Triangulations. FSTTCS 1995: 413-427
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDrago Krznaric, Christos Levcopoulos: Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear Time. FSTTCS 1995: 443-455
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDrago Krznaric, Christos Levcopoulos: The First Subquadratic Algorithm for Complete Linkage Clustering. ISAAC 1995: 392-401
1994
36no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Ola Petersson: Sorting Shuffled Monotone Sequences Inf. Comput. 112(1): 37-50 (1994)
35no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Teresa M. Przytycka: A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem. Parallel Processing Letters 4: 37-43 (1994)
1993
34no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSvante Carlsson, Christos Levcopoulos, Ola Petersson: Sublinear Merging and Natural Mergesort. Algorithmica 9(6): 629-648 (1993)
33no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJyrki Katajainen, Christos Levcopoulos, Ola Petersson: Space-Efficient Parallel Merging. ITA 27(4): 295-310 (1993)
32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Ola Petersson: Adaptive Heapsort. J. Algorithms 14(3): 395-413 (1993)
1992
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJingsen Chen, Christos Levcopoulos: Improved Parallel Sorting of Presorted Sequences. CONPAR 1992: 539-544
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Andrzej Lingas: C-sensitive Triangulations Approximate the MinMax Length Triangulation. FSTTCS 1992: 104-115
29no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos 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)
28no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Andrzej Lingas: Fast Algorithms for Greedy Triangulation. BIT 32(2): 280-296 (1992)
27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Ola Petersson: Matching Parentheses in Parallel. Discrete Applied Mathematics 40(4): 423-431 (1992)
1991
26no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Ola Petersson: An Optimal Adaptive In-place Sorting Algorithm. FCT 1991: 329-338
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Andrzej Lingas: Greedy Triangulation Approximates the Optimum and Can Be Implemented in Linear Time in the Average Case. ICCI 1991: 139-148
24no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Ola Petersson: Splitsort - An Adaptive Sorting Algorithm. Inf. Process. Lett. 39(4): 205-211 (1991)
1990
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter: Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS 1990: 204-214
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Ola Petersson: Splitsort - An Adaptive Sorting Algorithm. MFCS 1990: 416-422
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSvante Carlsson, Christos Levcopoulos, Ola Petersson: Sublinear Merging and Natural Merge Sort. SIGAL International Symposium on Algorithms 1990: 251-260
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Ola Petersson: Sorting Shuffled Monotone Sequences. SWAT 1990: 181-191
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Andrzej Lingas: Fast Algorithms for Greedy Triangulation. SWAT 1990: 238-250
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPer-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: A Sublogarithmic Convex Hull Algorithm. BIT 30(3): 378-384 (1990)
1989
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJyrki Katajainen, Christos Levcopoulos, Ola Petersson: Local Insertion Sort Revisited. Optimal Algorithms 1989: 239-253
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos 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
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Ola Petersson: Heapsort - Adapted for Presorted Files. WADS 1989: 499-509
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Ola Petersson: A Note on Adaptive Parallel Sorting. Inf. Process. Lett. 33(4): 187-191 (1989)
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos 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)
1988
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos: On Optimal Parallel Algorithm for Sorting Presorted Files. FSTTCS 1988: 154-160
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Jyrki Katajainen, Andrzej Lingas: An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. SWAT 1988: 190-198
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Mark H. Overmars: A Balanced Search Tree with O (1) Worst-case Update Time. Acta Inf. 26(3): 269-277 (1988)
1987
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos: Improved Bounds for Covering General Polygons with Rectangles. FSTTCS 1987: 95-102
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack: Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract). ICALP 1987: 376-385
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Andrzej Lingas: On Approximation Behavior of the Greedy Triangulation for Convex Polygons. Algorithmica 2: 15-193 (1987)
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack: Algorithms for Minimum Length Partitions of Polygons. BIT 27(4): 474-479 (1987)
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos: An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation. Inf. Process. Lett. 25(4): 247-251 (1987)
1986
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos: Fast Heuristics for Minimum Length Rectangular Partitions of Polygons. Symposium on Computational Geometry 1986: 100-108
1985
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos: A fast heuristic for covering polygons by rectangles. FCT 1985: 269-278
1984
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Andrzej Lingas: Bounds on the Length of Convex Partitions of Polygons. FSTTCS 1984: 279-295
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos Levcopoulos, Andrzej Lingas: Covering Polygons with Minimum Number of Rectangles. STACS 1984: 63-72

Coauthor Index

1Mattias Andersson [73] [76] [77] [80] [83] [87] [90] [95]
2Bengt Aspvall [42]
3Mark de Berg [75] [82]
4Christian Borgelt [84] [91]
5Magdalene G. Borgelt (Magdalene Grantson) [78] [79] [84] [85] [88] [91]
6Svante Carlsson [21] [34]
7Jingsen Chen [31]
8Per-Olof Fjällström [18]
9Joachim Gudmundsson [46] [48] [50] [57] [58] [60] [62] [63] [64] [65] [66] [68] [69] [72] [73] [74] [75] [76] [77] [80] [81] [82] [83] [87] [89] [90] [92] [95]
10Thore Husfeldt [69]
11Jyrki Katajainen [11] [17] [18] [33]
12Matthew J. Katz (Matya Katz) [75] [82]
13Rolf Klein [86]
14Drago Krznaric [37] [38] [41] [43] [45] [47] [49] [51] [52] [53] [54] [55] [59] [61] [67]
15Andrzej Lingas [1] [2] [6] [7] [8] [11] [13] [16] [19] [23] [25] [28] [29] [30] [39] [42] [71] [86]
16Joseph S. B. Mitchell [71]
17Giri Narasimhan [56] [62] [65] [66] [68] [70] [72] [73] [74] [76] [92]
18Bengt J. Nilsson [51] [59]
19Mark H. Overmars [10] [75] [82]
20Anna Pagh (Anna Östlin) [44]
21Ola Petersson [14] [15] [17] [18] [20] [21] [22] [23] [24] [26] [27] [32] [33] [34] [36] [40]
22Teresa M. Przytycka [35]
23Wojciech Rytter [23]
24Jörg-Rüdiger Sack [6] [8] [13]
25Michiel H. M. Smid [56] [70] [72] [74] [92]
26A. Frank van der Stappen [75] [82]
27Robert Storlind [42]
28Cao Wang [39]

Colors in the list of coauthors

Copyright © Wed Nov 25 14:46:41 2009 by Michael Ley (ley@uni-trier.de)