Daniel Raible

Daniel Raible

Theoretical Computer Science
Computer Science Department
University of Trier


 Theoretische Informatik Symbol
Navigation Contact Consultation hours Publications Research Teaching

Contact Details move to top of page
E-Mail email
Visitors Campus II
Room 413
Phone +49 651 201 2831

Consultation hours move to top of page
Thursday 13-14

Research interests move to top of page
Parameterized, randomized and exact algorithms, approximization algorithms, graphs and their drawings, combinatorics.

Publications move to top of page
Daniel Raible and Henning Fernau:
An Amortized Search Tree Analysis for k-Leaf Spanning Tree.Proceedings of the 36th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) 2009 ,

Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Daniel Raible and Peter Rossmanith :
An exact algorithm for the Maximum Leaf Spanning Tree problem. Proceedings of the 4th Workshop on Paramterized and Exact Computation (IWPEC) 2009 ,

Gabor Erdelyi, Henning Fernau Judy Goldsmith, Nicholas Mattei, Daniel Raible and Jörg Rothe :
The Complexity of Probabilistic Lobbying. Proceedings of the 1st international Conference on Algorithmic Decison Theory (ADT) 2009 ,

Henning Fernau, Serge Gasper and Daniel Raible:
Exact and Parameterized Algorithms for Max Internal Spanning Tree. Proceedings of the 35th Workshop on Graph-Theoretic Concepts in Computer Science (WG) 2009 ,

Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff and Daniel Raible:
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. Proceedings of the Cologne-Twente Workshop 2009 ,

Henning Fernau and Daniel Raible:
Packing Paths: Recycling Saves Time.Proceedings of the Cologne-Twente Workshop 2009 ,

Henning Fernau and Daniel Raible:
A parameterized perspective on packing paths of length two.Journal of Combinatorial Optimization, online first
(original publication).

Daniel Raible and Henning Fernau
Searching Trees: An Essay. In Theory and Applications of Models of Computation, 6th Annual Conference (TAMC 2009), Changsha, China, May 18-22, 2009 .
Volume 5532 in Lecture Notes in Computer Science, pages 59–70, Springer (original publication)

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.
In 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Freiburg, Germany, February 26-28,2009 .
(original publication).

Daniel Raible and Henning Fernau
Power Domination in $O^*(1.7548^n)$ using Reference Search Trees.
 In Proceedings of the 19th Symposium on Algorithms and Computation 2008 (ISAAC 2008), Surfers Paradise, Gold Coast, Australia , December 15-17, 2008 .
Volume 5369 in Lecture Notes in Computer Science, pages 136–147, Springer (original publication)

Daniel Raible and Henning Fernau
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach.
 In Proceedings of the 33rd Symposium Mathematical Foundations of Computer Science 2008 (MFCS 2008), Torun, Poland, August 25-29, 2008.
Volume 5162 in Lecture Notes in Computer Science, pages 551–562, Springer (original publication).

Daniel Raible and Henning Fernau
A Parameterized Perspective on Packing Paths of Length Two.
In Proceedings of the 2nd Conference on Combinatorial Optimization and Applications 2008 (COCOA 2008), St. John's, Newfoundland Canada, August 2008.
Volume 5165 in Lecture Notes in Computer Science, pages 54–63, Springer (original publication).

Jiong Guo, Rolf Niedermeier, and Daniel Raible:
Improved algorithms and complexity results for power domination in graphs.
Algorithmica, 52(2):177–202, 2008 (original publication).

Daniel Raible and Henning Fernau
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs.
 In Proceedings of the 2nd Workshop on Algorithms and Computation 2008 (WALCOM 2008), Dhaka, Bangladesh, Feburary 2008.
Volume 4921 in Lecture Notes in Computer Science, pages 144–156, Springer (original publication).

Daniel Raible and Henning Fernau
Alliances in graphs: a complexity-theoretic study.
In Proceedings Volume II of the 33nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07), Harrachov, Czech Republic. January 2007.


Jiong Guo, Rolf Niedermeier, and Daniel Raible:
Improved algorithms and complexity results for power domination in graphs.
In Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT'05), Lübeck, Germany. August 2005.
Volume 3623 in Lecture Notes in Computer Science, pages 172–184, Springer (original publication).

Courses move to top of page

Miscellaneous move to top of page
Diplomarbeit (Master Thesis) und Studienarbeit (in german).
Some lecture notes I did in the past. Nice Photos