×

zbMATH — the first resource for mathematics

Mölle, Daniel

Compute Distance To:
Author ID: molle.daniel Recent zbMATH articles by "Mölle, Daniel"
Published as: Molle, D.; Mölle, Daniel
External Links: MGP
Documents Indexed: 14 Publications since 2005

Publications by Year

Citations contained in zbMATH

13 Publications have been cited 162 times in 135 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
Dynamic programming for minimum Steiner trees. Zbl 1148.68038
Fuchs, B.; Kern, W.; Molle, D.; Richter, S.; Rossmanith, P.; Wang, X.
16
2007
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Zbl 1148.68041
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
14
2008
Partial vs. complete domination: \(t\)-Dominating Set. Zbl 1131.68488
Kneis, Joachim; Mölle, Daniel; Rossmanith, Peter
13
2007
A faster algorithm for the Steiner tree problem. Zbl 1136.68468
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
12
2006
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
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
4
2006
On the parameterized complexity of exact satisfiability problems. Zbl 1156.68404
Kneis, Joachim; Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
4
2005
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Zbl 1185.05117
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
3
2006
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
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
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Zbl 1148.68041
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
14
2008
Dynamic programming for minimum Steiner trees. Zbl 1148.68038
Fuchs, B.; Kern, W.; Molle, D.; Richter, S.; Rossmanith, P.; Wang, X.
16
2007
Partial vs. complete domination: \(t\)-Dominating Set. Zbl 1131.68488
Kneis, Joachim; Mölle, Daniel; Rossmanith, Peter
13
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
A faster algorithm for the Steiner tree problem. Zbl 1136.68468
Mölle, Daniel; Richter, Stefan; Rossmanith, Peter
12
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
4
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
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 238 Authors

18 Saurabh, Saket
16 Fomin, Fedor V.
13 Zehavi, Meirav
10 Lokshtanov, Daniel
6 Fernau, Henning
6 Panolan, Fahad
5 Binkele-Raible, Daniel
5 Björklund, Andreas
5 Bodlaender, Hans L.
5 Raman, Venkatesh
4 Chen, Jian-er
4 Gaspers, Serge
4 Gutin, Gregory Z.
4 Kaski, Petteri
4 Kratsch, Stefan
4 Nederlof, Jesper
4 Rossmanith, Peter
3 Damaschke, Peter
3 Escoffier, Bruno
3 Fellows, Michael Ralph
3 Feng, Qilong
3 Golovach, Petr A.
3 Grandoni, Fabrizio
3 Husfeldt, Thore
3 Kowalik, Łukasz
3 Kratsch, Dieter
3 Liao, Chung-Shou
3 Misra, Neeldhara
3 Moser, Hannes
3 Shachnai, Hadas
3 Sikdar, Somnath
3 Sorkin, Gregory B.
3 Suchý, Ondřej
3 Vygen, Jens
3 Wang, Jianxin
2 Bazgan, Cristina
2 Brimkov, Boris
2 Cohen, Nathann
2 Dorbec, Paul
2 Edwards, Keith J.
2 Ferrero, Daniela
2 Foucaud, Florent
2 Hermelin, Danny
2 Jansen, Bart M. P.
2 Jiang, Minghui
2 Kamat, Vikram
2 Kang, Liying
2 Kim, Eun Jung
2 Kneis, Joachim
2 Koivisto, Mikko
2 Langer, Alexander
2 Li, Yuchao
2 Lu, Songjian
2 Niedermeier, Rolf
2 Paschos, Vangelis Th.
2 Pinter, Ron Yair
2 Protti, Fábio
2 Rosamond, Frances A.
2 Sakai, Takayuki
2 Seto, Kazuhisa
2 Sikora, Florian
2 Smith, Logan
2 Tamaki, Suguru
2 van Rooij, Johan M. M.
2 Wang, Wei
2 Xia, Ge
2 Yang, Zishen
2 Yeo, Anders
2 Zhang, Yong
1 Aazami, Ashkan
1 Abu-Khzam, Faisal N.
1 Amini, Omid
1 Angel, Eric
1 Araújo, Júlio César Silva
1 Bampis, Evripidis
1 Barbero, Florian
1 Barrera, Roberto
1 Barth, Dominique
1 Ben-Basat, Ran
1 Bentz, Cédric
1 Bezáková, Ivona
1 Böckenhauer, Hans-Joachim
1 Boria, Nicolas
1 Bourgeois, Nicolas
1 Campos, Victor A.
1 Carbone, Anna
1 Cardinal, Jean-Paul
1 Carlson, Joshua
1 Caskurlu, Bugra
1 Chang, Gerard Jennhwa
1 Chang, Jou-Ming
1 Chen, Lei
1 Chen, Zhizhong
1 Chu, Chia-Chi
1 Costa Dourado, Mitre
1 Curticapean, Radu
1 Cygan, Marek
1 De Oliveira, Rodolfo Alves
1 Dell, Holger
1 Della Croce, Federico
...and 138 more Authors

Citations by Year