Pages that link to "Item:Q4640289"
From MaRDI portal
The following pages link to Deciding First-Order Properties of Nowhere Dense Graphs (Q4640289):
Displaying 50 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- On ultralimits of sparse graph classes (Q286118) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- First-order limits, an analytical perspective (Q896082) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- Towards a characterization of universal categories (Q1684740) (← links)
- Induced subdivisions and bounded expansion (Q1686256) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- A meta-theorem for distributed certification (Q2097341) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Harmless sets in sparse classes (Q2169963) (← links)
- On coloring numbers of graph powers (Q2174571) (← links)
- Polynomial treedepth bounds in linear colorings (Q2223702) (← links)
- Uniform orderings for generalized coloring numbers (Q2225419) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- On the weak 2-coloring number of planar graphs (Q2237215) (← links)
- On the parameterized complexity of \([1,j]\)-domination problems (Q2283043) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- Some lower bounds in parameterized \(\mathrm{AC}^{0}\) (Q2417855) (← links)
- Modeling limits in hereditary classes: reduction and application to trees (Q2629494) (← links)
- Quantified conjunctive queries on partially ordered sets (Q2634671) (← links)
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs (Q2662795) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- Quantified Conjunctive Queries on Partially Ordered Sets (Q2946013) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- Coloring and Covering Nowhere Dense Graphs (Q4553722) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Model checking existential logic on partially ordered sets (Q4635604) (← links)
- (Q4972729) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- (Q5002812) (← links)
- (Q5002820) (← links)
