Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor.

J. Athenstädt, R. Görke, M. Krug, and M. Nöllenburg. Graph Drawing, volume 7704 of Lecture Notes in Computer Science, page 553-554. 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.

Tim Martin University of Stuttgart

Gaussian inference for data-driven state-feedback design of nonlinear systemsT. Martin, T. Schön, and F. Allgöwer. 22nd IFAC World Congress, 56, 2, page 4796-4803. Elsevier, (2023)

Univ. -Prof. Dr. -Ing. Ullrich Martin University of Stuttgart

Hon. -Prof. Dr. -Ing. Martin Krus University of Stuttgart

Martin Baumann

Martin Schwartz University of Stuttgart

Other publications of authors with the same name

Strict confluent drawing.D. Eppstein, D. Holten, M. Löffler, M. Nöllenburg, B. Speckmann, and K. Verbeek. JoCG, 7 (1): 22-46 (2016)Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions.M. Nöllenburg, R. Prutkin, and I. Rutter. Int. J. Comput. Geometry Appl., 27 (1-2): 121- (2017)Evaluation of Labeling Strategies for Rotating Maps.A. Gemsa, M. Nöllenburg, and I. Rutter. SEA, volume 8504 of Lecture Notes in Computer Science, page 235-246. Springer, (2014)Geographic Visualization.M. Nöllenburg. Human-Centered Visualization Environments, volume 4417 of Lecture Notes in Computer Science, page 257-294. Springer, (2006)Connecting Two Trees with Optimal Routing Cost.M. Kao, B. Katz, M. Krug, D. Lee, M. Nöllenburg, I. Rutter, and D. Wagner. CCCG, (2011)Adjacency-Preserving Spatial Treemaps.K. Buchin, D. Eppstein, M. Löffler, M. Nöllenburg, and R. Silveira. WADS, volume 6844 of Lecture Notes in Computer Science, page 159-170. Springer, (2011)Circular-arc cartograms.J. Kämper, S. Kobourov, and M. Nöllenburg. PacificVis, page 1-8. IEEE Computer Society, (2013)Progress on Partial Edge Drawings.T. Bruckdorfer, S. Cornelsen, C. Gutwenger, M. Kaufmann, F. Montecchiani, M. Nöllenburg, and A. Wolff. Graph Drawing, volume 7704 of Lecture Notes in Computer Science, page 67-78. Springer, (2012)Planar Drawings of Fixed-Mobile Bigraphs.M. Bekos, F. Luca, W. Didimo, T. Mchedlidze, M. Nöllenburg, A. Symvonis, and I. Tollis. Graph Drawing, volume 10692 of Lecture Notes in Computer Science, page 426-439. Springer, (2017)An Improved Algorithm for the Metro-line Crossing Minimization Problem.M. Nöllenburg. Graph Drawing, volume 5849 of Lecture Notes in Computer Science, page 381-392. Springer, (2009)