Bodo Manthey

Bodo Siebert

	2009
51		Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi: On Smoothed Analysis of Quicksort and Hoare's Find. COCOON 2009: 158-167
50		Bodo Manthey, Heiko Röglin: Improved smoothed analysis of the k-means method. SODA 2009: 461-470
49		Bodo Manthey: On Approximating Multi-Criteria TSP. STACS 2009: 637-648
48		Bodo Manthey, L. Shankar Ram: Approximation Algorithms for Multi-Criteria Traveling Salesman Problems. Algorithmica 53(1): 69-88 (2009)
47		Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. Algorithmica 53(3): 337-357 (2009)
46		David Arthur, Bodo Manthey, Heiko Röglin: k-Means has Polynomial Smoothed Complexity CoRR abs/0904.1113: (2009)
45		Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi: On Smoothed Analysis of Quicksort and Hoare's Find CoRR abs/0904.3898: (2009)
44		Bodo Manthey: Minimum-weight cycle covers and their approximability. Discrete Applied Mathematics 157(7): 1470-1480 (2009)
43		Christian Engels, Bodo Manthey: Average-case approximation ratio of the 2-opt algorithm for the TSP. Oper. Res. Lett. 37(2): 83-84 (2009)
	2008
42		Markus Bläser, Bodo Manthey, Oliver Putz: Approximating Multi-criteria Max-TSP. ESA 2008: 185-197
41		Bodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. MFCS 2008: 467-478
40		Markus Bläser, Bodo Manthey, Oliver Putz: Approximating Multi-Criteria Max-TSP CoRR abs/0806.3668: (2008)
39		Bodo Manthey, Heiko Röglin: Improved Smoothed Analysis of the k-Means Method CoRR abs/0809.1715: (2008)
38		Markus Bläser, Thomas Heynen, Bodo Manthey: Adding cardinality constraints to integer programs with applications to maximum satisfiability. Inf. Process. Lett. 105(5): 194-198 (2008)
37		Bodo Manthey: On Approximating Restricted Cycle Covers. SIAM J. Comput. 38(1): 181-206 (2008)
	2007
36		Bodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. Probabilistic Methods in the Design and Analysis of Algorithms 2007
35		Bodo Manthey: Minimum-Weight Cycle Covers and Their Approximability. WG 2007: 178-189
34		Bodo Manthey: Approximate Pareto Curves for the Asymmetric Traveling Salesman Problem CoRR abs/0711.2157: (2007)
33		Bodo Manthey: On Approximating Restricted Cycle Covers. Electronic Colloquium on Computational Complexity (ECCC) 14(011): (2007)
32		Bodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. Electronic Colloquium on Computational Complexity (ECCC) 14(039): (2007)
31		Bodo Manthey, Rüdiger Reischuk: Smoothed analysis of binary search trees. Theor. Comput. Sci. 378(3): 292-315 (2007)
	2006
30		Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. Complexity of Boolean Functions 2006
29		Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. SWAT 2006: 292-303
28		Bodo Manthey, L. Shankar Ram: Approximation Algorithms for Multi-criteria Traveling Salesman Problems. WAOA 2006: 302-315
27		Bodo Manthey: Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions. WG 2006: 336-347
26		Bodo Manthey: Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions CoRR abs/cs/0604020: (2006)
25		Bodo Manthey, L. Shankar Ram: Approximation Algorithms for Multi-Criteria Traveling Salesman Problems CoRR abs/cs/0606040: (2006)
24		Bodo Manthey: Minimum-weight Cycle Covers and Their Approximability CoRR abs/cs/0609103: (2006)
23		Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. Electronic Colloquium on Computational Complexity (ECCC) 13(045): (2006)
22		Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey: Private Computation: k-Connected versus 1-Connected Networks. J. Cryptology 19(3): 341-357 (2006)
21		Markus Bläser, Bodo Manthey, Jiri Sgall: An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. J. Discrete Algorithms 4(4): 623-632 (2006)
	2005
20		Bodo Manthey, Rüdiger Reischuk: Smoothed Analysis of Binary Search Trees. ISAAC 2005: 483-492
19		Bodo Manthey: On Approximating Restricted Cycle Covers. WAOA 2005: 282-295
18		Markus Bläser, Bodo Manthey: Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One. Algorithmica 42(2): 121-139 (2005)
17		Bodo Manthey: On Approximating Restricted Cycle Covers CoRR abs/cs/0504038: (2005)
16		Bodo Manthey, Rüdiger Reischuk: Smoothed Analysis of the Height of Binary Search Trees Electronic Colloquium on Computational Complexity (ECCC)(063): (2005)
15		Bodo Manthey: Non-approximability of weighted multiple sequence alignment for arbitrary metrics. Inf. Process. Lett. 95(3): 389-395 (2005)
14		Bodo Manthey, Rüdiger Reischuk: The intractability of computing the Hamming distance. Theor. Comput. Sci. 337(1-3): 331-346 (2005)
	2004
13		Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey: Privacy in Non-private Environments. ASIACRYPT 2004: 137-151
12		Maciej Liskiewicz, Bodo Manthey: New lower and upper bounds for the competitive ratio of transmission protocols. Inf. Process. Lett. 89(6): 297-301 (2004)
	2003
11		Markus Bläser, Bodo Manthey: Budget balanced mechanisms for the multicast pricing problem with rates. ACM Conference on Electronic Commerce 2003: 194-195
10		Bodo Manthey, Rüdiger Reischuk: The Intractability of Computing the Hamming Distance. ISAAC 2003: 88-97
9		Martin Böhme, Bodo Manthey: The Computational Power of Compiling C++. Bulletin of the EATCS 81: 264-270 (2003)
8		Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey: Private Computation - k-connected versus 1-connected Networks Electronic Colloquium on Computational Complexity (ECCC) 10(009): (2003)
7		Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey: Privacy in Non-Private Environments Electronic Colloquium on Computational Complexity (ECCC)(071): (2003)
6		Bodo Manthey: Non-approximability of weighted multiple sequence alignment. Theor. Comput. Sci. 296(1): 179-192 (2003)
	2002
5		Markus Bläser, Bodo Manthey: Two Approximation Algorithms for 3-Cycle Covers. APPROX 2002: 40-50
4		Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert: Private Computation - k-Connected versus 1-Connected Networks. CRYPTO 2002: 194-209
3		Markus Bläser, Bodo Manthey: Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. ISAAC 2002: 187-198
	2001
2		Bodo Siebert: Non-approximability of Weighted Multiple Sequence Alignment. COCOON 2001: 75-85
1		Markus Bläser, Bodo Siebert: Computing Cycle Covers without Short Cycles. ESA 2001: 368-379

Coauthor Index

1	Jan Arpe	[23] [29] [30] [47]
2	David Arthur	[46]
3	Markus Bläser	[1] [3] [4] [5] [7] [8] [11] [13] [18] [21] [22] [38] [40] [42]
4	Martin Böhme	[9]
5	Christian Engels	[43]
6	Mahmoud Fouz	[45] [51]
7	Thomas Heynen	[38]
8	Nima Zeini Jahromi	[45] [51]
9	Andreas Jakoby	[4] [7] [8] [13] [22]
10	Manfred Kufleitner	[45] [51]
11	Maciej Liskiewicz	[4] [7] [8] [12] [13] [22]
12	Oliver Putz	[40] [42]
13	L. Shankar Ram	[25] [28] [48]
14	Rüdiger Reischuk	[10] [14] [16] [20] [31]
15	Heiko Röglin	[39] [46] [50]
16	Jiri Sgall	[21]
17	Till Tantau	[32] [36] [41]

Colors in the list of coauthors