Optimality program in segment and string graphs

DOI10.1007/978-3-030-00256-5_7MaRDI QIDQ5915588zbMATH OpenOpenAlexFDO

Authors Édouard Bonnet, Paweł Rzążewski

Publication date 22 November 2018

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1712.08907

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimality program in segment and string graphs
• Subexponential algorithms for variants of the homomorphism problem in string graphs
• Fine-grained complexity of coloring unit disks and balls
• Fine-grained complexity of coloring unit disks and balls
• A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs

Cited in

(7)

• On dominating set of some subclasses of string graphs
• Subexponential algorithms for variants of the homomorphism problem in string graphs
• Subexponential algorithms for variants of homomorphism problem in string graphs
• A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
• Fine-grained complexity of coloring unit disks and balls
• A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
• Optimality program in segment and string graphs

This page was built for publication: Optimality program in segment and string graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915588)