The parametrized complexity of the segment number

DOI10.1007/978-3-031-49275-4_7MaRDI QIDQ6618253

Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Giordano Da Lozzo, Sabine Cornelsen, Alexander Wolff

Publication date: 14 October 2024

parameterized complexity vertex cover number visual complexity segment number line cover number

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

Improved upper bounds for vertex cover
An application of simultaneous diophantine approximation in combinatorial optimization
On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
Drawing plane triangulations with few segments
Induced subgraphs of graphs with large chromatic number. VI. Banana trees
Drawing planar graphs with few segments on a polynomial grid
Variants of the segment number of a graph
Drawings of planar graphs with few slopes and segments
A Note on Minimum-Segment Drawings of Planar Graphs
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments
Integer Programming with a Fixed Number of Variables
Complexity of Some Geometric and Topological Problems
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
Minkowski's Convex Body Theorem and Integer Programming
Drawing Planar Graphs with Few Geometric Primitives
Experimental Analysis of the Accessibility of Drawings with Few Segments
Drawing Graphs on Few Circles and Few Spheres
Parameterized Algorithms for Queue Layouts
Drawing graphs on few lines and few planes
Parameterized Algorithms for Book Embedding Problems
Geometry Revealed
Drawing Graphs with Few Arcs
The segment number: algorithms and universal lower bounds for some classes of planar graphs
The Complexity of Drawing Graphs on Few Lines and Few Planes

This page was built for publication: The parametrized complexity of the segment number