V. Dujmovic, 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, Proc. European Symposium on Algorithms, ESA 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Straight-Line Drawings on Restricted Integer Grids in.. - Felsner, Liotta, Wismath (2003) (24 citations) Self-citation (Liotta) (Correct)
No context found.
V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, D.R. Wood. On the Parameterized Complexity of Layered Graph Drawing. ESA, 1--12, 2001.
Straight-Line Drawings on Restricted Integer Grids in.. - Felsner, Liotta, Wismath (2002) (24 citations) Self-citation (Liotta) (Correct)
No context found.
V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, D. R. Wood. On the Parameterized Complexity of Layered Graph Drawing. ESA, 1-12, 2001.
Straight-Line Drawings on Restricted Integer Grids in.. - Felsner, Liotta, Wismath (2002) (24 citations) Self-citation (Liotta) (Correct)
....never appears a path that carries no searcher connecting the cleared edge with a contaminated (uncleared) one. We now show that the path width is a lower bound on the number k of grid lines needed for an n k grid drawing for general planar graphs. We note that a similar result was obtained in [19] however in the context of h layer graph drawings. Theorem 1 Let G be a planar graph. Then pw(G) min k (G is drawable on an n k grid) Proof. We prove the inequality in the node searching context; recall ns(G) pw(G) 1. Given a planar graph G which is drawn on an n k grid, we show that ....
V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, D.R. Wood. On the Parameterized Complexity of Layered Graph Drawing. ESA, 1-12, 2001.
Pathwidth and Layered Drawings of Trees - Suderman (2002) (3 citations) Self-citation (Suderman) (Correct)
....of trees and given linear time algorithms for obtaining drawings that match the optimal upper bounds. These linear time algorithms are significant because, even though there is an algorithm for determining whether or not an arbitrary graph has an h layer drawing that runs in f(h) n time [4], the value of f(h) is too large for the algorithm to be practical for even small values of h. The results in this paper demonstrate one approach to solving this general 20 problem, by considering increasingly more general classes of graphs. Another approach is to characterize the graphs whose ....
Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, M. Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, and David R. Wood. On the parameterized complexity of layered graph drawing. In Friedhelm Meyer auf der Heide, editor, Algorithms, 9th European Symposium (ESA 2001.
Radial Level Planarity Testing and Embedding in.. - Bachmaier.. (2004) (2 citations) (Correct)
No context found.
V. Dujmovic, 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, Proc. European Symposium on Algorithms, ESA 2001.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2003) (2 citations) (Correct)
No context found.
V. Dujmovic, 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, Proc. European Symposium on Algorithms, ESA 2001.
Radial Level Planarity Testing - And Embedding In (Correct)
No context found.
V. Dujmovic, 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, Proc. European Symposium on Algorithms, ESA 2001.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2005) (2 citations) (Correct)
No context found.
V. Dujmovic, 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, Proc. European Symposium on Algorithms 2001.
Radial Level Planarity Testing and Embedding in Linear Time - Bachmaier, Brandenburg.. (2003) (2 citations) (Correct)
No context found.
V. Dujmovic, 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, Proc. European Symposium on Algorithms, ESA 2001.
Parameterized Complexity for the Skeptic - Downey (2003) (15 citations) (Correct)
No context found.
V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, D. Wood, "On the Parameterized Complexity of Layered Graph Drawing." ESA 2001 488499
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC