Bodo Manthey

Bodo Siebert

2008
36	EE	Markus Bläser, Bodo Manthey, Oliver Putz: Approximating Multi-Criteria Max-TSP CoRR abs/0806.3668: (2008)
35	EE	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)
34	EE	Bodo Manthey: On Approximating Restricted Cycle Covers. SIAM J. Comput. 38(1): 181-206 (2008)
2007
33	EE	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
32	EE	Bodo Manthey: Minimum-Weight Cycle Covers and Their Approximability. WG 2007: 178-189
31	EE	Bodo Manthey: Approximate Pareto Curves for the Asymmetric Traveling Salesman Problem CoRR abs/0711.2157: (2007)
30	EE	Bodo Manthey, Rüdiger Reischuk: Smoothed analysis of binary search trees. Theor. Comput. Sci. 378(3): 292-315 (2007)
2006
29	EE	Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. Complexity of Boolean Functions 2006
28	EE	Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. SWAT 2006: 292-303
27	EE	Bodo Manthey, L. Shankar Ram: Approximation Algorithms for Multi-criteria Traveling Salesman Problems. WAOA 2006: 302-315
26	EE	Bodo Manthey: Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions. WG 2006: 336-347
25	EE	Bodo Manthey: Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions CoRR abs/cs/0604020: (2006)
24	EE	Bodo Manthey, L. Shankar Ram: Approximation Algorithms for Multi-Criteria Traveling Salesman Problems CoRR abs/cs/0606040: (2006)
23	EE	Bodo Manthey: Minimum-weight Cycle Covers and Their Approximability CoRR abs/cs/0609103: (2006)
22	EE	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	EE	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	EE	Bodo Manthey, Rüdiger Reischuk: Smoothed Analysis of Binary Search Trees. ISAAC 2005: 483-492
19	EE	Bodo Manthey: On Approximating Restricted Cycle Covers. WAOA 2005: 282-295
18	EE	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	EE	Bodo Manthey: On Approximating Restricted Cycle Covers CoRR abs/cs/0504038: (2005)
16	EE	Bodo Manthey, Rüdiger Reischuk: Smoothed Analysis of the Height of Binary Search Trees Electronic Colloquium on Computational Complexity (ECCC)(063): (2005)
15	EE	Bodo Manthey: Non-approximability of weighted multiple sequence alignment for arbitrary metrics. Inf. Process. Lett. 95(3): 389-395 (2005)
14	EE	Bodo Manthey, Rüdiger Reischuk: The intractability of computing the Hamming distance. Theor. Comput. Sci. 337(1-3): 331-346 (2005)
2004
13	EE	Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey: Privacy in Non-private Environments. ASIACRYPT 2004: 137-151
12	EE	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	EE	Markus Bläser, Bodo Manthey: Budget balanced mechanisms for the multicast pricing problem with rates. ACM Conference on Electronic Commerce 2003: 194-195
10	EE	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	EE	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	EE	Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey: Privacy in Non-Private Environments Electronic Colloquium on Computational Complexity (ECCC)(071): (2003)
6	EE	Bodo Manthey: Non-approximability of weighted multiple sequence alignment. Theor. Comput. Sci. 296(1): 179-192 (2003)
2002
5	EE	Markus Bläser, Bodo Manthey: Two Approximation Algorithms for 3-Cycle Covers. APPROX 2002: 40-50
4	EE	Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert: Private Computation - k-Connected versus 1-Connected Networks. CRYPTO 2002: 194-209
3	EE	Markus Bläser, Bodo Manthey: Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. ISAAC 2002: 187-198
2001
2	EE	Bodo Siebert: Non-approximability of Weighted Multiple Sequence Alignment. COCOON 2001: 75-85
1	EE	Markus Bläser, Bodo Siebert: Computing Cycle Covers without Short Cycles. ESA 2001: 368-379

Coauthor Index

1	Jan Arpe	[28] [29]
2	Markus Bläser	[1] [3] [4] [5] [7] [8] [11] [13] [18] [21] [22] [35] [36]
3	Martin Böhme	[9]
4	Thomas Heynen	[35]
5	Andreas Jakoby	[4] [7] [8] [13] [22]
6	Maciej Liskiewicz	[4] [7] [8] [12] [13] [22]
7	Oliver Putz	[36]
8	L. Shankar Ram	[24] [27]
9	Rüdiger Reischuk	[10] [14] [16] [20] [30]
10	Jiri Sgall	[21]
11	Till Tantau	[33]

Colors in the list of coauthors