Daniel Raible

Available identifiers

Publication	Date of Publication	Type
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves	2012-04-24	Paper
An exact algorithm for the maximum leaf spanning tree problem	2012-01-09	Paper
A parameterized perspective on packing paths of length two	2010-02-24	Paper
An Amortized Search Tree Analysis for k-Leaf Spanning Tree	2010-01-28	Paper
Exact and Parameterized Algorithms for Max Internal Spanning Tree	2010-01-21	Paper
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem	2010-01-14	Paper
The Complexity of Probabilistic Lobbying	2009-11-17	Paper
Searching Trees: An Essay	2009-06-03	Paper
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach	2009-02-03	Paper
Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees	2009-01-29	Paper
A Parameterized Perspective on Packing Paths of Length Two	2009-01-27	Paper
Improved algorithms and complexity results for power domination in graphs	2008-12-02	Paper
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs	2008-03-25	Paper
Fundamentals of Computation Theory	2006-10-20	Paper

This page was built for person: Daniel Raible