Veröffentlichungen 2003-2005

Liste der Veröffentlichungen aus dem Berichtszeitraum 2003-2005

  1. M. Baur and M. Benkert.
    Network Comparison.
    Ulrik Brandes, Thomas Erlebach (Eds.): Network Analysis: Methodological Foundations, volume 3418 of Lecture Notes in Computer Science, pages 318-340. Springer-Verlag, 2005.
  2. M. Baur and U. Brandes.
    Crossing Reduction in Circular Layouts.
    Proc. 30th Intl. Workshop Graph-Theoretic Concepts in Computer-Science (WG '04), LNCS 3353, pp. 332-343. Springer-Verlag, 2004.
  3. V. Batagelj and U. Brandes.
    Efficient Generation of Large Random Networks.
    Physical Review E 71, 036113 (2005).
  4. M. Baur, U. Brandes, M. Gaertler, and D. Wagner.
    Drawing the AS Graph in 2.5 Dimensions.
    Proc. 12th Intl. Symp. Graph Drawing (GD '04), LNCS 3383, pp. 43-48. Springer-Verlag, 2004.
  5. U. Brandes, S. Cornelsen, C. Fieß, and D. Wagner.
    How to Draw the Minimum Cuts of a Planar Graph.
    Computational Geometry: Theory & Applications, 29(2):117-133, 2004.
  6. U. Brandes, S. Cornelsen, and D. Wagner.
    Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles.
    Proc. 11th Intl. Symp. Graph Drawing (GD '03), LNCS 2912, pp. 357-368. Springer-Verlag, 2004.
  7. U. Brandes, S. Cornelsen, and D. Wagner.
    Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles.
    Journal of Graph Algorithms and Applications.
    To appear.
  8. U. Brandes, T. Dwyer, and F. Schreiber.
    Visualizing Related Metabolic Pathways in Two and a Half Dimensions.
    Proc. 11th Intl. Symp. Graph Drawing (GD '03), LNCS 2912, pp. 111-122. Springer-Verlag, 2004.
  9. U. Brandes, T. Dwyer and F. Schreiber.
    Visual Understanding of Metabolic Pathways Across Organisms Using Layout in Two and a Half Dimensions.
    Journal of Integrative Bioinformatics 0002, 2004.
  10. U. Brandes, T. Dwyer, and F. Schreiber.
    Visual Triangulation of Network-Based Phylogenetic Trees.
    Proc. 6th Joint Eurographics - IEEE TCVG Symp. Visualization (VisSym '04), pp. 75-83. Eurographics, 2004.
  11. U. Brandes and T. Erlebach, editors.
    Network Analysis: Methodological Foundations, volume 3418 of Lecture Notes in Computer Science Tutorial.
    Springer-Verlag, 2005.
  12. U. Brandes and D. Fleischer.
    Centrality Measures Based on Current Flow.
    Proc. 22nd Symp. Theoretical Aspects of Computer Science (STACS '05). LNCS 3404, pp. 533-544. Springer-Verlag, 2005.
  13. U. Brandes, M. Gaertler, and D. Wagner.
    Experiments on Graph Clustering Algorithms.
    Proc. 11th Europ. Symp. Algorithms (ESA '03), LNCS 2832, pp. 568-579. Springer-Verlag, 2003.
  14. U. Brandes and J. Lerner.
    Structural Similarity in Graphs.
    Proc. 15th Intl. Symp. Algorithms and Computation (ISAAC '04), LNCS 3341, pp. 184-195. Springer-Verlag, 2004.
  15. U. Brandes, J. Lerner, and C. Pich.
    GXL to GraphML and Vice Versa with XSLT.
    Proc. 2nd Intl. Workshop Graph-Based Tools (GraBaTs '04), Elsevier ENTCS.
    To appear.
  16. U. Brandes and C. Pich.
    GraphML Transformation.
    Proc. 12th Intl. Symp. Graph Drawing (GD '04), LNCS 3383, pp. 89-99. Springer-Verlag, 2004.
  17. U. Brandes, F. Schulz, D. Wagner, and T. Willhalm.
    Generating Node Coordinates for Shortest-Path Computations in Transportation Networks.
    ACM Journal of Experimental Algorithmics, 9(1.1), 2004.
  18. U. Brandes and D. Wagner.
    Netzwerkvisualisierung (in German).
    it - Information Technology, 46(3):129-134. Oldenbourg, 2004.
  19. M. Brinkmeier and T. Schank.
    Network Statistics.
    U. Brandes and T. Erlebach (Eds.): Network Analysis: Methodological Foundations, volume 3418 of Lecture Notes in Computer Science, pages 293-317. Springer-Verlag, 2005.
  20. S. Cornelsen, T. Schank, and D. Wagner.
    Drawing graphs on two and three lines.
    Journal of Graph Algorithms and Applications.
    To appear.
  21. S. Cornelsen and D. Wagner.
    Completely connected clustered graphs.
    Proceedings of the 29th Workshop on Graph-Theoretic Concepts in Computer Science, volume 2880 of Lecture Notes in Computer Science, pages 168-179. Springer-Verlag, 2003.
  22. S. Cornelsen and D. Wagner.
    Completely connected clustered graphs.
    Journal of Discrete Algorithms.
    To appear.
  23. M. Gaertler.
    Clustering.
    U. Brandes and T. Erlebach (Eds.): Network Analysis: Methodological Foundations, volume 3418 of Lecture Notes in Computer Science, pages 178-215. Springer-Verlag, 2005.
  24. M. Gaertler and M. Patrignani.
    Dynamic analysis of the autonomous system graph.
    In IPS 2004 - Inter-Domain Performance and Simulation, pages 13-24, 2004.
  25. J. Lerner.
    Role Assignments.
    U. Brandes and T. Erlebach (Eds.): Network Analysis: Methodological Foundations, volume 3418 of Lecture Notes in Computer Science, pages 216-252. Springer-Verlag, 2005.
  26. R. Möhring, H. Schilling, B. Schütz, D. Wagner, and T. Willhalm.
    Partitioning Graphs to Speed Up Dijkstra's Algorithm.
    Proceedings of 4th International Workshop on Experimental and Efficient Algorithms, (WEA'05), Lecture Notes in Computer Science, (2005), pages 189-202, to appear. Springer-Verlag, 2005. 7
  27. T. Schank and D. Wagner.
    Approximating Clustering-Coefficient and Transitivity.
    Journal on Graph Algorithms and Applications.
    Accepted for publication.
  28. T. Schank and D. Wagner.
    Finding, Counting and Listing all Triangles in Large Graphs, An Experimental Study.
    Proceedings of 4th International Workshop on Experimental and Efficient Algorithms, (WEA'05), Lecture Notes in Computer Science, (2005).
    To appear.
  29. T. Schank and D. Wagner.
    Finding, Counting and Listing all Triangles in Large Graphs, An Experimental Study.
    Technical Report. Universität Karlsruhe, 2005.