Antonios Symvonis 个人学术档案

引用次数

	总计	2019 年至今
引用	1764	484
h 指数	23	12
i10 指数	48	16

120

19911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320245 12 8 17 21 21 20 27 17 23 16 19 22 37 26 37 35 60 75 72 66 84 101 78 78 92 82 92 92 92 80 59 118 41

开放获取的出版物数量

查看全部

22 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, Greece在 uoi.gr 的电子邮件经过验证
Michael KaufmannProfessor of Computer Science, Tübingen University在 informatik.uni-tuebingen.de 的电子邮件经过验证
Walter DidimoProfessor, University of Perugia在 unipg.it 的电子邮件经过验证
Patrizio AngeliniJohn Cabot University在 dia.uniroma3.it 的电子邮件经过验证
Evmorfia N. ArgyriouyWorks GmbH在 math.ntua.gr 的电子邮件经过验证
Stephen KobourovProfessor of Computer Science, University of Arizona在 cs.arizona.edu 的电子邮件经过验证
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU Wien在 ac.tuwien.ac.at 的电子邮件经过验证
Katerina PotikaSan Jose State University在 sjsu.edu 的电子邮件经过验证
Giuseppe LiottaProfessor of Computer Science, University of Perugia在 unipg.it 的电子邮件经过验证
Giuseppe Di BattistaDipartimento di Ingegneria Università Roma Tre在 dia.uniroma3.it 的电子邮件经过验证
Seok-Hee HongProfessor of Computer Science, University of Sydney在 sydney.edu.au 的电子邮件经过验证
Fabrizio FratiFull Professor, Roma Tre University在 dia.uniroma3.it 的电子邮件经过验证
David R. WoodSchool of Mathematics, Monash University在 monash.edu 的电子邮件经过验证
Sue WhitesidesProfessor of Computer Science, University of Victoria BC在 uvic.ca 的电子邮件经过验证
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of Würzburg在 uni-wuerzburg.de 的电子邮件经过验证
Maurizio PatrignaniProfessor of Computer Science, Roma Tre University在 dia.uniroma3.it 的电子邮件经过验证
Peter D EadesUniversity of Sydney在 sydney.edu.au 的电子邮件经过验证
Gerhard WoegingerProfessor of Computer Science, RWTH Aachen在 cs.rwth-aachen.de 的电子邮件经过验证
Doan HoangProfessor, University of Technology Sydney在 uts.edu.au 的电子邮件经过验证
Luca Cittadini在 dia.uniroma3.it 的电子邮件经过验证

关注

Antonios Symvonis

National Technical U. of Athens

在 math.ntua.gr 的电子邮件经过验证 - 首页

Graph Drawing Algorithms Graph Theory Privacy


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Boundary labeling: Models and efficient algorithms for rectangular maps MA Bekos, M Kaufmann, A Symvonis, A Wolff Computational Geometry 36 (3), 215-236, 2007	151	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	148	1993
Three-dimensional orthogonal graph drawing algorithms P Eades, A Symvonis, S Whitesides Discrete Applied Mathematics 103 (1-3), 55-87, 2000	69	2000
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	54	2010
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
Fan-planarity: Properties and complexity C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ... Theoretical Computer Science 589, 76-86, 2015	51	2015
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	45	2011
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
Smooth orthogonal layouts MA Bekos, M Kaufmann, SG Kobourov, A Symvonis International Symposium on Graph Drawing, 150-161, 2012	41	2012
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	36	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	30	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
Geometric RAC simultaneous drawings of graphs E Argyriou, M Bekos, M Kaufmann, A Symvonis Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012	26	2012
Area-feature boundary labeling MA Bekos, M Kaufmann, K Potika, A Symvonis The Computer Journal 53 (6), 827-841, 2010	26	2010

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用