×
Compute Distance To:
Author ID: rossmanith.peter Recent zbMATH articles by "Rossmanith, Peter"
Published as: Rossmanith, Peter; Rossmanith, P.
External Links: MGP
all top 5

Co-Authors

2 single-authored
21 Kneis, Joachim
18 Langer, Alexander
16 Niedermeier, Rolf
15 Sikdar, Somnath
14 Mölle, Daniel
13 Richter, Stefan
10 Reidl, Felix
9 Obdržálek, Jan
8 Chang, Maw-Shang
8 Hliněný, Petr
6 Chen, Li-Hsuan
6 Ganian, Robert
6 Hung, Ling-Ju
6 Liedloff, Mathieu
5 Böckenhauer, Hans-Joachim
5 Královič, Richard
5 Sánchez Villaamil, Fernando
4 Esparza, Javier
4 Fernau, Henning
4 Hromkovič, Juraj
4 Kratsch, Dieter
4 Lange, Klaus-Jörn
4 Lin, Chuang-Chieh
3 Gajarský, Jakub
3 Gramm, Jens
3 Komm, Dennis
3 Kunde, Manfred
3 Ordyniak, Sebastian
3 Zeugmann, Thomas
2 Binkele-Raible, Daniel
2 Branković, Ljiljana
2 Erlebach, Thomas
2 Holzer, Markus
2 Junosza-Szaniawski, Konstanty
2 Kim, Eunjung
2 Kratochvíl, Jan
2 Meister, Daniel
2 Paul, Christophe
2 Raible, Daniel
2 Reinhardt, Klaus
2 Rytter, Wojciech
2 Rzążewski, Paweł
2 Sau, Ignasi
2 Schwoon, Stefan
2 Stadtherr, Hans
2 Steger, Angelika
1 Bodlaender, Hans L.
1 Bouajjani, Ahmed
1 Buntrock, Gerhard
1 Burjons, Elisabet
1 Chen, Jian-er
1 Cygan, Marek
1 Damm, Carsten
1 Demaine, Erik D.
1 Dreier, Jan
1 Ďuriš, Pavol
1 F. S. Sánchez Villaamil, Fernando
1 Finkel, Alain
1 Fuchs, Bernhard
1 Hansel, David
1 Heggernes, Pinar
1 Hirsch, Edward A.
1 Hsieh, Sun-Yuan
1 Jenner, Birgit
1 Katoen, Joost-Pieter
1 Kern, Walter
1 Kesdogan, Dogan
1 Královič, Rastislav
1 Kuinke, Philipp
1 Liu, Yizhi
1 Lotze, Henri
1 Lu, Songjian
1 Maler, Oded
1 Marx, Dániel
1 Mömke, Tobias
1 Pardubská, Dana
1 Pašen, Martin
1 Pilipczuk, Marcin L.
1 Raszyk, Martin
1 Su, Ping-Chen
1 Sullivan, Blair D.
1 Sze, Sing-Hoi
1 van Rooij, Johan M. M.
1 Wang, Xinhui
1 Willems, Bernard
1 Wojtaszczyk, Jakub Onufry
1 Wolper, Pierre
1 Wu, Guan-Han
1 Xuan, Ba Le
1 Zhang, Fenghui

Publications by Year

Citations contained in zbMATH Open

