Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Daniel
    Last name: Binkele-Raible
    DBLP: r/DanielRaible
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 39  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Jörg Rothe.
    The complexity of probabilistic lobbying.
    Discrete Optimization 2014, Volume 11 (0) 2014
    Conference paper
    Daniel Binkele-Raible, Henning Fernau.
    An Amortized Search Tree Analysis for Finding a k-Leaf Spanning Tree in an Undirected Graph.
    Discrete Mathematics Theoretical Computer Science 2014, Volume 16 (0) 2014
    Journal article
    Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff.
    Exact and Parameterized Algorithms for Max Internal Spanning Tree.
    Algorithmica 2013, Volume 65 (0) 2013
    Conference paper
    Daniel Binkele-Raible, Henning Fernau.
    Packing paths: Recycling saves time.
    Discrete Applied Mathematics 2013, Volume 161 (0) 2013
    Journal article
    Daniel Binkele-Raible, Henning Fernau.
    An Exact Exponential Time Algorithm for Power Dominating Set.
    Algorithmica 2012, Volume 63 (0) 2012
    Journal article
    Daniel Binkele-Raible, Henning Fernau.
    Parameterized Measure Conquer for Problems with No Small Kernels.
    Algorithmica 2012, Volume 64 (0) 2012
    Journal article
    Daniel Binkele-Raible, Henning Fernau.
    An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem.
    J. Discrete Algorithms 2012, Volume 15 (0) 2012
    Conference paper
    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 2012, Volume 8 (0) 2012
    Conference paper
    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 2
    J. Discrete Algorithms 2011, Volume 9 (0) 2011
    Conference paper
    Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Binkele-Raible, Peter Rossmanith.
    An exact algorithm for the Maximum Leaf Spanning Tree problem.
    Theor. Comput. Sci. 2011, Volume 412 (0) 2011
    Conference paper
    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 2
    Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Daniel Binkele-Raible, Henning Fernau.
    A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem.
    Computer Science - Theory and Applications, 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings 2010 (0) 2010
    Journal article
    Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff.
    Exact exponential-time algorithms for finding bicliques.
    Inf. Process. Lett. 2010, Volume 111 (0) 2010
    Conference paper
    Daniel Binkele-Raible, Henning Fernau.
    A new upper bound for Max-2-SAT: A graph-theoretic approach.
    J. Discrete Algorithms 2010, Volume 8 (0) 2010
    Conference paper
    Daniel Binkele-Raible, Henning Fernau.
    Enumerate and Measure: Improving Parameter Budget Management.
    Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Daniel Binkele-Raible, Henning Fernau.
    An Amortized Search Tree Analysis for
    SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings 2010 (0) 2010
    Conference paper
    Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Binkele-Raible, Peter Rossmanith.
    An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.
    Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers 2009 (0) 2009
    Conference paper
    Henning Fernau, Daniel Binkele-Raible.
    Searching Trees: An Essay.
    Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Henning Fernau, Serge Gaspers, Daniel Binkele-Raible.
    Exact and Parameterized Algorithms for Max Internal Spanning Tree.
    Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers 2010 (0) 2009
    Conference paper
    Henning Fernau, Daniel Binkele-Raible.
    Packing Paths: Recycling Saves Time.
    Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009 2009 (0) 2009
    Conference paper
    Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Binkele-Raible.
    Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.
    Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009 2009 (0) 2009
    Conference paper
    Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Binkele-Raible, Jörg Rothe.
    The Complexity of Probabilistic Lobbying.
    Algorithmic Decision Theory, First International Conference, ADT 2009, Venice, Italy, October 20-23, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Binkele-Raible, Jörg Rothe.
    The Complexity of Probabilistic Lobbying
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Binkele-Raible, Peter Rossmanith.
    Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Daniel Binkele-Raible, Henning Fernau.
    A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
    CoRR 2009, Volume 0 (0) 2009
    Show item 1 to 25 of 39  

    Your query returned 39 matches in the database.