Matching walks that are minimal with respect to edge inclusion
ArXiv preprint:2408.14048.
2024.
Distinct Shortest Walk Enumeration for RPQs
Joint work with Claire David, Nadime Francis.
In the proceedings of PODS, vol. 2, n°2.
2024.
Enumerating regular languages in radix order: Revisiting the Ackerman-Shallit algorithm
Joint work with Nadime Francis.
Technical Report.
ArXiv:2310.13309.
2023.
A Researcher’s Digest of GQL
Joint work with Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoč.
In the proceedings of ICDT, LIPIcs, vol. 255.
Invited talk.
2023.
PG-Schema: Schemas for Property Graphs
Joint work with Renzo Angles, Angela Bonifati, Stefania Dumbrava, George Fletcher, Alastair Green, Jan Hidders, Bei Li, Leonid Libkin, Wim Martens, Filip Murlak, Stefan Plantikow, Ognjen Savković, Michael Schmidt, Juan Sequeda, Sławek Staworko, Dominik Tomaszuk, Hannes Voigt, Domagoj Vrgoč, Mingxi Wu, Dušan Živković.
In the proceedings of SIGMOD, vol. 1, n°2.
Industrial Track.
2023.
Graph Pattern Matching in GQL and SQL/PGQ
Joint work with Alin Deutsch, Nadime Francis, Alastair Green, Keith Hare, Bei Li, Leonid Libkin, Tobias Lindaaker, Wim Martens, Jan Michels, Filip Murlak, Stefan Plantikow, Petra Selmer, Oskar van Rest, Hannes Voigt, Domagoj Vrgoč, Mingxi Wu, Fred Zemke.
In the proceedings of SIGMOD.
Industrial track.
2022.
On p/q-recognisable sets
In Logical Methods in Computer Science, vol. 17, n°3.
2021.
Taking-and-merging games as rewrite games
Joint work with Eric Duchêne, Aline Parreau, Michel Rigo.
In Discrete Mathematics & Theoretical Computer Science, vol. 22, n°4.
2020.
Updating Graph Databases with Cypher
Joint work with Alastair Green, Paolo Guagliardo, Leonid Libkin, Tobias Lindaaker, Stefan Plantikow, Martin Schuster, Petra Selmer, Hannes Voigt.
In the proceedings of VLDB, vol. 12, n°12.
2019.
An efficient algorithm to decide periodicity of b-recognisable sets using LSDF convention
In Logical Methods in Computer Science, vol. 15, n°3.
2019.
On subtrees of the representation tree in rational base numeration systems
Joint work with Shigeki Akiyama, Jacques Sakarovitch.
In Discrete Mathematics & Theoretical Computer Science, vol. 20, n°1.
2018.
An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention
Joint work with Bernard Boigelot, Isabelle Mainz, Michel Rigo.
In the proceedings of ICALP, Leibniz International Proceedings in Informatics, vol. 80.
2017.
Trees and languages with periodic signature
Joint work with Jacques Sakarovitch.
In Indagationes Mathematicae, vol. 28, n°1.
Special Issue on Automatic Sequences, Number Theory, and Aperiodic Order.
2017.
The signature of rational languages
Joint work with Jacques Sakarovitch.
In Theoretical Computer Science, vol. 658, Part A.
Formal Languages and Automata: Models, Methods and Application In honour of the 70th birthday of Antonio Restivo.
2017.
Énumération et numération
Ph.D. Thesis.
In French.
2016.
Trees and Languages with Periodic Signature
Joint work with Jacques Sakarovitch.
In the proceedings of LATIN, Lecture Notes in Computer Science, vol. 9644.
2016.
Surminimisation of Automata
In the proceedings of DLT, Lecture Notes in Computer Science, vol. 9168.
2015.
Breadth-First Serialisation of Trees and Rational Languages
Joint work with Jacques Sakarovitch.
In the proceedings of DLT, Lecture Notes in Computer Science, vol. 8633.
2014.
Auto-similarity in Rational Base Number Systems
Joint work with Shigeki Akiyama, Jacques Sakarovitch.
In the proceedings of WORDS, Lecture Notes in Computer Science, vol. 8079.
2013.
On Sets of Numbers Rationally Represented in a Rational Base Number System
Joint work with Jacques Sakarovitch.
In the proceedings of CAI, Lecture Notes in Computer Science, vol. 8080.
2013.
Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure
Joint work with Jacques Sakarovitch.
In the proceedings of DLT, Lecture Notes in Computer Science, vol. 7907.
2013.
|