Christos Levcopoulos

Int. J. Found. Comput. Sci., August, 2023

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

[BibT_eX]

[DOI]

Jesper Jansson

CoRR, 2023

2022

Perpetual maintenance of machines with different urgency requirements.

[BibT_eX]

[DOI]

CoRR, 2022

Local Routing in Sparse and Lightweight Geometric Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2022

2021

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

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

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

[BibT_eX]

[DOI]

Leszek Gasieniec

Jesper Jansson

J. Comput. Syst. Sci., 2021

Efficient Assignment of Identities in Anonymous Populations.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2019

On a Fire Fighter's Problem.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

Shortcuts for the circle.

[BibT_eX]

[DOI]

Comput. Geom., 2019

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

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018

Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems.

[BibT_eX]

[DOI]

Rolf Klein

Algorithms, 2018

3D Rectangulations and Geometric Matrix Multiplication.

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

Efficiently Correcting Matrix Products.

[BibT_eX]

[DOI]

Algorithmica, 2017

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

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2016

Minimum Weight Triangulation.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Minimum Geometric Spanning Trees.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

2015

A Fire Fighter's Problem.

[BibT_eX]

[DOI]

Rolf Klein

Elmar Langetepe

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Quickest path queries on transportation network.

[BibT_eX]

[DOI]

Radwa El Shawi

Comput. Geom., 2014

Efficiently Correcting Matrix Products.

[BibT_eX]

[DOI]

Leszek Gasieniec

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Clearing Connections by Few Agents.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2009

Restricted Mesh Simplification Using Edge Contractions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2009

2008

Minimum Weight Triangulation.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Minimum Geometric Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximate distance oracles for geometric spanners.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem.

[BibT_eX]

[DOI]

Magdalene G. Borgelt

Christian Borgelt

Int. J. Comput. Geom. Appl., 2008

2007

Minimum weight pseudo-triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Approximate distance oracles for graphs with dense clusters.

[BibT_eX]

[DOI]

Comput. Geom., 2007

2006

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

[BibT_eX]

[DOI]

Rolf Klein

Comput. Geom., 2006

Covering a Set of Points with a Minimum Number of Lines.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

TSP with neighborhoods of varying size.

[BibT_eX]

[DOI]

A. Frank van der Stappen

J. Algorithms, 2005

Chips on wafers, or packing rectangles into grids.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Minimum Weight Triangulation by Cutting Out Triangles.

[BibT_eX]

[DOI]

Christian Borgelt

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

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

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004

Tight Time Bounds for the Minimum Local Convex Partition Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

2003

Balanced Partition of Minimum Spanning Trees.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2003

Chips on Wafers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002

Optimal algorithms for complete linkage clustering in d dimensions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Lower bounds for approximate polygon decomposition and minimum gap.

[BibT_eX]

[DOI]

Thore Husfeldt

Inf. Process. Lett., 2002

Improved Algorithms for Constructing Fault-Tolerant Spanners.

[BibT_eX]

[DOI]

Michiel H. M. Smid

Algorithmica, 2002

Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Proceedings of the Algorithm Theory, 2002

Approximate distance oracles for geometric graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Approximate Distance Oracles Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Approximating a Minimum Manhattan Network.

[BibT_eX]

[DOI]

Nord. J. Comput., 2001

2000

A Parallel Approximation Algorithm for Minimum Weight Triangulation.

[BibT_eX]

Nord. J. Comput., 2000

Improved Greedy Algorithms for Constructing Sparse Geometric Spanners.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

1999

Minimum Spanning Trees in d Dimensions.

[BibT_eX]

Bengt J. Nilsson

Nord. J. Comput., 1999

A Fast Approximation Algorithm for TSP with Neighborhoods.

[BibT_eX]

Nord. J. Comput., 1999

Close Approximations of Minimum Rectangular Coverings.

[BibT_eX]

[DOI]

J. Comb. Optim., 1999

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

[BibT_eX]

[DOI]

Comput. Geom., 1999

Approximating Minimum Manhattan Networks.

[BibT_eX]

[DOI]

Proceedings of the Randomization, 1999

