Pages that link to "Item:Q2300624"

The following pages link to On the parameterized complexity of graph modification to first-order logic properties (Q2300624):

Displaying 9 items.

• Streaming deletion problems parameterized by vertex cover (Q2140522) (← links)
• The limits of decidability for first order logic on CPDA graphs (Q2904796) (← links)
• Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic (Q4635884) (← links)
• First-Order Logic on CPDA Graphs (Q4981168) (← links)
• Parameterized Complexity of Elimination Distance to First-Order Logic Properties (Q5072610) (← links)
• Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
• Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• Trimming forests is hard (unless they are made of stars) (Q6654119) (← links)