Author of the publication

Force-Directed Graph Drawing Using Social Gravity and Scaling.

, , , and . GD, volume 7704 of Lecture Notes in Computer Science, page 414-425. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings., , , and . GD, volume 8871 of Lecture Notes in Computer Science, page 149-161. Springer, (2014)Superpatterns and Universal Point Sets., , , and . GD, volume 8242 of Lecture Notes in Computer Science, page 208-219. Springer, (2013)Track Layout Is Hard., , , , and . GD, volume 9801 of Lecture Notes in Computer Science, page 499-510. Springer, (2016)Small Superpatterns for Dominance Drawing., , and . ANALCO, page 92-103. SIAM, (2014)Confluent Orthogonal Drawings of Syntax Diagrams., , and . GD, volume 9411 of Lecture Notes in Computer Science, page 260-271. Springer, (2015)Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges., , , and . SODA, page 856-864. SIAM, (2013)Randomized Speedup of the Bellman-Ford Algorithm., and . ANALCO, page 41-47. SIAM, (2012)Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges, , , and . CoRR, (2012)Lower Bounds and Fixed-Parameter Tractability of Drawing Graphs.. University of California, Irvine, USA, (2015)Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings., and . GD, volume 7034 of Lecture Notes in Computer Science, page 367-378. Springer, (2011)