Stephan Kreutzer

From MaRDI portal
(Redirected from Person:266261)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A half-integral Erdős-Pósa theorem for directed odd cycles
Journal of Combinatorial Theory. Series B
2025-03-28Paper
Model checking on interpretations of classes of bounded local cliquewidth2024-12-06Paper
Directed tangle tree-decompositions and applications2024-07-19Paper
Differential games, locality, and model checking for FO logic of graphs
(available as arXiv preprint)
2024-04-10Paper
Excluding a planar matching minor in bipartite graphs
Journal of Combinatorial Theory. Series B
2024-01-29Paper
Packing even directed circuits quarter-integrally2023-11-28Paper
scientific article; zbMATH DE number 7650941 (Why is no real title available?)2023-02-07Paper
Algorithmic properties of sparse digraphs2022-07-18Paper
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth2022-02-25Paper
First-order interpretations of bounded expansion classes2021-07-28Paper
On zero-one and convergence laws for graphs embeddable on a fixed surface2021-07-28Paper
The Directed Flat Wall Theorem
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
2021-02-02Paper
scientific article; zbMATH DE number 7297863 (Why is no real title available?)2021-01-19Paper
scientific article; zbMATH DE number 7297863 (Why is no real title available?)
(available as arXiv preprint)
2021-01-19Paper
The canonical directed tree decomposition and its applications to the directed disjoint paths problem2020-09-28Paper
First-order interpretations of bounded expansion classes
ACM Transactions on Computational Logic
2020-09-11Paper
First-order interpretations of bounded expansion classes
ACM Transactions on Computational Logic
2020-09-11Paper
Model-checking on ordered structures
ACM Transactions on Computational Logic
2020-09-11Paper
A half-integral Erd\H{o}s-P\'osa theorem for directed odd cycles2020-07-23Paper
Neighborhood complexity and kernelization for nowhere dense classes of graphs
(available as arXiv preprint)
2020-05-27Paper
Current trends and new perspectives for first-order model checking (invited talk)2020-05-26Paper
Polynomial planar directed grid theorem
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-10-15Paper
Routing with congestion in acyclic digraphs
Information Processing Letters
2019-09-20Paper
An excluded grid theorem for digraphs with forbidden minors
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
Packing directed cycles through a specified vertex set
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-05-15Paper
Directed nowhere dense classes of graphs2019-05-10Paper
Polynomial kernels and wideness properties of nowhere dense graph classes
ACM Transactions on Algorithms
2019-03-28Paper
Digraphs of bounded width
Springer Monographs in Mathematics
2019-03-04Paper
Coloring and covering nowhere dense graphs
SIAM Journal on Discrete Mathematics
2018-10-31Paper
Polynomial kernels and wideness properties of nowhere dense graph classes
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
Deciding first-order properties of nowhere dense graphs
Journal of the ACM
2018-05-17Paper
Decomposition theorems and model-checking for the modal -calculus
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
2018-04-23Paper
On Hanf-equivalence and the number of embeddings of small induced subgraphs
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
2018-04-23Paper
Structural properties and constant factor-approximation of strong distance-r dominating sets in sparse directed graphs2018-04-19Paper
The generalised colouring numbers on classes of bounded expansion
(available as arXiv preprint)
2018-03-21Paper
scientific article; zbMATH DE number 6851840 (Why is no real title available?)
(available as arXiv preprint)
2018-03-21Paper
Matching connectivity: on the structure of graphs with perfect matchings
(available as arXiv preprint)
2018-01-18Paper
Inflationary fixed points in modal logic
ACM Transactions on Computational Logic
2017-07-12Paper
Quantitative Monadic Second-Order Logic
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
2017-07-03Paper
Model checking for successor-invariant first-order logic on minor-closed graph classes
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
2017-07-03Paper
Majority colourings of digraphs
The Electronic Journal of Combinatorics
2017-06-13Paper
Majority colourings of digraphs
The Electronic Journal of Combinatorics
2017-06-13Paper
First-order and monadic second-order model-checking on ordered structures
2012 27th Annual IEEE Symposium on Logic in Computer Science
2017-05-16Paper
Characterisations of nowhere dense graphs (invited talk)2017-02-21Paper
Graph searching games and width measures for directed graphs2017-01-24Paper
DAG-width is PSPACE-complete
Theoretical Computer Science
2016-11-29Paper
Colouring and covering nowhere dense graphs
Graph-Theoretic Concepts in Computer Science
2016-10-21Paper
Complexity and monotonicity results for domination games
Theoretical Computer Science
2016-04-13Paper
The Erdos-Posa Property for Directed Graphs2016-03-08Paper
Graph operations on parity games and polynomial-time algorithms
Theoretical Computer Science
2016-01-21Paper
Directed elimination games
Discrete Applied Mathematics
2015-12-10Paper
Towards the graph minor theorems for directed graphs
Automata, Languages, and Programming
2015-11-04Paper
The directed grid theorem
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing
2015-08-21Paper
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
2015-06-26Paper
Deciding first-order properties of nowhere dense graphs
Proceedings of the forty-sixth annual ACM symposium on Theory of computing
2015-06-26Paper
Digraph measures: Kelly decompositions, games, and orderings2014-12-18Paper
Directed Width Measures and Monotonicity of Directed Graph Searching2014-08-20Paper
Vertex disjoint paths in upward planar graphs
Computer Science - Theory and Applications
2014-06-24Paper
Directed Nowhere Dense Classes of Graphs
(available as arXiv preprint)
2014-05-22Paper
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
2014-04-03Paper
Domination problems in nowhere-dense classes of graphs2012-10-24Paper
The dag-width of directed graphs
Journal of Combinatorial Theory. Series B
2012-08-14Paper
Linkless and flat embeddings in 3-space
Discrete & Computational Geometry
2012-05-22Paper
On the parameterized intractability of monadic second-order logic
Logical Methods in Computer Science
2012-04-03Paper
Methods for algorithmic meta theorems2012-03-02Paper
Algorithmic meta-theorems2011-10-05Paper
Graph searching games2011-10-05Paper
Digraph decompositions and monotonicity in digraph searching
Theoretical Computer Science
2011-09-12Paper
Operational semantics for fixed-point logics on constraint databases
Logic for Programming, Artificial Intelligence, and Reasoning
2011-05-06Paper
Non-regular fixed-point logics and games2011-03-30Paper
Extended computation tree logic
Logic for Programming, Artificial Intelligence, and Reasoning
2010-10-12Paper
scientific article; zbMATH DE number 5764786 (Why is no real title available?)2010-08-06Paper
Once upon a time in the West. Determinacy, definability, and complexity of path games2010-02-24Paper
Distance \(d\)-domination games
Graph-Theoretic Concepts in Computer Science
2010-01-21Paper
On the Parameterised Intractability of Monadic Second-Order Logic
Computer Science Logic
2009-11-12Paper
Reachability in Succinct and Parametric One-Counter Automata
CONCUR 2009 - Concurrency Theory
2009-10-22Paper
Digraph Decompositions and Monotonicity in Digraph Searching
Graph-Theoretic Concepts in Computer Science
2009-01-20Paper
On Datalog vs. LFP
Automata, Languages and Programming
2008-08-19Paper
The complexity of independence-friendly fixpoint logic2008-07-01Paper
Digraph measures: Kelly decompositions, games, and orderings
Theoretical Computer Science
2008-06-24Paper
Algorithmic Meta-theorems
Parameterized and Exact Computation
2008-06-05Paper
DAG-Width and Parity Games
STACS 2006
2008-03-19Paper
Model Theory Makes Formulas Large
Automata, Languages and Programming
2007-11-28Paper
Boundedness of Monadic FO over Acyclic Structures
Automata, Languages and Programming
2007-11-28Paper
Generalising automaticity to modal properties of finite structures
Theoretical Computer Science
2007-07-16Paper
Computer Science Logic
Lecture Notes in Computer Science
2006-11-01Paper
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science
2006-10-20Paper
Backtracking games and inflationary fixed points
Theoretical Computer Science
2006-03-20Paper
Automata, Languages and Programming
Lecture Notes in Computer Science
2005-08-24Paper
An Extension of Muchnik's Theorem
Journal Of Logic And Computation
2005-04-29Paper
Expressive equivalence of least and inflationary fixed-point logic
Annals of Pure and Applied Logic
2004-11-18Paper
scientific article; zbMATH DE number 2080477 (Why is no real title available?)2004-08-04Paper
scientific article; zbMATH DE number 1948172 (Why is no real title available?)2003-07-10Paper
scientific article; zbMATH DE number 1841826 (Why is no real title available?)2002-12-04Paper
scientific article; zbMATH DE number 1424028 (Why is no real title available?)2000-03-23Paper
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Stephan Kreutzer