Many real-world networks are globally sparse but locally dense. Typical examples are social
networks, biological networks, and information networks. This double structural nature …

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 …

Many real-world networks are globally sparse but locally dense. Typical examples are social
networks, biological networks, and information networks. This double structural nature …

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 …

We study the complexity of testing whether a biconnected graph is planar with the additional
constraint that some cyclic orders of the edges incident to its vertices are allowed while …

We introduce and study a constrained planarity testing problem, called 1-Fixed Constrained
Planarity, and prove that this problem can be solved in quadratic time for biconnected …

Hybrid visualizations mix different metaphors in a single layout of a network. In particular, the
popular NodeTrix model, introduced by Henry, Fekete, and McGuffin in 2007, combines …

This paper introduces and studies the following beyond-planarity problem, which we call h-
Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned …

Hierarchical embedding constraints define a set of allowed cyclic orders for the edges
incident to the vertices of a graph. These constraints are expressed in terms of FPQ-trees …