Daniel Raible

	2009
19		Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe: The Complexity of Probabilistic Lobbying. ADT 2009: 86-97
18		Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible: Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209
17		Henning Fernau, Daniel Raible: Packing Paths: Recycling Saves Time. CTW 2009: 79-83
16		Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS 2009: 421-432
15		Henning Fernau, Daniel Raible: Searching Trees: An Essay. TAMC 2009: 59-70
14		Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe: The Complexity of Probabilistic Lobbying CoRR abs/0906.4431: (2009)
13		Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles CoRR abs/0909.4224: (2009)
	2008
12		Henning Fernau, Daniel Raible: A Parameterized Perspective on Packing Paths of Length Two. COCOA 2008: 54-63
11		Daniel Raible, Henning Fernau: Power Domination in O*(1.7548n) Using Reference Search Trees. ISAAC 2008: 136-147
10		Daniel Raible, Henning Fernau: A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. MFCS 2008: 551-562
9		Henning Fernau, Daniel Raible: Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. WALCOM 2008: 144-156
8		Jiong Guo, Rolf Niedermeier, Daniel Raible: Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica 52(2): 177-202 (2008)
7		Daniel Raible, Henning Fernau: A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach CoRR abs/0803.3531: (2008)
6		Jianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang: A Parameterized Perspective on P2-Packings CoRR abs/0804.0570: (2008)
5		Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger: Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves CoRR abs/0810.4796: (2008)
4		Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov: Exact Exponential Time Algorithms for Max Internal Spanning Tree CoRR abs/0811.1875: (2008)
	2007
3		Henning Fernau, Daniel Raible: Alliances in Graphs: a Complexity-Theoretic Study. SOFSEM (2) 2007: 61-70
2		Daniel Raible, Henning Fernau: Exact Elimination of Cycles in Graphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007
	2005
1		Jiong Guo, Rolf Niedermeier, Daniel Raible: Improved Algorithms and Complexity Results for Power Domination in Graphs. FCT 2005: 172-184

Coauthor Index

1	Ljiljana Brankovic	[13]
2	Jianer Chen	[6]
3	Gábor Erdélyi	[14] [19]
4	Henning Fernau	[2] [3] [4] [5] [6] [7] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19]
5	Fedor V. Fomin	[5] [16]
6	Serge Gaspers	[4] [18]
7	Judy Goldsmith	[14] [19]
8	Jiong Guo	[1] [8]
9	Joachim Kneis	[13]
10	Dieter Kratsch	[13] [18]
11	Alexander Langer	[13]
12	Mathieu Liedloff	[13] [18]
13	Daniel Lokshtanov	[5] [16]
14	Nicholas Mattei	[14] [19]
15	Rolf Niedermeier	[1] [8]
16	Dan Ning	[6]
17	Peter Rossmanith	[13]
18	Jörg Rothe	[14] [19]
19	Saket Saurabh	[5] [16]
20	Alexey A. Stepanov	[4]
21	Yngve Villanger	[5] [16]
22	Jianxin Wang	[6]