Martin Nöllenburg
Martin Nöllenburg
Associate Professor, Algorithms and Complexity Group, TU Wien
Dirección de correo verificada de ac.tuwien.ac.at - Página principal
TítuloCitado porAño
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
1372011
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
752012
Geographic visualization
M Nöllenburg
Human-centered visualization environments, 257-294, 2007
672007
A mixed-integer program for drawing high-quality metro maps
M Nöllenburg, A Wolff
Graph Drawing, 321-333, 2006
652006
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
642008
Optimizing active ranges for consistent dynamic map labeling
K Been, M Nöllenburg, SH Poon, A Wolff
Computational Geometry 43 (3), 312-328, 2010
602010
Algorithms for Multi-Criteria Boundary Labeling.
M Benkert, HJ Haverkort, M Kroll, M Nöllenburg
J. Graph Algorithms Appl. 13 (3), 289-317, 2009
48*2009
Drawing metro maps using Bézier curves
M Fink, H Haverkort, M Nöllenburg, M Roberts, J Schuhmann, A Wolff
International Symposium on Graph Drawing, 463-474, 2012
472012
Boundary labeling with octilinear leaders
MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis
Algorithmica 57 (3), 436-461, 2010
472010
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
44*2012
Drawing trees with perfect angular resolution and polynomial area
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg
Discrete & Computational Geometry 49 (2), 157-182, 2013
382013
On the usability of Lombardi graph drawings
HC Purchase, J Hamer, M Nöllenburg, SG Kobourov
International Symposium on Graph Drawing, 451-462, 2012
362012
Automated drawing of metro maps
M Nöllenburg
Universität Karlsruhe, Fakultät für Informatik, 2005
352005
Planar and poly-arc Lombardi drawings
CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Löffler
International Symposium on Graph Drawing, 308-319, 2011
322011
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
30*2017
Consistent labeling of rotating maps
A Gemsa, M Nöllenburg, I Rutter
Journal of Computational Geometry 7 (1), 308-331, 2016
30*2016
Consistent digital rays
J Chun, M Korman, M Nöllenburg, T Tokuyama
Discrete & computational geometry 42 (3), 359-378, 2009
302009
Dynamic one-sided boundary labeling.
M Nöllenburg, V Polishchuk, M Sysikaski
GIS, 310-319, 2010
282010
Trajectory-based dynamic map labeling
A Gemsa, B Niedermann, M Nöllenburg
International Symposium on Algorithms and Computation, 413-423, 2013
262013
Drawing binary tanglegrams: An experimental evaluation
M Nöllenburg, D Holten, M Völker, A Wolff
11th Workshop Algorithm Engineering and Experiments (ALENEX’09), 106-119, 2008
262008
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20