78 Publications have been cited 905 times in 699 Documents Cited by Year
Dynamic programming on tree decompositions using generalised fast subset convolution. Zbl 1256.68157
van Rooij, Johan M. M.; Bodlaender, Hans L.; Rossmanith, Peter
52
2009
Fixed-parameter algorithms for CLOSEST STRING and related problems. Zbl 1058.68119
Gramm, Jens; Niedermeier, Rolf; Rossmanith, Peter
42
2003
Efficient algorithms for model checking pushdown systems. Zbl 0974.68116
Esparza, Javier; Hansel, David; Rossmanith, Peter; Schwoon, Stefan
41
2000
A general method to speed up fixed-parameter-tractable algorithms. Zbl 1014.68064
Niedermeier, Rolf; Rossmanith, Peter
37
2000
Randomized divide-and-conquer: improved path, matching, and packing algorithms. Zbl 1191.68849
Chen, Jianer; Kneis, Joachim; Lu, Songjian; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter; Sze, Sing-Hoi; Zhang, Fenghui
32
2009
New upper bounds for maximum satisfiability. Zbl 0959.68049
Niedermeier, Rolf; Rossmanith, Peter
32
2000
An efficient fixed-parameter algorithm for 3-hitting set. Zbl 1118.68511
Niedermeier, Rolf; Rossmanith, Peter
32
2003
Divide-and-color. Zbl 1167.68411
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
25
2006
On efficient fixed-parameter algorithms for weighted vertex cover. Zbl 1046.68058
Niedermeier, Rolf; Rossmanith, Peter
25
2003
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Zbl 1051.68078
Gramm, Jens; Hirsch, Edward A.; Niedermeier, Rolf; Rossmanith, Peter
23
2003
Upper bounds for vertex cover further improved. Zbl 0921.05046
Niedermeier, Rolf; Rossmanith, Peter
23
1999
Kernelization using structural parameters on sparse graph classes. Zbl 1353.68127
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath
21
2017
Parameterized power domination complexity. Zbl 1187.68249
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
21
2006
Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1336.68201
Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath
19
2013
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Zbl 1148.68041
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
19
2008
Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1398.68245
Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath
19
2016
Digraph width measures in parameterized algorithmics. Zbl 1285.05077
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
18
2014
A faster parameterized algorithm for treedepth. Zbl 1412.68089
Reidl, Felix; Rossmanith, Peter; Villaamil, Fernando Sánchez; Sikdar, Somnath
18
2014
On digraph width measures in parameterized algorithmics. Zbl 1273.68276
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
17
2009
Partial vs. complete domination: \(t\)-Dominating Set. Zbl 1131.68488
Kneis, Joachim; Mölle, Daniel; Rossmanith, Peter
17
2007
Dynamic programming for minimum Steiner trees. Zbl 1148.68038
Fuchs, B.; Kern, W.; Molle, D.; Richter, S.; Rossmanith, P.; Wang, X.
17
2007
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack. Zbl 1225.05227
Binkele-Raible, Daniel; Brankovic, Ljiljana; Cygan, Marek; Fernau, Henning; Kneis, Joachim; Kratsch, Dieter; Langer, Alexander; Liedloff, Mathieu; Pilipczuk, Marcin; Rossmanith, Peter; Wojtaszczyk, Jakub Onufry
15
2011
Are there any good digraph width measures? Zbl 1309.68150
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
15
2010
The online knapsack problem: advice and randomization. Zbl 1282.68196
Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Rossmanith, Peter
15
2014
Courcelle’s theorem – a game-theoretic approach. Zbl 1235.68103
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
15
2011
Fixed-parameter algorithms for Vertex Cover \(P_3\). Zbl 1387.05248
Chang, Maw-Shang; Chen, Li-Hsuan; Hung, Ling-Ju; Rossmanith, Peter; Su, Ping-Chen
14
2016
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Zbl 0976.68085
Erlebach, T.; Rossmanith, P.; Stadtherr, H.; Steger, A.; Zeugmann, T.
14
2001
A faster algorithm for the Steiner tree problem. Zbl 1136.68468
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
13
2006
Improved upper bounds for partial vertex cover. Zbl 1202.05108
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
12
2008
Exact solutions for CLOSEST STRING and related problems. Zbl 1077.68659
Gramm, Jens; Niedermeier, Rolf; Rossmanith, Peter
12
2001
A fine-grained analysis of a simple independent set algorithm. Zbl 1248.05202
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
12
2009
Algorithms based on the treewidth of sparse graphs. Zbl 1171.05428
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
12
2005
On the advice complexity of the knapsack problem. Zbl 1297.68266
Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Rossmanith, Peter
12
2012
Reoptimization of Steiner trees: changing the terminal set. Zbl 1192.68471
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Královič, Richard; Mömke, Tobias; Rossmanith, Peter
11
2009
Are there any good digraph width measures? Zbl 1327.05136
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
11
2016
Unambiguity and fewness for logarithmic space. Zbl 0925.68184
Buntrock, Gerhard; Jenner, Birgit; Lange, Klaus-Jörn; Rossmanith, Peter
10
1991
A bound on the pathwidth of sparse graphs with applications to exact algorithms. Zbl 1219.05187
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
10
2009
An exact algorithm for the maximum leaf spanning tree problem. Zbl 1233.68236
Fernau, Henning; Kneis, Joachim; Kratsch, Dieter; Langer, Alexander; Liedloff, Mathieu; Raible, Daniel; Rossmanith, Peter
10
2011
Kernelization using structural parameters on sparse graph classes. Zbl 1353.68126
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath
9
2013
A new algorithm for finding trees with many leaves. Zbl 1183.05082
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
8
2008
Stochastic finite learning of the pattern languages. Zbl 0992.68117
Rossmanith, Peter; Zeugmann, Thomas
8
2001
Practical algorithms for MSO model-checking on tree-decomposable graphs. Zbl 1302.68184
Langer, Alexander; Reidl, Felix; Rossmanith, Peter; Sikdar, Somnath
8
2014
On the power of randomness versus advice in online computation. Zbl 1367.68340
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Komm, Dennis; Královič, Richard; Rossmanith, Peter
7
2012
Enumerate and expand: new runtime bounds for vertex cover variants. Zbl 1162.05361
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
7
2006
An exact algorithm for the maximum leaf spanning tree problem. Zbl 1273.05219
Fernau, Henning; Kneis, Joachim; Kratsch, Dieter; Langer, Alexander; Liedloff, Mathieu; Raible, Daniel; Rossmanith, Peter
6
2009
New fixed-parameter algorithms for the minimum quartet inconsistency problem. Zbl 1204.68257
Chang, Maw-Shang; Lin, Chuang-Chieh; Rossmanith, Peter
6
2010
A new algorithm for finding trees with many leaves. Zbl 1230.68112
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
6
2011
Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract). Zbl 1331.68111
Langer, Alexander; Rossmanith, Peter; Sikdar, Somnath
5
2011
Intuitive algorithms and \(t\)-vertex cover. Zbl 1135.68442
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
5
2006
Characterizing unambiguous augmented pushdown automata by circuits. Zbl 0731.68038
Lange, Klaus-Jörn; Rossmanith, Peter
5
1990
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking. Zbl 1311.68087
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
5
2014
Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits. Zbl 0826.68080
Niedermeier, Rolf; Rossmanith, Peter
4
1995
Exact algorithms for problems related to the densest \(k\)-set problem. Zbl 1302.05182
Chang, Maw-Shang; Chen, Li-Hsuan; Hung, Ling-Ju; Rossmanith, Peter; Wu, Guan-Han
4
2014
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs. Zbl 1425.05149
Demaine, Erik D.; Reidl, Felix; Rossmanith, Peter; F. S. Sánchez Villaamil, Fernando; Sikdar, Somnath; Sullivan, Blair D.
4
2019
An automata approach to some problems on context-free grammars. Zbl 0895.68085
Esparza, J.; Rossmanith, P.
3
1997
Unambiguous computations and locally definable acceptance types. Zbl 0902.68079
Niedermeier, Rolf; Rossmanith, Peter
3
1998
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Zbl 1185.05117
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
3
2006
Observations on \(\log(n)\) time parallel recognition of unambiguous cfl’s. Zbl 0764.68053
Rossmanith, Peter; Rytter, Wojciech
3
1992
Fast exact algorithm for \(L(2,1)\)-labeling of graphs. Zbl 1417.05214
Junosza-Szaniawski, Konstanty; Kratochvíl, Jan; Liedloff, Mathieu; Rossmanith, Peter; Rzążewski, Paweł
3
2013
Extended locally definable acceptance types. Zbl 0791.68065
Niedermeier, Rolf; Rossmanith, Peter
2
1993
New upper bounds for MaxSat. Zbl 0946.68061
Niedermeier, Rolf; Rossmanith, Peter
2
1999
A uniform framework for problems on context-free grammars. Zbl 0977.68051
Esparza, Javier; Rossmanith, Peter; Schwoon, Stefan
2
2000
Fast exact algorithm for \(L(2,1)\)-labeling of graphs. Zbl 1333.05292
Junosza-Szaniawski, Konstanty; Kratochvíl, Jan; Liedloff, Mathieu; Rossmanith, Peter; Rzążewski, Paweł
2
2011
Recognition of probe distance-hereditary graphs. Zbl 1255.05157
Chang, Maw-Shang; Hung, Ling-Ju; Rossmanith, Peter
2
2013
An efficient automata approach to some problems on context-free grammars. Zbl 1137.68418
Bouajjani, Ahmed; Esparza, Javier; Finkel, Alain; Maler, Oded; Rossmanith, Peter; Willems, Bernard; Wolper, Pierre
2
2000
The owner concept for PRAMs. Zbl 0773.68027
Rossmanith, Peter
2
1991
Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking. Zbl 1245.68107
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
2
2012
A parameterized route to exact puzzles: breaking the \(2^{n }\)-barrier for irredundance (extended abstract). Zbl 1284.05266
Binkele-Raible, Daniel; Brankovic, Ljiljana; Fernau, Henning; Kneis, Joachim; Kratsch, Dieter; Langer, Alexander; Liedloff, Mathieu; Rossmanith, Peter
2
2010
On the parameterized complexity of exact satisfiability problems. Zbl 1156.68404
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
2
2005
Evaluation of an MSO-solver. Zbl 1430.68415
Langer, Alexander; Reidl, Felix; Rossmanith, Peter; Sikdar, Somnath
2
2012
Optimal deterministic sorting and routing on grids and tori with diagonals. Zbl 0937.68036
Kunde, M.; Niedermeier, R.; Reinhardt, K.; Rossmanith, P.
1
1999
Faster sorting and routing on grids with diagonals. Zbl 0941.68550
Kunde, Manfred; Niedermeier, Rolf; Rossmanith, Peter
1
1994
Learning from random text. Zbl 0949.68130
Rossmanith, Peter
1
1999
Expressing uniformity via oracles. Zbl 0872.68047
Damm, C.; Holzer, M.; Rossmanith, P.
1
1997
On efficient fixed parameter algorithms for WEIGHTED VERTEX COVER. Zbl 1044.68133
Niedermeier, Rolf; Rossmanith, Peter
1
2000
A property tester for tree-likeness of quartet topologies. Zbl 1227.68115
Chang, Maw-Shang; Lin, Chuang-Chieh; Rossmanith, Peter
1
2011
Width, depth, and space: tradeoffs between branching and dynamic programming. Zbl 1461.68147
Chen, Li-Hsuan; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando
1
2018
The emptiness problem for intersections of regular languages. Zbl 07573151
Lange, Klaus-Jörn; Rossmanith, Peter
1
1992
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs. Zbl 1425.05149
Demaine, Erik D.; Reidl, Felix; Rossmanith, Peter; F. S. Sánchez Villaamil, Fernando; Sikdar, Somnath; Sullivan, Blair D.
4
2019
Width, depth, and space: tradeoffs between branching and dynamic programming. Zbl 1461.68147
Chen, Li-Hsuan; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando
1
2018
Kernelization using structural parameters on sparse graph classes. Zbl 1353.68127
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath
21
2017
Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1398.68245
Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath
19
2016
Fixed-parameter algorithms for Vertex Cover \(P_3\). Zbl 1387.05248
Chang, Maw-Shang; Chen, Li-Hsuan; Hung, Ling-Ju; Rossmanith, Peter; Su, Ping-Chen
14
2016
Are there any good digraph width measures? Zbl 1327.05136
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
11
2016
Digraph width measures in parameterized algorithmics. Zbl 1285.05077
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
18
2014
A faster parameterized algorithm for treedepth. Zbl 1412.68089
Reidl, Felix; Rossmanith, Peter; Villaamil, Fernando Sánchez; Sikdar, Somnath
18
2014
The online knapsack problem: advice and randomization. Zbl 1282.68196
Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Rossmanith, Peter
15
2014
Practical algorithms for MSO model-checking on tree-decomposable graphs. Zbl 1302.68184
Langer, Alexander; Reidl, Felix; Rossmanith, Peter; Sikdar, Somnath
8
2014
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking. Zbl 1311.68087
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
5
2014
Exact algorithms for problems related to the densest \(k\)-set problem. Zbl 1302.05182
Chang, Maw-Shang; Chen, Li-Hsuan; Hung, Ling-Ju; Rossmanith, Peter; Wu, Guan-Han
4
2014
Linear kernels and single-exponential algorithms via protrusion decompositions. Zbl 1336.68201
Kim, Eun Jung; Langer, Alexander; Paul, Christophe; Reidl, Felix; Rossmanith, Peter; Sau, Ignasi; Sikdar, Somnath
19
2013
Kernelization using structural parameters on sparse graph classes. Zbl 1353.68126
Gajarský, Jakub; Hliněný, Petr; Obdržálek, Jan; Ordyniak, Sebastian; Reidl, Felix; Rossmanith, Peter; Sánchez Villaamil, Fernando; Sikdar, Somnath
9
2013
Fast exact algorithm for \(L(2,1)\)-labeling of graphs. Zbl 1417.05214
Junosza-Szaniawski, Konstanty; Kratochvíl, Jan; Liedloff, Mathieu; Rossmanith, Peter; Rzążewski, Paweł
3
2013
Recognition of probe distance-hereditary graphs. Zbl 1255.05157
Chang, Maw-Shang; Hung, Ling-Ju; Rossmanith, Peter
2
2013
On the advice complexity of the knapsack problem. Zbl 1297.68266
Böckenhauer, Hans-Joachim; Komm, Dennis; Královič, Richard; Rossmanith, Peter
12
2012
On the power of randomness versus advice in online computation. Zbl 1367.68340
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Komm, Dennis; Královič, Richard; Rossmanith, Peter
7
2012
Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking. Zbl 1245.68107
Ganian, Robert; Hliněný, Petr; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
2
2012
Evaluation of an MSO-solver. Zbl 1430.68415
Langer, Alexander; Reidl, Felix; Rossmanith, Peter; Sikdar, Somnath
2
2012
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack. Zbl 1225.05227
Binkele-Raible, Daniel; Brankovic, Ljiljana; Cygan, Marek; Fernau, Henning; Kneis, Joachim; Kratsch, Dieter; Langer, Alexander; Liedloff, Mathieu; Pilipczuk, Marcin; Rossmanith, Peter; Wojtaszczyk, Jakub Onufry
15
2011
Courcelle’s theorem – a game-theoretic approach. Zbl 1235.68103
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
15
2011
An exact algorithm for the maximum leaf spanning tree problem. Zbl 1233.68236
Fernau, Henning; Kneis, Joachim; Kratsch, Dieter; Langer, Alexander; Liedloff, Mathieu; Raible, Daniel; Rossmanith, Peter
10
2011
A new algorithm for finding trees with many leaves. Zbl 1230.68112
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
6
2011
Linear-time algorithms for graphs of bounded rankwidth: a fresh look using game theory (extended abstract). Zbl 1331.68111
Langer, Alexander; Rossmanith, Peter; Sikdar, Somnath
5
2011
Fast exact algorithm for \(L(2,1)\)-labeling of graphs. Zbl 1333.05292
Junosza-Szaniawski, Konstanty; Kratochvíl, Jan; Liedloff, Mathieu; Rossmanith, Peter; Rzążewski, Paweł
2
2011
A property tester for tree-likeness of quartet topologies. Zbl 1227.68115
Chang, Maw-Shang; Lin, Chuang-Chieh; Rossmanith, Peter
1
2011
Are there any good digraph width measures? Zbl 1309.68150
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Meister, Daniel; Obdržálek, Jan; Rossmanith, Peter; Sikdar, Somnath
15
2010
New fixed-parameter algorithms for the minimum quartet inconsistency problem. Zbl 1204.68257
Chang, Maw-Shang; Lin, Chuang-Chieh; Rossmanith, Peter
6
2010
A parameterized route to exact puzzles: breaking the \(2^{n }\)-barrier for irredundance (extended abstract). Zbl 1284.05266
Binkele-Raible, Daniel; Brankovic, Ljiljana; Fernau, Henning; Kneis, Joachim; Kratsch, Dieter; Langer, Alexander; Liedloff, Mathieu; Rossmanith, Peter
2
2010
Dynamic programming on tree decompositions using generalised fast subset convolution. Zbl 1256.68157
van Rooij, Johan M. M.; Bodlaender, Hans L.; Rossmanith, Peter
52
2009
Randomized divide-and-conquer: improved path, matching, and packing algorithms. Zbl 1191.68849
Chen, Jianer; Kneis, Joachim; Lu, Songjian; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter; Sze, Sing-Hoi; Zhang, Fenghui
32
2009
On digraph width measures in parameterized algorithmics. Zbl 1273.68276
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
17
2009
A fine-grained analysis of a simple independent set algorithm. Zbl 1248.05202
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
12
2009
Reoptimization of Steiner trees: changing the terminal set. Zbl 1192.68471
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Královič, Richard; Mömke, Tobias; Rossmanith, Peter
11
2009
A bound on the pathwidth of sparse graphs with applications to exact algorithms. Zbl 1219.05187
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
10
2009
An exact algorithm for the maximum leaf spanning tree problem. Zbl 1273.05219
Fernau, Henning; Kneis, Joachim; Kratsch, Dieter; Langer, Alexander; Liedloff, Mathieu; Raible, Daniel; Rossmanith, Peter
6
2009
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Zbl 1148.68041
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
19
2008
Improved upper bounds for partial vertex cover. Zbl 1202.05108
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
12
2008
A new algorithm for finding trees with many leaves. Zbl 1183.05082
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
8
2008
Partial vs. complete domination: \(t\)-Dominating Set. Zbl 1131.68488
Kneis, Joachim; Mölle, Daniel; Rossmanith, Peter
17
2007
Dynamic programming for minimum Steiner trees. Zbl 1148.68038
Fuchs, B.; Kern, W.; Molle, D.; Richter, S.; Rossmanith, P.; Wang, X.
17
2007
Divide-and-color. Zbl 1167.68411
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
25
2006
Parameterized power domination complexity. Zbl 1187.68249
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
21
2006
A faster algorithm for the Steiner tree problem. Zbl 1136.68468
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
13
2006
Enumerate and expand: new runtime bounds for vertex cover variants. Zbl 1162.05361
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
7
2006
Intuitive algorithms and \(t\)-vertex cover. Zbl 1135.68442
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
5
2006
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Zbl 1185.05117
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
3
2006
Algorithms based on the treewidth of sparse graphs. Zbl 1171.05428
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
12
2005
On the parameterized complexity of exact satisfiability problems. Zbl 1156.68404
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
2
2005
Fixed-parameter algorithms for CLOSEST STRING and related problems. Zbl 1058.68119
Gramm, Jens; Niedermeier, Rolf; Rossmanith, Peter
42
2003
An efficient fixed-parameter algorithm for 3-hitting set. Zbl 1118.68511
Niedermeier, Rolf; Rossmanith, Peter
32
2003
On efficient fixed-parameter algorithms for weighted vertex cover. Zbl 1046.68058
Niedermeier, Rolf; Rossmanith, Peter
25
2003
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Zbl 1051.68078
Gramm, Jens; Hirsch, Edward A.; Niedermeier, Rolf; Rossmanith, Peter
23
2003
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Zbl 0976.68085
Erlebach, T.; Rossmanith, P.; Stadtherr, H.; Steger, A.; Zeugmann, T.
14
2001
Exact solutions for CLOSEST STRING and related problems. Zbl 1077.68659
Gramm, Jens; Niedermeier, Rolf; Rossmanith, Peter
12
2001
Stochastic finite learning of the pattern languages. Zbl 0992.68117
Rossmanith, Peter; Zeugmann, Thomas
8
2001
Efficient algorithms for model checking pushdown systems. Zbl 0974.68116
Esparza, Javier; Hansel, David; Rossmanith, Peter; Schwoon, Stefan
41
2000
A general method to speed up fixed-parameter-tractable algorithms. Zbl 1014.68064
Niedermeier, Rolf; Rossmanith, Peter
37
2000
New upper bounds for maximum satisfiability. Zbl 0959.68049
Niedermeier, Rolf; Rossmanith, Peter
32
2000
A uniform framework for problems on context-free grammars. Zbl 0977.68051
Esparza, Javier; Rossmanith, Peter; Schwoon, Stefan
2
2000
An efficient automata approach to some problems on context-free grammars. Zbl 1137.68418
Bouajjani, Ahmed; Esparza, Javier; Finkel, Alain; Maler, Oded; Rossmanith, Peter; Willems, Bernard; Wolper, Pierre
2
2000
On efficient fixed parameter algorithms for WEIGHTED VERTEX COVER. Zbl 1044.68133
Niedermeier, Rolf; Rossmanith, Peter
1
2000
Upper bounds for vertex cover further improved. Zbl 0921.05046
Niedermeier, Rolf; Rossmanith, Peter
23
1999
New upper bounds for MaxSat. Zbl 0946.68061
Niedermeier, Rolf; Rossmanith, Peter
2
1999
Optimal deterministic sorting and routing on grids and tori with diagonals. Zbl 0937.68036
Kunde, M.; Niedermeier, R.; Reinhardt, K.; Rossmanith, P.
1
1999
Learning from random text. Zbl 0949.68130
Rossmanith, Peter
1
1999
Unambiguous computations and locally definable acceptance types. Zbl 0902.68079
Niedermeier, Rolf; Rossmanith, Peter
3
1998
An automata approach to some problems on context-free grammars. Zbl 0895.68085
Esparza, J.; Rossmanith, P.
3
1997
Expressing uniformity via oracles. Zbl 0872.68047
Damm, C.; Holzer, M.; Rossmanith, P.
1
1997
Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits. Zbl 0826.68080
Niedermeier, Rolf; Rossmanith, Peter
4
1995
Faster sorting and routing on grids with diagonals. Zbl 0941.68550
Kunde, Manfred; Niedermeier, Rolf; Rossmanith, Peter
1
1994
Extended locally definable acceptance types. Zbl 0791.68065
Niedermeier, Rolf; Rossmanith, Peter
2
1993
Observations on \(\log(n)\) time parallel recognition of unambiguous cfl’s. Zbl 0764.68053
Rossmanith, Peter; Rytter, Wojciech
3
1992
The emptiness problem for intersections of regular languages. Zbl 07573151
Lange, Klaus-Jörn; Rossmanith, Peter
1
1992
Unambiguity and fewness for logarithmic space. Zbl 0925.68184
Buntrock, Gerhard; Jenner, Birgit; Lange, Klaus-Jörn; Rossmanith, Peter
10
1991
The owner concept for PRAMs. Zbl 0773.68027
Rossmanith, Peter
2
1991
Characterizing unambiguous augmented pushdown automata by circuits. Zbl 0731.68038
Lange, Klaus-Jörn; Rossmanith, Peter
5
1990
all top 5

