| Publication | Date of Publication | Type |
|---|
Improved algorithms for optimal k sink location on path networks
Theoretical Computer Science | 2025-04-16 | Paper |
A polynomial time algorithm for constructing optimal binary AIFV-2 codes
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
| Fully dynamic \(k\)-center in low dimensions via approximate furthest neighbors | 2024-05-29 | Paper |
Scheduling on a graph with release times
Journal of Scheduling | 2024-04-02 | Paper |
Labelled trees and pairs of input-output permutations in priority queues
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
The multi-weighted spanning tree problem
Lecture Notes in Computer Science | 2023-12-12 | Paper |
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
Algorithmica | 2023-06-28 | Paper |
| scientific article; zbMATH DE number 7650102 (Why is no real title available?) | 2023-02-03 | Paper |
Dynamic closest pairs — A probabilistic approach
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
On Huang and Wong's algorithm for generalized binary split trees
Acta Informatica | 2022-10-24 | Paper |
Minmax regret for sink location on dynamic flow paths with general capacities
Discrete Applied Mathematics | 2022-04-29 | Paper |
Scheduling with gaps: new models and algorithms
Journal of Scheduling | 2021-12-13 | Paper |
On the cost of unsuccessful searches in search trees with two-way comparisons
Information and Computation | 2021-11-25 | Paper |
Dynamic Trees with Almost-Optimal Access Cost
(available as arXiv preprint) | 2021-08-04 | Paper |
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries
Theoretical Computer Science | 2021-04-08 | Paper |
Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems
(available as arXiv preprint) | 2020-11-25 | Paper |
The asymptotic number of spanning trees in circulant graphs (extended abstract)
2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Minmax regret k-sink location on a dynamic path network with uniform capacities
Algorithmica | 2019-08-20 | Paper |
A generic top-down dynamic-programming approach to prefix-free coding
(available as arXiv preprint) | 2019-05-06 | Paper |
| A generic top-down dynamic-programming approach to prefix-free coding | 2019-05-06 | Paper |
Prefix codes: equiprobable words, unequal letter costs
Automata, Languages and Programming | 2019-04-29 | Paper |
Exact asymptotics of divide-and-conquer recurrences
Automata, Languages and Programming | 2019-03-29 | Paper |
The transfer matrices and the capacity of the 2-dimensional (1, )-runlength limited constraint
Discrete Mathematics | 2019-02-20 | Paper |
A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
Automata, Languages and Programming | 2019-01-10 | Paper |
The probabilistic complexity of the Voronoi diagram of points on a polyhedron
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Sink Evacuation on Trees with Dynamic Confluent Flows
(available as arXiv preprint) | 2018-04-19 | Paper |
Curve reconstruction from noisy samples
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Improved algorithms for computing \(k\)-sink on dynamic flow path networks
(available as arXiv preprint) | 2017-09-22 | Paper |
A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Optimal Search Trees with 2-Way Comparisons
Algorithms and Computation | 2016-01-11 | Paper |
Multiple sink location problems in dynamic path networks
Theoretical Computer Science | 2015-12-08 | Paper |
Encoding 2D range maximum queries
Theoretical Computer Science | 2015-12-08 | Paper |
The channel capacity of read/write isolated memory
Discrete Applied Mathematics | 2015-12-07 | Paper |
Scheduling with gaps: new models and algorithms
Lecture Notes in Computer Science | 2015-09-21 | Paper |
| Algorithms for infinite Huffman-codes | 2015-08-03 | Paper |
Minimax regret 1-sink location problem in dynamic path networks
Theoretical Computer Science | 2015-06-11 | Paper |
Multiple sink location problems in dynamic path networks
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Minimax regret sink location problem in dynamic tree networks with uniform capacity
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
Algorithms and Computation | 2014-02-18 | Paper |
Vehicle scheduling on a graph revisited
Algorithms and Computation | 2013-03-21 | Paper |
Paging mobile users in cellular networks: optimality versus complexity and simplicity
Theoretical Computer Science | 2013-02-19 | Paper |
Huffman coding with letter costs: a linear-time approximation scheme
SIAM Journal on Computing | 2012-09-12 | Paper |
Encoding 2D range maximum queries
Lecture Notes in Computer Science | 2011-12-16 | Paper |
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Huffman coding with unequal letter costs
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
The asymptotic number of spanning trees in circulant graphs
Discrete Mathematics | 2010-04-27 | Paper |
Discrete and Computational Geometry
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Online dynamic programming speedups
Theory of Computing Systems | 2009-09-02 | Paper |
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
The number of spanning trees in a class of double fixed-step loop networks
Networks | 2008-10-08 | Paper |
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding
Algorithms and Computation | 2008-05-27 | Paper |
Online Dynamic Programming Speedups
Approximation and Online Algorithms | 2008-02-21 | Paper |
The two‐median problem on Manhattan meshes
Networks | 2007-05-23 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Online maintenance of k-medians and k-covers on a line
Algorithmica | 2006-09-26 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Chebyshev polynomials and spanning tree formulas for circulant and related graphs
Discrete Mathematics | 2005-09-22 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Curve reconstruction from noisy samples
Computational Geometry | 2005-05-04 | Paper |
Fun-Sort -- or the chaos of unordered binary search
Discrete Applied Mathematics | 2005-02-23 | Paper |
Competitive facility location: the Voronoi game
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2102776 (Why is no real title available?) | 2004-09-24 | Paper |
New upper and lower bounds on the channel capacity of read/write isolated memory
Discrete Applied Mathematics | 2004-08-06 | Paper |
Optimal point-to-point broadcast algorithms via lopsided trees
Discrete Applied Mathematics | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 1984566 (Why is no real title available?) | 2003-09-22 | Paper |
Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets
Designs, Codes and Cryptography | 2003-09-07 | Paper |
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
Computational Geometry | 2003-05-27 | Paper |
| scientific article; zbMATH DE number 1798165 (Why is no real title available?) | 2002-11-04 | Paper |
Lopsided trees. I: Analyses
Algorithmica | 2002-08-01 | Paper |
An algorithm for finding a k-median in a directed tree
Information Processing Letters | 2002-07-25 | Paper |
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
Journal of Algorithms | 2002-07-11 | Paper |
A combinatorial approach to Golomb forests
Theoretical Computer Science | 2001-08-20 | Paper |
The number of spanning trees in circulant graphs
Discrete Mathematics | 2000-12-03 | Paper |
Dog Bites Postman
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
| scientific article; zbMATH DE number 1305081 (Why is no real title available?) | 2000-04-06 | Paper |
On the Expected Depth of Random Circuits
Combinatorics, Probability and Computing | 2000-03-07 | Paper |
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Labelled trees and pairs of input--output permutations in priority queues
Theoretical Computer Science | 1999-01-12 | Paper |
Randomized Data Structures for the Dynamic Closest-Pair Problem
SIAM Journal on Computing | 1998-09-20 | Paper |
Prefix Codes: Equiprobable Words, Unequal Letter Costs
SIAM Journal on Computing | 1997-11-18 | Paper |
Queries on Voronoi diagrams on moving points
Computational Geometry | 1997-03-03 | Paper |
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
Information Processing Letters | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 759411 (Why is no real title available?) | 1996-11-10 | Paper |
| scientific article; zbMATH DE number 871921 (Why is no real title available?) | 1996-06-18 | Paper |
A provably fast linear-expected-time maxima-finding algorithm
Algorithmica | 1995-10-29 | Paper |
Mellin transforms and asymptotics. The mergesort recurrence
Acta Informatica | 1994-12-18 | Paper |
| scientific article; zbMATH DE number 437555 (Why is no real title available?) | 1994-11-29 | Paper |
Queue-mergesort
Information Processing Letters | 1994-02-24 | Paper |
| scientific article; zbMATH DE number 437560 (Why is no real title available?) | 1993-12-15 | Paper |
How many maxima can there be?
Computational Geometry | 1993-06-29 | Paper |
