A Fixed-Parameter Approach to Two-Layer Planarization-Reference-Cited by-同舟云学术

A Fixed-Parameter Approach to Two-Layer Planarization

Published:2002 Issue: Volume: Page:1-15
ISSN:0302-9743
Container-title:Graph Drawing
language:
Short-container-title:

Author:

Dujmović V.,Fellows M.,Hallett M.,Kitching M.,Liotta Giuseppe,McCartin C.,Nishimura N.,Ragde P.,Rosamond F.,Suderman M.,Whitesides S.,Wood David R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45848-4_1

Reference19 articles.

1. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.

2. R. G. Downey and M. R. Fellows. Parametrized complexity. Springer, 1999.

3. 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. On the parameterized complexity of layered graph drawing. In Proc. 9th European Symp. on Algorithms (ESA’ 01), to appear.

4. P. Eades, B. D. McKay, and N. C. Wormald. On an edge crossing problem. In Proc. 9th Australian Computer Science Conference, pages 327–334. Australian National University, 1986.

5. P. Eades and S. Whitesides. Drawing graphs in two layers. Theoret. Comput. Sci., 131(2):361–374, 1994.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Planarization of Wireless Sensor Networks;Algorithmica;2010-12-14

2. Parameterized Algorithms for Hitting Set: The Weighted Case;Lecture Notes in Computer Science;2006

3. Fixed-Parameter Tractable Algorithms for Testing Upward Planarity;SOFSEM 2005: Theory and Practice of Computer Science;2005

4. Two-Layer Planarization: Improving on Parameterized Algorithmics;SOFSEM 2005: Theory and Practice of Computer Science;2005

5. Experiments with the Fixed-Parameter Approach for Two-Layer Planarization;Graph Drawing;2004