| Publication | Date of Publication | Type |
|---|
A new perspective on FO model checking of dense graph classes
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
scientific article; zbMATH DE number 7029306 (Why is no real title available?)
| 2019-02-25 | Paper |
A new perspective on FO model checking of dense graph classes
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
First order limits of sparse graphs: plane trees and path-width
Random Structures \& Algorithms | 2017-08-10 | Paper |
Shrub-depth: Capturing Height of Dense Graphs
| 2017-07-02 | Paper |
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Tree-depth and vertex-minors
European Journal of Combinatorics | 2016-05-11 | Paper |
FO model checking of interval graphs
Logical Methods in Computer Science | 2016-01-07 | Paper |
Faster existential FO model checking on posets
Logical Methods in Computer Science | 2016-01-07 | Paper |
Are there any good digraph width measures?
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
Finite integer index of pathwidth and treewidth
Parameterized and Exact Computation | 2015-09-15 | Paper |
Faster existential FO model checking on posets
Algorithms and Computation | 2015-09-11 | Paper |
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics | 2014-04-02 | Paper |
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
Journal of Computer and System Sciences | 2014-01-28 | Paper |
Expanding the expressive power of monadic second-order logic on restricted graph classes
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Kernelization using structural parameters on sparse graph classes
Lecture Notes in Computer Science | 2013-09-17 | Paper |
FO model checking of interval graphs
Automata, Languages, and Programming | 2013-08-07 | Paper |
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Fundamenta Informaticae | 2013-04-18 | Paper |
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
European Journal of Combinatorics | 2013-01-24 | Paper |
When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\)
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Better algorithms for satisfiability problems for formulas of bounded rank-width
| 2012-08-29 | Paper |
Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking
| 2012-08-23 | Paper |
The dag-width of directed graphs
Journal of Combinatorial Theory. Series B | 2012-08-14 | Paper |
Qualitative reachability in stochastic BPA games
| 2012-04-24 | Paper |
Clique-width: when hard does not mean impossible
| 2012-01-23 | Paper |
Qualitative reachability in stochastic BPA games
Information and Computation | 2011-10-10 | Paper |
Efficient loop navigation for symbolic execution
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Are there any good digraph width measures?
Parameterized and Exact Computation | 2010-12-07 | Paper |
DAG-width
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Fast mu-calculus model checking when tree-width is bounded.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
On digraph width measures in parameterized algorithmics
Parameterized and Exact Computation | 2010-01-14 | Paper |
Clique-Width and Parity Games
Computer Science Logic | 2009-03-05 | Paper |
An OpenMP-like interface for parallel programming in Java
Concurrency and Computation: Practice \& Experience | 2002-05-14 | Paper |
