The following pages link to Michael A. Bekos (Q300465):
Displaying 50 items.
- Two-page book embeddings of 4-planar graphs (Q300468) (← links)
- (Q473204) (redirect page) (← links)
- A note on maximum differential coloring of planar graphs (Q473207) (← links)
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- Boundary labeling: Models and efficient algorithms for rectangular maps (Q868108) (← links)
- Boundary labeling with octilinear leaders (Q970611) (← links)
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs (Q1687902) (← links)
- 1-fan-bundle-planar drawings of graphs (Q1708027) (← links)
- On mixed linear layouts of series-parallel graphs (Q2087464) (← links)
- Bitonic st-orderings for upward planar graphs: the variable embedding setting (Q2110637) (← links)
- On the queue number of planar graphs (Q2151450) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- Grid drawings of graphs with constant edge-vertex resolution (Q2230412) (← links)
- Geometric representations of dichotomous ordinal data (Q2301543) (← links)
- Planar drawings of fixed-mobile bigraphs (Q2330125) (← links)
- On RAC drawings of 1-planar graphs (Q2402260) (← links)
- The maximum \(k\)-differential coloring problem (Q2407949) (← links)
- On the recognition of fan-planar and maximal outer-fan-planar graphs (Q2408919) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- On morphing 1-planar drawings (Q2672443) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- An improved upper bound on the queue number of planar graphs (Q2684487) (← links)
- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends (Q2790160) (← links)
- On the Total Number of Bends for Planar Octilinear Drawings (Q2802935) (← links)
- Vertex-Coloring with Star-Defects (Q2803807) (← links)
- Smooth Orthogonal Layouts (Q2856479) (← links)
- Slanted Orthogonal Drawings (Q2867679) (← links)
- Geometric RAC Simultaneous Drawings of Graphs (Q2914333) (← links)
- Improved Approximation Algorithms for Box Contact Representations (Q2921396) (← links)
- On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs (Q2936926) (← links)
- Slanted Orthogonal Drawings: Model, Algorithms and Evaluations (Q2938746) (← links)
- The Book Embedding Problem from a SAT-Solving Perspective (Q2959749) (← links)
- Low Ply Drawings of Trees (Q2961519) (← links)
- On the Density of Non-simple 3-Planar Graphs (Q2961527) (← links)
- Two-Page Book Embeddings of 4-Planar Graphs (Q2965479) (← links)
- On a Conjecture of Lov\'asz on Circle-Representations of Simple 4-Regular Planar Graphs (Q2970413) (← links)
- Vertex-Coloring with Defects (Q2971395) (← links)
- Maximizing the Total Resolution of Graphs (Q3073659) (← links)
- The Straight-Line RAC Drawing Problem Is NP-Hard (Q3075508) (← links)
- Combining Traditional Map Labeling with Boundary Labeling (Q3075509) (← links)
- The Straight-Line RAC Drawing Problem is NP-Hard (Q3143754) (← links)
- Combining Problems on RAC Drawings and Simultaneous Graph Drawings (Q3223975) (← links)
- On Metro-Line Crossing Minimization (Q3402375) (← links)
- Boundary Labeling with Octilinear Leaders (Q3512462) (← links)
- Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem (Q3611868) (← links)
- A universal slope set for 1-bend planar drawings (Q4580081) (← links)
- On Optimal 2- and 3-Planar Graphs (Q4580088) (← links)
- Geometric RAC Simultaneous Drawings of Graphs (Q4899121) (← links)
- Circle-Representations of Simple 4-Regular Planar Graphs (Q4912197) (← links)
