Parameterized algorithms for boxicity

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

Volumn 6506 LNCS, Issue PART 1, 2010, Pages 366-377

  Adiga, Abhijin ^a   Chitnis, Rajesh ^b   Saurabh, Saket ^c  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY FUNCTIONS; ARBITRARY GRAPHS; BOXICITY; EDGE-SETS; GRAPH G; GRAPH INVARIANT; INTERVAL GRAPH; NP COMPLETE; PARAMETERIZED; PARAMETERIZED ALGORITHM; POSITIVE INTEGERS; PROBLEM COMPLEXITY; RUNNING TIME; RUNNING-IN; STRUCTURAL PARAMETER; STRUCTURAL RELATIONSHIP; VERTEX COVER; VERTEX SET; MAX-LEAF NUMBERS;

APPROXIMATION ALGORITHMS; PARAMETERIZATION; PARAMETER ESTIMATION;

GRAPH THEORY;

EID: 78650883379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17517-6_33     Document Type: Conference Paper

References (26)

1. Adiga, A., Bhowmick, D., Chandran, L.S.: Boxicity and poset dimension. In: Thai, T. (ed.) COCOON 2010. LNCS, vol. 6196, pp. 3-12. Springer, Heidelberg (2010)
2. Adiga, A., Bhowmick, D., Chandran, L.S.: The hardness of approximating the threshold dimension, boxicity and cubicity of a graph. DAM 158(16), 1719-1726 (2010)
3. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comput. Syst. Sci. 13(3), 335-379 (1976)
4. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)
5. Cai, L., Huang, X.: Fixed-parameter approximation: Conceptual framework and approximability results. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 96-108. Springer, Heidelberg (2006)
6. Chandran, L.S., Das, A., Shah, C.D.: Cubicity, boxicity, and vertex cover. Disc. Math. 309, 2488-2496 (2009)
7. Chandran, L.S., Francis, M.C., Sivadasan, N.: Boxicity and maximum degree. J. Comb. Theory Ser. 98(2), 443-445 (2008)
8. Chandran, L.S., Sivadasan, N.: Boxicity and treewidth. J. Comb. Theory Ser. 97(5), 733-744 (2007)
9. Chen, Y., Grohe, M., Grüber, M.: On parameterized approximability. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 175-183. Springer, Heidelberg (2006)
10. Cozzens, M.B.: Higher and multi-dimensional analogues of interval graphs, Ph.D. thesis. Department of Mathematics, Rutgers University, New Brunswick (1981)
11. Cozzens, M.B., Roberts, F.S.: Computing the boxicity of a graph by covering its complement by cointerval graphs. Disc. Appl. Math. 6, 217-228 (1983)
12. Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)
13. Downey, R.G., Fellows, M.R., McCartin, C.: Parameterized approximation problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 121-129. Springer, Heidelberg (2006)
14. Esperet, L.: Boxicity of graphs with bounded degree. European J. Combin. 30(5), 1277-1280 (2009)
15. Fellows, M.R., Lokshtanov, D., Misra, N., Mnich, M., Rosamond, F.A., Saurabh, S.: The complexity ecology of parameters: An illustration using bounded max leaf number. Theory Comput. Syst. 45(4), 822-848 (2009)
16. Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294-305. Springer, Heidelberg (2008)
17. Fiala, J., Golovach, P.A., Kratochvíl, J.: Parameterized complexity of coloring problems: Treewidth versus vertex cover. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol. 5532, Springer, Heidelberg (2009)
18. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)
19. Kleitman, D.J., West, D.B.: Spanning trees with many leaves. SJDM 4, 99-106 (1991)
20. Kratochvíl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Disc. Appl. Math. 52, 233-252 (1994)
21. Marx, D., Razgon, I.: Constant ratio fixed-parameter approximation of the edge multicut problem. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 647-658. Springer, Heidelberg (2009)
22. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)
23. Roberts, F.S.: On the boxicity and cubicity of a graph. In: Recent Progresses in Combinatorics, pp. 301-310. Academic Press, New York (1969)
24. Scheinerman, E.R.: Intersection classes and multiple intersection parameters, Ph.D. thesis, Princeton University (1984)
25. Thomassen, C.: Interval representations of planar graphs. J. Comb. Theory Ser. 40, 9-20 (1986)
26. Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Alg. Disc. Math. 3(3), 351-358 (1982)