Dr. Tamara Mchedlidze

Citata da

	Tutte	Dal 2019
Citazioni	683	402
Indice H	16	11
i10-index	29	14

120

200820092010201120122013201420152016201720182019202020212022202320244 15 12 7 10 21 22 41 33 42 58 55 65 59 52 101 67

Accesso pubblico

Visualizza tutto

25 articoli

3 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Antonios SymvonisNational Technical U. of AthensEmail verificata su math.ntua.gr
Michael KaufmannProfessor of Computer Science, Tübingen UniversityEmail verificata su uni-tuebingen.de
Patrizio AngeliniJohn Cabot UniversityEmail verificata su dia.uniroma3.it
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienEmail verificata su ac.tuwien.ac.at
Giuseppe LiottaProfessor of Computer Science, University of PerugiaEmail verificata su unipg.it
Stephen KobourovProfessor of Computer Science, Technical University MunichEmail verificata su tum.de
Philipp KindermannUniversität TrierEmail verificata su uni-trier.de
Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, GreeceEmail verificata su uoi.gr
Fabrizio FratiFull Professor, Roma Tre UniversityEmail verificata su dia.uniroma3.it
Ignaz RutterUniversity of PassauEmail verificata su uni-passau.de
Walter DidimoProfessor, University of PerugiaEmail verificata su unipg.it
Vincenzo RoselliRoma Tre UniversityEmail verificata su dia.uniroma3.it
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgEmail verificata su uni-wuerzburg.de
Giordano Da LozzoRoma Tre University, ItalyEmail verificata su dia.uniroma3.it
Emilio Di GiacomoAssociate Professor, University of Perugia, ItalyEmail verificata su unipg.it
William LenhartProfessor of Computer Science, Williams CollegeEmail verificata su williams.edu
William S. EvansUniversity of British ColumbiaEmail verificata su cs.ubc.ca
Carla BinucciUniversity of PerugiaEmail verificata su unipg.it
Sylvain LazardINRIAEmail verificata su loria.fr
Vida DujmovicUniversity of OttawaEmail verificata su uottawa.ca

Segui

Dr. Tamara Mchedlidze

Assistant Professor at Utrecht University

Email verificata su uu.nl - Home page

Network Visualization Algorithmic Graph Theory Computational Geometry Visual Perception and Cognition Digital Humanities


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Monotone drawings of graphs with fixed embedding P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ... Algorithmica 71, 233-257, 2015	34*	2015
Bar 1-visibility graphs and their relation to other nearly planar graphs W Evans, M Kaufmann, W Lenhart, T Mchedlidze, S Wismath Journal of Graph Algorithms and Applications 18 (5), 721-739, 2014	33	2014
Gestalt principles in graph drawing SG Kobourov, T Mchedlidze, L Vonessen Graph Drawing and Network Visualization: 23rd International Symposium, GD …, 2015	31	2015
Computing upward topological book embeddings of upward planar digraphs F Giordano, G Liotta, T Mchedlidze, A Symvonis Algorithms and Computation: 18th International Symposium, ISAAC 2007, Sendai …, 2007	31	2007
Extending convex partial drawings of graphs T Mchedlidze, M Nöllenburg, I Rutter Algorithmica 76 (1), 47-67, 2016	27*	2016
The power of shape: How shape of node-link diagrams impacts aesthetic appreciation and triggers interest CC Carbon, T Mchedlidze, MH Raab, H Wächter i-Perception 9 (5), 2041669518796851, 2018	24	2018
Upward book embeddings of st-graphs C Binucci, G Da Lozzo, E Di Giacomo, W Didimo, T Mchedlidze, ... arXiv preprint arXiv:1903.07966, 2019	22	2019
Lower and upper bounds for long induced paths in 3-connected planar graphs E Di Giacomo, G Liotta, T Mchedlidze Theoretical Computer Science 636, 47–55, 2016	22	2016
Minimum tree supports for hypergraphs and low-concurrency Euler diagrams B Klemz, T Mchedlidze, M Nöllenburg Algorithm Theory–SWAT 2014: 14th Scandinavian Symposium and Workshops …, 2014	21	2014
Small point sets for simply-nested planar graphs P Angelini, G Di Battista, M Kaufmann, T Mchedlidze, V Roselli, ... International Symposium on Graph Drawing, 75-85, 2011	20	2011
Drawing planar graphs with many collinear vertices G Da Lozzo, V Dujmović, F Frati, T Mchedlidze, V Roselli Journal of Computational Geometry 9 (1), 94–130-94–130, 2018	19	2018
Computing upward topological book embeddings of upward planar digraphs F Giordano, G Liotta, T Mchedlidze, A Symvonis, SH Whitesides Journal of Discrete Algorithms 30, 45-69, 2015	18*	2015
Universal point sets for planar graph drawings with circular arcs P Angelini, D Eppstein, F Frati, M Kaufmann, S Lazard, T Mchedlidze, ... Canadian Conference on Computational Geometry, 117-122, 2013	18*	2013
Aesthetic discrimination of graph layouts M Klammler, T Mchedlidze, A Pak Graph Drawing and Network Visualization: 26th International Symposium, GD …, 2018	16	2018
Upward geometric graph embeddings into point sets P Angelini, F Frati, M Geyer, M Kaufmann, T Mchedlidze, A Symvonis International Symposium on Graph Drawing, 25-37, 2010	16	2010
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs T Mchedlidze, A Symvonis International Symposium on Algorithms and Computation, 882-891, 2009	16	2009
Experimental evaluation of book drawing algorithms J Klawitter, T Mchedlidze, M Nöllenburg International Symposium on Graph Drawing and Network Visualization, 224-238, 2017	15	2017
Strongly monotone drawings of planar graphs S Felsner, A Igamberdiev, P Kindermann, BorisKlemz, T Mchedlidze, ... 32nd International Symposium on Computational Geometry (SoCG 2016) 51, 1-15, 2016	15	2016
Universal point subsets for planar graphs P Angelini, C Binucci, W Evans, F Hurtado, G Liotta, T Mchedlidze, ... International Symposium on Algorithms and Computation, 423-432, 2012	15	2012
Crossing-optimal acyclic hamiltonian path completion and its application to upward topological book embeddings T Mchedlidze, A Symvonis WALCOM: Algorithms and Computation: Third International Workshop, WALCOM …, 2009	15*	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

Segui

Citata da

Coautori