As many readers may know, graph theory is a fundamental branch of mathematics that
explores networks made up of nodes and edges, focusing on their paths, structures, and …

The crossing number is a popular tool in graph drawing and visualization, but there is not
really just one crossing number; there is a large family of crossing number notions of which …

Dealing with relational data always required significant computational resources, domain
expertise and task-dependent feature engineering to incorporate structural information into a …

In this survey/introductory article, we first present the basics of the field of Parameterized
Complexity, made accessible to readers without background on the subject. Afterwards, we …

Graph drawing techniques have been developed in the last few years with the purpose of
producing esthetically pleasing node-link layouts. Recently, the employment of differentiable …

Node-link visualizations are a familiar and powerful tool for displaying the relationships in a
network. The readability of these visualizations highly depends on the spatial layout used for …

The planar graph product structure theorem of Dujmović et al.[J. ACM, 67 (2020), 22] states
that every planar graph is a subgraph of the strong product of a graph with bounded …

A topological drawing of a graph is fan-planar if for each edge $ e $ the edges crossing $ e $
form a star and no endpoint of $ e $ is enclosed by $ e $ and its crossing edges. A fan …

Dujmovic, Joret, Micek, Morin, Ueckerdt and Wood [J. ACM 2020] proved that for every
graph G with Euler genus g there is a graph H with treewidth at most 4 and a path P such …

We study two notions of fan-planarity introduced by (Cheong et al., GD22), called weak and
strong fan-planarity, which separate two non-equivalent definitions of fan-planarity in the …