"Obdr\u017E\u00E1lek, Jan" . "Clique-width: When Hard Does Not Mean Impossible" . . "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS" . "978-3-939897-25-5" . . "12"^^ . "2011-01-01+01:00"^^ . "RIV/00216224:14330/11:00049978" . "Clique-width: When Hard Does Not Mean Impossible"@en . . "In recent years, the parameterized complexity approach has lead to the introduction of many new algorithms and frameworks on graphs and digraphs of bounded clique-width and, equivalently, rank-width. However, despite intensive work on the subject, there still exist well-established hard problems where neither a parameterized algorithm nor a theoretical obstacle to its existence are known. Our article is interested mainly in the digraph case, targeting the well-known Minimum Leaf Out-Branching (cf.\\ also Minimum Leaf Spanning Tree) and Edge Disjoint Paths problems on digraphs of bounded clique-width with non-standard new approaches."@en . . . . "Clique-width: When Hard Does Not Mean Impossible"@en . . . "1868-8969" . "clique-width; parameterized algorithm; XP"@en . "190628" . . "Dortmund, Germany" . . "Ganian, Robert" . . "Clique-width: When Hard Does Not Mean Impossible" . . . "28th International Symposium on Theoretical Aspects of Computer Science STACS2011" . . . . "Dagstuhl, Germany" . . "[6C309C2E8040]" . "P(1M0545), P(GAP202/11/0196), S" . "3"^^ . "14330" . . "3"^^ . . "RIV/00216224:14330/11:00049978!RIV12-GA0-14330___" . "In recent years, the parameterized complexity approach has lead to the introduction of many new algorithms and frameworks on graphs and digraphs of bounded clique-width and, equivalently, rank-width. However, despite intensive work on the subject, there still exist well-established hard problems where neither a parameterized algorithm nor a theoretical obstacle to its existence are known. Our article is interested mainly in the digraph case, targeting the well-known Minimum Leaf Out-Branching (cf.\\ also Minimum Leaf Spanning Tree) and Edge Disjoint Paths problems on digraphs of bounded clique-width with non-standard new approaches." . "Hlin\u011Bn\u00FD, Petr" . . .