Computing Upward Topological Book Embeddings of Upward Planar Digraphs. - Francesco Giordano; Giuseppe Liotta; Tamara Mchedlidze; Antonios Symvonis (ISAAC, 2007)

Spine Crossing Minimization in Upward Topological Book Embeddings. - Tamara Mchedlidze; Antonios Symvonis (GD, 2008)

Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings) - Tamara Mchedlidze; Antonios Symvonis (CoRR, 2008)

Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. - Tamara Mchedlidze; Antonios Symvonis (COCOON, 2009)

On rho-Constrained Upward Topological Book Embeddings. - Tamara Mchedlidze; Antonios Symvonis (GD, 2009)

Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. - Tamara Mchedlidze; Antonios Symvonis (ISAAC, 2009)

Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. - Tamara Mchedlidze; Antonios Symvonis (WALCOM, 2009)

Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs - Tamara Mchedlidze; Antonios Symvonis (CoRR, 2009)

Upward Geometric Graph Embeddings into Point Sets. - Patrizio Angelini; Fabrizio Frati; Markus Geyer; Michael Kaufmann 001; Tamara Mchedlidze; Antonios Symvonis (GD, 2010)

Unilateral Orientation of Mixed Graphs. - Tamara Mchedlidze; Antonios Symvonis (SOFSEM, 2010)

Small Point Sets for Simply-Nested Planar Graphs. - Patrizio Angelini; Giuseppe Di Battista; Michael Kaufmann 001; Tamara Mchedlidze; Vincenzo Roselli; Claudio Squarcella (GD, 2011)

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. - Martin Fink 001; Jan-Henrik Haunert; Tamara Mchedlidze; Joachim Spoerhase; Alexander Wolff 001 (GD, 2011)

Upward Point Set Embeddability for Convex Point Sets Is in P. - Michael Kaufmann 001; Tamara Mchedlidze; Antonios Symvonis (GD, 2011)

Upward Point-Set Embeddability. - Markus Geyer; Michael Kaufmann 001; Tamara Mchedlidze; Antonios Symvonis (SOFSEM, 2011)

Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. - Tamara Mchedlidze; Antonios Symvonis (J. Graph Algorithms Appl., 2011)

Point-Set Embeddability of 2-Colored Trees. - Fabrizio Frati; Marc Glisse; William J. Lenhart; Giuseppe Liotta; Tamara Mchedlidze; Rahnuma Islam Nishat (GD, 2012)

Universal Point Subsets for Planar Graphs. - Patrizio Angelini; Carla Binucci; William S. Evans; Ferran Hurtado; Giuseppe Liotta; Tamara Mchedlidze; Henk Meijer; Yoshio Okamoto (ISAAC, 2012)

How many vertex locations can be arbitrarily chosen when drawing planar graphs? - Emilio Di Giacomo; Giuseppe Liotta; Tamara Mchedlidze (CoRR, 2012)

Universal Point Sets for Planar Graph Drawings with Circular Arcs. - Patrizio Angelini; David Eppstein; Fabrizio Frati; Michael Kaufmann 001; Sylvain Lazard; Tamara Mchedlidze; Monique Teillaud; Alexander Wolff 001 (CCCG, 2013)

Drawing Planar Graphs with a Prescribed Inner Face. - Tamara Mchedlidze; Martin Nöllenburg; Ignaz Rutter (GD, 2013)

On upward point set embeddability. - Michael Kaufmann 001; Tamara Mchedlidze; Antonios Symvonis (Comput. Geom., 2013)

Upward planar embedding of an n-vertex oriented path on O(n2) points. - Tamara Mchedlidze (Comput. Geom., 2013)

Monotone Simultaneous Embedding of Directed Paths. - Oswin Aichholzer; Thomas Hackl; Sarah Lutteropp; Tamara Mchedlidze; Alexander Pilz; Birgit Vogtenhuber (CoRR, 2013)

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. - William S. Evans; Michael Kaufmann 001; William J. Lenhart; Giuseppe Liotta; Tamara Mchedlidze; Stephen K. Wismath (CoRR, 2013)

Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams. - Boris Klemz; Tamara Mchedlidze; Martin Nöllenburg (SWAT, 2014)

