Pages that link to "Item:Q3196630"
From MaRDI portal
The following pages link to Deciding first-order properties of locally tree-decomposable structures (Q3196630):
Displaying 50 items.
- On the complexity of connection games (Q307770) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- On the treewidth of dynamic graphs (Q744102) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- On the fixed-parameter tractability of parameterized model-checking problems (Q963328) (← links)
- Homomorphism preservation on quasi-wide classes (Q980940) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
- An existential locality theorem (Q1887659) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Local 2-separators (Q2673481) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Efficient First-Order Model-Checking Using Short Labels (Q3507329) (← links)
- Computing the<i>j</i>th solution of a first-order query (Q3514640) (← links)
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
- On the Parameterised Intractability of Monadic Second-Order Logic (Q3644759) (← links)
- (Q5002812) (← links)
- (Q5002820) (← links)
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- Recovering sparse graphs (Q5005129) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
- (Q5111878) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Junction Tree Factored Particle Inference Algorithm for Multi-Agent Dynamic Influence Diagrams (Q5321715) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- Parameterized Graph Editing with Chosen Vertex Degrees (Q5505639) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- (Q5874521) (← links)