Daniel Raible

MaRDI QIDQ653319zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
\(\text{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 Theoretical Computer Science	2012-01-09	Paper
A parameterized perspective on packing paths of length two Journal of Combinatorial Optimization	2010-02-24	Paper
An amortized search tree analysis for \(k\)-leaf spanning tree SOFSEM 2010: Theory and Practice of Computer Science	2010-01-28	Paper
Exact and parameterized algorithms for Max Internal Spanning Tree Graph-Theoretic Concepts in Computer Science	2010-01-21	Paper
An exact algorithm for the maximum leaf spanning tree problem Parameterized and Exact Computation	2010-01-14	Paper
The Complexity of Probabilistic Lobbying Algorithmic Decision Theory	2009-11-17	Paper
Searching Trees: An Essay Lecture Notes in Computer Science	2009-06-03	Paper
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach Lecture Notes in Computer Science	2009-02-03	Paper
Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees Algorithms and Computation	2009-01-29	Paper
A Parameterized Perspective on Packing Paths of Length Two Combinatorial Optimization and Applications	2009-01-27	Paper
Improved algorithms and complexity results for power domination in graphs Algorithmica	2008-12-02	Paper
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs WALCOM: Algorithms and Computation	2008-03-25	Paper
Fundamentals of Computation Theory Lecture Notes in Computer Science	2006-10-20	Paper

Research outcomes over time

This page was built for person: Daniel Raible