Reprint of: Upward planar embedding of an n-vertex oriented path on O(n2) points. - Tamara Mchedlidze (Comput. Geom., 2014)

Universal Point Sets for Drawing Planar Graphs with Circular Arcs. - Patrizio Angelini; David Eppstein; Fabrizio Frati; Michael Kaufmann 001; Sylvain Lazard; Tamara Mchedlidze; Monique Teillaud; Alexander Wolff 001 (J. Graph Algorithms Appl., 2014)

Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. - William S. Evans; Michael Kaufmann 001; William J. Lenhart; Tamara Mchedlidze; Stephen K. Wismath (J. Graph Algorithms Appl., 2014)

Operating Power Grids with Few Flow Control Buses. - Thomas Leibfried; Tamara Mchedlidze; Nico Meyer-Hübner; Martin Nöllenburg; Ignaz Rutter; Peter Sanders 001; Dorothea Wagner; Franziska Wegner (e-Energy, 2015)

Towards Realistic Flow Control in Power Grid Operation. - Tamara Mchedlidze; Martin Nöllenburg; Ignaz Rutter; Dorothea Wagner; Franziska Wegner (D-A-CH EI, 2015)

A Universal Point Set for 2-Outerplanar Graphs. - Patrizio Angelini; Till Bruckdorfer; Michael Kaufmann 001; Tamara Mchedlidze (GD, 2015)

Gestalt Principles in Graph Drawing. - Stephen G. Kobourov; Tamara Mchedlidze; Laura Vonessen (GD, 2015)

Monotone Drawings of Graphs with Fixed Embedding. - Patrizio Angelini; Walter Didimo; Stephen G. Kobourov; Tamara Mchedlidze; Vincenzo Roselli; Antonios Symvonis; Stephen K. Wismath (Algorithmica, 2015)

Simultaneous straight-line drawing of a planar graph and its rectangular dual. - Tamara Mchedlidze (CoRR, 2015)

Computing upward topological book embeddings of upward planar digraphs. - Francesco Giordano; Giuseppe Liotta; Tamara Mchedlidze; Antonios Symvonis; Sue Whitesides (J. Discrete Algorithms, 2015)

Monotone Simultaneous Embeddings of Upward Planar Digraphs. - Oswin Aichholzer; Thomas Hackl; Sarah Lutteropp; Tamara Mchedlidze; Alexander Pilz; Birgit Vogtenhuber (J. Graph Algorithms Appl., 2015)

Embedding Four-directional Paths on Convex Point Sets. - Oswin Aichholzer; Thomas Hackl; Sarah Lutteropp; Tamara Mchedlidze; Birgit Vogtenhuber (J. Graph Algorithms Appl., 2015)

Fitting Planar Graphs on Planar Maps. - Md. Jawaherul Alam; Michael Kaufmann 001; Stephen G. Kobourov; Tamara Mchedlidze (J. Graph Algorithms Appl., 2015)

Strongly Monotone Drawings of Planar Graphs. - Stefan Felsner; Alexander Igamberdiev; Philipp Kindermann; Boris Klemz; Tamara Mchedlidze; Manfred Scheucher (SoCG, 2016)

Monotone Simultaneous Embeddings of Paths in d Dimensions. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (GD, 2016)

Extending Convex Partial Drawings of Graphs. - Tamara Mchedlidze; Martin Nöllenburg; Ignaz Rutter (Algorithmica, 2016)

Monotone Simultaneous Embeddings of Paths in R^d. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Sue Whitesides; Stephen K. Wismath (CoRR, 2016)

Lower and upper bounds for long induced paths in 3-connected planar graphs. - Emilio Di Giacomo; Giuseppe Liotta; Tamara Mchedlidze (Theor. Comput. Sci., 2016)

Experimental Evaluation of Book Drawing Algorithms. - Jonathan Klawitter; Tamara Mchedlidze; Martin Nöllenburg (GD, 2017)

