The following pages link to Directed tree-width (Q1850539):
Displayed 50 items.
- On the complexity of the FIFO stack-up problem (Q261535) (← links)
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- On the monotonicity of process number (Q299059) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Jumping robbers in digraphs (Q343927) (← links)
- DAG-width is PSPACE-complete (Q343929) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- Finding a subdivision of a digraph (Q476873) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- A cops and robber game in multidimensional grids (Q602750) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- Directed width parameters and circumference of digraphs (Q730003) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- Directed elimination games (Q896668) (← links)
- Directed NLC-width (Q906393) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Monotonicity in digraph search problems (Q955030) (← links)
- On complexity of minimum leaf out-branching problem (Q967352) (← links)
- Recognizing digraphs of Kelly-width 2 (Q972333) (← links)
- Standard directed search strategies and their applications (Q1029267) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs (Q1929213) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- Digraphs of directed treewidth one (Q2005715) (← links)
- A trichotomy for regular simple path queries on graphs (Q2009646) (← links)
- The treewidth of proofs (Q2013559) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)