Pages that link to "Item:Q419416"
From MaRDI portal
The following pages link to Sparsity. Graphs, structures, and algorithms (Q419416):
Displaying 29 items.
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
- On the size of minimal separators for treedepth decomposition (Q6558688) (← links)
- Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces (Q6582315) (← links)
- Slim tree-cut width (Q6586668) (← links)
- Elimination distance to bounded degree on planar graphs preprint (Q6593702) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q6604703) (← links)
- Transducing paths in graph classes with unbounded shrubdepth (Q6614398) (← links)
- MSO undecidability for hereditary classes of unbounded clique-width (Q6614399) (← links)
- Hardness of the generalized coloring numbers (Q6614401) (← links)
- Distributed domination on sparse graph classes (Q6614403) (← links)
- Discrepancy and sparsity (Q6615750) (← links)
- Fixed-parameter algorithms for computing RAC drawings of graphs (Q6618251) (← links)
- Counting subgraphs in somewhere dense graphs (Q6621747) (← links)
- Product structure of graph classes with bounded treewidth (Q6630446) (← links)
- Product structure of graph classes with bounded treewidth (Q6632809) (← links)
- Pursuit-evasion in graphs: zombies, lazy zombies and a survivor (Q6635086) (← links)
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs (Q6636993) (← links)
- Linear colouring of binomial random graphs (Q6646401) (← links)
- Logical equivalences, homomorphism indistinguishability, and forbidden minors (Q6647759) (← links)
- The splitting power of branching programs of bounded repetition and CNFs of bounded width (Q6648277) (← links)
- Treelike decompositions for transductions of sparse graphs (Q6649461) (← links)
- Stable graphs of bounded twin-width (Q6649471) (← links)
- When locality meets preservation (Q6649481) (← links)
- Product structure of graphs with an excluded minor (Q6653803) (← links)
- Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs (Q6655672) (← links)
- The complexity of optimizing atomic congestion (Q6665726) (← links)
- Circuit and Graver walks and linear and integer programming (Q6670505) (← links)
- The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds (Q6671386) (← links)
