Circle-Representations of Simple 4-Regular Planar Graphs. - Michael A. Bekos; Chrysanthi N. Raftopoulou (GD, 2012)

Perfect smooth orthogonal drawings. - Michael A. Bekos; Martin Gronemann; Sergey Pupyrev; Chrysanthi N. Raftopoulou (IISA, 2014)

On the AVDTC of 4-regular graphs. - A. Papaioannou; Chrysanthi N. Raftopoulou (Discret. Math., 2014)

1-Planar Graphs have Constant Book Thickness. - Michael A. Bekos; Till Bruckdorfer; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (ESA, 2015)

On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs. - Michael A. Bekos; Chrysanthi N. Raftopoulou (J. Comput. Geom., 2015)

On the Density of Non-simple 3-Planar Graphs. - Michael A. Bekos; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (GD, 2016)

AVDTC of generalized 3-Halin graphs. - Michael A. Bekos; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (IISA, 2016)

Two-Page Book Embeddings of 4-Planar Graphs. - Michael A. Bekos; Martin Gronemann; Chrysanthi N. Raftopoulou (Algorithmica, 2016)

On the Density of 3-Planar Graphs. - Michael A. Bekos; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (CoRR, 2016)

Χρωματισμοί, εμφυτεύσεις και συναφή γραφοθεωρητικά προβλήματα - Chrysanthi N. Raftopoulou (2016)

On Optimal 2- and 3-Planar Graphs. - Michael A. Bekos; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (SoCG, 2017)

The Book Thickness of 1-Planar Graphs is Constant. - Michael A. Bekos; Till Bruckdorfer; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (Algorithmica, 2017)

Vertex-Coloring with Defects. - Patrizio Angelini; Michael A. Bekos; Felice De Luca; Walter Didimo; Michael Kaufmann 001; Stephen G. Kobourov; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Vincenzo Roselli; Antonios Symvonis (J. Graph Algorithms Appl., 2017)

Bounded Stub Resolution for Some Maximal 1-Planar Graphs. - Michael Kaufmann 001; Jan Kratochvíl; Fabian Lipp; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Pavel Valtr 001 (CALDAM, 2018)

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. - Evmorfia N. Argyriou; Sabine Cornelsen; Henry Förster; Michael Kaufmann 001; Martin Nöllenburg; Yoshio Okamoto; Chrysanthi N. Raftopoulou; Alexander Wolff 001 (GD, 2018)

Planar Graphs of Bounded Degree have Constant Queue Number. - Michael A. Bekos; Henry Förster; Martin Gronemann; Tamara Mchedlidze; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (CoRR, 2018)

Interactive and Personalized Activity eBooks for Learning to Read: The iRead Case. - Nick Deligiannis; Dionysis Panagiotopoulos; Panagiotis Patsilinakos; Chrysanthi N. Raftopoulou; Antonios Symvonis (iTextbooks@AIED, 2019)

Towards Evidence-informed Design Principles for Adaptive Reading Games. - Manolis Mavrikis; Asimina Vasalou; Laura Benton; Chrysanthi N. Raftopoulou; Antonios Symvonis; Kostas Karpouzis; Drew Wilkins (CHI Extended Abstracts, 2019)

Coloring outerplanar graphs and planar 3-trees with small monochromatic components. - Michael A. Bekos; Carla Binucci; Michael Kaufmann 001; Chrysanthi N. Raftopoulou; Antonios Symvonis; Alessandra Tappini (CoRR, 2019)

Edge partitions of optimal 2-plane and 3-plane graphs. - Michael A. Bekos; Emilio Di Giacomo; Walter Didimo; Giuseppe Liotta; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou (Discret. Math., 2019)

Planar Graphs of Bounded Degree Have Bounded Queue Number. - Michael A. Bekos; Henry Förster; Martin Gronemann; Tamara Mchedlidze; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (SIAM J. Comput., 2019)

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages. - Michael A. Bekos; Giordano Da Lozzo; Svenja Griesbach; Martin Gronemann; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou (SoCG, 2020)

Layered Fan-Planar Graph Drawings. - Therese Biedl; Steven Chaplick; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Chrysanthi N. Raftopoulou (MFCS, 2020)

On Layered Fan-Planar Graph Drawings. - Therese Biedl; Steven Chaplick; Jirí Fiala 001; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Chrysanthi N. Raftopoulou (CoRR, 2020)

Four Pages Are Indeed Necessary for Planar Graphs. - Michael A. Bekos; Michael Kaufmann 001; Fabian Klute; Sergey Pupyrev; Chrysanthi N. Raftopoulou; Torsten Ueckerdt (J. Comput. Geom., 2020)

On the Queue Number of Planar Graphs. - Michael A. Bekos; Martin Gronemann; Chrysanthi N. Raftopoulou (GD, 2021)

Recognizing and Embedding Simple Optimal 2-Planar Graphs. - Henry Förster; Michael Kaufmann 001; Chrysanthi N. Raftopoulou (GD, 2021)

Designing for "challenge" in a large-scale adaptive literacy game for primary school children. - Laura Benton; Manolis Mavrikis; Asimina Vasalou; Nelly Joye; Emma Sumner; Elisabeth Herbert; Andrea Révész; Antonios Symvonis; Chrysanthi N. Raftopoulou (Br. J. Educ. Technol., 2021)

The Stub Resolution of 1-planar Graphs. - Michael Kaufmann 001; Jan Kratochvíl; Fabian Lipp; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou; Pavel Valtr 001 (J. Graph Algorithms Appl., 2021)

Parameterized Algorithms for Upward Planarity. - Steven Chaplick; Emilio Di Giacomo; Fabrizio Frati; Robert Ganian; Chrysanthi N. Raftopoulou; Kirill Simonov (SoCG, 2022)

Testing Upward Planarity of Partial 2-Trees. - Steven Chaplick; Emilio Di Giacomo; Fabrizio Frati; Robert Ganian; Chrysanthi N. Raftopoulou; Kirill Simonov (GD, 2022)

Linear Layouts of Bipartite Planar Graphs. - Henry Förster; Michael Kaufmann 001; Laura Merker; Sergey Pupyrev; Chrysanthi N. Raftopoulou (WADS, 2023)

An Improved Upper Bound on the Queue Number of Planar Graphs. - Michael A. Bekos; Martin Gronemann; Chrysanthi N. Raftopoulou (Algorithmica, 2023)

Recognizing DAGs with page-number 2 is NP-complete. - Michael A. Bekos; Giordano Da Lozzo; Fabrizio Frati; Martin Gronemann; Tamara Mchedlidze; Chrysanthi N. Raftopoulou (Theor. Comput. Sci., 2023)

Book embeddings of k-framed graphs and k-map graphs. - Michael A. Bekos; Giordano Da Lozzo; Svenja M. Griesbach; Martin Gronemann; Fabrizio Montecchiani; Chrysanthi N. Raftopoulou (Discret. Math., 2024)