| Publication | Date of Publication | Type |
|---|
| Connected \(k\)-center and \(k\)-diameter clustering | 2024-11-14 | Paper |
| Connected \(k\)-center and \(k\)-diameter clustering | 2024-10-24 | Paper |
| Minimum-error triangulations for sea surface reconstruction | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6182149 | 2023-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6090891 | 2023-11-20 | Paper |
| The smoothed number of Pareto-optimal solutions in bicriteria integer optimization | 2023-05-25 | Paper |
| Noisy, Greedy and Not so Greedy k-Means++ | 2023-02-07 | Paper |
| Smoothed Analysis of Pareto Curves in Multiobjective Optimization | 2022-02-04 | Paper |
| Probabilistic analysis of online (class-constrained) bin packing and bin covering | 2020-02-12 | Paper |
| Analysis of Ward's Method | 2019-10-15 | Paper |
| Smoothed Analysis of Local Search for the Maximum-Cut Problem | 2019-06-20 | Paper |
| Smoothed Analysis of the Successive Shortest Path Algorithm | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633855 | 2019-05-06 | Paper |
| New deterministic algorithms for solving parity games | 2019-01-14 | Paper |
| The Alternating Stock Size Problem and the Gasoline Puzzle | 2018-11-13 | Paper |
| Smoothed Analysis of Local Search for the Maximum-Cut Problem | 2018-11-05 | Paper |
| Smoothed Analysis of the 2-Opt Algorithm for the General TSP | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606344 | 2018-03-02 | Paper |
| Improved analysis of complete-linkage clustering | 2017-10-10 | Paper |
| The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization | 2017-05-19 | Paper |
| Worst-case and smoothed analysis of k-means clustering with Bregman divergences | 2017-03-09 | Paper |
| Bounds for the Convergence Time of Local Search in Scheduling Problems | 2017-02-10 | Paper |
| Solving Totally Unimodular LPs with the Shadow Vertex Algorithm | 2017-01-24 | Paper |
| Polynomial kernels for weighted problems | 2016-11-14 | Paper |
| New deterministic algorithms for solving parity games | 2016-05-03 | Paper |
| Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering | 2016-05-03 | Paper |
| Smoothed Analysis of the Successive Shortest Path Algorithm | 2015-12-11 | Paper |
| Improved Analysis of Complete-Linkage Clustering | 2015-11-19 | Paper |
| Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem | 2015-11-19 | Paper |
| On the impact of combinatorial structure on congestion games | 2015-11-11 | Paper |
| Economical Caching | 2015-09-24 | Paper |
| Polynomial kernels for weighted problems | 2015-09-16 | Paper |
| Improved smoothed analysis of multiobjective optimization | 2015-08-14 | Paper |
| Internet routing between autonomous systems: fast algorithms for path trading | 2015-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934725 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191602 | 2014-10-06 | Paper |
| Smoothed performance guarantees for local search | 2014-08-29 | Paper |
| k-Means Has Polynomial Smoothed Complexity | 2014-07-25 | Paper |
| Smoothed Analysis of Multiobjective Optimization | 2014-07-25 | Paper |
| Improved smoothed analysis of multiobjective optimization | 2014-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405114 | 2014-04-01 | Paper |
| Evaluation of online strategies for reordering buffers | 2014-04-01 | Paper |
| Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP | 2014-03-25 | Paper |
| Smoothed Analysis of the k-Means Method | 2014-02-17 | Paper |
| A bad instance for \texttt{k-means++} | 2014-01-16 | Paper |
| Smoothed analysis of belief propagation for minimum-cost flow and matching | 2013-11-28 | Paper |
| Finding Short Paths on Polytopes by the Shadow Vertex Algorithm | 2013-08-06 | Paper |
| Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching | 2013-04-12 | Paper |
| Computing approximate Nash equilibria in network congestion games | 2012-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389993 | 2012-04-24 | Paper |
| Competitive routing over time | 2011-10-10 | Paper |
| Smoothed Performance Guarantees for Local Search | 2011-09-16 | Paper |
| Lower Bounds for the Smoothed Number of Pareto Optimal Solutions | 2011-07-01 | Paper |
| A Bad Instance for k-Means++ | 2011-07-01 | Paper |
| Uncoordinated Two-Sided Matching Markets | 2011-05-17 | Paper |
| The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers | 2011-02-15 | Paper |
| A Unified Approach to Congestion Games and Two-Sided Markets | 2010-07-09 | Paper |
| Worst-case and smoothed analysis of \(k\)-means clustering with Bregman divergences | 2009-12-17 | Paper |
| Agnostic clustering | 2009-12-01 | Paper |
| Pure Nash equilibria in player-specific and weighted congestion games | 2009-04-29 | Paper |
| Computing Approximate Nash Equilibria in Network Congestion Games | 2008-07-10 | Paper |
| The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization | 2007-11-29 | Paper |
| Evaluation of Online Strategies for Reordering Buffers | 2007-09-14 | Paper |
| Smoothed Analysis of Integer Programming | 2007-08-30 | Paper |
| Decision-making based on approximate and smoothed Pareto curves | 2007-07-09 | Paper |
| Smoothed analysis of integer programming | 2007-04-19 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