Cited by 952 Authors

38 Saurabh, Saket
31 Rossmanith, Peter
29 Fernau, Henning
28 Fomin, Fedor V.
22 Lokshtanov, Daniel
22 Niedermeier, Rolf
22 Zehavi, Meirav
18 Thilikos, Dimitrios M.
17 Panolan, Fahad
15 Chen, Jian-er
15 Ganian, Robert
15 Paschos, Vangelis Th.
14 Böckenhauer, Hans-Joachim
14 Jansen, Bart M. P.
12 Hromkovič, Juraj
12 Liedloff, Mathieu
12 Sau, Ignasi
11 Gutin, Gregory Z.
11 Komm, Dennis
11 Raman, Venkatesh
11 Sikdar, Somnath
10 Eiben, Eduard
10 Golovach, Petr A.
10 Kratsch, Dieter
10 Lampis, Michael
10 Pilipczuk, Marcin L.
9 Bodlaender, Hans L.
9 Damaschke, Peter
9 Fellows, Michael Ralph
9 Guo, Jiong
9 Kwon, Ojoung
9 Ramanujan, M. S.
9 Reidl, Felix
9 Wang, Jianxin
8 Binkele-Raible, Daniel
8 Gaspers, Serge
8 Gurski, Frank
8 Kanj, Iyad A.
8 Královič, Richard
8 Langer, Alexander
7 Bazgan, Cristina
7 Björklund, Andreas
7 Chen, Li-Hsuan
7 Hanaka, Tesshu
7 Kneis, Joachim
7 Komusiewicz, Christian
7 Mömke, Tobias
7 Mouawad, Amer E.
7 Paul, Christophe
7 Wang, Lusheng
7 Zhang, Zhao
6 Boria, Nicolas
6 Branković, Ljiljana
6 Chang, Maw-Shang
6 Chen, Zhizhong
6 Komander, Dominique
6 Koutecký, Martin
6 Kratsch, Stefan
6 Ono, Hirotaka
6 Schmid, Markus L.
6 Shachnai, Hadas
6 Suchý, Ondřej
6 Xia, Ge
6 Xiao, Mingyu
5 Agrawal, Akanksha
5 Allender, Eric W.
5 Casel, Katrin
5 Downey, Rodney Graham
5 Escoffier, Bruno
5 Grandoni, Fabrizio
5 Hermelin, Danny
5 Kaski, Petteri
5 Kim, Eunjung
5 Knop, Dušan
5 Koivisto, Mikko
5 Kreutzer, Stephan
5 Krug, Sacha
5 Kucera, Antonin
5 Misra, Neeldhara
5 Mnich, Matthias
5 Monnot, Jérôme
5 Moser, Hannes
5 Ordyniak, Sebastian
5 Perez, Anthony
5 Pilipczuk, Michał
5 Rehs, Carolin
5 Sorge, Manuel
5 Szeider, Stefan
4 Abu-Khzam, Faisal N.
4 Bannach, Max
4 Bozzelli, Laura
4 de Figueiredo, Celina M. Herrera
4 Della Croce, Federico
4 Esparza, Javier
4 Faria, Luerbio
4 Giannopoulou, Archontia C.
4 Hirsch, Edward A.
4 Hliněný, Petr
4 Huang, Xiaohui
4 Hüffner, Falk
...and 852 more Authors
all top 5

