The following pages link to Michael A. Bekos (Q300465):
Displaying 45 items.
- Smooth Orthogonal Layouts (Q4912198) (← links)
- $$\textit{\textbf{k}}$$-Planar Graphs (Q5001659) (← links)
- Fan-Planar Graphs (Q5001660) (← links)
- On Mixed Linear Layouts of Series-Parallel Graphs (Q5014112) (← links)
- On Turn-Regular Orthogonal Representations (Q5014121) (← links)
- On Turn-Regular Orthogonal Representations (Q5049999) (← links)
- Four pages are indeed necessary for planar graphs (Q5120157) (← links)
- The Maximum k-Differential Coloring Problem (Q5175098) (← links)
- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends (Q5176586) (← links)
- Planar graphs of bounded degree have bounded queue number (Q5212758) (← links)
- Planar Graphs of Bounded Degree Have Bounded Queue Number (Q5235482) (← links)
- On the Total Number of Bends for Planar Octilinear Drawings (Q5278054) (← links)
- Algorithms and Insights for RaceTrack (Q5282804) (← links)
- Efficient Labeling of Collinear Sites (Q5301442) (← links)
- Multi-stack Boundary Labeling Problems (Q5385975) (← links)
- Smooth Orthogonal Drawings of Planar Graphs (Q5405035) (← links)
- Line Crossing Minimization on Metro Maps (Q5452227) (← links)
- Graph Drawing (Q5711637) (← links)
- Many-to-One Boundary Labeling with Backbones (Q5891360) (← links)
- Planar Octilinear Drawings with One Bend Per Edge (Q5892030) (← links)
- Planar Octilinear Drawings with One Bend Per Edge (Q5899627) (← links)
- Many-to-One Boundary Labeling with Backbones (Q5899631) (← links)
- Edge partitions of optimal 2-plane and 3-plane graphs (Q5915586) (← links)
- Hierarchical partial planarity (Q5915789) (← links)
- Universal slope sets for upward planar drawings (Q5915938) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Edge partitions of optimal 2-plane and 3-plane graphs (Q5915955) (← links)
- Universal slope sets for upward planar drawings (Q5918782) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario (Q6053469) (← links)
- Book embeddings of nonplanar graphs with small faces in few pages (Q6059964) (← links)
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs (Q6080147) (← links)
- (Q6104072) (← links)
- Strictly-convex drawings of 3-connected planar graphs (Q6117042) (← links)
- Recognizing map graphs of bounded treewidth (Q6182682) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q6199406) (← links)
- Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity (Q6323379) (← links)
- The Mixed Page Number of Graphs (Q6372498) (← links)
- Recognizing map graphs of bounded treewidth (Q6544066) (← links)
- RAC drawings of graphs with low degree (Q6584002) (← links)
- Graph product structure for \(h\)-framed graphs (Q6602440) (← links)
- Strictly-convex drawings of 3-connected planar graphs (Q6621709) (← links)
- Axis-parallel right angle crossing graphs (Q6656947) (← links)
- Graph product structure for \(h\)-framed graphs (Q6671588) (← links)
- On $k$-planar Graphs without Short Cycles (Q6742156) (← links)
