No. Title Author Year
1 Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration Golovach, Petr A. et al. 2021
2 Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms Komusiewicz, Christian et al. 2019
3 A Linear Kernel for Finding Square Roots of Almost Planar Graphs Golovach, Petr A. et al. 2016
4 Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs Kammer, Frank et al. 2016
5 Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality Golovach, Petr A. et al. 2015
6 10441 Abstracts Collection -- Exact Complexity of NP-hard Problems Husfeldt, Thore et al. 2011
7 08431 Abstracts Collection -- Moderately Exponential Time Algorithms Fomin, Fedor V. et al. 2008
8 08431 Executive Summary -- Moderately Exponential Time Algorithms Fomin, Fedor V. et al. 2008
9 08431 Open Problems -- Moderately Exponential Time Algorithms Fomin, Fedor V. et al. 2008
10 07211 Abstracts Collection -- Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes Brandst├Ądt, Andreas et al. 2007
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI