Two-layer planarization: Improving on parameterized algorithmics

Lecture Notes in Computer Science

Volumn 3381, Issue , 2005, Pages 137-146

  Fernau, Henning ^a,b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING;

PLANARIZATION; PROBLEM KERNEL; VERTICES;

ALGORITHMS;

EID: 24144503669     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30577-4_17     Document Type: Conference Paper

References (10)

1. P. Damaschke. Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. In R. Downey, M. Fellows, and F. Dehne, editors, Intern. Workshop on Parameterized and Exact Computation IWPEC 2004, volume 3162 of LNCS, pages 1-12. Springer, 2004.
2. R. G. Downey and M. R. Fellows. Parameterized complexity. Springer, 1999.
3. V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, and D. R. Wood. On the parameterized complexity of layered graph drawing. In F. Meyer auf der Heide, editor, European Symp. on Algorithms ESA, volume 2161 of LNCS, pages 488-499. Springer, 2001.
4. V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosemand, M. Suderman, S. Whitesides, and D. R. Wood. A fixed-parameter approach to two-layer planarization. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing GD 2001, volume 2265 of LNCS, pages 1-15. Springer, 2002.
5. V. Dujmović, H. Fernau, and M. Kaufmann. Fixed parameter algorithms for one-sided crossing minimization revisited. In G. Liotta, editor, Graph Drawing GD 2003, volume 2912 of LNCS, pages 332-344. Springer, 2004.
6. H. Fernau. A top-down approach to search-trees: Improved algorithmics for 3-hitting set. TR04-073, Electronic Colloquium on Computational Complexity ECCC, 2004.
7. P. Mutzel. An alternative method to crossing minimization on hierarchical graphs. SIAM J. Optimization, 11 (4):1065-1080, 2001.
8. R. Niedermeier and P. Rossmanith. An efficient fixed-parameter algorithm for 3-hitting set. Journal of Discrete Algorithms, 1:89-102, 2003.
9. N. Nishimura, P. Ragde, and D. Thilikos. Smaller kernels for hitting set problems of constant arity. In R. Downey, M. Fellows, and F. Dehne, editors, Intern. Workshop on Parameterized and Exact Computation IWPEC 2004, volume 3162 of LNCS, pages 121-126. Springer, 2004.
10. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Trans. Systems Man Cybernet., 11(2):109-125, 1981.