Search Results - "Kreutzer, Stephan"

Digraph measures: Kelly decompositions, games, and orderings by Hunter, Paul, Kreutzer, Stephan

“…We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k -trees and cops and robber games and study their…”
Get full text

On the Parameterized Intractability of Monadic Second-Order Logic by Kreutzer, Stephan

“…One of Courcelle's celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO_2)…”
Get full text

Lower Bounds for the Complexity of Monadic Second-Order Logic by Kreutzer, Stephan, Tazari, Siamak

“…Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO 2 ) can be decided in linear time on any…”
Get full text

Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes by Eickmeyer, Kord, Kawarabayashi, Ken-ichi, Kreutzer, Stephan

“…Model checking problems for first- and monadic second-order logic on graphs have received considerable attention in the past, not the least due to their…”
Get full text

First-Order and Monadic Second-Order Model-Checking on Ordered Structures by Engelmann, V., Kreutzer, S., Siebertz, S.

“…Model-checking for first- and monadic second-order logic in the context of graphs has received considerable attention in the literature. It is well-known that…”
Get full text

Excluding a planar matching minor in bipartite graphs by Giannopoulou, Archontia C., Kreutzer, Stephan, Wiederrecht, Sebastian

“…The notion of matching minors is a specialisation of minors fit for the study of graphs with perfect matchings. Matching minors have been used to give a…”
Get full text

Complexity and monotonicity results for domination games by Kreutzer, Stephan, Ordyniak, Sebastian

“…In this paper we study Domination Games, a class of games introduced by Fomin, Kratsch, and Müller in [8]. Domination games are a variant of the well-known…”
Get full text

DAG-width is PSPACE-complete by Amiri, Saeed Akhoondian, Kreutzer, Stephan, Rabinovich, Roman

“…Berwanger et al. show in [2] that for every graph G of size n and DAG-width k there is a DAG decomposition of width k and size nO(k). They also establish a…”
Get full text

Digraph decompositions and monotonicity in digraph searching by Kreutzer, Stephan, Ordyniak, Sebastian

“…Graph decompositions such as tree-decompositions and associated width measures have been the focus of much attention in structural and algorithmic graph…”
Get full text

Routing with congestion in acyclic digraphs by Akhoondian Amiri, Saeed, Kreutzer, Stephan, Marx, Dániel, Rabinovich, Roman

“…We study the version of the k-disjoint paths problem where k demand pairs (s1,t1), …, (sk,tk) are specified in the input and the paths in the solution are…”
Get full text

The dag-width of directed graphs by Berwanger, Dietmar, Dawar, Anuj, Hunter, Paul, Kreutzer, Stephan, Obdržálek, Jan

“…Tree-width is a well-known metric on undirected graphs that measures how tree-like a graph is and gives a notion of graph decomposition that proves useful in…”
Get full text

Directed elimination games by Engelmann, Viktor, Ordyniak, Sebastian, Kreutzer, Stephan

“…While tools from structural graph theory such as tree- or path-width have proved to be highly successful in coping with computational intractability on…”
Get full text

Quantitative Monadic Second-Order Logic by Kreutzer, Stephan, Riveros, Cristian

“…While monadic second-order logic is a prominent logic for specifying languages of finite words, it lacks the power to compute quantitative properties, e.g. to…”
Get full text

Graph operations on parity games and polynomial-time algorithms by Dittmann, Christoph, Kreutzer, Stephan, Tomescu, Alexandru I.

“…In this paper we establish polynomial-time algorithms for special classes of parity games. In particular we study various constructions for combining graphs…”
Get full text

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 by Kreutzer, Stephan

Get full text

Majority Colourings of Digraphs by Kreutzer, Stephan, Oum, Sang-il, Seymour, Paul, Van der Zypen, Dominic, Wood, David R.

“…We prove that every digraph has a vertex 4-colouring such that for each vertex $v$, at most half the out-neighbours of $v$ receive the same colour as $v$. We…”
Get full text

Matching Connectivity: On the Structure of Graphs with Perfect Matchings by Giannopoulou, Archontia C., Kreutzer, Stephan, Wiederrecht, Sebastian

“…We introduce the concept of matching connectivity as a notion of connectivity in graphs admitting perfect matchings. The notion relies heavily on structural…”
Get full text

Generalising automaticity to modal properties of finite structures by Dawar, Anuj, Kreutzer, Stephan

“…We introduce a complexity measure of modal properties of finite structures which generalises the automaticity of languages. It is based on graph-automata-like…”
Get full text

Foreword: Special Issue on Theory and Applications of Graph Searching Problems by Fraigniaud, Pierre, Kreutzer, Stephan, Thilikos, Dimitrios M.

Get full text

Digraph measures : Kelly decompositions, games, and orderings: Graph Searching by HUNTER, Paul, KREUTZER, Stephan

Get full text