We stand with Ukraine  

Irena Schindler

Affiliations:
  • Universität Hannover, Germany


According to our database1, Irena Schindler authored at least 9 papers between 2014 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Default logic and bounded treewidth.
[BibTeX]
[DOI]
Johannes Klaus Fichte
,
Markus Hecher
,
Irina Schindler
Inf. Comput., 2022

2019
Backdoors for Linear Temporal Logic.
[BibTeX]
[DOI]
Arne Meier
,
Sebastian Ordyniak
,
M. S. Ramanujan
,
Irena Schindler
Algorithmica, 2019

2018
Parameterized complexity of decision problems in non-classical logics
[BibTeX]
[DOI]
Irena Schindler
PhD thesis, 2018

2017
Parametrised Complexity of Satisfiability in Temporal Logic.
[BibTeX]
[DOI]
Martin Lück
,
Arne Meier
,
Irena Schindler
ACM Trans. Comput. Log., 2017

2016
Strong Backdoors for Linear Temporal Logic.
[BibTeX]
[DOI]
Arne Meier
,
Sebastian Ordyniak
,
M. S. Ramanujan
,
Irena Schindler
CoRR, 2016

Strong Backdoors for Default Logic.
[BibTeX]
[DOI]
Johannes Klaus Fichte
,
Arne Meier
,
Irina Schindler
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015
On the parameterized complexity of non-monotonic logics.
[BibTeX]
[DOI]
Arne Meier
,
Irina Schindler
,
Johannes Schmidt
,
Michael Thomas
,
Heribert Vollmer
Arch. Math. Log., 2015

Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Martin Lück
,
Arne Meier
,
Irina Schindler
Electron. Colloquium Comput. Complex., 2014


  Loading...