default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Binkele-Raible
Other persons with the same name
- Daniel Raible 0002 — NASA Glenn Research Center, Cleveland, OH, USA
Refine list
refinements active!
zoomed in on 39 of 39 records
view refined list in
export refined list as
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2010 – 2019
- 2014
[j14]Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau
, Judy Goldsmith, Nicholas Mattei, Jörg Rothe:
The complexity of probabilistic lobbying. Discret. Optim. 11: 1-21 (2014)- [j13]Daniel Binkele-Raible, Henning Fernau:
A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph. Discret. Math. Theor. Comput. Sci. 16(1): 179-200 (2014) - 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. Discret. Appl. Math. 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 Trans. Algorithms 8(4): 38:1-38:19 (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) - [c17]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 - [c16]Daniel Binkele-Raible, Henning Fernau:
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. CSR 2010: 328-339 - [c15]Daniel Binkele-Raible, Henning Fernau:
Enumerate and Measure: Improving Parameter Budget Management. IPEC 2010: 38-49 - [c14]Daniel Raible, Henning Fernau:
An Amortized Search Tree Analysis for k-Leaf Spanning Tree. SOFSEM 2010: 672-684 - no results
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) - [c13]Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe:
The Complexity of Probabilistic Lobbying. ADT 2009: 86-97 - [c12]Henning Fernau, Daniel Raible:
Packing Paths: Recycling Saves Time. CTW 2009: 79-83 - [c11]Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible:
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW 2009: 205-209 - [c10]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 - [c9]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 - [c8]Henning Fernau, Daniel Raible:
Searching Trees: An Essay. TAMC 2009: 59-70 - [c7]Henning Fernau, Serge Gaspers, Daniel Raible:
Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG 2009: 100-111 - [i8]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) - [i7]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) - [i6]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) - [c6]Henning Fernau, Daniel Raible:
A Parameterized Perspective on Packing Paths of Length Two. COCOA 2008: 54-63 - [c5]Daniel Raible, Henning Fernau:
Power Domination in O*(1.7548n) Using Reference Search Trees. ISAAC 2008: 136-147 - [c4]Daniel Raible, Henning Fernau:
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. MFCS 2008: 551-562 - [c3]Henning Fernau, Daniel Raible:
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. WALCOM 2008: 144-156 - [i5]Daniel Raible, Henning Fernau:
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach. CoRR abs/0803.3531 (2008) - [i4]Jianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang:
A Parameterized Perspective on P2-Packings. CoRR abs/0804.0570 (2008) - [i3]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) - [i2]Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov:
Exact Exponential Time Algorithms for Max Internal Spanning Tree. CoRR abs/0811.1875 (2008) - 2007
- [c2]Henning Fernau, Daniel Raible:
Alliances in Graphs: a Complexity-Theoretic Study. SOFSEM (2) 2007: 61-70 - [i1]Daniel Raible, Henning Fernau:
Exact Elimination of Cycles in Graphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 - 2005
- [c1]Jiong Guo, Rolf Niedermeier, Daniel Raible:
Improved Algorithms and Complexity Results for Power Domination in Graphs. FCT 2005: 172-184 - no results
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
