Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Daniel Binkele-Raible
Daniel Raible
2010 – today
- 2013
[j12]Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff: Exact and Parameterized Algorithms for Max Internal Spanning Tree. Algorithmica 65(1): 95-128 (2013)- [j11]Daniel Binkele-Raible, Henning Fernau: Packing paths: Recycling saves time. Discrete Applied Mathematics 161(12): 1686-1698 (2013)
- 2012
- [j10]Daniel Binkele-Raible, Henning Fernau: An Exact Exponential Time Algorithm for Power Dominating Set. Algorithmica 63(1-2): 323-346 (2012)
- [j9]Daniel Binkele-Raible, Henning Fernau: Parameterized Measure & Conquer for Problems with No Small Kernels. Algorithmica 64(1): 189-212 (2012)
- [j8]Daniel Binkele-Raible, Henning Fernau: An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem. J. Discrete Algorithms 15: 43-55 (2012)
- [j7]Daniel Binkele-Raible, Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger: Kernel(s) for problems with no kernel: On out-trees with many leaves. ACM Transactions on Algorithms 8(4): 38 (2012)
- 2011
- [j6]Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk, Peter Rossmanith, Jakub Onufry Wojtaszczyk: Breaking the 2n-barrier for Irredundance: Two lines of attack. J. Discrete Algorithms 9(3): 214-230 (2011)
- [j5]Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: An exact algorithm for the Maximum Leaf Spanning Tree problem. Theor. Comput. Sci. 412(45): 6290-6302 (2011)
- 2010
- [j4]Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff: Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. 111(2): 64-67 (2010)
- [j3]Daniel Binkele-Raible, Henning Fernau: A new upper bound for Max-2-SAT: A graph-theoretic approach. J. Discrete Algorithms 8(4): 388-401 (2010)
- [c18]Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith: A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. CIAC 2010: 311-322
- [c17]Daniel Binkele-Raible, Henning Fernau: A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. CSR 2010: 328-339
- [c16]Daniel Binkele-Raible, Henning Fernau: Enumerate and Measure: Improving Parameter Budget Management. IPEC 2010: 38-49
- [c15]Daniel Raible, Henning Fernau: An Amortized Search Tree Analysis for k-Leaf Spanning Tree. SOFSEM 2010: 672-684
2000 – 2009
- 2009
- [j2]Henning Fernau, Daniel Raible: A parameterized perspective on packing paths of length two. J. Comb. Optim. 18(4): 319-341 (2009)
- [c14]Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe: The Complexity of Probabilistic Lobbying. ADT 2009: 86-97
- [c13]
- [c12]Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible: Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209
- [c11]Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith: An Exact Algorithm for the Maximum Leaf Spanning Tree Problem. IWPEC 2009: 161-172
- [c10]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
- [c9]
- [c8]Henning Fernau, Serge Gaspers, Daniel Raible: Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG 2009: 100-111
- [i7]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)
- [i6]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)
- [i5]Daniel Raible, Henning Fernau: A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. CoRR abs/0911.1900 (2009)
- 2008
- [j1]Jiong Guo, Rolf Niedermeier, Daniel Raible: Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica 52(2): 177-202 (2008)
- [c7]Henning Fernau, Daniel Raible: A Parameterized Perspective on Packing Paths of Length Two. COCOA 2008: 54-63
- [c6]Daniel Raible, Henning Fernau: Power Domination in O*(1.7548n) Using Reference Search Trees. ISAAC 2008: 136-147
- [c5]Daniel Raible, Henning Fernau: A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. MFCS 2008: 551-562
- [c4]Henning Fernau, Daniel Raible: Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. WALCOM 2008: 144-156
- [i4]Daniel Raible, Henning Fernau: A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach. CoRR abs/0803.3531 (2008)
- [i3]Jianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang: A Parameterized Perspective on P2-Packings. CoRR abs/0804.0570 (2008)
- [i2]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)
- [i1]Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov: Exact Exponential Time Algorithms for Max Internal Spanning Tree. CoRR abs/0811.1875 (2008)
- 2007
- [c3]Daniel Raible, Henning Fernau: Exact Elimination of Cycles in Graphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007
- [c2]Henning Fernau, Daniel Raible: Alliances in Graphs: a Complexity-Theoretic Study. SOFSEM (2) 2007: 61-70
- 2005
- [c1]Jiong Guo, Rolf Niedermeier, Daniel Raible: Improved Algorithms and Complexity Results for Power Domination in Graphs. FCT 2005: 172-184
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-05 20:49 CEST by the dblp team