Martin Nöllenburg

Citata da

	Tutte	Dal 2016
Citazioni	1846	1015
Indice H	25	18
i10-index	47	40

260

130

195

20062007200820092010201120122013201420152016201720182019202020215 12 29 49 62 72 100 115 185 159 194 155 170 211 246 36

Coautori

Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgEmail verificata su uni-wuerzburg.de
Ignaz RutterUniversity of PassauEmail verificata su uni-passau.de
Stephen KobourovProfessor of Computer Science, University of ArizonaEmail verificata su cs.arizona.edu
Andreas GemsaKarlsruhe Institute of Technology (KIT)Email verificata su kit.edu
Benjamin NiedermannUniversity of BonnEmail verificata su uni-bonn.de
David EppsteinDistinguished Professor of Computer Science, University of California, IrvineEmail verificata su uci.edu
Maarten LöfflerComputer Science, Utrecht UniversityEmail verificata su cs.uu.nl
Michael KaufmannProfessor of Computer Science, Tübingen UniversityEmail verificata su informatik.uni-tuebingen.de
Michael A. BekosPostdoctoral Reasearcher, Eberhard-Karls-Universität Tübingen - Department of Computer ScienceEmail verificata su informatik.uni-tuebingen.de
Yoshio OkamotoUniversity of Electro-CommunicationsEmail verificata su uec.ac.jp
Dr. Tamara MchedlidzePostdoctoral Researcher at Karlsruhe Institute of TechnologyEmail verificata su iti.uka.de
Antonios SymvonisNational Technical U. of AthensEmail verificata su math.ntua.gr
Rodrigo I. SilveiraUniversitat Politècnica de CatalunyaEmail verificata su upc.edu
Kevin BuchinAssociate Professor of Computer Science, Technical University EindhovenEmail verificata su tue.nl
Christian A. DuncanAssociate Professor of Computer Science, Quinnipiac UniversityEmail verificata su acm.org
Michael T. GoodrichProfessor of Computer Science, University of California, IrvineEmail verificata su uci.edu
Fabrizio MontecchianiUniversity of PerugiaEmail verificata su unipg.it
Fabian KluteUtrecht UniversityEmail verificata su uu.nl
Henning MeyerhenkeProfessor of Computer Science, HU BerlinEmail verificata su hu-berlin.de
Hsiang-Yun WuTU WienEmail verificata su acm.org

Martin Nöllenburg

Professor, Algorithms and Complexity Group, TU Wien

Email verificata su ac.tuwien.ac.at - Home page

graph drawing computational geometry information visualization graph algorithms algorithm engineering


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	218*	2011
Geographic visualization M Nöllenburg Human-centered visualization environments, 257-294, 2007	85	2007
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	81	2012
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	75	2008
Optimizing active ranges for consistent dynamic map labeling K Been, M Nöllenburg, SH Poon, A Wolff Computational Geometry 43 (3), 312-328, 2010	70	2010
Algorithms for Multi-Criteria Boundary Labeling. M Benkert, HJ Haverkort, M Kroll, M Nöllenburg J. Graph Algorithms Appl. 13 (3), 289-317, 2009	52*	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	51	2012
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	50	2010
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	41*	2012
Automated drawing of metro maps M Nöllenburg Universität Karlsruhe, Fakultät für Informatik, 2005	41	2005
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	39	2013
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	37	2017
On the usability of Lombardi graph drawings HC Purchase, J Hamer, M Nöllenburg, SG Kobourov International symposium on graph drawing, 451-462, 2012	37	2012
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	36*	2017
Consistent labeling of rotating maps A Gemsa, M Nöllenburg, I Rutter Journal of Computational Geometry 7 (1), 308-331, 2016	36*	2016
Dynamic one-sided boundary labeling M Nöllenburg, V Polishchuk, M Sysikaski Proceedings of the 18th SIGSPATIAL International Conference on Advances in …, 2010	34	2010
Consistent digital rays J Chun, M Korman, M Nöllenburg, T Tokuyama Discrete & computational geometry 42 (3), 359-378, 2009	34	2009
Planar and poly-arc Lombardi drawings CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Löffler, ... Journal of Computational Geometry 9 (1), 328--355, 2018	33*	2018
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, 6-26, 2017	32	2017
An improved algorithm for the metro-line crossing minimization problem M Nöllenburg International Symposium on Graph Drawing, 381-392, 2009	30	2009

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Carica PDF

Segui questo autore

Citata da

Coautori