Joachim Kneis

From MaRDI portal
Person:408374

Available identifiers

zbMath Open kneis.joachimMaRDI QIDQ408374

List of research outcomes





PublicationDate of PublicationType
Are there any good digraph width measures?2015-12-11Paper
A Practical Approach to Courcelle's Theorem2014-07-23Paper
Digraph width measures in parameterized algorithmics2014-04-02Paper
A fine-grained analysis of a simple independent set algorithm2012-10-24Paper
Courcelle's theorem -- a game-theoretic approach2012-04-05Paper
An exact algorithm for the maximum leaf spanning tree problem2012-01-09Paper
A new algorithm for finding trees with many leaves2011-12-14Paper
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack2011-08-23Paper
https://portal.mardi4nfdi.de/entity/Q30791802011-03-01Paper
Are there any good digraph width measures?2010-12-07Paper
A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance2010-05-28Paper
A bound on the pathwidth of sparse graphs with applications to exact algorithms2010-03-17Paper
Parameterized power domination complexity2010-01-18Paper
An exact algorithm for the maximum leaf spanning tree problem2010-01-14Paper
On digraph width measures in parameterized algorithmics2010-01-14Paper
Randomized divide-and-conquer: improved path, matching, and packing algorithms2010-01-06Paper
Approximation hardness of deadline-TSP reoptimization2009-05-28Paper
A New Algorithm for Finding Trees with Many Leaves2009-01-29Paper
Improved Upper Bounds for Partial Vertex Cover2009-01-20Paper
Divide-and-Color2008-09-04Paper
Intuitive Algorithms and t-Vertex Cover2008-04-24Paper
Partial vs. Complete Domination: t-Dominating Set2008-03-07Paper
The parameterized approximability of TSP with deadlines2007-12-19Paper
On the Approximation Hardness of Some Generalizations of TSP2007-09-07Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper

Research outcomes over time

This page was built for person: Joachim Kneis