Daniel Raible - RankMe

25 papers A 1B 6C 4Journal 10Unranked 4

Year	Rank	Type	Title / Venue / Authors
2011	J	`jnl`	An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2010	B	`conf`	An Amortized Search Tree Analysis for SOFSEM Daniel Raible, Henning Fernau
2009	J	`jnl`	A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem CoRR Daniel Raible, Henning Fernau
2009	J	`jnl`	A parameterized perspective on packing paths of length two. J. Comb. Optim. Henning Fernau, Daniel Raible
2009	—	`conf`	An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009	J	`jnl`	Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles CoRR Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith
2009	C	`conf`	Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible
2009	B	`conf`	Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG Henning Fernau, Serge Gaspers, Daniel Raible
2009	A	`conf`	Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. STACS Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
2009	C	`conf`	Packing Paths: Recycling Saves Time. CTW Henning Fernau, Daniel Raible
2009	C	`conf`	Searching Trees: An Essay. TAMC Henning Fernau, Daniel Raible
2009	J	`jnl`	The Complexity of Probabilistic Lobbying CoRR Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
2009	—	`conf`	The Complexity of Probabilistic Lobbying. ADT Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
2008	B	`conf`	A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. MFCS Daniel Raible, Henning Fernau
2008	J	`jnl`	A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach CoRR Daniel Raible, Henning Fernau
2008	J	`jnl`	A Parameterized Perspective on P CoRR Jianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang
2008	C	`conf`	A Parameterized Perspective on Packing Paths of Length Two. COCOA Henning Fernau, Daniel Raible
2008	B	`conf`	Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. WALCOM Henning Fernau, Daniel Raible
2008	J	`jnl`	Exact Exponential Time Algorithms for Max Internal Spanning Tree CoRR Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov
2008	J	`jnl`	Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica Jiong Guo, Rolf Niedermeier, Daniel Raible
2008	J	`jnl`	Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves CoRR Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger
2008	B	`conf`	Power Domination in O ISAAC Daniel Raible, Henning Fernau
2007	—	`conf`	Alliances in Graphs: a Complexity-Theoretic Study. SOFSEM (2) Henning Fernau, Daniel Raible
2007	—	`conf`	Exact Elimination of Cycles in Graphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs Daniel Raible, Henning Fernau
2005	B	`conf`	Improved Algorithms and Complexity Results for Power Domination in Graphs. FCT Jiong Guo, Rolf Niedermeier, Daniel Raible