| | |
Bodo Siebert
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 67 |      | Bodo Manthey: On approximating multicriteria TSP. ACM Transactions on Algorithms 8(2): 17 (2012) |
| 66 | | Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi: On Smoothed Analysis of Quicksort and Hoare's Find. Algorithmica 62(3-4): 879-905 (2012) |
| 65 | | Markus Bläser, Bodo Manthey: Smoothed Complexity Theory CoRR abs/1202.1936: (2012) |
| 64 | | Bodo Manthey: Multi-criteria TSP: Min and max combined. Oper. Res. Lett. 40(1): 36-38 (2012) |
| 2011 | ||
| 63 | | Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey: Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. ICALP (1) 2011: 147-158 |
| 62 | | Bodo Manthey: Deterministic Algorithms for Multi-criteria TSP. TAMC 2011: 264-275 |
| 61 | | Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao: Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. WADS 2011: 110-121 |
| 60 | | David Arthur, Bodo Manthey, Heiko Röglin: Smoothed Analysis of the k-Means Method. J. ACM 58(5): 19 (2011) |
| 59 | | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey: Privacy in Non-private Environments. Theory Comput. Syst. 48(1): 211-245 (2011) |
| 58 | | Bodo Manthey, Heiko Röglin: Smoothed Analysis: Analysis of Algorithms Beyond Worst Case. it - Information Technology 53(6): 280-286 (2011) |
| 2010 | ||
| 57 |  | Bodo Manthey, Kai Plociennik: Approximating Independent Set in Semi-Random Graphs. CTW 2010: 119-122 |
| 56 | | Matthijs Bomhoff, Bodo Manthey: Bisimplicial Edges in Bipartite Graphs. CTW 2010: 29-32 |
| 2009 | ||
| 55 | | Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi: On Smoothed Analysis of Quicksort and Hoare's Find. COCOON 2009: 158-167 |
| 54 | | David Arthur, Bodo Manthey, Heiko Röglin: k-Means Has Polynomial Smoothed Complexity. FOCS 2009: 405-414 |
| 53 | | Bodo Manthey, Heiko Röglin: Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences. ISAAC 2009: 1024-1033 |
| 52 | | Bodo Manthey, Heiko Röglin: Improved smoothed analysis of the k-means method. SODA 2009: 461-470 |
| 51 | | Bodo Manthey: On Approximating Multi-Criteria TSP. STACS 2009: 637-648 |
| 50 | | Bodo Manthey: Multi-Criteria TSP: Min and Max Combined. WAOA 2009: 205-216 |
| 49 | | Bodo Manthey, L. Shankar Ram: Approximation Algorithms for Multi-Criteria Traveling Salesman Problems. Algorithmica 53(1): 69-88 (2009) |
| 48 | | Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. Algorithmica 53(3): 337-357 (2009) |
| 47 | | David Arthur, Bodo Manthey, Heiko Röglin: k-Means has Polynomial Smoothed Complexity CoRR abs/0904.1113: (2009) |
| 46 | | Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi: On Smoothed Analysis of Quicksort and Hoare's Find CoRR abs/0904.3898: (2009) |
| 45 | | Bodo Manthey: Minimum-weight cycle covers and their approximability. Discrete Applied Mathematics 157(7): 1470-1480 (2009) |
| 44 | | 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 | ||
| 43 | | Markus Bläser, Bodo Manthey, Oliver Putz: Approximating Multi-criteria Max-TSP. ESA 2008: 185-197 |
| 42 | | Bodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise. MFCS 2008: 467-478 |
| 41 | | Markus Bläser, Bodo Manthey, Oliver Putz: Approximating Multi-Criteria Max-TSP CoRR abs/0806.3668: (2008) |
| 40 | | Bodo Manthey, Heiko Röglin: Improved Smoothed Analysis of the k-Means Method CoRR abs/0809.1715: (2008) |
| 39 | | 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) |
| 38 | | Bodo Manthey: On Approximating Restricted Cycle Covers. SIAM J. Comput. 38(1): 181-206 (2008) |
| 2007 | ||
| 37 | | 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 |
| 36 | | Bodo Manthey: Minimum-Weight Cycle Covers and Their Approximability. WG 2007: 178-189 |
| 35 | | Bodo Manthey: Approximate Pareto Curves for the Asymmetric Traveling Salesman Problem CoRR abs/0711.2157: (2007) |
| 34 | | Bodo Manthey: On Approximating Restricted Cycle Covers. Electronic Colloquium on Computational Complexity (ECCC) 14(011): (2007) |
| 33 | | Bodo Manthey, Till Tantau: Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. Electronic Colloquium on Computational Complexity (ECCC) 14(039): (2007) |
| 32 | | Bodo Manthey, Rüdiger Reischuk: Smoothed analysis of binary search trees. Theor. Comput. Sci. 378(3): 292-315 (2007) |
| 2006 | ||
| 31 | | Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. Complexity of Boolean Functions 2006 |
| 30 | | Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. SWAT 2006: 292-303 |
| 29 | | Bodo Manthey, L. Shankar Ram: Approximation Algorithms for Multi-criteria Traveling Salesman Problems. WAOA 2006: 302-315 |
| 28 | | Bodo Manthey: Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions. WG 2006: 336-347 |
| 27 | | Bodo Manthey: Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions CoRR abs/cs/0604020: (2006) |
| 26 | | Bodo Manthey, L. Shankar Ram: Approximation Algorithms for Multi-Criteria Traveling Salesman Problems CoRR abs/cs/0606040: (2006) |
| 25 | | Bodo Manthey: Minimum-weight Cycle Covers and Their Approximability CoRR abs/cs/0609103: (2006) |
| 24 | | Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. Electronic Colloquium on Computational Complexity (ECCC) 13(045): (2006) |
| 23 | | Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey: Private Computation: k-Connected versus 1-Connected Networks. J. Cryptology 19(3): 341-357 (2006) |
| 22 | | 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 | ||
| 21 | | Bodo Manthey, Rüdiger Reischuk: Smoothed Analysis of Binary Search Trees. ISAAC 2005: 483-492 |
| 20 | | Bodo Manthey: On Approximating Restricted Cycle Covers. WAOA 2005: 282-295 |
| 19 | | Markus Bläser, Bodo Manthey: Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One. Algorithmica 42(2): 121-139 (2005) |
| 18 | | Bodo Manthey: On Approximating Restricted Cycle Covers CoRR abs/cs/0504038: (2005) |
| 17 | | Bodo Manthey, Rüdiger Reischuk: Smoothed Analysis of the Height of Binary Search Trees Electronic Colloquium on Computational Complexity (ECCC)(063): (2005) |
| 16 | | Bodo Manthey: Non-approximability of weighted multiple sequence alignment for arbitrary metrics. Inf. Process. Lett. 95(3): 389-395 (2005) |
| 15 | | Bodo Manthey, Rüdiger Reischuk: The intractability of computing the Hamming distance. Theor. Comput. Sci. 337(1-3): 331-346 (2005) |
| 14 | | Bodo Manthey: Approximability of cycle covers and smoothed analysis of binary search trees. Universität Lübeck 2005: I-XI, 1-117 |
| 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 |
| 1 | Jan Arpe | [24] [30] [31] [48] |
| 2 | David Arthur | [47] [54] [60] |
| 3 | Markus Bläser | [1] [3] [4] [5] [7] [8] [11] [13] [19] [22] [23] [39] [41] [43] [59] [61] [65] |
| 4 | Martin Böhme | [9] |
| 5 | Matthijs Bomhoff | [56] |
| 6 | Endre Boros | [63] |
| 7 | Khaled M. Elbassioni | [63] |
| 8 | Christian Engels | [44] |
| 9 | Mahmoud Fouz | [46] [55] [63] [66] |
| 10 | Vladimir Gurvich | [63] |
| 11 | Thomas Heynen | [39] |
| 12 | Nima Zeini Jahromi | [46] [55] [66] |
| 13 | Andreas Jakoby | [4] [7] [8] [13] [23] [59] |
| 14 | Manfred Kufleitner | [46] [55] [66] |
| 15 | Maciej Liskiewicz | [4] [7] [8] [12] [13] [23] [59] |
| 16 | Kazuhisa Makino | [63] |
| 17 | Kai Plociennik | [57] |
| 18 | Oliver Putz | [41] [43] |
| 19 | L. Shankar Ram | [26] [29] [49] |
| 20 | B. V. Raghavendra Rao | [61] |
| 21 | Rüdiger Reischuk | [10] [15] [17] [21] [32] |
| 22 | Heiko Röglin (Heiko Roeglin) | [40] [47] [52] [53] [54] [58] [60] |
| 23 | Jiri Sgall | [22] |
| 24 | Till Tantau | [33] [37] [42] |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page