The simultaneous interval number: a new width parameter that measures the similarity to interval graphs
From MaRDI portal
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A New Algorithm for Generating All the Maximal Independent Sets
- A partial k-arboretum of graphs with bounded treewidth
- A single-exponential time 2-approximation algorithm for treewidth
- A unified approach to domination problems on interval graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- An Optimal Solution for the Channel-Assignment Problem
- Approximating clique-width and branch-width
- Clustering and domination in perfect graphs
- Computing tree decompositions with small independence number
- Dominating sets for split and bipartite graphs
- Dominating Sets in Chordal Graphs
- Extremal Values of the Interval Number of a Graph
- Finding Hamiltonian circuits in interval graphs
- Graph classes with structured neighborhoods and algorithmic applications
- scientific article; zbMATH DE number 1185295 (Why is no real title available?)
- Incidence matrices and interval graphs
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
- Lower bounds based on the exponential time hypothesis
- Mim-width. I. Induced path problems
- Mim-width. III. Graph powers and generalized distance domination problems
- Minor-matching hypertree width
- NP-completeness of some edge-disjoint paths problems
- On \(d\)-stable locally checkable problems parameterized by mim-width
- On \(H\)-topological intersection graphs
- On a clique covering problem of Orlin
- On the clique-width of some perfect graph classes
- On the complexity of k-SAT
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of some optimization problems related to multiple-interval graphs
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- On the thinness and proper thinness of a graph
- On the tractability of optimization problems on \(H\)-graphs
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
- Parameterized algorithms
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
- Recognizing d-interval graphs and d-track interval graphs
- Simultaneous interval graphs
- Simultaneous PQ-ordering with applications to constrained embedding problems
- Simultaneous representation of proper and unit interval graphs
- The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
- The Complexity of Coloring Circular Arcs and Chords
- The maximum clique problem in multiple interval graphs
- The simultaneous interval number: a new width parameter that measures the similarity to interval graphs
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
- The simultaneous representation problem for chordal, comparability and permutation graphs
- The stable set problem and the thinness of a graph
- Thinness of product graphs
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- Treewidth versus clique number. II: Tree-independence number
- Twin-width. I: Tractable FO model checking
Cited in
(1)
This page was built for publication: The simultaneous interval number: a new width parameter that measures the similarity to interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891150)
