default search action
Chrysanthi N. Raftopoulou
Person information
- affiliation: National Technical University of Athens, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Michael A. Bekos, Giordano Da Lozzo, Svenja M. Griesbach, Martin Gronemann, Fabrizio Montecchiani
, Chrysanthi N. Raftopoulou:
Book embeddings of k-framed graphs and k-map graphs. Discret. Math. 347(1): 113690 (2024) - 2023
- [j12]Michael A. Bekos
An Improved Upper Bound on the Queue Number of Planar Graphs. Algorithmica 85(2): 544-562 (2023) - [j11]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with page-number 2 is NP-complete. Theor. Comput. Sci. 946: 113689 (2023) - [c22]Henry Förster
Linear Layouts of Bipartite Planar Graphs. WADS 2023: 444-459 - [i17]Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou:
Linear Layouts of Bipartite Planar Graphs. CoRR abs/2305.16087 (2023) - 2022
- [c21]Steven Chaplick
Parameterized Algorithms for Upward Planarity. SoCG 2022: 26:1-26:16 - [c20]Steven Chaplick
Testing Upward Planarity of Partial 2-Trees. GD 2022: 175-187 - [c19]Michael A. Bekos
Recognizing DAGs with Page-Number 2 Is NP-complete. GD 2022: 361-370 - [i16]Steven Chaplick
Parameterized Algorithms for Upward Planarity. CoRR abs/2203.05364 (2022) - [i15]Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Testing Upward Planarity of Partial 2-Trees. CoRR abs/2208.12548 (2022) - [i14]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with Page-Number 2 is NP-complete. CoRR abs/2208.13615 (2022) - 2021
- [j10]Laura Benton, Manolis Mavrikis
Designing for "challenge" in a large-scale adaptive literacy game for primary school children. Br. J. Educ. Technol. 52(5): 1862-1880 (2021) - [j9]Michael Kaufmann, Jan Kratochvíl
The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 625-642 (2021) - [c18]Henry Förster
Recognizing and Embedding Simple Optimal 2-Planar Graphs. GD 2021: 87-100 - [c17]Michael A. Bekos
On the Queue Number of Planar Graphs. GD 2021: 271-284 - [i13]Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou:
On the Queue Number of Planar Graphs. CoRR abs/2106.08003 (2021) - [i12]Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou:
Recognizing and Embedding Simple Optimal 2-Planar Graphs. CoRR abs/2108.00665 (2021) - 2020
- [j8]Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Four Pages Are Indeed Necessary for Planar Graphs. J. Comput. Geom. 11(1): 332-353 (2020) - [c16]Michael A. Bekos
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages. SoCG 2020: 16:1-16:17 - [c15]Therese Biedl
Layered Fan-Planar Graph Drawings. MFCS 2020: 14:1-14:13 - [c14]Michael Kaufmann, Jan Kratochvíl
The Stub Resolution of 1-Planar Graphs. WALCOM 2020: 170-182 - [i11]Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
On Layered Fan-Planar Graph Drawings. CoRR abs/2002.09597 (2020) - [i10]Michael A. Bekos, Giordano Da Lozzo, Svenja Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou:
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages. CoRR abs/2003.07655 (2020) - [i9]Michael A. Bekos, Michael Kaufmann, Fabian Klute
Four Pages Are Indeed Necessary for Planar Graphs. CoRR abs/2004.07630 (2020)
2010 – 2019
- 2019
- [j7]Michael A. Bekos
Edge partitions of optimal 2-plane and 3-plane graphs. Discret. Math. 342(4): 1038-1047 (2019) - [j6]Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze
Planar Graphs of Bounded Degree Have Bounded Queue Number. SIAM J. Comput. 48(5): 1487-1502 (2019) - [c13]Nick Deligiannis, Dionysis Panagiotopoulos, Panagiotis Patsilinakos, Chrysanthi N. Raftopoulou, Antonios Symvonis:
Interactive and Personalized Activity eBooks for Learning to Read: The iRead Case. iTextbooks@AIED 2019: 57-69 - [c12]Manolis Mavrikis, Asimina Vasalou
Towards Evidence-informed Design Principles for Adaptive Reading Games. CHI Extended Abstracts 2019 - [c11]Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze
Planar graphs of bounded degree have bounded queue number. STOC 2019: 176-184 - [i8]Michael A. Bekos, Chrysanthi N. Raftopoulou:
On a Conjecture of Lovász on Circle-Representations of Simple 4-Regular Planar Graphs. CoRR abs/1909.01721 (2019) - [i7]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
- [c10]Michael Kaufmann, Jan Kratochvíl
Bounded Stub Resolution for Some Maximal 1-Planar Graphs. CALDAM 2018: 214-220 - [c9]Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. GD 2018: 509-523 - [c8]Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
Edge Partitions of Optimal 2-plane and 3-plane Graphs. WG 2018: 27-39 - [i6]Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff:
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. CoRR abs/1808.10536 (2018) - [i5]Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Planar Graphs of Bounded Degree have Constant Queue Number. CoRR abs/1811.00816 (2018) - 2017
- [j5]Michael A. Bekos
The Book Thickness of 1-Planar Graphs is Constant. Algorithmica 79(2): 444-465 (2017) - [j4]Patrizio Angelini
Vertex-Coloring with Defects. J. Graph Algorithms Appl. 21(3): 313-340 (2017) - [c7]Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou
On Optimal 2- and 3-Planar Graphs. SoCG 2017: 16:1-16:16 - [i4]Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou:
On Optimal 2- and 3-Planar Graphs. CoRR abs/1703.06526 (2017) - 2016
- [b1]Chrysanthi N. Raftopoulou:
Χρωματισμοί, εμφυτεύσεις και συναφή γραφοθεωρητικά προβλήματα. National Technical University of Athens, Greece, 2016 - [j3]Michael A. Bekos
Two-Page Book Embeddings of 4-Planar Graphs. Algorithmica 75(1): 158-185 (2016) - [c6]Michael A. Bekos
On the Density of Non-simple 3-Planar Graphs. GD 2016: 344-356 - [c5]Michael A. Bekos
AVDTC of generalized 3-Halin graphs. IISA 2016: 1-6 - [i3]Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou:
On the Density of 3-Planar Graphs. CoRR abs/1602.04995 (2016) - 2015
- [j2]Michael A. Bekos, Chrysanthi N. Raftopoulou:
On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs. J. Comput. Geom. 6(1): 1-20 (2015) - [c4]Michael A. Bekos
1-Planar Graphs have Constant Book Thickness. ESA 2015: 130-141 - [i2]Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou:
The Book Thickness of 1-Planar Graphs is Constant. CoRR abs/1503.04990 (2015) - 2014
- [j1]A. Papaioannou, Chrysanthi N. Raftopoulou
On the AVDTC of 4-regular graphs. Discret. Math. 330: 20-40 (2014) - [c3]Michael A. Bekos
Perfect smooth orthogonal drawings. IISA 2014: 76-81 - [c2]Michael A. Bekos
Two-Page Book Embeddings of 4-Planar Graphs. STACS 2014: 137-148 - [i1]Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou:
Two-Page Book Embeddings of 4-Planar Graphs. CoRR abs/1401.0684 (2014) - 2012
- [c1]Michael A. Bekos
Circle-Representations of Simple 4-Regular Planar Graphs. GD 2012: 138-149
Coauthor Index
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-04-24 22:56 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: