Martin Nöllenburg

Citata da

	Tutte	Dal 2017
Citazioni	2237	1190
Indice H	27	19
i10-index	56	46

300

150

225

200720082009201020112012201320142015201620172018201920202021202213 28 49 62 72 100 132 187 156 195 161 177 197 266 290 94

Accesso pubblico

Visualizza tutto

71 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

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
Maarten LöfflerComputer Science, Utrecht UniversityEmail verificata su cs.uu.nl
David EppsteinDistinguished Professor of Computer Science, University of California, IrvineEmail verificata su uci.edu
Michael KaufmannProfessor of Computer Science, Tübingen UniversityEmail verificata su informatik.uni-tuebingen.de
Dr. Tamara MchedlidzePostdoctoral Researcher at Karlsruhe Institute of TechnologyEmail verificata su iti.uka.de
Yoshio OkamotoUniversity of Electro-CommunicationsEmail verificata su uec.ac.jp
Michael A. BekosAssistant Professor, University of Ioannina, Ioannina, GreeceEmail verificata su uoi.gr
Hsiang-Yun WuSt. Pölten University of Applied Sciences, AustriaEmail verificata su acm.org
Fabian KluteUtrecht UniversityEmail verificata su uu.nl
Fabrizio MontecchianiAssociate Professor, University of PerugiaEmail verificata su unipg.it
Sujoy BhoreIndian Institute of Science Education and Research, BhopalEmail verificata su ac.tuwien.ac.at
Antonios SymvonisNational Technical U. of AthensEmail verificata su math.ntua.gr
Rodrigo I. SilveiraUniversitat Politècnica de CatalunyaEmail verificata su upc.edu
Kevin BuchinProfessor of Computer Science, Technical University DortmundEmail verificata su tu-dortmund.de
Christian A. DuncanProfessor of Computer Science, Quinnipiac UniversityEmail verificata su acm.org
Michael T. GoodrichProfessor of Computer Science, University of California, IrvineEmail verificata su uci.edu

Segui

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	245*	2011
Geographic visualization M Nöllenburg Human-centered visualization environments, 257-294, 2007	93	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	88	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	87	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	77	2010
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	62	2012
Algorithms for Multi-Criteria Boundary Labeling. M Benkert, HJ Haverkort, M Kroll, M Nöllenburg J. Graph Algorithms Appl. 13 (3), 289-317, 2009	58*	2009
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	52	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	48*	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	47	2013
Automated drawing of metro maps M Nöllenburg Universität Karlsruhe, Fakultät für Informatik, 2005	47	2005
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	45	2017
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	43	2017
Consistent labeling of rotating maps A Gemsa, M Nöllenburg, I Rutter Journal of Computational Geometry 7 (1), 308–331-308–331, 2016	43*	2016
On the usability of Lombardi graph drawings HC Purchase, J Hamer, M Nöllenburg, SG Kobourov International symposium on graph drawing, 451-462, 2012	42	2012
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	40	2016
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	38*	2017
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	36*	2018
Dynamic one-sided boundary labeling M Nöllenburg, V Polishchuk, M Sysikaski Proceedings of the 18th SIGSPATIAL International Conference on Advances in …, 2010	36	2010
Trajectory-based dynamic map labeling A Gemsa, B Niedermann, M Nöllenburg International Symposium on Algorithms and Computation, 413-423, 2013	35	2013

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

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui questo autore

Citata da

Coautori