Pages that link to "Item:Q1578412"
From MaRDI portal
The following pages link to Diameter and treewidth in minor-closed graph families (Q1578412):
Displaying 50 items.
- Roman domination in subgraphs of grids (Q324726) (← links)
- Minors and dimension (Q345115) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures (Q443712) (← links)
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Improved approximation algorithms for projection games (Q513283) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- High-dimensional structure estimation in Ising models: local separation criterion (Q693728) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- How to catch marathon cheaters: new approximation algorithms for tracking paths (Q832889) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Homomorphism preservation on quasi-wide classes (Q980940) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Obstructions to a small hyperbolicity in Helly graphs (Q1625787) (← links)
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph (Q1696548) (← links)
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- An existential locality theorem (Q1887659) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
- Complexity of edge monitoring on some graph classes (Q2172388) (← links)
- On fractional fragility rates of graph classes (Q2205120) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Tree-width and dimension (Q2400108) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- On the dimension of posets with cover graphs of treewidth 2 (Q2407679) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- Parameterized complexity of firefighting (Q2453548) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
