Publication:4626304
From MaRDI portal
DOI10.20382/jocg.v9i2a4zbMath1417.68227MaRDI QIDQ4626304
Paweł Rzążewski, Dániel Marx, Édouard Bonnet, Csaba Biró, Tillmann Miltzow
Publication date: 27 February 2019
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C15: Coloring of graphs and hypergraphs
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Computing list homomorphisms in geometric intersection graphs, Star colouring of bounded degree graphs and regular graphs, Subexponential algorithms for variants of the homomorphism problem in string graphs, A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
