Triangles, 4-cycles and parameterized (in-)tractability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4059 LNCS, Issue , 2006, Pages 304-315

  Raman, Venkatesh ^a   Saurabh, Saket ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PARAMETER ESTIMATION; PROBLEM SOLVING;

DOMINATING SET PROBLEM; FIXED PARAMETER ALGORITHMS; PARAMETERIZED COMPLEXITY CLASSES; TRIANGLE FREE GRAPHS;

GRAPH THEORY;

EID: 33746398067     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785293_29     Document Type: Conference Paper

References (11)

1. M. Bläser. Computing small partial coverings. Information Processing Letters 85(6) (2003) 327-331.
2. M. Cesati. http://bravo.ce.uniroma2.it/home/cesati/research/compendium/
3. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer Verlag (1999).
4. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag, (2006).
5. F. V. Fomin and A. V. Pyatkin. Finding Feedback Vertex Set in a Bipartite Graph. Reports in Informatics, University of Bergen. Report No. 291, (2005).
6. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, Oxford University Press, (2006).
7. J. Guo, R. Niedermeier and S. Wernicke. Parameterized complexity of generalized Vertex Cover problems.. In the Proceeding of 9th WADS, LNCS 3608 (2005) 36-48.
8. F. Harary. Graph Theory. Addison-Wesley Publishing Company (1969).
9. S. Jukna. Extremal Combinatorics. Springer-Verlag (2001).
10. S. Khot and V. Raman. Parameterized complexity of finding Subgraphs with hereditary properties. Theoretical Computer Science 289(2) (2002) 997-1008.
11. G. Kortsarz and D. Peleg. On Choosing a Dense Subgraph. In the Proceeding of 34th FOCS, (1993) 692-701.