Pages that link to "Item:Q1974445"
From MaRDI portal
The following pages link to Linear time solvable optimization problems on graphs of bounded clique-width (Q1974445):
Displaying 50 items.
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- Well-quasi-ordering versus clique-width (Q1745730) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Fly-automata for checking \(\mathrm{MSO}_2\) graph properties (Q1752502) (← links)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- On \textsf{NC} algorithms for problems on bounded rank-width graphs (Q1799577) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Constrained-path labellings on graphs of bounded clique-width (Q1959385) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Computing a metric basis of a bipartite distance-hereditary graph (Q2062127) (← links)
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
- The factorisation forest theorem (Q2074219) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Restrained condition on double Roman dominating functions (Q2096308) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width (Q2121810) (← links)
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs (Q2124227) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← links)
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- Total Roman \(\{2\}\)-dominating functions in graphs (Q2151223) (← links)
- A general framework for path convexities (Q2156285) (← links)
- On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring (Q2173433) (← links)
- Parameterized complexity of fair deletion problems (Q2174554) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
