scientific article; zbMATH DE number 7199584

MaRDI QIDQ5109514

Wojtek Kazana, Luc Segoufin

Publication date: 12 May 2020

Full work available at URL: https://arxiv.org/abs/1802.04613

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of database queries
• The complexity of first-order and monadic second-order logic revisited
• Grad and classes with bounded expansion. I: Decompositions
• Grad and classes with bounded expansion. II: Algorithmic aspects
• On nowhere dense graphs
• Domination Problems in Nowhere-Dense Classes
• Enumeration of monadic second-order queries on trees
• Easy problems for tree-decomposable graphs
• Computing thejth solution of a first-order query
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
• Color-coding
• Deciding First-Order Properties of Nowhere Dense Graphs
• First-order queries on structures of bounded degree are computable with constant delay
• Testing first-order properties for subclasses of sparse graphs
• Enumeration for FO Queries over Nowhere Dense Graphs

This page was built for publication: