The following pages link to (Q5463359):
Displaying 27 items.
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- A new graph construction of unbounded clique-width (Q509276) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs (Q868392) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Linear-time algorithms for counting independent sets in bipartite permutation graphs (Q1675914) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Split permutation graphs (Q2014716) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width (Q2121810) (← links)
- Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← links)
- Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← links)
- Infinitely many minimal classes of graphs of unbounded clique-width (Q2413975) (← links)
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (Q3007673) (← links)
- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
