This is the homepage of Tim Dwyer - the best way to reach me is:

Having finished my PhD - "Two and a Half Dimensional Visualisation of Relational Networks" (23MB pdf) - in Computer Science at the University of Sydney in 2004 I am now working as a Research Fellow at Monash University.

Most days you'll find me in:

Postal address:

Room 134A, Building 63
School of Computer Science and Software Engineering
Monash University
Wellington Road
Clayton,
Victoria 3800
AUSTRALIA

Telephone:

Phone: (03) 9905 5189
International callers: +61 3 9905 5189

Fax: (03) 9905 5159
International callers: +61 3 9905 5159
email:

If you are interested in Node Overlap Removal, please read the note at the bottom of this page.

Journal Articles

Bibliography

1

Tim Dwyer, Yehuda Koren, and Kim Marriott.
Constrained graph layout by stress majorization and gradient projection.
Discrete Mathematics, 2007 -- to appear.

2

Tim Dwyer, Yehuda Koren, and Kim Marriott.
IPSep-CoLa: an incremental procedure for separation constraint layout of graphs.
IEEE Transactions on Visualization and Computer Graphics, 12(5):821-828, 2006.

3

Tim Dwyer, Yehuda Koren, and Kim Marriott.
Drawing directed graphs using quadratic programming.
IEEE Transactions on Visualization and Computer Graphics, 12(4):536-548, 2006.

4

Tim Dwyer and David R. Gallagher.
Visualising changes in fund manager holdings in two and a half-dimensions http://www.palgrave-journals.com/ivs/journal/v3/n4/abs/9500081a.html.
Information Visualization, 3(4):227-244, 2004.

5

Ulrik Brandes, Tim Dwyer, and Falk Schreiber.
Visual understanding of metabolic pathways across organisms using layout in two and a half dimensions http://journal.imbio.de/index.php?paper_id=2.
Journal of Integrative Bioinformatics, 2, 2004.

Book Chapters

Bibliography

1

Tim Dwyer and Peter Eckersley.
Graph Drawing Software http://www.springer.com/east/home?SGWID=5-102-22-3062342-0&changeHeader=true, chapter WilmaScope -- a 3D graph visualisation system, pages 55-75.
Mathematics and Visualization. Springer, 2003.

Refereed Conference Papers

Bibliography

1

