Parameterized algorithms for boxicity

DOI10.1007/978-3-642-17517-6_33MaRDI QIDQ3060748zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Abhijin Adiga, Rajesh Chitnis, Saket Saurabh

Publication date 9 December 2010

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17517-6_33

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Polynomial time and parameterized approximation algorithms for boxicity
• Sublinear approximation algorithms for boxicity and related problems
• Geometric Representation of Graphs in Low Dimension

Cited in

(12)

• On structural parameterizations of happy coloring, empire coloring and boxicity
• Sublinear approximation algorithms for boxicity and related problems
• Efficient algorithm for box folding
• Lower bounds for boxicity
• Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
• OPTIMAL DYNAMIC BOX-COUNTING ALGORITHM
• Polynomial time and parameterized approximation algorithms for boxicity
• Efficient Algorithm for Box Folding
• Improved approximation algorithms for box contact representations
• Boxicity and cubicity of a subclass of divisor graphs and power graphs of cyclic groups
• A survey on the boxicity and cubicity of graphs
• Finding vertex-surjective graph homomorphisms

This page was built for publication: Parameterized algorithms for boxicity

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