| Publication | Date of Publication | Type |
|---|
| Optimal energetic paths for electric cars | 2025-01-06 | Paper |
| The unweighted and weighted reverse shortest path problem for disk graphs | 2025-01-06 | Paper |
| Expander decomposition with fewer inter-cluster edges using a spectral cut player | 2024-11-14 | Paper |
| Fast approximation of search trees on trees with centroid trees | 2024-11-14 | Paper |
| Dynamic binary search trees: improved lower bounds for the greedy-future Algorithm | 2024-10-08 | Paper |
| Selection from heaps, row-sorted matrices, and \(X+Y\) using soft heaps | 2024-08-26 | Paper |
| Online weighted matching with a sample | 2024-07-19 | Paper |
| Simulating a stack using queues | 2024-07-19 | Paper |
| Adversarially robust streaming algorithms via differential privacy | 2024-06-06 | Paper |
| Insertion-only dynamic connectivity in general disk graphs | 2024-05-29 | Paper |
| Minimum-cost paths for electric cars | 2024-05-29 | Paper |
| Almost tight bounds for online facility location in the random-order model | 2024-05-14 | Paper |
| Dynamic connectivity in disk graphs | 2024-05-14 | Paper |
| Dynamic connectivity in disk graphs | 2024-01-09 | Paper |
| Algorithms and complexity of sandwich problems in graphs (extended abstract) | 2024-01-05 | Paper |
| Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds | 2023-12-08 | Paper |
| Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations | 2023-11-02 | Paper |
| How to Find a Point in the Convex Hull Privately | 2023-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875724 | 2023-02-03 | Paper |
| Simple confluently persistent catenable lists | 2022-12-09 | Paper |
| Fast approximation of search trees on trees with centroid trees | 2022-09-16 | Paper |
| Differentially Private Learning of Geometric Concepts | 2022-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091042 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091276 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091017 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088935 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075809 | 2022-05-11 | Paper |
| Separating adaptive streaming from oblivious streaming using the bounded storage model | 2022-04-22 | Paper |
| Pairing heaps: the forward variant. | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009581 | 2021-08-04 | Paper |
| Min-Cost Bipartite Perfect Matching with Delays | 2021-07-28 | Paper |
| Union of Hypercubes and 3D Minkowski Sums with Random Sizes. | 2021-07-28 | Paper |
| Stabbing pairwise intersecting disks by five points | 2021-06-14 | Paper |
| Clustering in Hypergraphs to Minimize Average Edge Service Time | 2021-05-03 | Paper |
| Union of hypercubes and 3D Minkowski sums with random sizes | 2021-04-29 | Paper |
| Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time | 2021-04-14 | Paper |
| Competitive Analysis with a Sample and the Secretary Problem | 2021-02-02 | Paper |
| Output sensitive algorithms for approximate incidences and their applications | 2021-01-07 | Paper |
| Restoration by path concatenation: fast recovery of MPLS paths | 2020-12-03 | Paper |
| Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications | 2020-10-23 | Paper |
| Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location | 2020-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111688 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111741 | 2020-05-27 | Paper |
| Clustering in Hypergraphs to Minimize Average Edge Service Time | 2020-05-27 | Paper |
| Reachability oracles for directed transmission graphs | 2020-04-01 | Paper |
| Faster k -SAT algorithms using biased-PPSZ | 2020-01-30 | Paper |
| Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points | 2019-10-25 | Paper |
| A sort of an adversary | 2019-10-15 | Paper |
| Reach for A*: Efficient Point-to-Point Shortest Path Algorithms | 2019-09-11 | Paper |
| Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles | 2019-06-20 | Paper |
| Computing the Discrete Fréchet Distance in Subquadratic Time | 2019-05-15 | Paper |
| Reporting Neighbors in High-Dimensional Euclidean Space | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743404 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633941 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633823 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633857 | 2019-05-06 | Paper |
| Adjacency Labeling Schemes and Induced-Universal Graphs | 2019-01-16 | Paper |
| Hollow Heaps | 2018-11-12 | Paper |
| Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles | 2018-11-05 | Paper |
| Kinetic and dynamic data structures for closest pair and all nearest neighbors | 2018-11-05 | Paper |
| Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications | 2018-11-05 | Paper |
| Thin heaps, thick heaps | 2018-11-05 | Paper |
| The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection | 2018-10-30 | Paper |
| Spanners for Directed Transmission Graphs | 2018-08-21 | Paper |
| Upward Max-Min Fairness | 2018-08-02 | Paper |
| (1 + ∊)-Approximate f-Sensitive Distance Oracles | 2018-07-16 | Paper |
| Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications | 2018-07-16 | Paper |
| Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays | 2018-07-16 | Paper |
| Approximating the k-Level in Three-Dimensional Plane Arrangements | 2018-07-16 | Paper |
| Improved bounds for multipass pairing heaps and path-balanced binary search trees | 2018-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643859 | 2018-05-29 | Paper |
| The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection | 2018-04-23 | Paper |
| Routing in unit disk graphs | 2018-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607914 | 2018-03-15 | Paper |
| Approximating the k-Level in Three-Dimensional Plane Arrangements | 2018-02-26 | Paper |
| Minimum-cost flows in unit-capacity networks | 2018-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601879 | 2018-01-24 | Paper |
| Guarding a terrain by two watchtowers | 2017-10-20 | Paper |
| Spanners and Reachability Oracles for Directed Transmission Graphs | 2017-10-10 | Paper |
| The amortized cost of finding the minimum | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351928 | 2017-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955012 | 2017-01-24 | Paper |
| Unique maximum matching algorithms | 2016-09-29 | Paper |
| Connection caching | 2016-09-29 | Paper |
| Exploiting regularities in web traffic patterns for cache replacement | 2016-09-29 | Paper |
| Routing in unit disk graphs | 2016-05-03 | Paper |
| Restoration by path concatenation, fast recovery of MPLS paths | 2016-03-04 | Paper |
| Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions | 2016-02-03 | Paper |
| Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search | 2015-11-19 | Paper |
| The Temp Secretary Problem | 2015-11-19 | Paper |
| Weak ε-nets and interval chains | 2015-11-11 | Paper |
| Hollow Heaps | 2015-10-27 | Paper |
| On the Complexity of Hub Labeling (Extended Abstract) | 2015-09-16 | Paper |
| Adjacency Labeling Schemes and Induced-Universal Graphs | 2015-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501812 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501254 | 2015-08-03 | Paper |
| The CB tree: a practical concurrent self-adjusting search tree | 2015-02-23 | Paper |
| Union of random minkowski sums and network vulnerability analysis | 2015-02-17 | Paper |
| Private coresets | 2015-02-04 | Paper |
| Minimal indices for predecessor search | 2015-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934665 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934578 | 2014-12-18 | Paper |
| Optimal dynamic vertical ray shooting in rectilinear planar subdivisions | 2014-11-18 | Paper |
| Union of random Minkowski sums and network vulnerability analysis | 2014-11-14 | Paper |
| Reporting neighbors in high-dimensional Euclidean space | 2014-11-14 | Paper |
| Data structures for mergeable trees | 2014-09-09 | Paper |
| Finding the largest empty disk containing a query point | 2014-08-11 | Paper |
| Finding the maximal empty disk containing a query point | 2014-08-07 | Paper |
| Computing the Discrete Fréchet Distance in Subquadratic Time | 2014-07-30 | Paper |
| Algorithms and estimators for summarization of unaggregated data streams | 2014-06-10 | Paper |
| A kinetic triangulation scheme for moving points in the plane | 2014-04-03 | Paper |
| Summarizing data using bottom-k sketches | 2014-03-13 | Paper |
| Soft heaps simplified | 2013-11-14 | Paper |
| Scheduling Subset Tests: One-Time, Continuous, and How They Relate | 2013-10-04 | Paper |
| What You Can Do with Coordinated Samples | 2013-10-04 | Paper |
| Minimal Indices for Successor Search | 2013-09-20 | Paper |
| Joint Cache Partition and Job Assignment on Multi-core Processors | 2013-08-12 | Paper |
| CBTree: A Practical Concurrent Self-Adjusting Search Tree | 2013-03-13 | Paper |
| I/O efficient dynamic data structures for longest prefix queries | 2013-03-05 | Paper |
| Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique | 2012-10-15 | Paper |
| Unit distances in three dimensions | 2012-09-04 | Paper |
| Envy-free makespan approximation | 2012-05-30 | Paper |
| An optimal dynamic data structure for stabbing-semigroup queries | 2012-05-30 | Paper |
| Optimal Cover of Points by Disks in a Simple Polygon | 2012-03-15 | Paper |
| Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums | 2012-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113677 | 2012-01-23 | Paper |
| A simpler linear-time recognition of circular-arc graphs | 2011-11-07 | Paper |
| Maximum Flows by Incremental Breadth-First Search | 2011-09-16 | Paper |
| Maximum flow in directed planar graphs with vertex capacities | 2011-08-16 | Paper |
| On lines, joints, and incidences in three dimensions | 2011-04-11 | Paper |
| Line Transversals of Convex Polyhedra in $\mathbb{R}^3$ | 2011-04-04 | Paper |
| The overlay of minimization diagrams in a randomized incremental construction | 2011-03-31 | Paper |
| A kinetic triangulation scheme for moving points in the plane | 2011-03-25 | Paper |
| Range minima queries with respect to a random permutation, and approximate range counting | 2011-03-10 | Paper |
| On lines and joints | 2010-11-08 | Paper |
| Labeling Dynamic XML Trees | 2010-11-04 | Paper |
| Guarding a terrain by two watchtowers | 2010-09-16 | Paper |
| Optimal Cover of Points by Disks in a Simple Polygon | 2010-09-06 | Paper |
| Optimal oblivious routing in polynomial time | 2010-08-16 | Paper |
| Dynamic rectangular intersection with priorities | 2010-08-16 | Paper |
| Learning with attribute costs | 2010-08-16 | Paper |
| Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579389 | 2010-08-06 | Paper |
| Meldable heaps and boolean union-find | 2010-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574264 | 2010-07-09 | Paper |
| Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs | 2010-04-28 | Paper |
| Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals | 2010-04-06 | Paper |
| The greedy algorithm for edit distance with moves | 2009-12-18 | Paper |
| Maximum Flow in Directed Planar Graphs with Vertex Capacities | 2009-10-29 | Paper |
| The greedy algorithm for shortest superstrings | 2009-08-27 | Paper |
| Linear data structures for fast ray-shooting amidst convex polyhedra | 2009-08-27 | Paper |
| Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems | 2009-08-20 | Paper |
| Efficient Colored Orthogonal Range Counting | 2009-06-22 | Paper |
| On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations | 2009-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602886 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601522 | 2009-02-10 | Paper |
| Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs | 2008-12-21 | Paper |
| Path Minima in Incremental Unrooted Trees | 2008-11-25 | Paper |
| Processing top-\(k\) queries from samples | 2008-10-08 | Paper |
| Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra | 2008-09-25 | Paper |
| Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs | 2008-09-04 | Paper |
| I/O Efficient Dynamic Data Structures for Longest Prefix Queries | 2008-07-15 | Paper |
| Most Burrows-Wheeler Based Compressors Are Not Optimal | 2008-06-17 | Paper |
| A simpler analysis of Burrows-Wheeler-based compression | 2007-12-19 | Paper |
| Strong Price of Anarchy for Machine Load Balancing | 2007-11-28 | Paper |
| Online Conflict‐Free Coloring for Intervals | 2007-10-22 | Paper |
| A Simpler Analysis of Burrows-Wheeler Based Compression | 2007-09-14 | Paper |
| A Simpler Linear-Time Recognition of Circular-Arc Graphs | 2007-09-07 | Paper |
| Finding the Position of the k-Mismatch and Approximate Tandem Repeats | 2007-09-07 | Paper |
| Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213] | 2007-07-16 | Paper |
| Associative search in peer to peer networks: Harnessing latent semantics | 2007-04-26 | Paper |
| Spatially-decaying aggregation over a network | 2007-04-26 | Paper |
| Compact labeling scheme for XML ancestor queries | 2007-02-14 | Paper |
| Kinetic and dynamic data structures for convex hulls and upper envelopes | 2006-12-14 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Compact Labeling Scheme for Ancestor Queries | 2006-06-01 | Paper |
| Partial alphabetic trees | 2006-04-28 | Paper |
| On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems | 2005-08-01 | Paper |
| Sorting signed permutations by reversals, revisited | 2005-05-04 | Paper |
| Performance aspects of distributed caches using TTL-based consistency | 2005-04-06 | Paper |
| Balanced-Replication Algorithms for Distribution Trees | 2005-02-21 | Paper |
| Nearest common ancestors: a survey and a new algorithm for a distributed environment | 2005-02-08 | Paper |
| Purely functional, real-time deques with catenation | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828911 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829035 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829033 | 2004-11-29 | Paper |
| Optimal oblivious routing in polynomial time | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471366 | 2004-07-28 | Paper |
| Making data structures confluently persistent | 2004-03-14 | Paper |
| Reachability and Distance Queries via 2-Hop Labels | 2003-09-28 | Paper |
| Connection caching: Model and algorithms. | 2003-08-19 | Paper |
| Proactive caching of DNS records: Addressing a performance bottleneck. | 2003-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411351 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411367 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252418 | 2003-05-04 | Paper |
| Scalable secure storage when half the system is faulty | 2003-01-14 | Paper |
| Competitive analysis of the LRFU paging algorithm | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778559 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778550 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542546 | 2002-09-17 | Paper |
| Exploiting regularities in web traffic patterns for cache replacement | 2002-06-17 | Paper |
| A new rounding procedure for the assignment problem with applications to dense graph arrangement problems | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535061 | 2002-06-12 | Paper |
| Caching documents with variable sizes and fetching costs: an LP-based approach | 2002-05-21 | Paper |
| Unique maximum matching algorithms | 2002-04-08 | Paper |
| Compact labeling schemes for ancestor queries. (Extended abstract) | 2002-01-30 | Paper |
| Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract) | 2002-01-30 | Paper |
| Making data structures confluently persistent. (Extended abstract) | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234055 | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754178 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252327 | 2000-11-12 | Paper |
| Simple Confluently Persistent Catenable Lists | 2000-10-18 | Paper |
| Bounded degree interval sandwich problems | 2000-04-03 | Paper |
| A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals | 2000-03-19 | Paper |
| Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228472 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252388 | 1999-09-15 | Paper |
| Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques | 1996-12-11 | Paper |
| Graph Sandwich Problems | 1996-05-27 | Paper |
| On the complexity of DNA physical mapping | 1994-11-23 | Paper |
| The domatic number problem on some perfect graph families | 1994-05-19 | Paper |
