Result 1 to 20 from 123 total
$h$-quasi planar drawings of bounded treewidth graphs in linear area. (English)
Golumbic, Martin Charles (ed.) et al., Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26‒28, 2012. Revised selcted papers. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). Lecture Notes in Computer Science 7551, 91-102 (2012).
1
Vertex angle and crossing angle resolution of leveled tree drawings. (English)
Inf. Process. Lett. 112, No. 16, 630-635 (2012).
2
Drawing trees in a streaming model. (English)
Inf. Process. Lett. 112, No. 11, 418-422 (2012).
3
Heuristics for the maximum 2-layer RAC subgraph problem. (English)
Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 6th international workshop, WALCOM 2012, Dhaka, Bangladesh, February 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28075-7/pbk). Lecture Notes in Computer Science 7157, 211-216 (2012).
4
Drawing a tree as a minimum spanning tree approximation. (English)
J. Comput. Syst. Sci. 78, No. 2, 491-503 (2012).
5
Bounds on the crossing resolution of complete geometric graphs. (English)
Discrete Appl. Math. 160, No. 1-2, 132-139 (2012).
6
Upward planarity testing of embedded mixed graphs. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 427-432 (2012).
7
Monotone drawings of graphs with fixed embedding. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 379-390 (2012).
8
2-layer right angle crossing drawings. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20‒22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 156-169 (2011).
9
Area, curve complexity, and crossing resolution of non-planar graph drawings. (English)
Theory Comput. Syst. 49, No. 3, 565-575 (2011).
10
Drawing graphs with right angle crossings. (English)
Theor. Comput. Sci. 412, No. 39, 5156-5166 (2011).
11
A graph drawing application to web site traffic analysis. (English)
J. Graph Algorithms Appl. 15, No. 2, 229-251 (2011).
12
On the perspectives opened by right angle crossing drawings. (English)
J. Graph Algorithms Appl. 15, No. 1, 53-78 (2011).
13
Topology-driven force-directed algorithms. (English)
Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21‒24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 165-176 (2011).
14
Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations (English)
IEEE Trans. Vis. Comput. Graph. 17, No. 11, 1587-1598 (2011).
15
An advanced network visualization system for financial crime detection (English)
PacificVis, 203-210 (2011).
16
Upward planarity testing of embedded mixed graphs (English)
Graph Drawing, 427-432 (2011).
17
Monotone drawings of graphs with fixed embedding (English)
Graph Drawing, 379-390 (2011).
18
2-layer right angle crossing drawings (English)
IWOCA, 156-169 (2011).
19
A characterization of complete bipartite RAC graphs. (English)
Inf. Process. Lett. 110, No. 16, 687-691 (2010).
20
Result 1 to 20 from 123 total
Start
Contact
Print
General Help
