default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonios Symvonis
- > Home > Persons > Antonios Symvonis
Publications
- 2024
[j47]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani
, Antonios Symvonis:
Convex grid drawings of planar graphs with constant edge-vertex resolution. Theor. Comput. Sci. 982: 114290 (2024)- 2023
- [j46]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43(3): 24-35 (2023) - [i25]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. CoRR abs/2301.10872 (2023) - 2022
- [c68]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Strictly-Convex Drawings of 3-Connected Planar Graphs. GD 2022: 144-156 - [c66]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution. IWOCA 2022: 157-171 - [i24]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex Grid Drawings of Planar Graphs\\with Constant Edge-Vertex Resolution. CoRR abs/2204.14040 (2022) - [i23]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Strictly-Convex Drawings of 3-Connected Planar Graphs. CoRR abs/2208.13388 (2022) - 2021
- [j44]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Dömötör Pálvölgyi, Antonios Symvonis, Leonidas Theocharous:
Grid drawings of graphs with constant edge-vertex resolution. Comput. Geom. 98: 101789 (2021) - 2020
- [i20]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis, Leonidas Theocharous:
Grid Drawings of Graphs with Constant Edge-Vertex Resolution. CoRR abs/2005.02082 (2020) - 2019
- [j43]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy rectilinear drawings. Theor. Comput. Sci. 795: 375-397 (2019) - [j42]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar drawings of fixed-mobile bigraphs. Theor. Comput. Sci. 795: 408-419 (2019) - [c61]Patrizio Angelini, Michael A. Bekos, Martin Gronemann, Antonios Symvonis:
Geometric Representations of Dichotomous Ordinal Data. WG 2019: 205-217 - [i18]Michael A. Bekos, Carla Binucci, Michael Kaufmann, Chrysanthi N. Raftopoulou, Antonios Symvonis, Alessandra Tappini:
Coloring outerplanar graphs and planar 3-trees with small monochromatic components. CoRR abs/1911.10863 (2019) - 2018
- [c59]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. GD 2018: 495-508 - [i16]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. CoRR abs/1808.09063 (2018) - 2017
- [j41]Patrizio Angelini, Michael A. Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen G. Kobourov, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Vincenzo Roselli, Antonios Symvonis:
Vertex-Coloring with Defects. J. Graph Algorithms Appl. 21(3): 313-340 (2017) - [c55]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. GD 2017: 426-439 - [i15]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. CoRR abs/1708.09238 (2017) - 2016
- [c54]Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl Jr., Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr:
Low Ply Drawings of Trees. GD 2016: 236-248 - [i12]Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr:
Low Ply Drawings of Trees. CoRR abs/1608.08538 (2016) - 2015
- [j37]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. J. Graph Algorithms Appl. 19(3): 779-816 (2015) - 2013
- [j34]Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis:
Maximizing the Total Resolution of Graphs. Comput. J. 56(7): 887-900 (2013) - [j32]Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Geometric RAC Simultaneous Drawings of Graphs. J. Graph Algorithms Appl. 17(1): 11-34 (2013) - [j31]Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis:
Smooth Orthogonal Layouts. J. Graph Algorithms Appl. 17(5): 575-595 (2013) - [c48]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. GD 2013: 244-255 - [i10]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. CoRR abs/1308.6801 (2013) - 2012
- [j29]Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis:
The Straight-Line RAC Drawing Problem is NP-Hard. J. Graph Algorithms Appl. 16(2): 569-597 (2012) - [c46]Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Geometric RAC Simultaneous Drawings of Graphs. COCOON 2012: 287-298 - [c45]Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis:
Smooth Orthogonal Layouts. GD 2012: 150-161 - 2011
- [c41]Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Combining Problems on RAC Drawings and Simultaneous Graph Drawings. GD 2011: 433-434 - [c39]Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis:
The Straight-Line RAC Drawing Problem Is NP-Hard. SOFSEM 2011: 74-85 - [c38]Michael A. Bekos, Michael Kaufmann, Dimitrios Papadopoulos, Antonios Symvonis:
Combining Traditional Map Labeling with Boundary Labeling. SOFSEM 2011: 111-122 - [i8]Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Geometric Simultaneous RAC Drawings of Graphs. CoRR abs/1106.2694 (2011) - 2010
- [j25]Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis:
Boundary Labeling with Octilinear Leaders. Algorithmica 57(3): 436-461 (2010) - [j24]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Area-Feature Boundary Labeling. Comput. J. 53(6): 827-841 (2010) - [j23]Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
On Metro-Line Crossing Minimization. J. Graph Algorithms Appl. 14(1): 75-96 (2010) - [c35]Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis:
Maximizing the Total Resolution of Graphs. GD 2010: 62-67 - [i6]Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis:
Maximizing the Total Resolution of Graphs. CoRR abs/1009.2109 (2010) - [i5]Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis:
The Straight-Line RAC Drawing Problem is NP-Hard. CoRR abs/1009.5227 (2010) - 2008
- [j22]Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Efficient Labeling of Collinear Sites. J. Graph Algorithms Appl. 12(3): 357-380 (2008) - [c27]Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. GD 2008: 336-347 - [c23]Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis:
Boundary Labeling with Octilinear Leaders. SWAT 2008: 234-245 - 2007
- [j21]Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff:
Boundary labeling: Models and efficient algorithms for rectangular maps. Comput. Geom. 36(3): 215-236 (2007) - [c22]Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Labeling collinear sites. APVIS 2007: 45-51 - [c20]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Line Crossing Minimization on Metro Maps. GD 2007: 231-242 - 2006
- [c18]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Polygon labelling of minimum leader length. APVIS 2006: 15-21 - [c17]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Multi-stack Boundary Labeling Problems. FSTTCS 2006: 81-92 - 2005
- [c16]Michael A. Bekos, Antonios Symvonis:
BLer: A Boundary Labeller for Technical Drawings. GD 2005: 503-504 - [c15]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Boundary Labelling of Optimal Total Leader Length. Panhellenic Conference on Informatics 2005: 80-89 - 2004
- [c14]Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff:
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. GD 2004: 49-59
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
