Follow
Michael Baur
Michael Baur
Formerly Universität Karlsruhe (TH)
Verified email at michaelbaur.de
Title
Cited by
Cited by
Year
Crossing reduction in circular layouts
M Baur, U Brandes
Graph-Theoretic Concepts in Computer Science: 30th International Workshop …, 2005
1122005
Visone software for visual social network analysis
M Baur, M Benkert, U Brandes, S Cornelsen, M Gaertler, B Köpf, J Lerner, ...
Graph Drawing: 9th International Symposium, GD 2001 Vienna, Austria …, 2002
992002
Drawing the AS graph in 2.5 dimensions
M Baur, U Brandes, M Gaertler, D Wagner
Graph Drawing, 43-48, 2005
792005
Multi-circular layout of micro/macro graphs
M Baur, U Brandes
Graph Drawing: 15th International Symposium, GD 2007, Sydney, Australia …, 2008
352008
Dynamic graph drawing in visone
M Baur, T Schank
Univ., Fak. für Informatik, 2008
342008
visone-Software for the Analysis and Visualization of Social Networks
M Baur
Karlsruhe, Univ., Diss., 2008, 2008
322008
Group-level analysis and visualization of social networks
M Baur, U Brandes, J Lerner, D Wagner
Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation …, 2009
202009
Generating graphs with predefined k-core structure
M Baur, M Gaertler, R Görke, M Krug, D Wagner
Proceedings of the European Conference of Complex Systems 1166 (10.3934), 2007
202007
Network comparison
M Baur, M Benkert
Network Analysis: Methodological Foundations, 318-340, 2005
202005
Augmenting k-core generation with preferential attachment
M Baur, M Gaertler, R Görke, M Krug, D Wagner
Networks and Heterogeneous Media 3 (2), 277, 2008
122008
Leftist canonical ordering
M Badent, M Baur, U Brandes, S Cornelsen
Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA …, 2010
32010
Kantenkreuzungen in Kreislayouts
M Baur
2003
Drawing Nested Decompositions of Large Networks in 2.5 D
M Baur, M Gaertler, D Wagner, U Brandes
DELIS-TR-500
M Baur, M Gaertler, R Gorke
Fully dynamic algorithms for the single source shortest path problem.
M Baur
The system can't perform the operation now. Try again later.
Articles 1–15