Locally Excluding a Minor

Authors:
Anuj Dawar;Martin Grohe;Stephan Kreutzer
Affiliations:
University of Cambridge, UK;Humboldt Universitat zu Berlin, Germany;Universitat zu Berlin, Germany
Venue:
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Year:
2007

Citing 0
Cited 32

On the fixed-parameter tractability of parameterized model-checking problems

Information Processing Letters
Efficient First-Order Model-Checking Using Short Labels

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Parameterized Complexity for Domination Problems on Degenerate Graphs

Graph-Theoretic Concepts in Computer Science
Algorithmic meta-theorems

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Parameterized complexity of the smallest degree-constrained subgraph problem

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
On the parameterised intractability of monadic second-order logic

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Homomorphism preservation on quasi-wide classes

Journal of Computer and System Sciences
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Database theory: query languages

Algorithms and theory of computation handbook
Faster approximation schemes and parameterized algorithms on H-minor-free and odd-minor-free graphs

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Compact labelings for efficient first-order model-checking

Journal of Combinatorial Optimization
Approximation algorithms for domination search

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
On nowhere dense graphs

European Journal of Combinatorics
Tight bounds for linkages in planar graphs

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Locality of queries definable in invariant first-order logic with arbitrary built-in predicates

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Faster parameterized algorithms for minor containment

Theoretical Computer Science
Dominating set is fixed parameter tractable in claw-free graphs

Theoretical Computer Science
Linear kernels for (connected) dominating set on H-minor-free graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Parameterized complexity of finding small degree-constrained subgraphs

Journal of Discrete Algorithms
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs

Theoretical Computer Science
Faster parameterized algorithms for minor containment

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Catalan structures and dynamic programming in H-minor-free graphs

Journal of Computer and System Sciences
Graph minors and parameterized algorithm design

The Multivariate Algorithmic Revolution and Beyond
First-Order and Monadic Second-Order Model-Checking on Ordered Structures

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Deciding first order properties of matroids

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Finite model theory on tame classes of structures

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Model-checking first-order logic: automata and locality

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
The power of counting logics on restricted classes of finite structures

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Enumerating with constant delay the answers to a query

Proceedings of the 16th International Conference on Database Theory
Testing first-order properties for subclasses of sparse graphs

Journal of the ACM (JACM)
FO model checking of interval graphs

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The decidability of equality is proved for Martin-Lof type theory with a universe á la Russell and typed beta-eta- equality judgements. A corollary of this result is that the constructor for dependent function types is injective, a property which ...