The parameterized complexity of k-edge induced subgraphs
- 1 February 2017
- journal article
- Published by Elsevier in Information and Computation
- Vol. 252, 138-160
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Induced subgraphs with distinct sizesRandom Structures & Algorithms, 2008
- Chordless paths through three verticesTheoretical Computer Science, 2006
- The complexity of first-order and monadic second-order logic revisitedAnnals of Pure and Applied Logic, 2004
- An existential locality theoremAnnals of Pure and Applied Logic, 2004
- The Parameterized Complexity of Counting ProblemsSIAM Journal on Computing, 2004
- Detecting even holesJournal of Graph Theory, 2004
- Computing crossing numbers in quadratic timeJournal of Computer and System Sciences, 2003
- Deciding first-order properties of locally tree-decomposable structuresJournal of the ACM, 2001
- Fixed-parameter tractability of graph modification problems for hereditary propertiesInformation Processing Letters, 1996
- EϒPHKA! num = Δ + Δ + ΔJournal of Number Theory, 1986