| 2023 | CONCUR | Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*}(ℤ) to Decision Procedures. | Stphane Demri, Karin Quaas |
| 2023 | JELIA | First Steps Towards Taming Description Logics with Strings. | Stphane Demri, Karin Quaas |
| 2022 | MFCS | Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order. | Dominik Peteler, Karin Quaas |
| 2021 | ICALP | New Techniques for Universality in Unambiguous Register Automata. | Wojciech Czerwinski, Antoine Mottet, Karin Quaas |
| 2019 | ICTAC | Computing Branching Distances Using Quantitative Games. | Uli Fahrenberg, Axel Legay, Karin Quaas |
| 2019 | STACS | The Containment Problem for Unambiguous Register Automata. | Antoine Mottet, Karin Quaas |
| 2017 | CONCUR | The Complexity of Flat Freeze LTL. | Benedikt Bollig, Karin Quaas, Arnaud Sangnier |
| 2017 | LICS | Revisiting reachability in timed automata. | Karin Quaas, Mahsa Shirmohammadi, James Worrell |
| 2016 | MFCS | Synchronizing Data Words for Register Automata. | Parvaneh Babari, Karin Quaas, Mahsa Shirmohammadi |
| 2015 | DLT | Path Checking for MTL and TPTL over Data Words. | Shiguang Feng, Markus Lohrey, Karin Quaas |
| 2014 | CONCUR | Verification for Timed Automata Extended with Unbounded Discrete Data Structures. | Karin Quaas |
| 2014 | LATA | Satisfiability for MTL and TPTL over Non-monotonic Data Words. | Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil, Karin Quaas |
| 2013 | ATVA | Kleene Algebras and Semimodules for Energy Problems. | Zoltn sik, Uli Fahrenberg, Axel Legay, Karin Quaas |
| 2013 | LATA | Model Checking Metric Temporal Logic over Automata with One Counter. | Karin Quaas |
| 2011 | LATA | On the Interval-Bound Problem for Weighted Timed Automata. | Karin Quaas |
| 2009 | DLT | Weighted Timed MSO Logics. | Karin Quaas |
| 2008 | FOSSACS | A Kleene-Schtzenberger Theorem for Weighted Timed Automata. | Manfred Droste, Karin Quaas |