Chrysanthi N. Raftopoulou

According to our database, Chrysanthi N. Raftopoulou authored at least 35 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Book embeddings of <i>k</i>-framed graphs and <i>k</i>-map graphs.

Michael A. Bekos, Giordano Da Lozzo, Svenja M. Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou

Discret. Math., January, 2024

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., February, 2023

An Improved Upper Bound on the Queue Number of Planar Graphs.

Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou

Algorithmica, February, 2023

Linear Layouts of Bipartite Planar Graphs.

Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022

Testing Upward Planarity of Partial 2-Trees.

Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Parameterized Algorithms for Upward Planarity.

Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

The Stub Resolution of 1-planar Graphs.

Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr

J. Graph Algorithms Appl., 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

Recognizing and Embedding Simple Optimal 2-Planar Graphs.

Henry Förster, Michael Kaufmann, Chrysanthi N. Raftopoulou

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

On the Queue Number of Planar Graphs.

Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020

Four Pages Are Indeed Necessary for Planar Graphs.

Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi N. Raftopoulou, Torsten Ueckerdt

J. Comput. Geom., 2020

On Layered Fan-Planar Graph Drawings.

Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou

CoRR, 2020

Layered Fan-Planar Graph Drawings.

Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

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

Proceedings of the 36th International Symposium on Computational Geometry, 2020

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

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

Coloring outerplanar graphs and planar 3-trees with small monochromatic components.

Michael A. Bekos, Carla Binucci, Michael Kaufmann, Chrysanthi N. Raftopoulou, Antonios Symvonis, Alessandra Tappini

CoRR, 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

Proceedings of the Extended Abstracts of the 2019 CHI Conference on Human Factors in Computing Systems, 2019

Interactive and Personalized Activity eBooks for Learning to Read: The iRead Case.

Nick Deligiannis, Dionysis Panagiotopoulos, Panagiotis Patsilinakos, Chrysanthi N. Raftopoulou, Antonios Symvonis

Proceedings of the First Workshop on Intelligent Textbooks co-located with 20th International Conference on Artificial Intelligence in Education (AIED 2019), 2019

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

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.

Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Bounded Stub Resolution for Some Maximal 1-Planar Graphs.

Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Vertex-Coloring with Defects.

Patrizio Angelini, Michael A. Bekos, Felice De Luca, Walter Didimo, Michael Kaufmann, Stephen G. Kobourov, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Vincenzo Roselli, Antonios Symvonis

J. Graph Algorithms Appl., 2017

The Book Thickness of 1-Planar Graphs is Constant.

Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou

Algorithmica, 2017

On Optimal 2- and 3-Planar Graphs.

Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Χρωματισμοί, εμφυτεύσεις και συναφή γραφοθεωρητικά προβλήματα

Chrysanthi N. Raftopoulou

PhD thesis, 2016

On the Density of 3-Planar Graphs.

Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou

CoRR, 2016

Two-Page Book Embeddings of 4-Planar Graphs.

Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou

Algorithmica, 2016

AVDTC of generalized 3-Halin graphs.

Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou

Proceedings of the 7th International Conference on Information, 2016

On the Density of Non-simple 3-Planar Graphs.

Michael A. Bekos, Michael Kaufmann, Chrysanthi N. Raftopoulou

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

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

1-Planar Graphs have Constant Book Thickness.

Michael A. Bekos, Till Bruckdorfer, Michael Kaufmann, Chrysanthi N. Raftopoulou

Proceedings of the Algorithms - ESA 2015, 2015

2014

On the AVDTC of 4-regular graphs.

A. Papaioannou, Chrysanthi N. Raftopoulou

Discret. Math., 2014

Perfect smooth orthogonal drawings.

Michael A. Bekos, Martin Gronemann, Sergey Pupyrev, Chrysanthi N. Raftopoulou

Proceedings of the 5th International Conference on Information, 2014

2012

Circle-Representations of Simple 4-Regular Planar Graphs.

Michael A. Bekos, Chrysanthi N. Raftopoulou

Proceedings of the Graph Drawing - 20th International Symposium, 2012