2008 | ||
---|---|---|
56 | EE | Joachim Kneis, Alexander Langer, Peter Rossmanith: A New Algorithm for Finding Trees with Many Leaves. ISAAC 2008: 270-281 |
55 | EE | Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith: New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. IWPEC 2008: 66-77 |
54 | EE | Joachim Kneis, Alexander Langer, Peter Rossmanith: Improved Upper Bounds for Partial Vertex Cover. WG 2008: 240-251 |
53 | EE | Peter Rossmanith: Simulated Annealing. Taschenbuch der Algorithmen 2008: 423-431 |
52 | EE | Daniel Mölle, Stefan Richter, Peter Rossmanith: Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. Theory Comput. Syst. 43(2): 234-253 (2008) |
2007 | ||
51 | EE | Joachim Kneis, Daniel Mölle, Peter Rossmanith: Partial vs. Complete Domination: t-Dominating Set. SOFSEM (1) 2007: 367-376 |
50 | EE | Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang: Dynamic Programming for Minimum Steiner Trees. Theory Comput. Syst. 41(3): 493-500 (2007) |
2006 | ||
49 | EE | Daniel Mölle, Stefan Richter, Peter Rossmanith: Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. COCOON 2006: 265-273 |
48 | EE | Daniel Mölle, Stefan Richter, Peter Rossmanith: Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. CSR 2006: 270-280 |
47 | EE | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Intuitive Algorithms and t-Vertex Cover. ISAAC 2006: 598-607 |
46 | EE | Daniel Mölle, Stefan Richter, Peter Rossmanith: A Faster Algorithm for the Steiner Tree Problem. STACS 2006: 561-570 |
45 | EE | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Divide-and-Color. WG 2006: 58-67 |
44 | EE | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Parameterized power domination complexity. Inf. Process. Lett. 98(4): 145-149 (2006) |
2005 | ||
43 | EE | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: On the Parameterized Complexity of Exact Satisfiability Problems. MFCS 2005: 568-579 |
42 | EE | Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Algorithms Based on the Treewidth of Sparse Graphs. WG 2005: 385-396 |
2003 | ||
41 | EE | Jens Gramm, Rolf Niedermeier, Peter Rossmanith: Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. Algorithmica 37(1): 25-42 (2003) |
40 | EE | Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Applied Mathematics 130(2): 139-155 (2003) |
39 | EE | Rolf Niedermeier, Peter Rossmanith: On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms 47(2): 63-77 (2003) |
38 | EE | Rolf Niedermeier, Peter Rossmanith: An efficient fixed-parameter algorithm for 3-Hitting Set. J. Discrete Algorithms 1(1): 89-102 (2003) |
2001 | ||
37 | EE | Jens Gramm, Rolf Niedermeier, Peter Rossmanith: Exact Solutions for CLOSEST STRING and Related Problems. ISAAC 2001: 441-453 |
36 | Peter Rossmanith, Thomas Zeugmann: Stochastic Finite Learning of the Pattern Languages. Machine Learning 44(1/2): 67-91 (2001) | |
35 | EE | Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann: Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Theor. Comput. Sci. 261(1): 119-156 (2001) |
2000 | ||
34 | Javier Esparza, David Hansel, Peter Rossmanith, Stefan Schwoon: Efficient Algorithms for Model Checking Pushdown Systems. CAV 2000: 232-247 | |
33 | EE | Rolf Niedermeier, Peter Rossmanith: On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. ISAAC 2000: 180-191 |
32 | Javier Esparza, Peter Rossmanith, Stefan Schwoon: A Uniform Framework for Problems on Context-Free Grammars. Bulletin of the EATCS 72: 169-177 (2000) | |
31 | EE | Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith: New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT Electronic Colloquium on Computational Complexity (ECCC) 7(37): (2000) |
30 | EE | Rolf Niedermeier, Peter Rossmanith: A general method to speed up fixed-parameter-tractable algorithms. Inf. Process. Lett. 73(3-4): 125-129 (2000) |
29 | EE | Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, Pierre Wolper: An efficient automata approach to some problems on context-free grammars. Inf. Process. Lett. 74(5-6): 221-227 (2000) |
28 | Rolf Niedermeier, Peter Rossmanith: New Upper Bounds for Maximum Satisfiability. J. Algorithms 36(1): 63-88 (2000) | |
1999 | ||
27 | EE | Peter Rossmanith: Learning from Random Text. ATL 1999: 132-144 |
26 | EE | Rolf Niedermeier, Peter Rossmanith: New Upper Bounds for MaxSat. ICALP 1999: 575-584 |
25 | EE | Rolf Niedermeier, Peter Rossmanith: Upper Bounds for Vertex Cover Further Improved. STACS 1999: 561-570 |
24 | EE | Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith: Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals. Algorithmica 25(4): 438-458 (1999) |
1998 | ||
23 | EE | Peter Rossmanith, Thomas Zeugmann: Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data. ICGI 1998: 13-24 |
22 | EE | Rolf Niedermeier, Peter Rossmanith: Unambiguous Computations and Locally Definable Acceptance Types. Theor. Comput. Sci. 194(1-2): 137-161 (1998) |
1997 | ||
21 | Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann: Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. ALT 1997: 260-276 | |
20 | EE | Javier Esparza, Peter Rossmanith: An Automata Approach to Some Problems on Context-Free Grammars. Foundations of Computer Science: Potential - Theory - Cognition 1997: 143-152 |
19 | Carsten Damm, Markus Holzer, Peter Rossmanith: Expressing Uniformity via Oracles. Theory Comput. Syst. 30(4): 355-366 (1997) | |
1995 | ||
18 | Rolf Niedermeier, Peter Rossmanith: PRAM's Towards Realistic Parallelism: BRAM's. FCT 1995: 363-373 | |
17 | Manfred Kunde, Rolf Niedermeier, Klaus Reinhardt, Peter Rossmanith: Optimal Average Case Sorting on Arrays. STACS 1995: 503-514 | |
16 | Rolf Niedermeier, Peter Rossmanith: Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits Inf. Comput. 118(2): 227-245 (1995) | |
15 | Rolf Niedermeier, Peter Rossmanith: On Optimal Orow-Pram Algorithms for Computing Recursively Defined Functions. Parallel Processing Letters 5: 299-309 (1995) | |
14 | Carsten Damm, Markus Holzer, Peter Rossmanith: Expressing Uniformity via Oracles Universität Trier, Mathematik/Informatik, Forschungsbericht 95-01: (1995) | |
1994 | ||
13 | Manfred Kunde, Rolf Niedermeier, Peter Rossmanith: Faster Sorting and Routing on Grids with Diagonals. STACS 1994: 225-236 | |
12 | Klaus-Jörn Lange, Peter Rossmanith: Unambiguous Polynomial Hierarchies and Exponential Size. Structure in Complexity Theory Conference 1994: 106-115 | |
1993 | ||
11 | Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith: Deterministic OL Languages are of Very Low Complexity: DOL is in AC0. Developments in Language Theory 1993: 305-313 | |
10 | Rolf Niedermeier, Peter Rossmanith: On the Power of Reading and Writing Simultaneously in Parallel Computation. ISAAC 1993: 240-249 | |
9 | Rolf Niedermeier, Peter Rossmanith: Extended Locally Definable Acceptance Types (Extended Abstract). STACS 1993: 473-483 | |
1992 | ||
8 | Rolf Niedermeier, Peter Rossmanith: Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits (Extended Abstract). LATIN 1992: 387-400 | |
7 | Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter: Parallel Recognition and Ranking of Context-Free Languages. MFCS 1992: 24-36 | |
6 | Klaus-Jörn Lange, Peter Rossmanith: The Emptiness Problem for Intersections of Regular Languages. MFCS 1992: 346-354 | |
5 | Peter Rossmanith, Wojciech Rytter: Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. Inf. Process. Lett. 44(5): 267-272 (1992) | |
1991 | ||
4 | Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith: Unambiguity and Fewness for Logarithmic Space. FCT 1991: 168-179 | |
3 | Inga Niepel, Peter Rossmanith: Uniform Circuits and Exclusive Read PRAMs. FSTTCS 1991: 307-318 | |
2 | Peter Rossmanith: The Owner Concept for PRAMs. STACS 1991: 172-183 | |
1990 | ||
1 | Klaus-Jörn Lange, Peter Rossmanith: Characterizing Unambiguous Augmented Pushdown Automata by Circuits. MFCS 1990: 399-406 |