Hybrid visualizations combine different metaphors into a single network layout, in order to
help humans in finding the “right way” of displaying the different portions of the network …

Upward planarity testing and Rectilinear planarity testing are central problems in graph
drawing. It is known that they are both NP-complete, but XP when parameterized by …

We study the complexity of testing whether a biconnected graph G=(V, E) is planar with the
constraint that some cyclic orders of the edges incident to its vertices are allowed while …

Over the past few decades, a large body of works studied the (in) tractability of various
computational problems on grid graphs, which often yield substantially faster algorithms …

Over the past decade, we witness an increasing amount of interest in the design of exact
exponential-time and parameterized algorithms for problems in Graph Drawing …

Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout,
cable plans, and metro maps. We focus on drawing planar graphs and assume that we are …