×

zbMATH — the first resource for mathematics

Kneis, Joachim

Compute Distance To:
Author ID: kneis.joachim Recent zbMATH articles by "Kneis, Joachim"
Published as: Kneis, Joachim
Documents Indexed: 26 Publications since 2005

Publications by Year

Citations contained in zbMATH

26 Publications have been cited 270 times in 215 Documents Cited by Year
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
29
2009
Divide-and-color. Zbl 1167.68411
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
23
2006
Parameterized power domination complexity. Zbl 1187.68249
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
17
2006
On the approximability of TSP on local modifications of optimally solved instances. Zbl 1206.90134
Böckenhauer, Hans-Joachim; Forlizzi, Luca; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim; Proietti, Guido; Widmayer, Peter
16
2007
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
On digraph width measures in parameterized algorithmics. Zbl 1273.68276
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
15
2009
Courcelle’s theorem – a game-theoretic approach. Zbl 1235.68103
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
14
2011
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
13
2011
Partial vs. complete domination: \(t\)-Dominating Set. Zbl 1131.68488
Kneis, Joachim; Mölle, Daniel; Rossmanith, Peter
13
2007
Digraph width measures in parameterized algorithmics. Zbl 1285.05077
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
12
2014
A fine-grained analysis of a simple independent set algorithm. Zbl 1248.05202
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
12
2009
Improved upper bounds for partial vertex cover. Zbl 1202.05108
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
11
2008
Algorithms based on the treewidth of sparse graphs. Zbl 1171.05428
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
11
2005
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
9
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
8
2011
A new algorithm for finding trees with many leaves. Zbl 1183.05082
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
8
2008
The parameterized approximability of TSP with deadlines. Zbl 1148.68052
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim
8
2007
A new algorithm for finding trees with many leaves. Zbl 1230.68112
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
6
2011
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
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
4
2016
A practical approach to Courcelle’s theorem. Zbl 1291.03077
Kneis, Joachim; Langer, Alexander
4
2009
Intuitive algorithms and \(t\)-vertex cover. Zbl 1135.68442
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
4
2006
On the approximation hardness of some generalizations of TSP. (Extended abstract). Zbl 1141.90507
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim
4
2006
On the parameterized complexity of exact satisfiability problems. Zbl 1156.68404
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
4
2005
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
Approximation hardness of deadline-TSP reoptimization. Zbl 1166.68042
Böckenhauer, Hans-Joachim; Kneis, Joachim; Kupke, Joachim
2
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
4
2016
Digraph width measures in parameterized algorithmics. Zbl 1285.05077
Ganian, Robert; Hliněný, Petr; Kneis, Joachim; Langer, Alexander; Obdržálek, Jan; Rossmanith, Peter
12
2014
Courcelle’s theorem – a game-theoretic approach. Zbl 1235.68103
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
14
2011
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
13
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
8
2011
A new algorithm for finding trees with many leaves. Zbl 1230.68112
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
6
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
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
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
29
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
15
2009
A fine-grained analysis of a simple independent set algorithm. Zbl 1248.05202
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
12
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
9
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
A practical approach to Courcelle’s theorem. Zbl 1291.03077
Kneis, Joachim; Langer, Alexander
4
2009
Approximation hardness of deadline-TSP reoptimization. Zbl 1166.68042
Böckenhauer, Hans-Joachim; Kneis, Joachim; Kupke, Joachim
2
2009
Improved upper bounds for partial vertex cover. Zbl 1202.05108
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
11
2008
A new algorithm for finding trees with many leaves. Zbl 1183.05082
Kneis, Joachim; Langer, Alexander; Rossmanith, Peter
8
2008
On the approximability of TSP on local modifications of optimally solved instances. Zbl 1206.90134
Böckenhauer, Hans-Joachim; Forlizzi, Luca; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim; Proietti, Guido; Widmayer, Peter
16
2007
Partial vs. complete domination: \(t\)-Dominating Set. Zbl 1131.68488
Kneis, Joachim; Mölle, Daniel; Rossmanith, Peter
13
2007
The parameterized approximability of TSP with deadlines. Zbl 1148.68052
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim
8
2007
Divide-and-color. Zbl 1167.68411
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
23
2006
Parameterized power domination complexity. Zbl 1187.68249
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
17
2006
Intuitive algorithms and \(t\)-vertex cover. Zbl 1135.68442
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
4
2006
On the approximation hardness of some generalizations of TSP. (Extended abstract). Zbl 1141.90507
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Kneis, Joachim; Kupke, Joachim
4
2006
Algorithms based on the treewidth of sparse graphs. Zbl 1171.05428
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
11
2005
On the parameterized complexity of exact satisfiability problems. Zbl 1156.68404
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
4
2005
all top 5