A Greedy Heuristic for Crossing-Angle Maximization. - Almut Demel; Dominik Dürrschnabel; Tamara Mchedlidze; Marcel Radermacher; Lasse Wulf (GD, 2018)

beta -Stars or On Extending a Drawing of a Connected Subgraph. - Tamara Mchedlidze; Jérôme Urhausen (GD, 2018)

β-Stars or On Extending a Drawing of a Connected Subgraph. - Tamara Mchedlidze; Jérôme Urhausen (CoRR, 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)

Network Visualization in the Humanities (Dagstuhl Seminar 18482). - Katy Börner; Øyvind Eide; Tamara Mchedlidze; Malte Rehbein; Gerik Scheuermann (Dagstuhl Reports, 2018)

Small Universal Point Sets for k-Outerplanar Graphs. - Patrizio Angelini; Till Bruckdorfer; Giuseppe Di Battista; Michael Kaufmann 001; Tamara Mchedlidze; Vincenzo Roselli; Claudio Squarcella (Discret. Comput. Geom., 2018)

Monotone Simultaneous Paths Embeddings in ℝd. - David Bremner; Olivier Devillers; Marc Glisse; Sylvain Lazard; Giuseppe Liotta; Tamara Mchedlidze; Guillaume Moroz; Sue Whitesides; Stephen K. Wismath (Discret. Math. Theor. Comput. Sci., 2018)

Aligned Drawings of Planar Graphs. - Tamara Mchedlidze; Marcel Radermacher; Ignaz Rutter (J. Graph Algorithms Appl., 2018)

Drawing planar graphs with many collinear vertices. - Giordano Da Lozzo; Vida Dujmovic; Fabrizio Frati; Tamara Mchedlidze; Vincenzo Roselli (J. Comput. Geom., 2018)

Upward Book Embeddings of st-Graphs. - Carla Binucci; Giordano Da Lozzo; Emilio Di Giacomo; Walter Didimo; Tamara Mchedlidze; Maurizio Patrignani (SoCG, 2019)

Graph Drawing Contest Report. - Philipp Kindermann; Tamara Mchedlidze; Ignaz Rutter (GD, 2019)

Drawing Planar Graphs with Few Segments on a Polynomial Grid. - Philipp Kindermann; Tamara Mchedlidze; Thomas Schneck; Antonios Symvonis (GD, 2019)

Drawing Clustered Graphs on Disk Arrangements. - Tamara Mchedlidze; Marcel Radermacher; Ignaz Rutter; Nina Zimbel (WALCOM, 2019)

Applying argumentation to structure and visualize multi-dimensional opinion spaces. - Gregor Betz; Michael Hamann; Tamara Mchedlidze; Sophie von Schmettow (Argument Comput., 2019)

Aesthetic Discrimination of Graph Layouts. - Tamara Mchedlidze; Alexey Pak; Moritz Klammler (J. Graph Algorithms Appl., 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)

Greedy rectilinear drawings. - Patrizio Angelini; Michael A. Bekos; Walter Didimo; Luca Grilli 001; Philipp Kindermann; Tamara Mchedlidze; Roman Prutkin; Antonios Symvonis; Alessandra Tappini (Theor. Comput. Sci., 2019)

Planar drawings of fixed-mobile bigraphs. - Michael A. Bekos; Felice De Luca; Walter Didimo; Tamara Mchedlidze; Martin Nöllenburg; Antonios Symvonis; Ioannis G. Tollis (Theor. Comput. Sci., 2019)

Graph Drawing Contest Report. - Philipp Kindermann; Tamara Mchedlidze; Wouter Meulemans; Ignaz Rutter (GD, 2020)

Upward Point Set Embeddings of Paths and Trees. - Elena Arseneva; Pilar Cano; Linda Kleist; Tamara Mchedlidze; Saeed Mehrabi 004; Irene Parada; Pavel Valtr 001 (CoRR, 2020)

Drawing Clustered Planar Graphs on Disk Arrangements. - Tamara Mchedlidze; Marcel Radermacher; Ignaz Rutter; Nina Zimbel (J. Graph Algorithms Appl., 2020)