A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time.

[BibT_eX]

Nord. J. Comput., 1998

Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation.

[BibT_eX]

[DOI]

J. Algorithms, 1998

Fast Algorithms for Complete Linkage Clustering.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

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

[BibT_eX]

[DOI]

Algorithmica, 1998

Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners.

[BibT_eX]

[DOI]

Michiel H. M. Smid

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997

A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Approximation Algorithms for Covering Polygons with Squares and Similar Problems.

[BibT_eX]

[DOI]

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

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

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Minimum Spanning Trees in <i>d</i> Dimensions.

[BibT_eX]

[DOI]

Bengt J. Nilsson

Proceedings of the Algorithms, 1997

1996

Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Tight Lower Bounds for Minimum Weight-Triangulation Heuristics.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

On 2-QBF Truth Testing in Parallel.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

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

[BibT_eX]

[DOI]

Anna Östlin

Proceedings of the Algorithm Theory, 1996

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

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1996

Close Approximation of Minimum Rectangular Coverings.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995

The First Subquadratic Algorithm for Complete Linkage Clustering.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

On Parallel Complexity of Planar Triangulations.

[BibT_eX]

[DOI]

Cao Wang

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

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

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

1994

Sorting Shuffled Monotone Sequences

[BibT_eX]

[DOI]

Inf. Comput., July, 1994

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

[BibT_eX]

[DOI]

Teresa M. Przytycka

Parallel Process. Lett., 1994

1993

Adaptive Heapsort.

[BibT_eX]

[DOI]

J. Algorithms, 1993

Space-Efficient Parallel Merging.

[BibT_eX]

[DOI]

Jyrki Katajainen

RAIRO Theor. Informatics Appl., 1993

Sublinear Merging and Natural Mergesort.

[BibT_eX]

[DOI]

Svante Carlsson

Algorithmica, 1993

1992

Matching Parentheses in Parallel.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Fast Algorithms for Greedy Triangulation.

[BibT_eX]

[DOI]

BIT, 1992

There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees.

[BibT_eX]

[DOI]

Algorithmica, 1992

C-sensitive Triangulations Approximate the MinMax Length Triangulation.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

Improved Parallel Sorting of Presorted Sequences.

[BibT_eX]

[DOI]

Jingsen Chen

Proceedings of the Parallel Processing: CONPAR 92, 1992

1991

Splitsort - An Adaptive Sorting Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing and Information, 1991

An Optimal Adaptive In-place Sorting Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

A Sublogarithmic Convex Hull Algorithm.

[BibT_eX]

[DOI]

BIT, 1990

Sublinear Merging and Natural Merge Sort.

[BibT_eX]

[DOI]

Svante Carlsson

Proceedings of the Algorithms, 1990

Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1989

Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems.

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

Theor. Comput. Sci., 1989

A Note on Adaptive Parallel Sorting.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Heapsort - Adapted for Presorted Files.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

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

[BibT_eX]

[DOI]

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Local Insertion Sort Revisited.

[BibT_eX]

[DOI]

Jyrki Katajainen

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

1988

A Balanced Search Tree with <i> O </i> (1) Worst-case Update Time.

[BibT_eX]

[DOI]

Mark H. Overmars

Acta Informatica, 1988

An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams.

[BibT_eX]

[DOI]

Jyrki Katajainen

Proceedings of the SWAT 88, 1988

On Optimal Parallel Algorithm for Sorting Presorted Files.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

1987

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

Algorithms for Minimum Length Partitions of Polygons.

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

BIT, 1987

On Approximation Behavior of the Greedy Triangulation for Convex Polygons.

[BibT_eX]

[DOI]

Algorithmica, 1987

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

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Improved Bounds for Covering General Polygons with Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986

Fast Heuristics for Minimum Length Rectangular Partitions of Polygons.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

A fast heuristic for covering polygons by rectangles.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Covering Polygons with Minimum Number of Rectangles.

[BibT_eX]

[DOI]

Proceedings of the STACS 84, 1984

Bounds on the Length of Convex Partitions of Polygons.

[BibT_eX]

[DOI]