The following pages link to Tamara Mchedlidze (Q290521):
Displaying 50 items.
- Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522) (← links)
- Extending convex partial drawings of graphs (Q334920) (← links)
- Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points'' (Q390169) (← links)
- Aesthetic discrimination of graph layouts (Q1725750) (← links)
- A greedy heuristic for crossing-angle maximization (Q1725762) (← links)
- \(\beta\)-stars or on extending a drawing of a connected subgraph (Q1725776) (← links)
- On upward point set embeddability (Q1947995) (← links)
- Small universal point sets for \(k\)-outerplanar graphs (Q1991093) (← links)
- On mixed linear layouts of series-parallel graphs (Q2087464) (← links)
- Drawing planar graphs with few segments on a polynomial grid (Q2206874) (← links)
- Upward point set embeddings of paths and trees (Q2232250) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- Planar drawings of fixed-mobile bigraphs (Q2330125) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points (Q2391546) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs (Q2864303) (← links)
- Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs (Q2865031) (← links)
- Drawing Planar Graphs with a Prescribed Inner Face (Q2867668) (← links)
- Embedding Four-Directional Paths on Convex Point Sets (Q2936942) (← links)
- Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs (Q2938759) (← links)
- A Universal Point Set for 2-Outerplanar Graphs (Q2959774) (← links)
- Drawing Planar Graphs with Many Collinear Vertices (Q2961512) (← links)
- Monotone Simultaneous Embeddings of Paths in d Dimensions (Q2961545) (← links)
- Upward Geometric Graph Embeddings into Point Sets (Q3073656) (← links)
- Upward Point-Set Embeddability (Q3075525) (← links)
- (Q3132871) (← links)
- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams (Q3188901) (← links)
- Small Point Sets for Simply-Nested Planar Graphs (Q3223945) (← links)
- Monotone Drawings of Graphs with Fixed Embedding (Q3223970) (← links)
- Upward Point Set Embeddability for Convex Point Sets Is in P (Q3223972) (← links)
- Unilateral Orientation of Mixed Graphs (Q3401117) (← links)
- Embedding Four-directional Paths on Convex Point Sets (Q3460400) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- Spine Crossing Minimization in Upward Topological Book Embeddings (Q3611880) (← links)
- Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs (Q3652275) (← links)
- (Q4560223) (← links)
- Aligned Drawings of Planar Graphs (Q4625095) (← links)
- Experimental Evaluation of Book Drawing Algorithms (Q4625114) (← links)
- Drawing planar graphs with many collinear vertices (Q4626290) (← links)
- Universal Point Subsets for Planar Graphs (Q4909559) (← links)
- Point-Set Embeddability of 2-Colored Trees (Q4912211) (← links)
- Aligned Drawings of Planar Graphs (Q4961753) (← links)
- On Mixed Linear Layouts of Series-Parallel Graphs (Q5014112) (← links)
- Graph Drawing Contest Report (Q5014141) (← links)
- Upward planar drawings with two slopes (Q5084713) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Monotone Simultaneous Embeddings of Upward Planar Digraphs (Q5176858) (← links)
- Planar graphs of bounded degree have bounded queue number (Q5212758) (← links)
- Drawing Clustered Planar Graphs on Disk Arrangements (Q5216285) (← links)