Tim Dwyer and Kim Marriott.
Constrained stress majorization using diagonally scaled gradient projection.
In Proc. 15th Intl. Symp. Graph Drawing (GD '07), volume 4875 of Lecture Notes in Computer Science, pages 219-330. Springer, 2007.

2

Tim Dwyer, Kim Marriott, and Michael Wybrow.
Integrating edge routing into force-directed layout.
In Proc. 14th Intl. Symp. Graph Drawing (GD '06), volume 4372 of Lecture Notes in Computer Science, pages 8-19. Springer, 2007.

3

Tim Dwyer, Seok-Hee Hong, Dirk Koschüetzki, Falk Schreiber, and Kai Xu.
Visual analysis of network centralities.
In Proc. of the Asia-Pacific symposium on Information Visualisation (APVIS 2006), volume 60 of CRPIT, pages 189-197. ACS, 2006.

4

Tim Dwyer, Yehuda Koren, and Kim Marriott.
Stress majorization with orthogonal ordering constraints.
In Proc. 13th Intl. Symp. Graph Drawing (GD '05), volume 3843 of Lecture Notes in Computer Science, pages 141-152. Springer, 2006.

5

Tim Dwyer, Kim Marriott, and Peter J. Stuckey.
Fast node overlap removal.
In Proc. 13th Intl. Symp. Graph Drawing (GD '05), volume 3843 of Lecture Notes in Computer Science, pages 153-164. Springer, 2006.

6

Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu, Joshua Ho, Seok-Hee Hong, Dirk Koschützki, Colin Murray, Nikola S. Nikolov, Ronnie Taib, Alexandre Tarassov, and Kai Xu.
GEOMI: GEOmetry fo maximum insight.
In Proc. 13th Intl. Symp. Graph Drawing (GD '05), volume 3843 of Lecture Notes in Computer Science, pages 468-479. Springer, 2006.

7

Tim Dwyer and Yehuda Koren.
Dig-cola: Directed graph layout through constrained energy minimization.
In Proceedings of the IEEE Symposium on Information Visualization (Infovis'05), pages 65-72. IEEE, 2005.

8

Adel Ahmed, Tim Dwyer, Seok-Hee Hong, Colin Murray, Le Song, and Ying Xin Wu.
Visualisation and analysis of large and complex scale-free networks.
In Proc. of Eurographics/IEEE VGTC Symposium on Visualization (EuroVis 2005), pages 239-246. IEEE, 2005.

9

Tim Dwyer.
Extending the WilmaScope 3D graph visualisation system: software demonstration.
In Proc. of the Asia-Pacific Symposium on Information Visualisation (APVIS 2005), pages 39-45. ACS, 2005.

10

Ulrik Brandes, Tim Dwyer, and Falk Schreiber.
Visualizing related metabolic pathways in two and a half dimensions http://www.springerlink.com/link.asp?id=77fh9j2re1b8.
In Proc. 11th Intl. Symp. Graph Drawing (GD '03), volume 2912 of Lecture Notes in Computer Science, pages 111-122. Springer, 2004.

11

Tim Dwyer, Hardy Rolletschek, and Falk Schreiber.
Representing experimental biological data in metabolic networks.
In Proc. 2nd Asia-Pacific Bioinformatics Conf. (APBC 2004), volume 29 of CRPIT, pages 13-20, 2004.

12

Tim Dwyer and Falk Schreiber.
Optimal leaf ordering for two and a half dimensional phylogenetic tree visualisation.
In Proc. Australasian Symp. on Information Visualisation (InVis.au 2004), CRPIT 35, pages 109-115. Australian Computer Society, 2004.

13

Ulrik Brandes, Tim Dwyer, , and Falk Schreiber.
Visual triangulation of network-based phylogenetic trees http://www.inf.uni-konstanz.de/algo/publications/bds-vtnpt-04.pdf.
In Proc. 6th Joint Eurographics - IEEE TCVG Symp. Visualization (VisSym '04), pages 75-83, 2004.

14

Tim Dwyer.
A scalable method for visualising changes in portfolio data.
In Proceedings of the Australasian Symposium on Information Visualisation (InVis.au'03), volume 24 of CRPIT, pages 17-25. Australian Computer Society, 2003.

15

Tim Dwyer and Peter Eades.
Visualising a fund manager flow graph with columns and worms.
In Proceedings of IV2002, pages 147-158. IEEE, 2002.

16

Tim Dwyer.
3D UML using force directed layout.
In Proceedings of the Australian Symposium on Information Visualisation (InVis.au'01), volume 9 of CRPIT, pages 77-85. Australian Computer Society, 2001.

Dissertations

Tim Dwyer (2005): "Two and a Half Dimensional Visualisation of Relational Networks", PhD Thesis, The University of Sydney. (23MB pdf)

Tim Dwyer (2001): "Three Dimensional UML using Force Directed Layout", Honours Thesis, The University of Melbourne (TR download)

Technical Reports

T. Dwyer, Y. Koren and K. Marriott: "Stress Majorization with Orthogonal Ordering Constraints", Technical Report 2005/175, Monash University School of Computer Science and Software Engineering (2005) pdf

T. Dwyer, K. Marriott and P.J. Stuckey: "Fast node overlap removal", Technical Report 2005/173, Monash University, School of Computer Science and Software Engineering (2005) pdf

Slides

My talk at Graph Drawing 2007: Constrained stress majorization using diagonally scaled gradient projection

My talk from CBLDD'07 Constrained optimisation and graph drawing

My talk at the Infovis'06 conference: IPSep-CoLa: An incremental procedure for constraint layout of graphs

My talks at the Graph Drawing 2005 conference:

• Fast Node Overlap Removal
• Stress Majorization with Orthogonal Ordering Constraints

Yehuda's talk from InfoVis'05:

• DiG-CoLa

Notes regarding Fast Node Overlap Removal

The tech report and the abridged version of same appearing in the GD'05 proceedings, both titled "Fast node overlap removal" (references above), contain a subtle oversight that we did not discover until these papers were published. A note, to be submitted to GD'06, giving the full details and complete proof of correctness is here. Please read it before you try and implement the algorithm or you will have trouble! The node-overlap removal algorithm has been implemented in both Java and C++. The Java code is available under the terms of the GPL from the Adaptagrams CVS repository --- follow these instructions (module name is "RectangleOverlapSolver"). The C++ version is included with the latest versions of the Inkscape drawing tool.