Antonios Symvonis

Navedeno

	Vse	Od leta 2018
Navedbe	1682	508
indeks h	23	13
indeks i10	45	16

120

1991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220235 11 8 17 21 21 20 27 16 21 17 18 22 37 25 36 35 70 69 73 64 79 101 79 81 87 76 93 83 95 86 62 88

Javni dostop

Prikaži vse

19 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Michael A. BekosAssistant Professor, Department of Mathematics, University of Ioannina, GreecePreverjeni e-poštni naslov na uoi.gr
Michael KaufmannProfessor of Computer Science, Tübingen UniversityPreverjeni e-poštni naslov na informatik.uni-tuebingen.de
Walter DidimoAssociate Professor, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Evmorfia N. ArgyriouyWorks GmbHPreverjeni e-poštni naslov na math.ntua.gr
Patrizio AngeliniJohn Cabot UniversityPreverjeni e-poštni naslov na dia.uniroma3.it
Stephen KobourovProfessor of Computer Science, University of ArizonaPreverjeni e-poštni naslov na cs.arizona.edu
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienPreverjeni e-poštni naslov na ac.tuwien.ac.at
Katerina PotikaSan Jose State UniversityPreverjeni e-poštni naslov na sjsu.edu
Giuseppe LiottaProfessor of Computer Science, University of PerugiaPreverjeni e-poštni naslov na unipg.it
Seok-Hee HongProfessor of Computer Science, University of SydneyPreverjeni e-poštni naslov na sydney.edu.au
Fabrizio FratiAssociate Professor, Roma Tre UniversityPreverjeni e-poštni naslov na dia.uniroma3.it
Giuseppe Di BattistaDipartimento di Ingegneria Università Roma TrePreverjeni e-poštni naslov na dia.uniroma3.it
David R. WoodSchool of Mathematics, Monash UniversityPreverjeni e-poštni naslov na monash.edu
Sue WhitesidesProfessor of Computer Science, University of Victoria BCPreverjeni e-poštni naslov na uvic.ca
Alexander WolffChair for Algorithms and Complexity, Institute of Computer Science, University of WürzburgPreverjeni e-poštni naslov na uni-wuerzburg.de
Maurizio PatrignaniProfessor of Computer Science, Roma Tre UniversityPreverjeni e-poštni naslov na dia.uniroma3.it
Peter D EadesUniversity of SydneyPreverjeni e-poštni naslov na sydney.edu.au
Gerhard WoegingerProfessor of Computer Science, RWTH AachenPreverjeni e-poštni naslov na cs.rwth-aachen.de
Luca CittadiniPreverjeni e-poštni naslov na dia.uniroma3.it
Doan HoangProfessor, University of Technology SydneyPreverjeni e-poštni naslov na uts.edu.au

Spremljaj

Antonios Symvonis

National Technical U. of Athens

Preverjeni e-poštni naslov na math.ntua.gr - Domača stran

Graph Drawing Algorithms Graph Theory Privacy


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Boundary labeling: Models and efficient algorithms for rectangular maps MA Bekos, M Kaufmann, A Symvonis, A Wolff Computational Geometry 36 (3), 215-236, 2007	145	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	143	1993
Three-dimensional orthogonal graph drawing algorithms P Eades, A Symvonis, S Whitesides Discrete Applied Mathematics 103 (1-3), 55-87, 2000	67	2000
Boundary labeling with octilinear leaders MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis Algorithmica 57 (3), 436-461, 2010	51	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	49	1997
The Straight-Line RAC Drawing Problem is NP-Hard. EN Argyriou, MA Bekos, A Symvonis J. Graph Algorithms Appl. 16 (2), 569-597, 2012	48	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
Fan-planarity: Properties and complexity C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ... Theoretical Computer Science 589, 76-86, 2015	44	2015
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
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
On the perspectives opened by right angle crossing drawings P Angelini, L Cittadini, G Di Battista, W Didimo, F Frati, M Kaufmann, ... Journal of Graph Algorithms and Applications 15 (1), 53-78, 2011	34	2011
Drawing trees in a streaming model C Binucci, U Brandes, G Di Battista, W Didimo, M Gaertler, P Palladino, ... Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA …, 2010	33	2010
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	29	2007
Multi-stack boundary labeling problems MA Bekos, M Kaufmann, K Potika, A Symvonis FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006	29	2006
Area-feature boundary labeling MA Bekos, M Kaufmann, K Potika, A Symvonis The Computer Journal 53 (6), 827-841, 2010	28	2010
Polygon labelling of minimum leader length MA Bekos, M Kaufmann, K Potika, A Symvonis APVis, 15-21, 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
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	26	2011

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji