Antonios Symvonis

Citata da

	Tutte	Dal 2016
Citazioni	1481	499
Indice H	22	13
i10-index	40	17

100

19911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020216 8 8 18 20 20 19 21 15 21 19 15 25 39 27 35 40 60 74 82 61 67 89 79 78 82 77 89 91 89 69

Accesso pubblico

Visualizza tutto

17 articoli

1 articolo

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

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
Evmorfia N. ArgyriouSpecial Laboratory and Teaching Staff - National Technical University of AthensEmail verificata su math.ntua.gr
Walter DidimoAssociate Professor, University of PerugiaEmail verificata su unipg.it
Patrizio AngeliniJohn Cabot UniversityEmail verificata su dia.uniroma3.it
Stephen KobourovProfessor of Computer Science, University of ArizonaEmail verificata su cs.arizona.edu
Katerina PotikaSan Jose State UniversityEmail verificata su sjsu.edu
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienEmail verificata su ac.tuwien.ac.at
Fabrizio FratiAssociate Professor, Roma Tre UniversityEmail verificata su dia.uniroma3.it
Seok-Hee HongProfessor of Computer Science, University of SydneyEmail verificata su it.usyd.edu.au
Giuseppe LiottaProfessor of Computer Science, University of PerugiaEmail verificata su unipg.it
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgEmail verificata su uni-wuerzburg.de
Giuseppe Di BattistaDipartimento di Ingegneria Università Roma TreEmail verificata su dia.uniroma3.it
David R. WoodSchool of Mathematics, Monash UniversityEmail verificata su monash.edu
Sue WhitesidesProfessor of Computer Science, University of Victoria BCEmail verificata su uvic.ca
Maurizio PatrignaniProfessor of Computer Science, Roma Tre UniversityEmail verificata su dia.uniroma3.it
Peter D EadesUniversity of SydneyEmail verificata su sydney.edu.au
Doan HoangProfessor, University of Technology SydneyEmail verificata su uts.edu.au
Gerhard WoegingerProfessor of Computer Science, RWTH AachenEmail verificata su cs.rwth-aachen.de
Luca CittadiniEmail verificata su dia.uniroma3.it

Antonios Symvonis

National Technical U. of Athens

Email verificata su math.ntua.gr - Home page

Graph Drawing Algorithms Graph Theory Privacy


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Boundary labeling: Models and efficient algorithms for rectangular maps MA Bekos, M Kaufmann, A Symvonis, A Wolff Computational Geometry 36 (3), 215-236, 2007	135	2007
Drawing graphs in the plane with high resolution M Formann, T Hagerup, J Haralambides, M Kaufmann, FT Leighton, ... SIAM Journal on Computing 22 (5), 1035-1052, 1993	124	1993
The straight-line RAC drawing problem is NP-hard EN Argyriou, MA Bekos, A Symvonis International Conference on Current Trends in Theory and Practice of …, 2011	64	2011
Three-dimensional orthogonal graph drawing algorithms P Eades, A Symvonis, S Whitesides Discrete Applied Mathematics 103 (1-3), 55-87, 2000	63	2000
Two algorithms for three dimensional orthogonal graph drawing P Eades, A Symvonis, S Whitesides International Symposium on Graph Drawing, 139-154, 1996	48	1996
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	44	2010
Optimal stable merging A Symvonis The Computer Journal 38 (8), 681-690, 1995	43	1995
Smooth orthogonal layouts MA Bekos, M Kaufmann, SG Kobourov, A Symvonis International Symposium on Graph Drawing, 150-161, 2012	39	2012
Line crossing minimization on metro maps MA Bekos, M Kaufmann, K Potika, A Symvonis International Symposium on Graph Drawing, 231-242, 2007	37	2007
Fan-planarity: Properties and complexity C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ... Theoretical Computer Science 589, 76-86, 2015	35	2015
Maximizing the total resolution of graphs EN Argyriou, MA Bekos, A Symvonis International Symposium on Graph Drawing, 62-67, 2010	35	2010
Monotone drawings of graphs with fixed embedding P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ... Algorithmica 71 (2), 233-257, 2015	33*	2015
Drawing trees in a streaming model C Binucci, U Brandes, G Di Battista, W Didimo, M Gaertler, P Palladino, ... International Symposium on Graph Drawing, 292-303, 2009	30	2009
On the Perspectives Opened by Right Angle Crossing Drawings. P Angelini, L Cittadini, W Didimo, F Frati, G Di Battista, M Kaufmann, ... J. Graph Algorithms Appl. 15 (1), 53-78, 2011	29	2011
Multi-stack boundary labeling problems MA Bekos, M Kaufmann, K Potika, A Symvonis International Conference on Foundations of Software Technology and …, 2006	29	2006
Computing upward topological book embeddings of upward planar digraphs F Giordano, G Liotta, T Mchedlidze, A Symvonis International Symposium on Algorithms and Computation, 172-183, 2007	28	2007
Polygon labelling of minimum leader length MA Bekos, M Kaufmann, K Potika, A Symvonis APVis, 15-21, 2006	27	2006
On the perspectives opened by right angle crossing drawings P Angelini, L Cittadini, G Di Battista, W Didimo, F Frati, M Kaufmann, ... International Symposium on Graph Drawing, 21-32, 2009	25	2009
Dimension-exchange algorithms for load balancing on trees ME Houle, A Symvonis, DR Wood Procs. of 9th Int. Colloquium on Structural Information and Communication …, 2002	25	2002
Geometric RAC simultaneous drawings of graphs E Argyriou, M Bekos, M Kaufmann, A Symvonis International Computing and Combinatorics Conference, 287-298, 2012	23	2012

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