UB Paderborn / Katalog / Suche / in CDI

Deciding First-Order Properties of Nowhere Dense Graphs

Journal of the ACM, 2017-06, Vol.64 (3), p.1-32

2017

Volltextzugriff (PDF)

Digraph measures: Kelly decompositions, games, and orderings

Theoretical computer science, 2008-06, Vol.399 (3), p.206-219

2008

Volltextzugriff (PDF)

On the Parameterized Intractability of Monadic Second-Order Logic

Logical methods in computer science, 2012-03, Vol.8, Issue 1

Kreutzer, Stephan

2012

Volltextzugriff (PDF)

Model-Checking on Ordered Structures

ACM transactions on computational logic, 2020-04, Vol.21 (2), p.1-28

2020

Volltextzugriff (PDF)

Lower Bounds for the Complexity of Monadic Second-Order Logic

2010 25th Annual IEEE Symposium on Logic in Computer Science, 2010, p.189-198

2010

Volltextzugriff (PDF)

An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem

Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, p.70-78

2014

Volltextzugriff (PDF)

Excluding a planar matching minor in bipartite graphs

Journal of combinatorial theory. Series B, 2024-01, Vol.164, p.161-221

2024

Volltextzugriff (PDF)

Deciding first-order properties of nowhere dense graphs

Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, p.89-98

2014

Volltextzugriff (PDF)

Complexity and monotonicity results for domination games

Theoretical computer science, 2016-05, Vol.628, p.1-29

2016

Volltextzugriff (PDF)

Coloring and Covering Nowhere Dense Graphs

SIAM journal on discrete mathematics, 2018-01, Vol.32 (4), p.2467-2481

2018

Volltextzugriff (PDF)

Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013, p.134-142

2013

Volltextzugriff (PDF)

First-Order and Monadic Second-Order Model-Checking on Ordered Structures

2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012, p.275-284

2012

Volltextzugriff (PDF)

Digraph decompositions and monotonicity in digraph searching

Theoretical computer science, 2011-08, Vol.412 (35), p.4688-4703

2011

Volltextzugriff (PDF)

Edge-Disjoint Paths in Eulerian Digraphs

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, p.704-715

2024

Volltextzugriff (PDF)

Packing Even Directed Circuits Quarter-Integrally

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, p.692-703

2024

Volltextzugriff (PDF)

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes

ACM transactions on algorithms, 2019-05, Vol.15 (2), p.1-19

2019

Volltextzugriff (PDF)

First-Order Interpretations of Bounded Expansion Classes

ACM transactions on computational logic, 2020-10, Vol.21 (4), p.1-41

2020

Volltextzugriff (PDF)

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, 2022, p.1-13

2022

Volltextzugriff (PDF)

Routing with congestion in acyclic digraphs

Information processing letters, 2019-11, Vol.151, p.105836, Article 105836

2019

Volltextzugriff (PDF)

The dag-width of directed graphs

Journal of combinatorial theory. Series B, 2012-07, Vol.102 (4), p.900-923

2012

Volltextzugriff (PDF)

Directed elimination games

Discrete Applied Mathematics, 2016-01, Vol.199, p.187-198

2016

Volltextzugriff (PDF)

Quantitative Monadic Second-Order Logic

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013, p.113-122

2013

Volltextzugriff (PDF)

Graph operations on parity games and polynomial-time algorithms

Theoretical computer science, 2016-02, Vol.614, p.97-108

2016

Volltextzugriff (PDF)

Colouring and Covering Nowhere Dense Graphs

Graph-Theoretic Concepts in Computer Science, p.325-338

Volltextzugriff (PDF)

E. Grädel, P.G. Kolaitis, L. Libkin, M. Marx, J. Spencer, M.Y. Vardi, Y. Venema and S. Weinstein. Finite model theory and its applications. Texts in Theoretical Computer Science. Springer, Berlin, 2007, xiii + 437 pp

The bulletin of symbolic logic, 2010-09, Vol.16 (3), p.406-407

Kreutzer, Stephan

2010

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Deciding First-Order Properties of Nowhere Dense Graphs

Digraph measures: Kelly decompositions, games, and orderings

On the Parameterized Intractability of Monadic Second-Order Logic

Model-Checking on Ordered Structures

Lower Bounds for the Complexity of Monadic Second-Order Logic

An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem

Excluding a planar matching minor in bipartite graphs

Deciding first-order properties of nowhere dense graphs

Complexity and monotonicity results for domination games

Coloring and Covering Nowhere Dense Graphs

Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes

First-Order and Monadic Second-Order Model-Checking on Ordered Structures

Digraph decompositions and monotonicity in digraph searching

Edge-Disjoint Paths in Eulerian Digraphs

Packing Even Directed Circuits Quarter-Integrally

Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes

First-Order Interpretations of Bounded Expansion Classes

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth

Routing with congestion in acyclic digraphs

The dag-width of directed graphs

Directed elimination games

Quantitative Monadic Second-Order Logic

Graph operations on parity games and polynomial-time algorithms

Colouring and Covering Nowhere Dense Graphs

E. Grädel, P.G. Kolaitis, L. Libkin, M. Marx, J. Spencer, M.Y. Vardi, Y. Venema and S. Weinstein. Finite model theory and its applications. Texts in Theoretical Computer Science. Springer, Berlin, 2007, xiii + 437 pp

Aktive Filter

Suchergebnisse filtern