Algorithmic Applications Group Algorithmic Applications Group Basser Department of Computer Science , University of Sydney , NSW 2006, Australia. The field of design and complexity analysis of algorithms has played a leading role in the establishment of Computer Science as a discipline of its own. It covers the whole spectrum of Computer Science and has provided the theoretical foundation for the development of new subfields. Our research group concentrates on designing and analyzing algorithms that will have impact on subfields of Computer Science on the frontiers of modern computing.
Scholarships are available.
Balanced vertex-orderings of graphs. Minimising the Number of Bends and Volume in Three-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout , D. R. Wood. The DLM Algorithm for Three-Dimensional Orthogonal Graph Drawing in the General Position Model , D. R. Wood. Token Distribution on Tree-Connected Architectures , M. E. Houle, A. Symvonis and D. R. Wood. Three-Dimensional Orthogonal Graph Drawing with Optimal Volume , T. Biedl, T. Thiele and D. R. Wood.