Irena Schindler

According to our database, Irena Schindler authored at least 9 papers between 2014 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2018

Parameterized complexity of decision problems in non-classical logics

Irena Schindler

PhD thesis, 2018

Default Logic and Bounded Treewidth.

Johannes Klaus Fichte, Markus Hecher, Irina Schindler

Proceedings of the Language and Automata Theory and Applications, 2018

2017

Parametrised Complexity of Satisfiability in Temporal Logic.

Martin Lück, Arne Meier, Irena Schindler

ACM Trans. Comput. Log., 2017

2016

Strong Backdoors for Linear Temporal Logic.

Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler

CoRR, 2016

Strong Backdoors for Default Logic.

Johannes Klaus Fichte, Arne Meier, Irina Schindler

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Backdoors for Linear Temporal Logic.

Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

On the parameterized complexity of non-monotonic logics.

Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer

Arch. Math. Log., 2015

Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem.

Martin Lück, Arne Meier, Irina Schindler

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies.

Martin Lück, Arne Meier, Irina Schindler

Electron. Colloquium Comput. Complex., 2014