Multi-sequential Word Relations. - Ismaël Jecker; Emmanuel Filiot (DLT, 2015)

Aperiodic String Transducers. - Luc Dartois; Ismaël Jecker; Pierre-Alain Reynier (DLT, 2016)

On Equivalence and Uniformisation Problems for Finite Transducers. - Emmanuel Filiot; Ismaël Jecker; Christof Löding; Sarah Winter (ICALP, 2016)

Degree of Sequentiality of Weighted Automata. - Laure Daviaud; Ismaël Jecker; Pierre-Alain Reynier; Didier Villevalois (FoSSaCS, 2017)

On Reversible Transducers. - Luc Dartois; Paulin Fournier; Ismaël Jecker; Nathan Lhote (ICALP, 2017)

On delay and regret determinization of max-plus automata. - Emmanuel Filiot; Ismaël Jecker; Nathan Lhote; Guillermo A. Pérez 001; Jean-François Raskin (LICS, 2017)

Beyond Admissibility: Dominance Between Chains of Strategies. - Nicolas Basset; Ismaël Jecker; Arno Pauly; Jean-François Raskin; Marie van den Bogaard (CSL, 2018)

The Complexity of Transducer Synthesis from Multi-Sequential Specifications. - Léo Exibard; Emmanuel Filiot; Ismaël Jecker (MFCS, 2018)

Simplified Game of Life: Algorithms and Complexity. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Ismaël Jecker; Jakub Svoboda (MFCS, 2020)

Unary Prime Languages. - Ismaël Jecker; Orna Kupferman; Nicolas Mazzocchi (MFCS, 2020)

Decomposing Permutation Automata. - Ismaël Jecker; Nicolas Mazzocchi; Petra Wolf 002 (CONCUR, 2021)

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. - Emmanuel Arrighi; Henning Fernau; Stefan Hoffmann 001; Markus Holzer 001; Ismaël Jecker; Mateus de Oliveira Oliveira; Petra Wolf 002 (FSTTCS, 2021)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. - Shibashis Guha; Ismaël Jecker; Karoliina Lehtinen; Martin Zimmermann 002 (MFCS, 2021)

Infinite-Duration All-Pay Bidding Games. - Guy Avni; Ismaël Jecker; Dorde Zikelic (SODA, 2021)

A Ramsey Theorem for Finite Monoids. - Ismaël Jecker (STACS, 2021)

Complexity of Spatial Games. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Ismaël Jecker; Jakub Svoboda (FSTTCS, 2022)

Parikh Automata over Infinite Words. - Shibashis Guha; Ismaël Jecker; Karoliina Lehtinen; Martin Zimmermann 002 (FSTTCS, 2022)

Operational complexity and pumping lemmas. - Jürgen Dassow; Ismaël Jecker (Acta Informatica, 2022)

Bidding Graph Games with Partially-Observable Budgets. - Guy Avni; Ismaël Jecker; Dorde Zikelic (AAAI, 2023)

History-Deterministic Parikh Automata. - Enzo Erlich; Shibashis Guha; Ismaël Jecker; Karoliina Lehtinen; Martin Zimmermann 002 (CONCUR, 2023)

New Lower Bounds for Reachability in Vector Addition Systems. - Wojciech Czerwinski; Ismaël Jecker; Slawomir Lasota 001; Jérôme Leroux; Lukasz Orlikowski (FSTTCS, 2023)

A Regular and Complete Notion of Delay for Streaming String Transducers. - Emmanuel Filiot; Ismaël Jecker; Christof Löding; Sarah Winter (STACS, 2023)

Finite-valued Streaming String Transducers. - Emmanuel Filiot; Ismaël Jecker; Christof Löding; Anca Muscholl; Gabriele Puppis; Sarah Winter (LICS, 2024)

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. - Ismaël Jecker; Filip Mazowiecki; David Purser (LICS, 2024)

Approximation Bounds for SLACK on Identical Parallel Machines. - Louis-Claude Canon; Anthony Dugois; Pierre-Cyrille Héam; Ismaël Jecker (Euro-Par (1), 2025)

Reachability in 3-VASS Is Elementary. - Wojciech Czerwinski; Ismaël Jecker; Slawomir Lasota 001; Lukasz Orlikowski (ICALP, 2025)

Approximate Problems for Finite Transducers. - Emmanuel Filiot; Ismaël Jecker; Khushraj Madnani; Saina Sunny (ICALP, 2025)

History-Deterministic Parikh Automata. - Enzo Erlich; Mario Grobler; Shibashis Guha; Ismaël Jecker; Karoliina Lehtinen; Martin Zimmermann 002 (ACM Trans. Comput. Log., 2025)