Cited in 81 Serials

121 Theoretical Computer Science
70 Algorithmica
50 Discrete Applied Mathematics
41 Journal of Computer and System Sciences
31 Information Processing Letters
31 Theory of Computing Systems
22 SIAM Journal on Discrete Mathematics
21 Journal of Combinatorial Optimization
20 Journal of Discrete Algorithms
16 Information and Computation
7 Discrete Optimization
6 Artificial Intelligence
6 Computers & Operations Research
4 SIAM Journal on Computing
4 European Journal of Operational Research
4 Formal Methods in System Design
4 Journal of Graph Algorithms and Applications
4 Discrete Mathematics, Algorithms and Applications
4 Computer Science Review
3 Discrete Mathematics
3 Journal of Graph Theory
3 European Journal of Combinatorics
3 Optimization Letters
3 Algorithms
2 Acta Informatica
2 Applied Mathematics and Computation
2 Journal of Combinatorial Theory. Series B
2 Networks
2 Journal of Automated Reasoning
2 Formal Aspects of Computing
2 International Journal of Foundations of Computer Science
2 Mathematical Programming. Series A. Series B
2 Computational Complexity
2 Constraints
2 Optimization Methods & Software
2 ACM Journal of Experimental Algorithmics
2 Logical Methods in Computer Science
2 RAIRO. Theoretical Informatics and Applications
1 International Journal of General Systems
1 Journal of Mathematical Biology
1 Information Sciences
1 Journal of Combinatorial Theory. Series A
1 Mathematical Systems Theory
1 Operations Research
1 Statistica Neerlandica
1 Systems & Control Letters
1 Acta Applicandae Mathematicae
1 Annals of Pure and Applied Logic
1 Optimization
1 Graphs and Combinatorics
1 Journal of Computer Science and Technology
1 Annals of Operations Research
1 Discrete Mathematics and Applications
1 Journal of Global Optimization
1 Applied Mathematical Modelling
1 Linear Algebra and its Applications
1 Experimental Mathematics
1 Journal of Mathematical Sciences (New York)
1 The Electronic Journal of Combinatorics
1 The Journal of Artificial Intelligence Research (JAIR)
1 Annals of Mathematics and Artificial Intelligence
1 Discussiones Mathematicae. Graph Theory
1 INFORMS Journal on Computing
1 Journal of Scheduling
1 Journal of the ACM
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Journal of Discrete Mathematical Sciences & Cryptography
1 Journal of the European Mathematical Society (JEMS)
1 RAIRO. Theoretical Informatics and Applications
1 CEJOR. Central European Journal of Operations Research
1 RAIRO. Operations Research
1 Trudy Instituta Matematiki
1 Journal of Systems Science and Complexity
1 AKCE International Journal of Graphs and Combinatorics
1 The European Physical Journal B. Condensed Matter and Complex Systems
1 Journal of Satisfiability, Boolean Modeling and Computation
1 Operational Research. An International Journal
1 Mathematical Programming Computation
1 Science China. Information Sciences
1 Philosophical Transactions of the Royal Society of London. A. Mathematical, Physical and Engineering Sciences
1 Bulletin of the Hellenic Mathematical Society

Citations by Year