Följ
Martin Nöllenburg
Martin Nöllenburg
Professor, Algorithms and Complexity Group, TU Wien
Verifierad e-postadress på ac.tuwien.ac.at - Startsida
Titel
Citeras av
Citeras av
År
Drawing and labeling high-quality metro maps by mixed-integer programming
M Nöllenburg, A Wolff
Visualization and Computer Graphics, IEEE Transactions on 17 (5), 626-641, 2011
295*2011
Geographic visualization
M Nöllenburg
Human-centered visualization environments: GI-Dagstuhl research seminar …, 2007
1272007
Morphing polylines: A step towards continuous generalization
M Nöllenburg, D Merrick, A Wolff, M Benkert
Computers, Environment and Urban Systems 32 (4), 248-260, 2008
1002008
Lombardi Drawings of Graphs
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
Journal of Graph Algorithms and Applications 16 (1), 37-60, 2012
992012
Optimizing active ranges for consistent dynamic map labeling
K Been, M Nöllenburg, SH Poon, A Wolff
Proceedings of the twenty-fourth annual symposium on Computational geometry …, 2008
902008
Drawing metro maps using Bézier curves
M Fink, H Haverkort, M Nöllenburg, M Roberts, J Schuhmann, A Wolff
Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013
752013
Crowdsourcing versus the laboratory: towards human-centered experiments using the crowd
U Gadiraju, S Möller, M Nöllenburg, D Saupe, S Egger-Lampl, ...
Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments …, 2017
662017
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
K Buchin, M Buchin, J Byrka, M Nöllenburg, Y Okamoto, RI Silveira, ...
Algorithmica 62 (1-2), 309-332, 2012
662012
Algorithms for multi-criteria boundary labeling
M Benkert, H Haverkort, M Kroll, M Nöllenburg
Journal of Graph Algorithms and Applications 13 (3), 289-317, 2009
64*2009
A survey on transit map layout–from design, machine, and human perspectives
HY Wu, B Niedermann, S Takahashi, MJ Roberts, M Nöllenburg
Computer Graphics Forum 39 (3), 619-646, 2020
612020
Boundary labeling with octilinear leaders
MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis
Algorithmica 57 (3), 436-461, 2010
612010
Drawing large graphs by multilevel maxent-stress optimization
H Meyerhenke, M Nöllenburg, C Schulz
IEEE Transactions on Visualization and Computer Graphics 24 (5), 1814-1827, 2017
572017
Evaluation of Labeling Strategies for Rotating Maps
A Gemsa, M Nöllenburg, I Rutter
ACM Journal of Experimental Algorithmics 21 (1), 1.4:1 -- 1.4:21, 2016
572016
Automated drawing of metro maps
M Nöllenburg
Univ., Fak. für Informatik, Bibl., 2005
572005
On the usability of Lombardi graph drawings
HC Purchase, J Hamer, M Nöllenburg, SG Kobourov
Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013
552013
Drawing trees with perfect angular resolution and polynomial area
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
Discrete & Computational Geometry 49, 157-182, 2013
542013
Consistent labeling of rotating maps
A Gemsa, M Nöllenburg, I Rutter
Algorithms and Data Structures: 12th International Symposium, WADS 2011, New …, 2011
532011
Progress on Partial Edge Drawings
T Bruckdorfer, S Cornelsen, C Gutwenger, M Kaufmann, F Montecchiani, ...
Journal of Graph Algorithms and Applications 21 (4), 757-786, 2017
47*2017
Dynamic one-sided boundary labeling
M Nöllenburg, V Polishchuk, M Sysikaski
Proceedings of the 18th SIGSPATIAL International Conference on Advances in …, 2010
462010
Metrosets: Visualizing sets as metro maps
B Jacobsen, M Wallinger, S Kobourov, M Nöllenburg
IEEE Transactions on Visualization and Computer Graphics 27 (2), 1257-1267, 2020
442020
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20