scientific article; zbMATH DE number 7030527
From MaRDI portal
Publication:4626304
DOI10.20382/jocg.v9i2a4zbMath1417.68227MaRDI QIDQ4626304
Paweł Rzążewski, Dániel Marx, Édouard Bonnet, Csaba Biró, Tillmann Miltzow
Publication date: 27 February 2019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Star colouring of bounded degree graphs and regular graphs ⋮ Computing list homomorphisms in geometric intersection 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
This page was built for publication:
