Pages that link to "Item:Q419416"
From MaRDI portal
The following pages link to Sparsity. Graphs, structures, and algorithms (Q419416):
Displaying 50 items.
- How to play Thue games (Q2342675) (← links)
- Limits of mappings (Q2403694) (← links)
- A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- Minimal asymmetric graphs (Q2407386) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- On nowhere dense graphs (Q2430977) (← links)
- A note on Fiedler value of classes with sublinear separators (Q2435377) (← links)
- Interpreting nowhere dense graph classes as a classical notion of model theory (Q2441640) (← links)
- Distance-two coloring of sparse graphs (Q2441647) (← links)
- On the tree-depth of random graphs (Q2442213) (← links)
- Pebble game algorithms and sparse graphs (Q2476285) (← links)
- Many large eigenvalues in sparse graphs (Q2509701) (← links)
- Modeling limits in hereditary classes: reduction and application to trees (Q2629494) (← links)
- Exact square coloring of subcubic planar graphs (Q2659166) (← links)
- Graph structured sparse subset selection (Q2662712) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- 1-subdivisions, the fractional chromatic number and the Hall ratio (Q2663411) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- A heuristic approach to the treedepth decomposition problem for large graphs (Q2672434) (← links)
- Local 2-separators (Q2673481) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- Long induced paths in minor-closed graph classes and beyond (Q2684889) (← links)
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Strongly sublinear separators and polynomial expansion (Q2808163) (← links)
- Structural sparsity (Q2815673) (← links)
- Sparse codes derived from graphs (Q2822969) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- Counting homomorphisms to sparse graphs (Q2851494) (← links)
- Quantified Conjunctive Queries on Partially Ordered Sets (Q2946013) (← links)
- Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
- Safe Sets in Graphs: Graph Classes and Structural Parameters (Q2958317) (← links)
- Track Layout Is Hard (Q2961541) (← links)
- Characterisations of nowhere dense graphs (invited talk) (Q2963895) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
- Two lower bounds for $p$-centered colorings (Q3386629) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
