73 citations · 178 across the 49 of their papers we have counts for
5 papers · 1 filter
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
An ordered graph is a graph whose vertex set is a subset of integers. The edges are interpreted as tuples with . For a positive integer , a matrix $M \in \mat…
Local and Union Boxicity
Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt
The boxicity of a graph is the smallest integer such that is the intersection of interval graphs, or equivalently, that is the intersect…
The -strong induced arboricity of a graph
Maria Axenovich, Daniel Goncalves, Jonathan Rollin +1
The induced arboricity of a graph is the smallest number of induced forests covering the edges of . This is a well-defined parameter bounded from above by the number of edge…
Chromatic number of ordered graphs with forbidden ordered subgraphs
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
It is well-known that the graphs not containing a given graph H as a subgraph have bounded chromatic number if and only if H is acyclic. Here we consider ordered graphs, i.e., grap…
Convex-Arc Drawings of Pseudolines
David Eppstein, Mereke van Garderen, Bettina Speckmann +1
A weak pseudoline arrangement is a topological generalization of a line arrangement, consisting of curves topologically equivalent to lines that cross each other at most once. We c…