Martin Nöllenburg

Citata da

	Tutte	Dal 2019
Citazioni	3192	1753
Indice H	32	22
i10-index	80	64

380

190

285

20072008200920102011201220132014201520162017201820192020202120222023202414 27 48 59 66 109 139 189 168 192 162 204 197 270 288 282 372 335

Accesso pubblico

Visualizza tutto

82 articoli

1 articolo

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, Technical University MunichEmail verificata su tum.de
Andreas GemsaKarlsruhe Institute of Technology (KIT)Email verificata su kit.edu
Fabrizio MontecchianiAssociate Professor, University of PerugiaEmail verificata su unipg.it
Hsiang-Yun WuSt. Pölten University of Applied Sciences, AustriaEmail verificata su acm.org
Sujoy BhoreIndian Institute of Technology BombayEmail verificata su iitb.ac.in
Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, GreeceEmail verificata su uoi.gr
Markus WallingerTU WienEmail verificata su ac.tuwien.ac.at
Robert GanianTU WienEmail verificata su ac.tuwien.ac.at
Maarten LöfflerComputer Science, Utrecht UniversityEmail verificata su cs.uu.nl
Fabian KlutePolytechnic University of CataloniaEmail verificata su upc.edu
David EppsteinDistinguished Professor of Computer Science, University of California, IrvineEmail verificata su uci.edu
Michael KaufmannProfessor of Computer Science, Tübingen UniversityEmail verificata su uni-tuebingen.de
Dr. Tamara MchedlidzeAssistant Professor at Utrecht UniversityEmail verificata su uu.nl
Antonios SymvonisNational Technical U. of AthensEmail verificata su math.ntua.gr
Yoshio OkamotoUniversity of Electro-CommunicationsEmail verificata su uec.ac.jp
Daniel ArchambaultNewcastle UniversityEmail verificata su newcastle.ac.uk
Guangping LiComputer Science, Technical University DortmundEmail verificata su tu-dortmund.de
Jules WulmsPostDoc, TU EindhovenEmail verificata su tue.nl

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	291*	2011
Geographic visualization M Nöllenburg Human-centered visualization environments: GI-Dagstuhl research seminar …, 2007	127	2007
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	100	2008
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	97	2012
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	86	2008
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	75	2013
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	65	2012
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
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	62	2017
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	62	2010
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	61	2020
Automated drawing of metro maps M Nöllenburg Univ., Fak. für Informatik, Bibl., 2005	58	2005
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	56	2016
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	55	2017
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	55	2013
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	54	2013
Consistent labeling of rotating maps A Gemsa, M Nöllenburg, I Rutter Algorithms and Data Structures: 12th International Symposium, WADS 2011, New …, 2011	50	2011
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	45	2020
Dynamic one-sided boundary labeling M Nöllenburg, V Polishchuk, M Sysikaski Proceedings of the 18th SIGSPATIAL International Conference on Advances in …, 2010	45	2010
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	44*	2017

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

Citata da

Coautori