
On Morphing 1Planar Drawings
Computing a morph between two drawings of a graph is a classical problem...
read it

On Mixed Linear Layouts of SeriesParallel Graphs
A mixed sstack qqueue layout of a graph consists of a linear order of ...
read it

Lazy Queue Layouts of Posets
We investigate the queue number of posets in terms of their width, that ...
read it

On TurnRegular Orthogonal Representations
An interesting class of orthogonal representations consists of the soca...
read it

Grid Drawings of Graphs with Constant EdgeVertex Resolution
We study the algorithmic problem of computing drawings of graphs in whic...
read it

Four Pages Are Indeed Necessary for Planar Graphs
An embedding of a graph in a book consists of a linear order of its vert...
read it

An Online Framework to Interact and Efficiently Compute Linear Layouts of Graphs
We present a prototype online system to automate the procedure of comput...
read it

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages
An embedding of a graph in a book, called book embedding, consists of a ...
read it

Coloring outerplanar graphs and planar 3trees with small monochromatic components
In this work, we continue the study of vertex colorings of graphs, in wh...
read it

On a Conjecture of Lovász on CircleRepresentations of Simple 4Regular Planar Graphs
Lovász conjectured that every connected 4regular planar graph G admits ...
read it

Simple kPlanar Graphs are Simple (k+1)Quasiplanar
A simple topological graph is kquasiplanar (k≥ 2) if it contains no k p...
read it

Efficient Generation of Different Topological Representations of Graphs BeyondPlanarity
Beyondplanarity focuses on combinatorial properties of classes of nonp...
read it

External Labeling Techniques: A Taxonomy and Survey
External labeling is frequently used for annotating features in graphica...
read it

Planar Graphs of Bounded Degree have Constant Queue Number
A queue layout of a graph consists of a linear order of its vertices and...
read it

Queue Layouts of Planar 3Trees
A queue layout of a graph G consists of a linear order of the vertices o...
read it

A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution
The crossing resolution of a nonplanar drawing of a graph is the value ...
read it

On RAC Drawings of Graphs with one Bend per Edge
A kbend rightanglecrossing drawing or (kbend RAC drawing, for short)...
read it

Greedy Rectilinear Drawings
A drawing of a graph is greedy if for each ordered pair of vertices u an...
read it

On Dispersable Book Embeddings
In a dispersable book embedding, the vertices of a given graph G must be...
read it

Universal Slope Sets for Upward Planar Drawings
We prove that every set S of Δ slopes containing the horizontal slope i...
read it

BeyondPlanarity: Density Results for Bipartite Graphs
Beyondplanarity focuses on the study of geometric and topological graph...
read it

3D Visibility Representations of 1planar Graphs
We prove that every 1planar graph G has a zparallel visibility represe...
read it
Michael A. Bekos
is this you? claim profile