Graph Drawing Contest Report. - Philipp Kindermann; Tamara Mchedlidze; Wouter Meulemans (GD, 2021)

Using the Metro-Map Metaphor for Drawing Hypergraphs. - Fabian Frank; Michael Kaufmann 001; Stephen G. Kobourov; Tamara Mchedlidze; Sergey Pupyrev; Torsten Ueckerdt; Alexander Wolff 001 (SOFSEM, 2021)

Upward Point Set Embeddings of Paths and Trees. - Elena Arseneva; Pilar Cano; Linda Kleist; Tamara Mchedlidze; Saeed Mehrabi 001; Irene Parada; Pavel Valtr 001 (WALCOM, 2021)

ClusterSets: Optimizing Planar Clusters in Categorical Point Data. - Jakob Geiger; Sabine Cornelsen; Jan-Henrik Haunert; Philipp Kindermann; Tamara Mchedlidze; Martin Nöllenburg; Yoshio Okamoto; Alexander Wolff 001 (Comput. Graph. Forum, 2021)

Graph Drawing Contest Report. - Philipp Kindermann; Fabian Klute; Tamara Mchedlidze; Wouter Meulemans (GD, 2022)

Metaphoric Maps for Dynamic Vertex-weighted Graphs. - Tamara Mchedlidze; Christian Schnorr (EuroVis (Short Papers), 2022)

Level-Planar Drawings with Few Slopes. - Guido Brückner; Nadine Davina Krisam; Tamara Mchedlidze (Algorithmica, 2022)

Can an NN model plainly learn planar layouts? - Simon van Wageningen; Tamara Mchedlidze (CoRR, 2022)

Upward planar drawings with two slopes. - Jonathan Klawitter; Tamara Mchedlidze (J. Graph Algorithms Appl., 2022)

On mixed linear layouts of series-parallel graphs. - Patrizio Angelini; Michael A. Bekos; Philipp Kindermann; Tamara Mchedlidze (Theor. Comput. Sci., 2022)

Viewpoint-Based Quality for Analyzing and Exploring 3D Multidimensional Projections. - Wouter Castelein; Zonglin Tian; Tamara Mchedlidze; Alexandru C. Telea (VISIGRAPP (3: IVAPP), 2023)

Identifying Cluttering Edges in Near-Planar Graphs. - Simon van Wageningen; Tamara Mchedlidze; Alexandru C. Telea (EuroVis (Short Papers), 2023)

Editorial. - Tamara Mchedlidze; Elena Arseneva (Comput. Geom., 2023)

Heuristic Algorithms for the Approximation of Mutual Coherence. - Gregor Betz; Vera Chekan; Tamara Mchedlidze (CoRR, 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)

Upward Book Embeddability of st-Graphs: Complexity and Algorithms. - Carla Binucci; Giordano Da Lozzo; Emilio Di Giacomo; Walter Didimo; Tamara Mchedlidze; Maurizio Patrignani (Algorithmica, 2023)

On 1-Bend Upward Point-Set Embeddings of st-Digraphs. - Emilio Di Giacomo; Henry Förster; Daria Kokhovich; Tamara Mchedlidze; Fabrizio Montecchiani; Antonios Symvonis; Anaïs Villedieu (LATIN (1), 2024)

An Experimental Evaluation of Viewpoint-Based 3D Graph Drawing. - Simon van Wageningen; Tamara Mchedlidze; Alexandru C. Telea (Comput. Graph. Forum, 2024)

Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4. - Maarten Löffler; Tamara Mchedlidze; David Orden; Josef Tkadlec; Jules Wulms (CoRR, 2024)

Removing Popular Faces in Curve Arrangements. - Phoebe de Nooijer; Soeren Terziadis; Alexandra Weinberger; Zuzana Masárová; Tamara Mchedlidze; Maarten Löffler; Günter Rote (J. Graph Algorithms Appl., 2024)

Viewpoint Optimization for 3D Graph Drawings. - Simon van Wageningen; Tamara Mchedlidze; Alexandru C. Telea (Comput. Graph. Forum, 2025)