| Publication | Date of Publication | Type |
|---|
Close approximations of minimum rectangular coverings (extended abstract)
| 2024-07-05 | Paper |
Efficient assignment of identities in anonymous populations
| 2024-04-15 | Paper |
Perpetual maintenance of machines with different urgency requirements
Journal of Computer and System Sciences | 2023-10-24 | Paper |
Online and Approximate Network Construction from Bounded Connectivity Constraints
International Journal of Foundations of Computer Science | 2023-08-18 | Paper |
Online and approximate network construction from bounded connectivity constraints
| 2023-03-22 | Paper |
The first subquadratic algorithm for complete linkage clustering
| 2023-03-21 | Paper |
Local Routing in Sparse and Lightweight Geometric Graphs
| 2023-02-03 | Paper |
Fast algorithms for greedy triangulation
SWAT 90 | 2022-12-09 | Paper |
A linear-time heuristic for minimum rectangular coverings (Extended abstract)
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Linear-time heuristics for minimum weight rectangulation
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
A fast heuristic for approximating the minimum weight triangulation
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Sorting shuffled monotone sequences
SWAT 90 | 2022-12-09 | Paper |
Local routing in sparse and lightweight geometric graphs
Algorithmica | 2022-05-03 | Paper |
Minimum spanning trees in \(d\) dimensions
| 2021-12-20 | Paper |
Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases
Journal of Computer and System Sciences | 2021-03-10 | Paper |
Shortcuts for the circle
| 2020-11-25 | Paper |
Approximation algorithms for the geometric firefighter and budget fence problems
Algorithms | 2019-10-29 | Paper |
Pushing the online matrix-vector conjecture off-line and identifying its easy cases
| 2019-10-11 | Paper |
On a fire fighter's problem
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Shortcuts for the circle
Computational Geometry | 2019-03-20 | Paper |
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms | 2018-11-05 | Paper |
3D rectangulations and geometric matrix multiplication
Algorithmica | 2018-02-28 | Paper |
A fire fighter's problem
| 2017-10-10 | Paper |
Efficiently correcting matrix products
Algorithmica | 2017-10-10 | Paper |
Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time
Lecture Notes in Computer Science | 2017-01-19 | Paper |
On parallel complexity of planar triangulations
Lecture Notes in Computer Science | 2017-01-19 | Paper |
3D rectangulations and geometric matrix multiplication
Algorithms and Computation | 2015-09-11 | Paper |
Efficiently correcting matrix products
Algorithms and Computation | 2015-09-11 | Paper |
scientific article; zbMATH DE number 6472628 (Why is no real title available?)
| 2015-08-14 | Paper |
Quickest path queries on transportation network
Computational Geometry | 2014-06-27 | Paper |
A note on a QPTAS for maximum weight triangulation of planar point sets
Information Processing Letters | 2014-04-30 | Paper |
Approximation algorithms for the geometric firefighter and budget fence problems
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Chips on wafers (extended abstract)
Lecture Notes in Computer Science | 2010-04-20 | Paper |
RESTRICTED MESH SIMPLIFICATION USING EDGE CONTRACTIONS
International Journal of Computational Geometry & Applications | 2009-07-20 | Paper |
FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
International Journal of Computational Geometry & Applications | 2008-08-26 | Paper |
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem
Discrete and Computational Geometry | 2008-03-18 | Paper |
Tight Time Bounds for the Minimum Local Convex Partition Problem
Discrete and Computational Geometry | 2008-03-18 | Paper |
Minimum weight pseudo-triangulations
Computational Geometry | 2007-10-12 | Paper |
Restricted Mesh Simplification Using Edge Contractions
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Approximate distance oracles for graphs with dense clusters
Computational Geometry | 2007-06-04 | Paper |
Covering a Set of Points with a Minimum Number of Lines
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
Computational Geometry | 2006-04-28 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
TSP with neighborhoods of varying size
Journal of Algorithms | 2005-11-16 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Chips on wafers, or packing rectangles into grids
Computational Geometry | 2005-01-31 | Paper |
scientific article; zbMATH DE number 2119744 (Why is no real title available?)
| 2004-11-29 | Paper |
BALANCED PARTITION OF MINIMUM SPANNING TREES
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
scientific article; zbMATH DE number 2089211 (Why is no real title available?)
| 2004-08-12 | Paper |
Balanced Partition of Minimum Spanning Trees
Lecture Notes in Computer Science | 2004-08-12 | Paper |
scientific article; zbMATH DE number 1979513 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1947392 (Why is no real title available?)
| 2003-07-08 | Paper |
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing | 2002-09-29 | Paper |
scientific article; zbMATH DE number 1775403 (Why is no real title available?)
| 2002-09-17 | Paper |
Optimal algorithms for complete linkage clustering in \(d\) dimensions
Theoretical Computer Science | 2002-08-13 | Paper |
Lower bounds for approximate polygon decomposition and minimum gap
Information Processing Letters | 2002-07-14 | Paper |
Improved algorithms for constructing fault-tolerant spanners
Algorithmica | 2002-05-20 | Paper |
Approximating a minimum Manhattan network
Nordic Journal of Computing | 2001-10-14 | Paper |
scientific article; zbMATH DE number 1617269 (Why is no real title available?)
| 2001-07-11 | Paper |
scientific article; zbMATH DE number 1496856 (Why is no real title available?)
| 2001-03-25 | Paper |
The greedy triangulation can be computed from the Delaunay triangulation in linear time
Computational Geometry | 2000-10-22 | Paper |
Close approximations of minimum rectangular coverings
Journal of Combinatorial Optimization | 2000-09-04 | Paper |
scientific article; zbMATH DE number 1436138 (Why is no real title available?)
| 2000-06-21 | Paper |
scientific article; zbMATH DE number 1436136 (Why is no real title available?)
| 2000-04-26 | Paper |
scientific article; zbMATH DE number 1302028 (Why is no real title available?)
| 2000-01-18 | Paper |
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
Journal of Algorithms | 1998-12-02 | Paper |
A linear-time approximation scheme for minimum weight triangulation of convex polygons
Algorithmica | 1998-08-02 | Paper |
scientific article; zbMATH DE number 1156715 (Why is no real title available?)
| 1998-05-26 | Paper |
Fast algorithms for complete linkage clustering
Discrete & Computational Geometry | 1998-03-11 | Paper |
Exploiting few inversions when sorting: Sequential and parallel algorithms
Theoretical Computer Science | 1997-09-10 | Paper |
On 2-QBF truth testing in parallel
Information Processing Letters | 1997-02-28 | Paper |
scientific article; zbMATH DE number 871937 (Why is no real title available?)
| 1996-04-28 | Paper |
Sorting shuffled monotone sequences
Information and Computation | 1995-02-13 | Paper |
Space-efficient parallel merging
RAIRO - Theoretical Informatics and Applications | 1993-11-15 | Paper |
Sublinear merging and natural mergesort
Algorithmica | 1993-06-29 | Paper |
Adaptive Heapsort
Journal of Algorithms | 1993-06-29 | Paper |
Matching parentheses in parallel
Discrete Applied Mathematics | 1993-05-16 | Paper |
scientific article; zbMATH DE number 140492 (Why is no real title available?)
| 1993-03-28 | Paper |
Fast algorithms for greedy triangulation
BIT | 1992-12-14 | Paper |
There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
Algorithmica | 1992-09-27 | Paper |
Splitsort -- an adaptive sorting algorithm
Information Processing Letters | 1992-06-27 | Paper |
scientific article; zbMATH DE number 4213426 (Why is no real title available?)
| 1990-01-01 | Paper |
A sublogarithmic convex hull algorithm
BIT | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4213471 (Why is no real title available?)
| 1990-01-01 | Paper |
A note on adaptive parallel sorting
Information Processing Letters | 1989-01-01 | Paper |
Heuristics for optimum binary search trees and minimum weight triangulation problems
Theoretical Computer Science | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4155926 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4155867 (Why is no real title available?)
| 1989-01-01 | Paper |
A balanced search tree O(1) worst-case update time
Acta Informatica | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4090817 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4062598 (Why is no real title available?)
| 1988-01-01 | Paper |
On approximation behavior of the greedy triangulation for convex polygons
Algorithmica | 1987-01-01 | Paper |
Algorithms for minimum length partitions of polygons
BIT | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4049039 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4047146 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3893101 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3918386 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3872705 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3883609 (Why is no real title available?)
| 1984-01-01 | Paper |
