| Publication | Date of Publication | Type |
|---|
| Connected \(k\)-center and \(k\)-diameter clustering | 2024-11-14 | Paper |
Connected \(k\)-center and \(k\)-diameter clustering
Algorithmica | 2024-10-24 | Paper |
| Minimum-error triangulations for sea surface reconstruction | 2024-05-14 | Paper |
Minimum-error triangulations for sea surface reconstruction
(available as arXiv preprint) | 2023-12-20 | Paper |
| Minimum-error triangulations for sea surface reconstruction | 2023-12-20 | Paper |
| scientific article; zbMATH DE number 7768363 (Why is no real title available?) | 2023-11-20 | Paper |
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
Mathematical Programming. Series A. Series B | 2023-05-25 | Paper |
Noisy, Greedy and Not so Greedy k-Means++
(available as arXiv preprint) | 2023-02-07 | Paper |
Smoothed Analysis of Pareto Curves in Multiobjective Optimization
(available as arXiv preprint) | 2022-02-04 | 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
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Smoothed Analysis of Local Search for the Maximum-Cut Problem
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Smoothed analysis of the successive shortest path algorithm
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Improved smoothed analysis of the \(k\)-means method | 2019-05-06 | Paper |
New deterministic algorithms for solving parity games
Discrete Optimization | 2019-01-14 | Paper |
The alternating stock size problem and the gasoline puzzle
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Smoothed analysis of local search for the maximum-cut problem
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Smoothed analysis of the 2-Opt algorithm for the general TSP
ACM Transactions on Algorithms | 2018-11-05 | Paper |
The alternating stock size problem and the gasoline puzzle
(available as arXiv preprint) | 2018-03-02 | Paper |
Improved analysis of complete-linkage clustering
Algorithmica | 2017-10-10 | Paper |
The smoothed number of Pareto-optimal solutions in non-integer bicriteria optimization
Lecture Notes in Computer Science | 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
Web and Internet Economics | 2017-02-10 | Paper |
Solving totally unimodular LPs with the shadow vertex algorithm
(available as arXiv preprint) | 2017-01-24 | Paper |
Polynomial kernels for weighted problems
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Probabilistic analysis of the dual next-fit algorithm for bin covering
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
New deterministic algorithms for solving parity games
Lecture Notes in Computer Science | 2016-05-03 | Paper |
Smoothed analysis of the successive shortest path algorithm
SIAM Journal on Computing | 2015-12-11 | Paper |
Improved analysis of complete-linkage clustering
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Smoothed analysis of the squared Euclidean maximum-cut problem
Algorithms - ESA 2015 | 2015-11-19 | Paper |
On the impact of combinatorial structure on congestion games
Journal of the ACM | 2015-11-11 | Paper |
Economical caching
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Polynomial kernels for weighted problems
Lecture Notes in Computer Science | 2015-09-16 | Paper |
Improved smoothed analysis of multiobjective optimization
Journal of the ACM | 2015-08-14 | Paper |
Internet routing between autonomous systems: fast algorithms for path trading
Discrete Applied Mathematics | 2015-04-28 | Paper |
| Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (extended abstract) | 2014-12-18 | Paper |
Lower bounds for the average and smoothed number of Pareto-optima
Theory of Computing | 2014-10-06 | Paper |
Smoothed performance guarantees for local search
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
k-Means Has Polynomial Smoothed Complexity
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Smoothed Analysis of Multiobjective Optimization
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Improved smoothed analysis of multiobjective optimization
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
| Active clustering of biological sequences | 2014-04-01 | Paper |
Evaluation of online strategies for reordering buffers
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
Algorithmica | 2014-03-25 | Paper |
Smoothed analysis of the \(k\)-means method
Journal of the ACM | 2014-02-17 | Paper |
A bad instance for \texttt{k-means++}
Theoretical Computer Science | 2014-01-16 | Paper |
Smoothed analysis of belief propagation for minimum-cost flow and matching
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Finding short paths on polytopes by the shadow vertex algorithm
Automata, Languages, and Programming | 2013-08-06 | Paper |
Smoothed analysis of belief propagation for minimum-cost flow and matching
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Computing approximate Nash equilibria in network congestion games
Networks | 2012-09-21 | Paper |
| Economical caching | 2012-04-24 | Paper |
Competitive routing over time
Theoretical Computer Science | 2011-10-10 | Paper |
Smoothed Performance Guarantees for Local Search
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Lower bounds for the smoothed number of Pareto optimal solutions
Lecture Notes in Computer Science | 2011-07-01 | Paper |
A bad instance for \(k\)-means++
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Uncoordinated two-sided matching markets
SIAM Journal on Computing | 2011-05-17 | Paper |
The power of uncertainty: bundle-pricing for unit-demand customers
Approximation and Online Algorithms | 2011-02-15 | Paper |
A unified approach to congestion games and two-sided markets
Internet Mathematics | 2010-07-09 | Paper |
Worst-case and smoothed analysis of \(k\)-means clustering with Bregman divergences
Algorithms and Computation | 2009-12-17 | Paper |
Agnostic clustering
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science | 2009-04-29 | Paper |
Computing Approximate Nash Equilibria in Network Congestion Games
Structural Information and Communication Complexity | 2008-07-10 | Paper |
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Evaluation of Online Strategies for Reordering Buffers
Experimental Algorithms | 2007-09-14 | Paper |
Smoothed Analysis of Integer Programming
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Decision-making based on approximate and smoothed Pareto curves
Theoretical Computer Science | 2007-07-09 | Paper |
Smoothed analysis of integer programming
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
