| Publication | Date of Publication | Type |
|---|
| Classification via two-way comparisons (extended abstract) | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147391 | 2024-01-15 | Paper |
| A Simple Algorithm for Optimal Search Trees with Two-way Comparisons | 2023-10-31 | Paper |
| Designing multi-commodity flow trees | 2023-01-18 | Paper |
| On Huang and Wong's algorithm for generalized binary split trees | 2022-10-24 | Paper |
| On the cost of unsuccessful searches in search trees with two-way comparisons | 2021-11-25 | Paper |
| First Come First Served for Online Slot Allocation and Huffman Coding | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743438 | 2019-05-10 | Paper |
| Accelerating the discovery of unsupervised-shapelets | 2019-05-03 | Paper |
| Prefix codes: Equiprobable words, unequal letter costs | 2019-04-29 | Paper |
| A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees | 2019-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635998 | 2018-04-23 | Paper |
| Rounding algorithms for a geometric embedding of minimum multiway cut | 2016-09-29 | Paper |
| Low degree spanning trees of small weight | 2016-09-01 | Paper |
| Simple strategies for large zero-sum games with applications to complexity theory | 2016-09-01 | Paper |
| Orienting graphs to optimize reachability | 2016-06-01 | Paper |
| Optimal Search Trees with 2-Way Comparisons | 2016-01-11 | Paper |
| On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms | 2015-09-02 | Paper |
| A nearly linear-time PTAS for explicit fractional packing and covering linear programs | 2015-01-19 | Paper |
| Hamming Approximation of NP Witnesses | 2014-10-06 | Paper |
| Polynomial-time approximation scheme for data broadcast | 2014-09-26 | Paper |
| Distributed and parallel algorithms for weighted vertex cover and other covering problems | 2014-07-23 | Paper |
| On a Linear Program for Minimum-Weight Triangulation | 2014-06-04 | Paper |
| Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost | 2013-05-16 | Paper |
| Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme | 2012-09-12 | Paper |
| Distributed algorithms for covering, packing and maximum weighted matching | 2012-02-06 | Paper |
| Huffman coding with unequal letter costs | 2010-08-05 | Paper |
| The reverse greedy algorithm for the metric k-median problem | 2009-12-18 | Paper |
| Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality | 2009-11-19 | Paper |
| Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost | 2009-07-14 | Paper |
| Oblivious Medians Via Online Bidding | 2008-09-18 | Paper |
| Incremental medians via online bidding | 2008-04-23 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Approximation algorithms for covering/packing integer programs | 2005-12-07 | Paper |
| Rounding algorithms for a geometric embedding of minimum multiway cut | 2005-11-11 | Paper |
| On-line file caching | 2002-06-17 | Paper |
| On-Line Paging Against Adversarially Biased Random Inputs | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234153 | 2001-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263721 | 2001-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952604 | 2001-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250209 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250168 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252370 | 1999-01-01 | Paper |
| Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic | 1998-10-21 | Paper |
| A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees | 1998-09-20 | Paper |
| Prefix Codes: Equiprobable Words, Unequal Letter Costs | 1997-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335209 | 1997-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335208 | 1997-08-03 | Paper |
| On strongly connected digraphs with bounded cycle length | 1997-04-07 | Paper |
| Low-Degree Spanning Trees of Small Weight | 1996-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886046 | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875198 | 1996-06-18 | Paper |
| Balancing minimum spanning trees and shortest-path trees | 1996-03-11 | Paper |
| Approximating the Minimum Equivalent Digraph | 1995-11-01 | Paper |
| A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers | 1994-11-30 | Paper |
| Designing multi-commodity flow trees | 1994-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140426 | 1994-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138959 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010308 | 1992-09-27 | Paper |
| Faster parametric shortest path and minimum‐balance algorithms | 1991-01-01 | Paper |
