| 2023 | FCT | Subhedge Projection for Stepwise Hedge Automata. | Antonio Al Serhali, Joachim Niehren |
| 2022 | ICDT | Linear Programs with Conjunctive Queries. | Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon |
| 2020 | CSR | Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata. | Iovka Boneva, Joachim Niehren, Momar Sakho |
| 2019 | LATA | Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables. | Iovka Boneva, Joachim Niehren, Momar Sakho |
| 2017 | DLT | Equivalence of Symbolic Tree Transducers. | Vincent Hugot, Adrien Boiret, Joachim Niehren |
| 2016 | SOFSEM | Projection for Nested Word Automata Speeds up XPath Evaluation on XML Streams. | Tom Sebastian, Joachim Niehren |
| 2015 | LATA | Logics for Unordered Trees with Data Constraints on Siblings. | Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen |
| 2015 | LATA | Sublinear DTD Validity. | Antoine Ndione, Aurlien Lemay, Joachim Niehren |
| 2015 | SOFSEM | A Uniform Programmning Language for Implementing XML Standards. | Pavel Labath, Joachim Niehren |
| 2014 | LATA | Learning Sequential Tree-to-Word Transducers. | Grgoire Laurence, Aurlien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi |
| 2013 | VMCAI | Knockout Prediction for Reaction Networks with Partial Kinetic Information. | Mathias John, Mirabelle Nebut, Joachim Niehren |
| 2012 | DLT | Learning Rational Functions. | Adrien Boiret, Aurlien Lemay, Joachim Niehren |
| 2011 | ESOP | Biochemical Reaction Rules with Constraints. | Mathias John, Cdric Lhoussaine, Joachim Niehren, Cristian Versari |
| 2011 | LATA | Normalization of Sequential Top-Down Tree-to-Word Transducers. | Grgoire Laurence, Aurlien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi |
| 2010 | PODS | A learning algorithm for top-down XML transformations. | Aurlien Lemay, Sebastian Maneth, Joachim Niehren |
| 2009 | FCT | Earliest Query Answering for Deterministic Nested Word Automata. | Olivier Gauwin, Joachim Niehren, Sophie Tison |
| 2009 | FCT | Equivalence of Deterministic Nested Word to Word Transducers. | Slawomir Staworko, Grgoire Laurence, Aurlien Lemay, Joachim Niehren |
| 2009 | LATA | Bounded Delay and Concurrency for Earliest Query Answering. | Olivier Gauwin, Joachim Niehren, Sophie Tison |
| 2008 | LATA | Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. | Jrme Champavre, Rmi Gilleron, Aurlien Lemay, Joachim Niehren |
| 2007 | PODS | Polynomial time fragments of XPath with variables. | Emmanuel Filiot, Joachim Niehren, Jean-Marc Talbot, Sophie Tison |
| 2005 | CADE | Well-Nested Context Unification. | Jordi Levy, Joachim Niehren, Mateu Villaret |
| 2005 | ESOP | Complexity of Subtype Satisfiability over Posets. | Joachim Niehren, Tim Priesnitz, Zhendong Su |
| 2004 | ACL | Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis. | Ruth Fuchss, Alexander Koller, Joachim Niehren, Stefan Thater |
| 2004 | SODA | A new algorithm for normal dominance constraints. | Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele |
| 2003 | ACL | Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints. | Joachim Niehren, Stefan Thater |
| 2003 | EACL | Well-Nested Parallelism Constraints for Ellipsis Resolution. | Katrin Erk, Joachim Niehren |
| 2003 | EACL | Underspecification formalisms: Hole semantics as dominance constraints. | Alexander Koller, Joachim Niehren, Stefan Thater |
| 2002 | LPAR | Parallelism and Tree Regular Constraints. | Joachim Niehren, Mateu Villaret |
| 2002 | POPL | The first-order theory of subtyping constraints. | Zhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen |
| 2001 | ACL | Underspecified Beta Reduction. | Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren |
| 2001 | SODA | An efficient algorithm for the configuration problem of dominance graphs. | Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel |
| 2000 | ACL | A Polynomial-Time Fragment of Dominance Constraints. | Alexander Koller, Kurt Mehlhorn, Joachim Niehren |
| 2000 | COLING | On Underspecified Processing of Dynamic Semantics. | Alexander Koller, Joachim Niehren |
| 1999 | LICS | Entailment of Atomic Set Constraints is PSPACE-Complete. | Joachim Niehren, Martin Mller, Jean-Marc Talbot |
| 1998 | ACL | Constraints over Lambda-Structures in Semantic Underspecification. | Markus Egg, Joachim Niehren, Peter Ruhrberg, Feiyu Xu |
| 1998 | LICS | The First-Order Theory of Ordering Constraints over Feature Trees. | Martin Mller, Joachim Niehren, Ralf Treinen |
| 1997 | ACL | A Uniform Approach to Underspecification and Parallelism. | Joachim Niehren, Manfred Pinkal, Peter Ruhrberg |
| 1997 | CADE | On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting. | Joachim Niehren, Manfred Pinkal, Peter Ruhrberg |
| 1997 | CP | Ordering Constraints over Feature Trees. | Martin Mller, Joachim Niehren, Andreas Podelski |
| 1996 | POPL | Functional Computation as Concurrent Computation. | Joachim Niehren |