| Publication | Date of Publication | Type |
|---|
| Approximation ineffectiveness of a tour-untangling heuristic | 2024-07-19 | Paper |
| Probabilistic analysis of optimization problems on sparse random shortest path metrics | 2023-12-13 | Paper |
| Approximation Ineffectiveness of a Tour-Untangling Heuristic | 2023-02-22 | Paper |
| Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics | 2023-02-07 | Paper |
| Improved Smoothed Analysis of 2-Opt for the Euclidean TSP | 2022-11-30 | Paper |
| Smoothed Analysis of Local Search | 2022-02-04 | Paper |
| Probabilistic properties of highly connected random geometric graphs | 2021-10-21 | Paper |
| In memoriam Walter Kern | 2021-09-15 | Paper |
| Probabilistic analysis of optimization problems on generalized random shortest path metrics | 2021-04-14 | Paper |
| Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm | 2020-09-04 | Paper |
| Probabilistic analysis of facility location on random shortest path metrics | 2020-05-12 | Paper |
| Probabilistic analysis of optimization problems on generalized random shortest path metrics | 2019-10-15 | Paper |
| Perturbation resilience for the facility location problem | 2019-06-11 | Paper |
| Smoothed Analysis of the Successive Shortest Path Algorithm | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633855 | 2019-05-06 | Paper |
| Approximating bounded-degree spanning trees and connected factors with leaves | 2019-02-22 | Paper |
| Approximation schemes for stochastic mean payoff games with perfect information and few random positions | 2019-01-11 | Paper |
| Belief propagation for the maximum-weight independent set and minimum spanning tree problems | 2018-06-18 | Paper |
| Probabilistic properties of highly connected random geometric graphs | 2018-06-05 | Paper |
| Approximation algorithms for connected graph factors of minimum weight | 2018-04-12 | Paper |
| Probabilistic analysis of power assignments | 2017-10-24 | Paper |
| Worst-case and smoothed analysis of k-means clustering with Bregman divergences | 2017-03-09 | Paper |
| Smoothed complexity theory | 2016-10-24 | Paper |
| Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope | 2016-10-07 | Paper |
| Approximation Algorithms for k-Connected Graph Factors | 2016-02-26 | Paper |
| Smoothed Analysis of the Successive Shortest Path Algorithm | 2015-12-11 | Paper |
| Smoothed Analysis of Local Search Algorithms | 2015-10-30 | Paper |
| Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm | 2015-10-29 | Paper |
| Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic | 2015-10-27 | Paper |
| Decomposition Algorithm for the Single Machine Scheduling Polytope | 2015-10-16 | Paper |
| Random shortest paths: non-Euclidean instances for metric optimization problems | 2015-09-03 | Paper |
| Probabilistic Analysis of Power Assignments | 2014-10-14 | Paper |
| On approximating multicriteria TSP | 2014-09-09 | Paper |
| Smoothed analysis of left-to-right maxima with applications | 2014-09-09 | Paper |
| Approximability of Connected Factors | 2014-09-02 | Paper |
| k-Means Has Polynomial Smoothed Complexity | 2014-07-25 | Paper |
| Approximating independent set in perturbed graphs | 2014-04-16 | Paper |
| Bisimplicial edges in bipartite graphs | 2014-04-16 | Paper |
| Smoothed Analysis of the k-Means Method | 2014-02-17 | Paper |
| Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise | 2014-01-14 | Paper |
| Smoothed analysis of belief propagation for minimum-cost flow and matching | 2013-11-28 | Paper |
| Random shortest paths: non-Euclidean instances for metric optimization problems | 2013-09-20 | Paper |
| Smoothed analysis of partitioning algorithms for Euclidean functionals | 2013-05-13 | Paper |
| Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching | 2013-04-12 | Paper |
| Deterministic algorithms for multi-criteria max-TSP | 2012-10-26 | Paper |
| Smoothed complexity theory | 2012-09-25 | Paper |
| Multi-criteria TSP: Min and Max combined | 2012-07-06 | Paper |
| On smoothed analysis of quicksort and Hoare's find | 2012-04-26 | Paper |
| On Approximating Multi-Criteria TSP | 2012-04-24 | Paper |
| Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals | 2011-08-12 | Paper |
| Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes | 2011-07-06 | Paper |
| Deterministic Algorithms for Multi-criteria TSP | 2011-07-01 | Paper |
| Privacy in non-private environments | 2011-04-01 | Paper |
| Multi-Criteria TSP: Min and Max Combined | 2010-05-11 | Paper |
| Adding cardinality constraints to integer programs with applications to maximum satisfiability | 2010-03-24 | Paper |
| Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences | 2009-12-17 | Paper |
| Non-approximability of weighted multiple sequence alignment for arbitrary metrics | 2009-12-04 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| On Smoothed Analysis of Quicksort and Hoare’s Find | 2009-07-23 | Paper |
| New lower and upper bounds for the competitive ratio of transmission protocols | 2009-07-09 | Paper |
| Minimum-weight cycle covers and their approximability | 2009-06-30 | Paper |
| Approximability of minimum AND-circuits | 2009-06-17 | Paper |
| Approximation algorithms for multi-criteria traveling salesman problems | 2009-05-13 | Paper |
| Average-case approximation ratio of the 2-opt algorithm for the TSP | 2009-05-07 | Paper |
| On Approximating Restricted Cycle Covers | 2009-03-16 | Paper |
| Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise | 2009-02-03 | Paper |
| Approximating Multi-criteria Max-TSP | 2008-11-25 | Paper |
| Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions | 2008-09-04 | Paper |
| Minimum-Weight Cycle Covers and Their Approximability | 2008-07-01 | Paper |
| Approximation algorithms for multi-criteria traveling salesman problems | 2008-02-21 | Paper |
| Approximability of Minimum AND-Circuits | 2007-09-07 | Paper |
| Smoothed analysis of binary search trees | 2007-07-09 | Paper |
| An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality | 2007-02-14 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Private computation: \(k\)-connected versus 1-connected networks | 2006-11-03 | Paper |
| Privacy in Non-private Environments | 2005-08-12 | Paper |
| Approximating maximum weight cycle covers in directed graphs with weights zero and one | 2005-08-02 | Paper |
| The intractability of computing the Hamming distance | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425953 | 2003-09-14 | Paper |
| Non-approximability of weighted multiple sequence alignment. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411276 | 2003-07-07 | Paper |
| Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering | N/A | Paper |
