Pages that link to "Item:Q2931403"
From MaRDI portal
The following pages link to Linear time low tree-width partitions and algorithmic consequences (Q2931403):
Displaying 36 items.
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Forbidden graphs for tree-depth (Q412288) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Colouring edges with many colours in cycles (Q462927) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- How many \(F\)'s are there in \(G\)? (Q648970) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Small graph classes and bounded expansion (Q965245) (← links)
- Fraternal augmentations, arrangeability and linear Ramsey numbers (Q1039442) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Colouring graphs with bounded generalized colouring number (Q1045038) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- Forbidden lifts (NP and CSP for combinatorialists) (Q2427542) (← links)
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities (Q2427548) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- Distance-two coloring of sparse graphs (Q2441647) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Obstructions for tree-depth (Q2851471) (← links)
- Finding small separators in linear time via treewidth reduction (Q2933661) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- On recognizing graphs by numbers of homomorphisms (Q3057061) (← links)
- Fraternal Augmentations of graphs, Coloration and Minors (Q3439588) (← links)
- NP for Combinatorialists (Q3503495) (← links)
- Efficient First-Order Model-Checking Using Short Labels (Q3507329) (← links)
- Recovering sparse graphs (Q5005129) (← links)
- (Q5090497) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- On the $AC^0$ Complexity of Subgraph Isomorphism (Q5737815) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
