Tamara Mchedlidze

According to our database1, Tamara Mchedlidze authored at least 75 papers between 2007 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Upward planar drawings with two slopes.
J. Graph Algorithms Appl., 2022

Can an NN model plainly learn planar layouts?
CoRR, 2022

Recognizing DAGs with Page-Number 2 is NP-complete.
CoRR, 2022

Removing Popular Faces in Curve Arrangements.
CoRR, 2022

Level-Planar Drawings with Few Slopes.
Algorithmica, 2022

2021
ClusterSets: Optimizing Planar Clusters in Categorical Point Data.
Comput. Graph. Forum, 2021

Upward Point Set Embeddings of Paths and Trees.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Using the Metro-Map Metaphor for Drawing Hypergraphs.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization, 2021

2020
Drawing Clustered Planar Graphs on Disk Arrangements.
J. Graph Algorithms Appl., 2020

Upward Point Set Embeddings of Paths and Trees.
CoRR, 2020

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

On Mixed Linear Layouts of Series-Parallel Graphs.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019
Planar drawings of fixed-mobile bigraphs.
Theor. Comput. Sci., 2019

Greedy rectilinear drawings.
Theor. Comput. Sci., 2019

Planar Graphs of Bounded Degree Have Bounded Queue Number.
SIAM J. Comput., 2019

Aesthetic Discrimination of Graph Layouts.
J. Graph Algorithms Appl., 2019

Applying argumentation to structure and visualize multi-dimensional opinion spaces.
Argument Comput., 2019

Drawing Clustered Graphs on Disk Arrangements.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Drawing Planar Graphs with Few Segments on a Polynomial Grid.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Graph Drawing Contest Report.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Upward Book Embeddings of st-Graphs.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Drawing planar graphs with many collinear vertices.
J. Comput. Geom., 2018

Aligned Drawings of Planar Graphs.
J. Graph Algorithms Appl., 2018

Monotone Simultaneous Paths Embeddings in ℝ<sup>d</sup>.
Discret. Math. Theor. Comput. Sci., 2018

Small Universal Point Sets for k-Outerplanar Graphs.
Discret. Comput. Geom., 2018

Network Visualization in the Humanities (Dagstuhl Seminar 18482).
Dagstuhl Reports, 2018

Planar Graphs of Bounded Degree have Constant Queue Number.
CoRR, 2018

β-Stars or On Extending a Drawing of a Connected Subgraph.
CoRR, 2018

\beta -Stars or On Extending a Drawing of a Connected Subgraph.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

A Greedy Heuristic for Crossing-Angle Maximization.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017
Experimental Evaluation of Book Drawing Algorithms.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
Lower and upper bounds for long induced paths in 3-connected planar graphs.
Theor. Comput. Sci., 2016

Monotone Simultaneous Embeddings of Paths in R^d.
CoRR, 2016

Extending Convex Partial Drawings of Graphs.
Algorithmica, 2016

Monotone Simultaneous Embeddings of Paths in d Dimensions.
Proceedings of the Graph Drawing and Network Visualization, 2016

Strongly Monotone Drawings of Planar Graphs.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Fitting Planar Graphs on Planar Maps.
J. Graph Algorithms Appl., 2015

Embedding Four-directional Paths on Convex Point Sets.
J. Graph Algorithms Appl., 2015

Monotone Simultaneous Embeddings of Upward Planar Digraphs.
J. Graph Algorithms Appl., 2015

Computing upward topological book embeddings of upward planar digraphs.
J. Discrete Algorithms, 2015

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

Monotone Drawings of Graphs with Fixed Embedding.
Algorithmica, 2015

Gestalt Principles in Graph Drawing.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

A Universal Point Set for 2-Outerplanar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Towards Realistic Flow Control in Power Grid Operation.
Proceedings of the Energy Informatics, 2015

Operating Power Grids with Few Flow Control Buses.
Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems, 2015

2014
Bar 1-Visibility Graphs vs. other Nearly Planar Graphs.
J. Graph Algorithms Appl., 2014

Universal Point Sets for Drawing Planar Graphs with Circular Arcs.
J. Graph Algorithms Appl., 2014

Reprint of: Upward planar embedding of an n-vertex oriented path on O(n<sup>2</sup>) points.
Comput. Geom., 2014

Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

2013
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs.
CoRR, 2013

Monotone Simultaneous Embedding of Directed Paths.
CoRR, 2013

Upward planar embedding of an n-vertex oriented path on O(n<sup>2</sup>) points.
Comput. Geom., 2013

On upward point set embeddability.
Comput. Geom., 2013

Drawing Planar Graphs with a Prescribed Inner Face.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Universal Point Sets for Planar Graph Drawings with Circular Arcs.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
How many vertex locations can be arbitrarily chosen when drawing planar graphs?
CoRR, 2012

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Universal Point Subsets for Planar Graphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Point-Set Embeddability of 2-Colored Trees.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs.
J. Graph Algorithms Appl., 2011

Upward Point-Set Embeddability.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Upward Point Set Embeddability for Convex Point Sets Is in P.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Small Point Sets for Simply-Nested Planar Graphs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010
Unilateral Orientation of Mixed Graphs.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Upward Geometric Graph Embeddings into Point Sets.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

2009
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
CoRR, 2009

Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Crossing-Free Acyclic Hamiltonian Path Completion for Planar <i>st</i>-Digraphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

On <i>rho</i>-Constrained Upward Topological Book Embeddings.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Crossing-Optimal Acyclic HP-Completion for Outerplanar <i>st</i>-Digraphs.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

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

Spine Crossing Minimization in Upward Topological Book Embeddings.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

2007
Computing Upward Topological Book Embeddings of Upward Planar Digraphs.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007


  Loading...