Jan Obdržálek

Available identifiers

zbMath Open obdrzalek.janMaRDI QIDQ281931

List of research outcomes

Publication	Date of Publication	Type
A New Perspective on FO Model Checking of Dense Graph Classes	2020-09-11	Paper
https://portal.mardi4nfdi.de/entity/Q4625695	2019-02-25	Paper
A New Perspective on FO Model Checking of Dense Graph Classes	2018-04-23	Paper
First order limits of sparse graphs: Plane trees and path-width	2017-08-10	Paper
Shrub-depth: Capturing Height of Dense Graphs	2017-07-02	Paper
Kernelization using structural parameters on sparse graph classes	2016-11-14	Paper
Tree-depth and vertex-minors	2016-05-11	Paper
FO Model Checking of Interval Graphs	2016-01-07	Paper
Faster Existential FO Model Checking on Posets	2016-01-07	Paper
Are there any good digraph width measures?	2015-12-11	Paper
Finite Integer Index of Pathwidth and Treewidth	2015-09-15	Paper
Faster Existential FO Model Checking on Posets	2015-09-11	Paper
Digraph width measures in parameterized algorithmics	2014-04-02	Paper
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking	2014-01-28	Paper
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes	2014-01-17	Paper
Kernelization Using Structural Parameters on Sparse Graph Classes	2013-09-17	Paper
FO Model Checking of Interval Graphs	2013-08-07	Paper
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width	2013-04-18	Paper
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width	2013-01-24	Paper
When Trees Grow Low: Shrubs and Fast MSO1	2012-09-25	Paper
https://portal.mardi4nfdi.de/entity/Q2908838	2012-08-29	Paper
https://portal.mardi4nfdi.de/entity/Q2904773	2012-08-23	Paper
The dag-width of directed graphs	2012-08-14	Paper
Qualitative Reachability in Stochastic BPA Games	2012-04-24	Paper
https://portal.mardi4nfdi.de/entity/Q3113705	2012-01-23	Paper
Qualitative reachability in stochastic BPA games	2011-10-10	Paper
Efficient Loop Navigation for Symbolic Execution	2011-10-07	Paper
Are There Any Good Digraph Width Measures?	2010-12-07	Paper
DAG-width	2010-08-16	Paper
Computer Aided Verification	2010-04-20	Paper
On Digraph Width Measures in Parameterized Algorithmics	2010-01-14	Paper
Clique-Width and Parity Games	2009-03-05	Paper
An OpenMP-like interface for parallel programming in Java	2002-05-14	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Jan Obdržálek