[Old photo of me] This is the homepage of Tim Dwyer - the best way to reach me is:

I have a new position: Senior Lecturer and Larkins Fellow at Monash University, Australia.

The publication list below is out of date (but the links may still be useful)

Here are my up-to-date publications

From December 2004 until June 2008 I worked as a Research Fellow at the Clayton School of IT at Monash University. In 2008-2009 I was a Visiting Researcher with the VIBE group at Microsoft Research in Redmond, USA. From July 2009 to October 2012 I was a Senior SDE with the Visual Studio product group at Microsoft.

My current project is WebCoLa

Publications

bibliography
[1] Tim Dwyer. Scalable, versatile and simple constrained graph layout. In Proc. Eurographics/IEEE-VGTC Symp. on Visualization (Eurovis 2009). (to appear) IEEE, 2009. [ bib | .pdf ]
[2] Chris North, Tim Dwyer, Bongshin Lee, Danyel Fisher, Petra Isenberg, George Robertson, and Kori Inkpen Quinn. Understanding multi-touch manipulation for surface computing. In Proc. 12th IFIP TC13 Conf. in Human-Computer Interaction (Interact 2009), LNCS. (to appear) Springer, 2009. [ bib ]
[3] Tim Dwyer, Kim Marriott, and Michael Wybrow. Topology preserving constrained graph layout. In Proc. 16th Intl. Symp. Graph Drawing (GD'08), volume 5417 of Lecture Notes in Computer Science, pages 230-241. Springer, 2009. [ bib | .pdf ]
[4] Tim Dwyer, Kim Marriott, and Michael Wybrow. Dunnart: A constraint-based network diagram authoring tool. In Proc. 16th Intl. Symp. Graph Drawing (GD'08), volume 5417 of Lecture Notes in Computer Science, pages 420-431. Springer, 2009. [ bib | .pdf ]
[5] Tim Dwyer, Yehuda Koren, and Kim Marriott. Constrained graph layout by stress majorization and gradient projection. Discrete Mathematics, 309(7):1895 - 1908, 2009. [ bib | DOI | http ]
[6] Tim Dwyer, Nathan Hurst, and Damian Merrick. A fast and simple heuristic for metro map path simplification. In Advances in Visual Computing, Proc. 4th Intl. Symp. on Visual Computing (ISVC'08), volume 5358 of Lecture Notes in Computer Science, pages 22-30. Springer, 2008. [ bib | .pdf ]
[7] Tim Dwyer, Kim Marriott, Falk Schreiber, Peter J. Stuckey, Michael Woodward, and Michael Wybrow. Exploration of networks using overview+detail with constraint-based cooperative layout. IEEE Transactions on Visualization and Computer Graphics, 14(6):1293-1300, 2008. [ bib | http ]
[8] 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. Springer, 2008. [ bib | http ]
[9] 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. [ bib | http ]
[10] 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. [ bib | http ]
[11] 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. [ bib | http ]
[12] 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. [ bib ]
[13] 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. [ bib ]
[14] 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. [ bib ]
[15] 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. [ bib ]
[16] 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. [ bib | .pdf ]
[17] 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. [ bib | http ]
[18] 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. [ bib ]
[19] Tim Dwyer and David R. Gallagher. Visualising changes in fund manager holdings in two and a half-dimensions. Information Visualization, 3(4):227-244, 2004. [ bib | .html ]
[20] Ulrik Brandes, Tim Dwyer, and Falk Schreiber. Visual understanding of metabolic pathways across organisms using layout in two and a half dimensions. Journal of Integrative Bioinformatics, 2, 2004. [ bib | http ]
[21] 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. [ bib ]
[22] Ulrik Brandes, Tim Dwyer, and Falk Schreiber. Visualizing related metabolic pathways in two and a half dimensions. In Proc. 11th Intl. Symp. Graph Drawing (GD '03), volume 2912 of Lecture Notes in Computer Science, pages 111-122. Springer, 2004. [ bib | http ]
[23] 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. [ bib ]
[24] Ulrik Brandes, Tim Dwyer, , and Falk Schreiber. Visual triangulation of network-based phylogenetic trees. In Proc. 6th Joint Eurographics - IEEE TCVG Symp. Visualization (VisSym '04), pages 75-83, 2004. [ bib | .pdf ]
[25] Adel Ahmed, Tim Dwyer, Colin Murray, Le Song, and Ying Xin Wu. Wilmascope graph visualization: Infovis contest 2004 - 1st place student prize. In Information Visualization, IEEE Symposium on. IEEE, 2004. [ bib | http ]
[26] Damian Merrick and Tim Dwyer. Skeletal animation for the exploration of graphs. In APVis '04: Proceedings of the 2004 Australasian symposium on Information Visualisation, pages 61-70, Darlinghurst, Australia, Australia, 2004. Australian Computer Society, Inc. [ bib | http ]
[27] 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. [ bib ]
[28] Tim Dwyer and Peter Eckersley. Graph Drawing Software, chapter WilmaScope - a 3D graph visualisation system, pages 55-75. Mathematics and Visualization. Springer, 2003. [ bib | http ]
[29] Tim Dwyer and Peter Eades. Visualising a fund manager flow graph with columns and worms. In Proceedings of IV2002, pages 147-158. IEEE, 2002. [ bib | http ]
[30] 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. [ bib | http ]

This file was generated by bibtex2html 1.92.

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 from Infovis 2008 (includes a couple of short movies): Exploration of networks using overview+detail with constraint-based cooperative layout

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: Yehuda's talk from InfoVis'05:

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.