Pages that link to "Item:Q4895809"
From MaRDI portal
The following pages link to Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs (Q4895809):
Displaying 50 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Complexity and monotonicity results for domination games (Q266262) (← links)
- Approximating the pathwidth of outerplanar graphs (Q293398) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- The complexity of minimum convex coloring (Q415283) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Computing the pathwidth of directed graphs with small vertex cover (Q477674) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Computing the vertex separation of unicyclic graphs (Q596295) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Linear-time algorithms for problems on planar graphs with fixed disk dimension (Q845887) (← links)
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- Online promise problems with online width metrics (Q859981) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- A graph search algorithm for indoor pursuit/evasion (Q970034) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- The parametrized complexity of knot polynomials (Q1877705) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Optimal tree decompositions revisited: a simpler linear-time FPT algorithm (Q2056889) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem (Q2253903) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Non-deterministic graph searching in trees (Q2344776) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
