Graph layout problems parameterized by vertex cover

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

Volumn 5369 LNCS, Issue , 2008, Pages 294-305

  Fellows, Michael R ^a   Lokshtanov, Daniel ^b   Misra, Neeldhara ^c   Rosamond, Frances A ^a   Saurabh, Saket ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF BERGEN   (Norway)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; LINEARIZATION; TELECOMMUNICATION SYSTEMS;

ATTACK GRAPHS; CUTWIDTH; DISTORTION (DEFORMATION); GRAPH LAYOUT; GRAPH PROBLEMS; INTEGER LINEAR PROGRAMMING (ILP); LAYOUT PROBLEMS; NP COMPLETE; PARAMETERIZATIONS; PARAMETERIZED COMPLEXITY; VERTEX COVER;

ALGORITHMS;

EID: 58549096353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92182-0_28     Document Type: Conference Paper

References (30)

1. Adolphson, D., Hu, T.C.: Optimal linear ordering. SIAM J. Appl. Math. 25, 403-423 (1973)
2. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. of Scheduling 1, 55-66 (1998)
3. Blin, G., Fertin, G., Hermelin, D., Vialette, S.: Fixed-parameter algorithms for protein similarity search under RNA structure constraints. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 271-282. Springer, Heidelberg (2005)
4. Botafogo, R.A.: Cluster analysis for hypertext systems. In: Proceedings of SIGIR 1993, pp. 116-125. ACM Press, New York (1993)
5. Chinn, P., Chvatalova, J., Dewdney, A., Gibbs, N.: The bandwidth problem for graphs and matrices - a survey. Journal of Graph Theory 6, 223-254 (1982)
6. Clarkson, K.L.: Las Vegas Algorithms for Linear and Integer Programming When the Dimension is Small. Journal of the Association for Computing Machinery 42(2), 488-499 (1995)
7. Courcelle, B.: The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs Inf. Comput. 85(1), 12-75 (1990)
8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
9. Fellows, M.R., Fomin, F.V., Lokshtanov, D., Losievskaja, E., Rosamond, F.A., Saurabh, S.: Parameterized Low-distortion Embeddings - Graph metrics into lines and trees, CoRR abs/0804.3028 (2008)
10. Fellows, M.R., Rosamond, F.A.: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 268-277. Springer, Heidelberg (2007)
11. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)
12. Frank, A., Tardos, E.: An Application ol Simultaneous Diophantine Approximation in Combinatorial Optimization. Combinatorica 7, 49-65 (1987)
13. Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems. Algorithmica 37(1), 25-42 (2003)
14. 1-embeddings of graphs. Combinatorica 24(2), 233-269 (2004)
15. Heggernes, P., Meister, D., Proskurowski, A.: Minimum distortion embeddings into a path ol bipartite permutation and threshold graphs. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 331-342. Springer, Heidelberg (2008)
16. Heinz, S.: Complexity ol integer quasiconvex polynomial optimization. Journal ol Complexity 21, 543-556 (2005)
17. Junguer, M., Reinelt, G., Rinaldi, G.: The traveling salesman problem. In: Handbook on Operations Research and Management Sciences, vol. 7, pp. 225-330. North-Holland, Amsterdam (1995)
18. Kannan, R.: Minkowski's Convex Body Theorem and Integer Programming. Mathematics ol Operations Research 12, 415-440 (1987)
19. Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16(1), 4-32 (1996)
20. Kant, G., He, X.: Regular edge labeling ol 4-connected plane graphs and its applications in graph drawing problems. Theoret. Comput. Sci. 172(1-2), 175-193 (1997)
21. Karger, D.R.: A randomized fully polynomial approximation scheme for all terminal network reliability problem. In: Proceedings of STOC, pp. 11-17. ACM Press, New York (1996)
22. Khachiyan, L., Porkolab, L.: Integer Optimization on Convex Semialgebraic Sets. Discrte Computational Geometry 23, 207-224 (2000)
23. Lenstra, H.W.: Integer Programming with a Fixed Number of Variables. Mathematics of Operations Research 8, 538-548 (1983)
24. Linial, N., London, E., Rabinovich, Y.: The Geometry of Graphs and Some of its Algorithmic Applications. Combinatorica 15(2), 215-245 (1995)
25. Makedon, F., Sudborough, I.H.: Minimizing width in linear layouts. In: ICALP 1983. LNCS, vol. 154, pp. 478-490. Springer, Heidelberg (1983)
26. Mutzel, P.: A polyhedral approach to planar augmentation and related problems. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 497-507. Springer, Heidelberg (1995)
27. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)
28. Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Computational Geometry 9, 83-110 (1998)
29. Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: Cutwidth II: Algorithms for partial w-trees of bounded degree. J. Algorithms 56(1), 25-49 (2005)
30. Wood, D.R.: Optimal three-dimensional orthogonal graph drawing in the general position model. Theoret. Comput. Sci. 299(1-3), 151-178 (2003)