| Publication | Date of Publication | Type |
|---|
| Scheduling on a graph with release times | 2024-04-02 | Paper |
| Labelled trees and pairs of input-output permutations in priority queues | 2024-01-05 | Paper |
| The multi-weighted spanning tree problem | 2023-12-12 | Paper |
| A Simple Algorithm for Optimal Search Trees with Two-way Comparisons | 2023-10-31 | Paper |
| Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows | 2023-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875491 | 2023-02-03 | Paper |
| Dynamic closest pairs — A probabilistic approach | 2022-12-09 | Paper |
| On Huang and Wong's algorithm for generalized binary split trees | 2022-10-24 | Paper |
| Minmax regret for sink location on dynamic flow paths with general capacities | 2022-04-29 | Paper |
| Scheduling with gaps: new models and algorithms | 2021-12-13 | Paper |
| On the cost of unsuccessful searches in search trees with two-way comparisons | 2021-11-25 | Paper |
| Dynamic Trees with Almost-Optimal Access Cost | 2021-08-04 | Paper |
| Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries | 2021-04-08 | Paper |
| Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems | 2020-11-25 | Paper |
| The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract) | 2019-09-16 | Paper |
| Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities | 2019-08-20 | Paper |
| A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding | 2019-05-06 | Paper |
| Prefix codes: Equiprobable words, unequal letter costs | 2019-04-29 | Paper |
| Exact asymptotics of divide-and-conquer recurrences | 2019-03-29 | Paper |
| The transfer matrices and the capacity of the 2-dimensional \((1, \infty)\)-runlength limited constraint | 2019-02-20 | Paper |
| A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs | 2019-01-10 | Paper |
| The probabilistic complexity of the Voronoi diagram of points on a polyhedron | 2018-11-23 | Paper |
| Sink Evacuation on Trees with Dynamic Confluent Flows | 2018-04-19 | Paper |
| Curve reconstruction from noisy samples | 2017-09-29 | Paper |
| Improved algorithms for computing \(k\)-sink on dynamic flow path networks | 2017-09-22 | Paper |
| A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property | 2017-07-27 | Paper |
| Optimal Search Trees with 2-Way Comparisons | 2016-01-11 | Paper |
| Encoding 2D range maximum queries | 2015-12-08 | Paper |
| Multiple sink location problems in dynamic path networks | 2015-12-08 | Paper |
| The channel capacity of read/write isolated memory | 2015-12-07 | Paper |
| Scheduling with Gaps: New Models and Algorithms | 2015-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501337 | 2015-08-03 | Paper |
| Minimax regret 1-sink location problem in dynamic path networks | 2015-06-11 | Paper |
| Multiple Sink Location Problems in Dynamic Path Networks | 2015-05-20 | Paper |
| Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity | 2015-01-15 | Paper |
| Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity | 2014-02-18 | Paper |
| Vehicle Scheduling on a Graph Revisited | 2013-03-21 | Paper |
| Paging mobile users in cellular networks: optimality versus complexity and simplicity | 2013-02-19 | Paper |
| Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme | 2012-09-12 | Paper |
| Encoding 2D range maximum queries | 2011-12-16 | Paper |
| The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity | 2010-08-16 | Paper |
| Huffman coding with unequal letter costs | 2010-08-05 | Paper |
| The asymptotic number of spanning trees in circulant graphs | 2010-04-27 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Online dynamic programming speedups | 2009-09-02 | Paper |
| More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding | 2009-02-24 | Paper |
| The number of spanning trees in a class of double fixed-step loop networks | 2008-10-08 | Paper |
| More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding | 2008-05-27 | Paper |
| Online Dynamic Programming Speedups | 2008-02-21 | Paper |
| The two‐median problem on Manhattan meshes | 2007-05-23 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Online maintenance of \(k\)-medians and \(k\)-covers on a line | 2006-09-26 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Chebyshev polynomials and spanning tree formulas for circulant and related graphs | 2005-09-22 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Curve reconstruction from noisy samples | 2005-05-04 | Paper |
| Fun-Sort -- or the chaos of unordered binary search | 2005-02-23 | Paper |
| Competitive facility location: the Voronoi game | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818864 | 2004-09-24 | Paper |
| New upper and lower bounds on the channel capacity of read/write isolated memory | 2004-08-06 | Paper |
| Optimal point-to-point broadcast algorithms via lopsided trees | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428932 | 2003-09-22 | Paper |
| Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets | 2003-09-07 | Paper |
| On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes | 2003-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553235 | 2002-11-04 | Paper |
| Lopsided trees. I: Analyses | 2002-08-01 | Paper |
| An algorithm for finding a \(k\)-median in a directed tree | 2002-07-25 | Paper |
| Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property | 2002-07-11 | Paper |
| A combinatorial approach to Golomb forests | 2001-08-20 | Paper |
| The number of spanning trees in circulant graphs | 2000-12-03 | Paper |
| Dog Bites Postman | 2000-11-07 | Paper |
| A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes | 2000-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252022 | 2000-04-06 | Paper |
| On the Expected Depth of Random Circuits | 2000-03-07 | Paper |
| A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs | 1999-11-21 | Paper |
| Labelled trees and pairs of input--output permutations in priority queues | 1999-01-12 | Paper |
| Randomized Data Structures for the Dynamic Closest-Pair Problem | 1998-09-20 | Paper |
| Prefix Codes: Equiprobable Words, Unequal Letter Costs | 1997-11-18 | Paper |
| Queries on Voronoi diagrams on moving points | 1997-03-03 | Paper |
| Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4834461 | 1996-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875192 | 1996-06-18 | Paper |
| A provably fast linear-expected-time maxima-finding algorithm | 1995-10-29 | Paper |
| Mellin transforms and asymptotics. The mergesort recurrence | 1994-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140433 | 1994-11-29 | Paper |
| Queue-mergesort | 1994-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140439 | 1993-12-15 | Paper |
| How many maxima can there be? | 1993-06-29 | Paper |
