Antonios Symvonis

Citado por

	Todos	Desde 2019
Citações	1944	550
Índice h	25	13
Índice i10	54	19

140

105

19911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320245 12 8 17 21 27 25 37 22 26 19 21 25 40 30 39 39 60 78 73 70 91 107 85 86 96 96 97 96 94 92 68 122 76

Acesso público

Ver tudo

23 artigos

0 artigos

disponível

não disponível

Com base em autorizações de financiamento

Coautores

Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, GreeceEmail confirmado em uoi.gr
Michael KaufmannProfessor of Computer Science, Tübingen UniversityEmail confirmado em uni-tuebingen.de
Evmorfia N. ArgyriouyWorks GmbHEmail confirmado em math.ntua.gr
Walter DidimoProfessor, University of PerugiaEmail confirmado em unipg.it
Patrizio AngeliniJohn Cabot UniversityEmail confirmado em dia.uniroma3.it
Stephen KobourovProfessor of Computer Science, Technical University MunichEmail confirmado em tum.de
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienEmail confirmado em ac.tuwien.ac.at
Katerina PotikaSan Jose State UniversityEmail confirmado em sjsu.edu
Giuseppe LiottaProfessor of Computer Science, University of PerugiaEmail confirmado em unipg.it
Giuseppe Di BattistaDipartimento di Ingegneria Università Roma TreEmail confirmado em dia.uniroma3.it
Seok-Hee HongProfessor of Computer Science, University of SydneyEmail confirmado em sydney.edu.au
Fabrizio FratiFull Professor, Roma Tre UniversityEmail confirmado em dia.uniroma3.it
David R. WoodSchool of Mathematics, Monash UniversityEmail confirmado em monash.edu
Sue WhitesidesProfessor of Computer Science, University of Victoria BCEmail confirmado em uvic.ca
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgEmail confirmado em uni-wuerzburg.de
Maurizio PatrignaniProfessor of Computer Science, Roma Tre UniversityEmail confirmado em dia.uniroma3.it
Peter D EadesUniversity of SydneyEmail confirmado em sydney.edu.au
Gerhard WoegingerProfessor of Computer Science, RWTH AachenEmail confirmado em cs.rwth-aachen.de
Luca CittadiniEmail confirmado em dia.uniroma3.it
Doan HoangProfessor, University of Technology SydneyEmail confirmado em uts.edu.au

Seguir

Antonios Symvonis

National Technical U. of Athens

Email confirmado em math.ntua.gr - Página inicial

Graph Drawing Algorithms Graph Theory Privacy


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Boundary labeling: Models and efficient algorithms for rectangular maps MA Bekos, M Kaufmann, A Symvonis, A Wolff Computational Geometry 36 (3), 215-236, 2007	152	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	151	1993
Three-dimensional orthogonal graph drawing algorithms P Eades, A Symvonis, S Whitesides Discrete Applied Mathematics 103 (1-3), 55-87, 2000	69	2000
Adaptive reading assistance for the inclusion of students with dyslexia: The AGENT-DYSL approach P Tzouveli, A Schmidt, M Schneider, A Symvonis, S Kollias 2008 Eighth IEEE International Conference on Advanced Learning Technologies …, 2008	62	2008
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	55	2010
Fan-planarity: Properties and complexity C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ... Theoretical Computer Science 589, 76-86, 2015	52	2015
Two algorithms for three dimensional orthogonal graph drawing P Eades, A Symvonis, S Whitesides Graph Drawing: Symposium on Graph Drawing, GD'96 Berkeley, California, USA …, 1997	52	1997
The straight-line RAC drawing problem is NP-hard E Argyriou, M Bekos, A Symvonis Journal of Graph Algorithms and Applications 16 (2), 569-597, 2012	49	2012
Optimal stable merging A Symvonis The Computer Journal 38 (8), 681-690, 1995	47	1995
Maximizing the total resolution of graphs EN Argyriou, MA Bekos, A Symvonis Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany …, 2011	46	2011
Smooth orthogonal layouts MA Bekos, M Kaufmann, SG Kobourov, A Symvonis International Symposium on Graph Drawing, 150-161, 2012	43	2012
Line crossing minimization on metro maps MA Bekos, M Kaufmann, K Potika, A Symvonis Graph Drawing: 15th International Symposium, GD 2007, Sydney, Australia …, 2008	43	2008
Making assistive reading tools user friendly: A new platform for Greek dyslexic students empowered by automatic speech recognition T Athanaselis, S Bakamidis, I Dologlou, EN Argyriou, A Symvonis Multimedia tools and applications 68, 681-699, 2014	37	2014
On the perspectives opened by right angle crossing drawings P Angelini, L Cittadini, W Didimo, F Frati, G Di Battista, M Kaufmann, ... Journal of Graph Algorithms and Applications 15 (1), 53-78, 2011	37	2011
Drawing trees in a streaming model C Binucci, U Brandes, G Di Battista, W Didimo, M Gaertler, P Palladino, ... Information Processing Letters 112 (11), 418-422, 2012	35	2012
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
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
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	28	2011
Polygon labelling of minimum leader length MA Bekos, M Kaufmann, K Potika, A Symvonis APVis, 15-21, 2006	28	2006
Multi-stack boundary labeling problems MA Bekos, M Kaufmann, K Potika, A Symvonis FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006	28	2006

O sistema não pode efectuar a operação agora. Tente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações unidas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores