Up a level |
(2020) A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs.
(2020) Isomorphism Testing for Graphs Excluding Small Minors.
(2020) On the Parameterized Approximability of Contraction to Classes of Chordal Graphs.
(2020) Chordless Cycle Packing Is Fixed-Parameter Tractable.
(2020) Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy.
(2020) On the Parameterized Complexity of Maximum Degree Contraction Problem.
(2020) Fine-Grained Complexity of Regular Expression Pattern Matching and Membership.