Cited by 326 Authors

16 Fernau, Henning
15 Saurabh, Saket
15 Zehavi, Meirav
14 Fomin, Fedor V.
11 Rossmanith, Peter
9 Paschos, Vangelis Th.
8 Binkele-Raible, Daniel
8 Liedloff, Mathieu
8 Lokshtanov, Daniel
7 Böckenhauer, Hans-Joachim
7 Gutin, Gregory Z.
7 Kneis, Joachim
7 Kratsch, Dieter
7 Langer, Alexander
7 Sikdar, Somnath
6 Bazgan, Cristina
6 Branković, Ljiljana
6 Gaspers, Serge
6 Golovach, Petr A.
5 Björklund, Andreas
5 Bodlaender, Hans L.
5 Mömke, Tobias
5 Raman, Venkatesh
5 Shachnai, Hadas
4 Boria, Nicolas
4 Casel, Katrin
4 Chen, Jian-er
4 Ganian, Robert
4 Hliněný, Petr
4 Kreutzer, Stephan
4 Monnot, Jérôme
4 Obdržálek, Jan
4 Panolan, Fahad
4 Thilikos, Dimitrios M.
3 Bonsma, Paul S.
3 Cygan, Marek
3 Damaschke, Peter
3 Della Croce, Federico
3 Downey, Rodney Graham
3 Feng, Qilong
3 Gurski, Frank
3 Hromkovič, Juraj
3 Husfeldt, Thore
3 Kaski, Petteri
3 Kim, Eun Jung
3 Koivisto, Mikko
3 Kowalik, Łukasz
3 Kratsch, Stefan
3 Lampis, Michael
3 Liao, Chung-Shou
3 Meister, Daniel
3 Moser, Hannes
3 Nederlof, Jesper
3 Niedermeier, Rolf
3 Nishimura, Naomi
3 Pilipczuk, Michał
3 Reidl, Felix
3 Sayadi, Mohamed Yosri
3 Sorkin, Gregory B.
3 van Rooij, Johan M. M.
3 Wang, Jianxin
3 Xiao, Mingyu
3 Yeo, Anders
2 Brimkov, Boris
2 Chang, Maw-Shang
2 Chen, Li-Hsuan
2 Cohen, Nathann
2 Courcelle, Bruno
2 De Oliveira Oliveira, Mateus
2 Dorbec, Paul
2 Edwards, Keith J.
2 Escoffier, Bruno
2 Fellows, Michael Ralph
2 Ferrero, Daniela
2 Foucaud, Florent
2 Giannopoulou, Archontia C.
2 Hanaka, Tesshu
2 Hermelin, Danny
2 Hung, Ling-Ju
2 Hunter, Paul
2 Jansen, Bart M. P.
2 Jansen, Klaus
2 Jiang, Minghui
2 Kamat, Vikram
2 Kang, Liying
2 Katrenič, Ján
2 Klein, Kim-Manuel
2 Koutecký, Martin
2 Lu, Songjian
2 Marx, Dániel
2 Misra, Neeldhara
2 Nagamochi, Hiroshi
2 Ono, Hirotaka
2 Ordyniak, Sebastian
2 Pilipczuk, Marcin
2 Pinter, Ron Yair
2 Raible, Daniel
2 Razzazi, Mohammadreza
2 Rehs, Carolin
2 Roayaei, Mehdy
...and 226 more Authors

Citations by Year