Parameterized Algorithms for Boxicity

2010/01/01 by Abhijin Adiga, Rajesh Chitnis, Saket Saurabh · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Computer science #Graph Labeling and Dimension Problems #Interconnection Networks and Systems #Mathematics #Parameterized complexity

paper · doi:10.1007/978-3-642-17517-6_33

crossref issued 2010/01/01 · crossref published 2010/01/01 · crossref published-print 2010/01/01 · openalex publication_date 2010/01/01 · crossref created 2010/12/03 · crossref deposited 2019/03/22 · openalex created_date 2025/10/10 · crossref indexed 2025/12/24 · openalex updated_date 2026/08/04

Citations

• Invitation to Fixed-Parameter Algorithms
• Parameterized Complexity Theory
• Interval representations of planar graphs
• Parameterized Complexity and Approximation Algorithms
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Boxicity and treewidth
• The Complexity of the Partial Order Dimension Problem
• A special planar satisfiability problem and a consequence of its NP-completeness
• Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
• Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes
• Dynamo
• Building a database on S3

Cited by

• Boxicity [wikipedia]