Two-layer planarization parameterized by feedback edge set

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

Volumn 6108 LNCS, Issue , 2010, Pages 431-442

  Uhlmann, Johannes ^a   Weller, Mathias ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE-SETS; FIXED-PARAMETER TRACTABILITY; NP-HARD; PARAMETERIZED; PLANARIZATION; PROBLEM KERNEL; TREE-BASED ALGORITHMS; TWO LAYERS; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 77954452360     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13562-0_39     Document Type: Conference Paper

References (19)

1. Bodlaender, H.L.: Kernelization: New upper and lower bound techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 17-37. Springer, Heidelberg (2009)
2. Chaudhary, A., Chen, D.Z., Hu, X.S., Niemier, M.T., Ravichandran, R., Whitton, K.: Fabricatable interconnect and molecular QCA circuits. IEEE Trans. on CAD of Integrated Circuits and Systems 26(11), 1978-1991 (2007)
3. Dom, M., Guo, J., Niedermeier, R.: Approximation and fixed-parameter algorithms for consecutive ones submatrix problems. Journal of Computer and System Sciences (2010)
4. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
5. Dujmović, V., Fellows, M., Hallett, M., Kitching, M., McCartin, G.L.C., Nishimura, N., Ragde, P., Rosamond, F., Suderman, M., Whitesides, S., Wood, D.R.: A fixed-parameter approach to 2-layer planarization. Algorithmica 45(2), 159-182 (2006)
6. Dujmović, V., Fellows, M., Hallett, M., Kitching, M., McCartin, G.L.C., Nishimura, N., Ragde, P., Rosamond, F., Suderman, M., Whitesides, S., Wood, D.R.: On the parameterized complexity of layered graph drawing. Algorithmica 52(2), 267-292 (2008)
7. Eades, P., Whitesides, S.: Drawing graphs in two layers. Theoretical Computer Science 131(2), 361-374 (1994)
8. Fernau, H.: Two-layer planarization: Improving on parameterized algorithmics. Journal of Graph Algorithms and Applications 9(2), 205-238 (2005)
9. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
10. Guo, J., Hüffner, F., Niedermeier, R.: A structural view on parameterizing problems: Distance from triviality. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 162-173. Springer, Heidelberg (2004)
11. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38(1), 31-45 (2007)
12. Lengauer, T.: Combinatorial algorithms for integrated circuit layout. John Wiley & Sons, Inc., New York (1990)
13. Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. SIAM Journal on Optimization 11(4), 1065-1080 (2001)
14. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, Oxford (2006)
15. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrto, I.: On bipartite drawings and the linear arrangement problem. SIAM Journal on Computing 30(6), 1773-1789 (2001) (Pubitemid 34125436)
16. Suderman, M.: Layered Graph Drawing. PhD thesis, School of Computer Science, McGill University Montréal (2005)
17. Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics 11(2), 109-125 (1981)
18. Tsiaras, V., Triantafilou, S., Tollis, I.G.: DAGmaps: Space filling visualization of directed acyclic graphs. Journal of Graph Algorithms and Applications 13(3), 319-347 (2009)
19. Waterman, M.S., Griggs, J.R.: Interval graphs and maps of DNA. Bulletin of Mathematical Biology 48(2), 189-195 (1986)