Bodo Manthey - RankMe

139 papers A* 4A 4B 24C 11Misc 2Journal 83Unranked 8

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Convergence and Running Time of Time-dependent Ant Colony Algorithms. CoRR Bodo Manthey, Jesse van Rhijn, Ashkan Safari, Tjark Vredeveld
2025	B	`conf`	Counting Locally Optimal Tours in the TSP. MFCS Bodo Manthey, Jesse van Rhijn
2025	J	`jnl`	Improved Smoothed Analysis of 2-Opt for the Euclidean TSP. Algorithmica Bodo Manthey, Jesse van Rhijn
2025	J	`jnl`	Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem. Discret. Appl. Math. Bodo Manthey, Jesse van Rhijn
2025	B	`conf`	Playing Snake on a Graph. WG Denise Graafsma, Bodo Manthey, Alexander Skopalik
2025	J	`jnl`	Playing Snake on a Graph. CoRR Denise Graafsma, Bodo Manthey, Alexander Skopalik
2025	J	`jnl`	Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise. Algorithmica Marvin Künnemann, Bodo Manthey, Rianne Veenstra
2024	B	`conf`	Complexity of Local Search for Euclidean Clustering Problems. ISAAC Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer
2024	J	`jnl`	Counting Locally Optimal Tours in the TSP. CoRR Bodo Manthey, Jesse van Rhijn
2024	A	`conf`	Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering. STACS Bodo Manthey, Jesse van Rhijn
2023	B	`conf`	Approximation Ineffectiveness of a Tour-Untangling Heuristic. WAOA Bodo Manthey, Jesse van Rhijn
2023	J	`jnl`	Approximation Ineffectiveness of a Tour-Untangling Heuristic. CoRR Bodo Manthey, Jesse van Rhijn
2023	J	`jnl`	Complexity of Local Search for Euclidean Clustering Problems. CoRR Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer
2023	B	`conf`	Improved Smoothed Analysis of 2-Opt for the Euclidean TSP. ISAAC Bodo Manthey, Jesse van Rhijn
2023	J	`jnl`	Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics. Algorithmica Stefan Klootwijk, Bodo Manthey
2023	J	`jnl`	Smoothed Analysis of the 2-Opt Heuristic for the TSP under Gaussian Noise. CoRR Marvin Künnemann, Bodo Manthey, Rianne Veenstra
2023	J	`jnl`	Worst-Case and Smoothed Analysis of Hartigan's Method for k-Means Clustering. CoRR Bodo Manthey, Jesse van Rhijn
2022	J	`jnl`	Improved Smoothed Analysis of 2-Opt for the Euclidean TSP. CoRR Bodo Manthey, Jesse van Rhijn
2022	J	`jnl`	Towards a Lower Bound for the Average Case Runtime of Simulated Annealing on TSP. CoRR Bodo Manthey, Jesse van Rhijn
2021	J	`jnl`	In Memoriam Walter Kern. Discret. Appl. Math. Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still
2021	J	`jnl`	Preface: 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2019). Discret. Appl. Math. Bodo Manthey, Johann L. Hurink
2021	J	`jnl`	Probabilistic analysis of optimization problems on generalized random shortest path metrics. Theor. Comput. Sci. Stefan Klootwijk, Bodo Manthey, Sander K. Visser
2021	J	`jnl`	Probabilistic properties of highly connected random geometric graphs. Discret. Appl. Math. Bodo Manthey, Victor M. J. J. Reijnders
2020	C	`conf`	Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics. AofA Stefan Klootwijk, Bodo Manthey
2020	—	`ch.`	Smoothed Analysis of Local Search. Beyond the Worst-Case Analysis of Algorithms Bodo Manthey
2020	J	`jnl`	Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm. J. Graph Algorithms Appl. Kamiel Cornelissen, Bodo Manthey
2019	C	`conf`	Probabilistic Analysis of Facility Location on Random Shortest Path Metrics. CiE Stefan Klootwijk, Bodo Manthey
2019	J	`jnl`	Probabilistic Analysis of Facility Location on Random Shortest Path Metrics. CoRR Stefan Klootwijk, Bodo Manthey
2019	B	`conf`	Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics. WALCOM Stefan Klootwijk, Bodo Manthey, Sander K. Visser
2018	J	`jnl`	Approximation Algorithms for Connected Graph Factors of Minimum Weight. Theory Comput. Syst. Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders
2018	J	`jnl`	Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. Algorithmica Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
2018	J	`jnl`	Belief propagation for the maximum-weight independent set and minimum spanning tree problems. Theor. Comput. Sci. Kamiel Cornelissen, Bodo Manthey
2018	J	`jnl`	Perturbation resilience for the facility location problem. Oper. Res. Lett. Bodo Manthey, Matthijs B. Tijink
2018	J	`jnl`	Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics. CoRR Stefan Klootwijk, Bodo Manthey, Sander K. Visser
2018	—	`conf`	Probabilistic Properties of Highly Connected Random Geometric Graphs. CALDAM Bodo Manthey, Victor M. J. J. Reijnders
2017	J	`jnl`	Approximating bounded-degree spanning trees and connected factors with leaves. Oper. Res. Lett. Walter Kern, Bodo Manthey
2017	J	`jnl`	Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141). Dagstuhl Reports Bodo Manthey, Claire Mathieu, Heiko Röglin, Eli Upfal
2017	J	`jnl`	Probabilistic analysis of power assignments. Random Struct. Algorithms Maurits de Graaf, Bodo Manthey
2016	J	`jnl`	Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope. Discret. Appl. Math. Ruben Hoeksma, Bodo Manthey, Marc Uetz
2016	J	`jnl`	Note on VCG vs. Price Raising for Matching Markets. CoRR Walter Kern, Bodo Manthey, Marc Uetz
2015	J	`jnl`	12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013). Discret. Appl. Math. Johann L. Hurink, Bodo Manthey
2015	B	`conf`	Approximation Algorithms for k-Connected Graph Factors. WAOA Bodo Manthey, Marten Waanders
2015	C	`conf`	On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSP. CTW Marvin Künnemann, Bodo Manthey
2015	J	`jnl`	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. Algorithmica Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao
2015	B	`conf`	Smoothed Analysis of Local Search Algorithms. WADS Bodo Manthey
2015	Misc	`conf`	Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm. COCOON Kamiel Cornelissen, Bodo Manthey
2015	C	`conf`	Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm. CTW Kamiel Cornelissen, Bodo Manthey
2015	J	`jnl`	Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm. CoRR Kamiel Cornelissen, Bodo Manthey
2015	J	`jnl`	Smoothed Analysis of the Successive Shortest Path Algorithm. CoRR Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner
2015	J	`jnl`	Smoothed Analysis of the Successive Shortest Path Algorithm. SIAM J. Comput. Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin, Clemens Rösner
2015	J	`jnl`	Smoothed Complexity Theory. ACM Trans. Comput. Theory Markus Bläser, Bodo Manthey
2015	—	`conf`	Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic. ICALP (1) Marvin Künnemann, Bodo Manthey
2014	J	`jnl`	Analysis of Algorithms Beyond the Worst Case (Dagstuhl Seminar 14372). Dagstuhl Reports Maria-Florina Balcan, Bodo Manthey, Heiko Röglin, Tim Roughgarden
2014	C	`conf`	Decomposition Algorithm for the Single Machine Scheduling Polytope. ISCO Ruben Hoeksma, Bodo Manthey, Marc Uetz
2014	—	`conf`	Probabilistic Analysis of Power Assignments. MFCS (2) Maurits de Graaf, Bodo Manthey
2014	J	`jnl`	Probabilistic Analysis of Power Assignments. CoRR Maurits de Graaf, Bodo Manthey
2013	C	`ed.`	12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013. CTW Kamiel Cornelissen, Ruben Hoeksma, Johann L. Hurink, Bodo Manthey
2013	B	`conf`	Approximability of Connected Factors. WAOA Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
2013	J	`jnl`	Approximability of Connected Factors. CoRR Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
2013	J	`jnl`	Approximating independent set in perturbed graphs. Discret. Appl. Math. Bodo Manthey, Kai Plociennik
2013	J	`jnl`	Bisimplicial edges in bipartite graphs. Discret. Appl. Math. Matthijs Bomhoff, Bodo Manthey
2013	J	`jnl`	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. CoRR Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao
2013	B	`conf`	Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems. MFCS Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao
2013	B	`conf`	Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. WALCOM Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2013	J	`jnl`	Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching. J. Graph Algorithms Appl. Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2013	J	`jnl`	Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. Algorithmica Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao
2013	B	`conf`	Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise. ISAAC Bodo Manthey, Rianne Veenstra
2013	A*	`conf`	Smoothed Analysis of the Successive Shortest Path Algorithm. SODA Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2013	C	`conf`	Smoothed analysis of the successive shortest path algorithm. CTW Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2013	J	`jnl`	Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences. J. Comput. Geom. Bodo Manthey, Heiko Röglin
2012	J	`jnl`	Deterministic algorithms for multi-criteria Max-TSP. Discret. Appl. Math. Bodo Manthey
2012	J	`jnl`	Multi-criteria TSP: Min and max combined. Oper. Res. Lett. Bodo Manthey
2012	J	`jnl`	On Smoothed Analysis of Quicksort and Hoare's Find. Algorithmica Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi
2012	J	`jnl`	On approximating multicriteria TSP. ACM Trans. Algorithms Bodo Manthey
2012	C	`conf`	Random Shortest Path Metrics with Applications. CTW Christian Engels, Bodo Manthey, B. V. Raghavendra Rao
2012	J	`jnl`	Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching CoRR Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin
2012	J	`jnl`	Smoothed Complexity Theory CoRR Markus Bläser, Bodo Manthey
2012	B	`conf`	Smoothed Complexity Theory. MFCS Markus Bläser, Bodo Manthey
2012	J	`jnl`	Smoothed analysis of left-to-right maxima with applications. ACM Trans. Algorithms Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, Till Tantau
2011	C	`conf`	Deterministic Algorithms for Multi-criteria TSP. TAMC Bodo Manthey
2011	J	`jnl`	Privacy in Non-private Environments. Theory Comput. Syst. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2011	B	`conf`	Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. WADS Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao
2011	J	`jnl`	Smoothed Analysis of the k-Means Method. J. ACM David Arthur, Bodo Manthey, Heiko Röglin
2011	J	`jnl`	Smoothed Analysis: Analysis of Algorithms Beyond Worst Case. it Inf. Technol. Bodo Manthey, Heiko Röglin
2011	—	`conf`	Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. ICALP (1) Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey
2010	C	`conf`	Approximating Independent Set in Semi-Random Graphs. CTW Bodo Manthey, Kai Plociennik
2010	C	`conf`	Bisimplicial Edges in Bipartite Graphs. CTW Matthijs Bomhoff, Bodo Manthey
2009	J	`jnl`	Approximability of Minimum AND-Circuits. Algorithmica Jan Arpe, Bodo Manthey
2009	J	`jnl`	Approximation Algorithms for Multi-Criteria Traveling Salesman Problems. Algorithmica Bodo Manthey, L. Shankar Ram
2009	J	`jnl`	Average-case approximation ratio of the 2-opt algorithm for the TSP. Oper. Res. Lett. Christian Engels, Bodo Manthey
2009	A*	`conf`	Improved smoothed analysis of the SODA Bodo Manthey, Heiko Röglin
2009	J	`jnl`	Minimum-weight cycle covers and their approximability. Discret. Appl. Math. Bodo Manthey
2009	B	`conf`	Multi-Criteria TSP: Min and Max Combined. WAOA Bodo Manthey
2009	A	`conf`	On Approximating Multi-Criteria TSP. STACS Bodo Manthey
2009	J	`jnl`	On Smoothed Analysis of Quicksort and Hoare's Find CoRR Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi
2009	Misc	`conf`	On Smoothed Analysis of Quicksort and Hoare's Find. COCOON Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi
2009	B	`conf`	Worst-Case and Smoothed Analysis of ISAAC Bodo Manthey, Heiko Röglin
2009	A*	`conf`	k-Means Has Polynomial Smoothed Complexity. FOCS David Arthur, Bodo Manthey, Heiko Röglin
2009	J	`jnl`	k-Means has Polynomial Smoothed Complexity CoRR David Arthur, Bodo Manthey, Heiko Röglin
2008	J	`jnl`	Adding cardinality constraints to integer programs with applications to maximum satisfiability. Inf. Process. Lett. Markus Bläser, Thomas Heynen, Bodo Manthey
2008	J	`jnl`	Approximating Multi-Criteria Max-TSP CoRR Markus Bläser, Bodo Manthey, Oliver Putz
2008	A	`conf`	Approximating Multi-criteria Max-TSP. ESA Markus Bläser, Bodo Manthey, Oliver Putz
2008	J	`jnl`	Improved Smoothed Analysis of the k-Means Method CoRR Bodo Manthey, Heiko Röglin
2008	J	`jnl`	On Approximating Restricted Cycle Covers. SIAM J. Comput. Bodo Manthey
2008	B	`conf`	Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. MFCS Bodo Manthey, Till Tantau
2007	J	`jnl`	Approximate Pareto Curves for the Asymmetric Traveling Salesman Problem CoRR Bodo Manthey
2007	B	`conf`	Minimum-Weight Cycle Covers and Their Approximability. WG Bodo Manthey
2007	J	`jnl`	On Approximating Restricted Cycle Covers. Electron. Colloquium Comput. Complex. Bodo Manthey
2007	—	`conf`	Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. Probabilistic Methods in the Design and Analysis of Algorithms Bodo Manthey, Till Tantau
2007	J	`jnl`	Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. Electron. Colloquium Comput. Complex. Bodo Manthey, Till Tantau
2007	J	`jnl`	Smoothed analysis of binary search trees. Theor. Comput. Sci. Bodo Manthey, Rüdiger Reischuk
2006	J	`jnl`	An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. J. Discrete Algorithms Markus Bläser, Bodo Manthey, Jirí Sgall
2006	—	`conf`	Approximability of Minimum AND-Circuits. Complexity of Boolean Functions Jan Arpe, Bodo Manthey
2006	—	`conf`	Approximability of Minimum AND-Circuits. SWAT Jan Arpe, Bodo Manthey
2006	J	`jnl`	Approximability of Minimum AND-Circuits. Electron. Colloquium Comput. Complex. Jan Arpe, Bodo Manthey
2006	J	`jnl`	Approximation Algorithms for Multi-Criteria Traveling Salesman Problems CoRR Bodo Manthey, L. Shankar Ram
2006	B	`conf`	Approximation Algorithms for Multi-criteria Traveling Salesman Problems. WAOA Bodo Manthey, L. Shankar Ram
2006	B	`conf`	Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions. WG Bodo Manthey
2006	J	`jnl`	Minimum-weight Cycle Covers and Their Approximability CoRR Bodo Manthey
2006	J	`jnl`	Private Computation: k-Connected versus 1-Connected Networks. J. Cryptol. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2005	—	`—`	Approximability of cycle covers and smoothed analysis of binary search trees. Bodo Manthey
2005	—	`ch.`	Approximability of cycle covers and smoothed analysis of binary search trees. Ausgezeichnete Informatikdissertationen Bodo Manthey
2005	J	`jnl`	Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One. Algorithmica Markus Bläser, Bodo Manthey
2005	J	`jnl`	Non-approximability of weighted multiple sequence alignment for arbitrary metrics. Inf. Process. Lett. Bodo Manthey
2005	J	`jnl`	On Approximating Restricted Cycle Covers CoRR Bodo Manthey
2005	B	`conf`	On Approximating Restricted Cycle Covers. WAOA Bodo Manthey
2005	B	`conf`	Smoothed Analysis of Binary Search Trees. ISAAC Bodo Manthey, Rüdiger Reischuk
2005	J	`jnl`	Smoothed Analysis of the Height of Binary Search Trees Electron. Colloquium Comput. Complex. Bodo Manthey, Rüdiger Reischuk
2005	J	`jnl`	The intractability of computing the Hamming distance. Theor. Comput. Sci. Bodo Manthey, Rüdiger Reischuk
2004	J	`jnl`	New lower and upper bounds for the competitive ratio of transmission protocols. Inf. Process. Lett. Maciej Liskiewicz, Bodo Manthey
2004	A	`conf`	Privacy in Non-private Environments. ASIACRYPT Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2003	A*	`conf`	Budget balanced mechanisms for the multicast pricing problem with rates. EC Markus Bläser, Bodo Manthey
2003	J	`jnl`	Non-approximability of weighted multiple sequence alignment. Theor. Comput. Sci. Bodo Manthey
2003	J	`jnl`	Privacy in Non-Private Environments Electron. Colloquium Comput. Complex. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2003	J	`jnl`	Private Computation - k-connected versus 1-connected Networks Electron. Colloquium Comput. Complex. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
2003	J	`jnl`	The Computational Power of Compiling C++. Bull. EATCS Martin Böhme, Bodo Manthey
2003	B	`conf`	The Intractability of Computing the Hamming Distance. ISAAC Bodo Manthey, Rüdiger Reischuk
2002	B	`conf`	Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. ISAAC Markus Bläser, Bodo Manthey
2002	—	`conf`	Two Approximation Algorithms for 3-Cycle Covers. APPROX Markus Bläser, Bodo Manthey