Geodesic

Volume 22 (2018) no. 1

Sommaire

Guest Editors' Foreword and Overview
p. 1-10
On the size of planarly connected crossing graphs
p. 11-22
Parameterized Complexity of 1-Planarity
p. 23-49
A First Order Logic Definition of Beyond-Planar Graphs
p. 51-66
On the Maximum Crossing Number
p. 67-87
Stack and Queue Layouts via Layered Separators
p. 89-99
On the NP-hardness of GRacSim drawing and k-SEFE Problems
p. 101-116
Saturated simple and 2-simple topological graphs with few edges
p. 117-138