The paper “On the Complexity of Universality for Partially Ordered NFAs” by Markus Krötzsch, Tomas Masopust and Michaël Thomazo has been accepted for publication at the Mathematical Foundations of Computer Science (MFCS 2016) conference.
Main recent results
- Nelly Barret’s PhD defense
- EMNLP 2023: Evaluating the Factual Faithfulness of Graph-to-Text Generation
- EDBT 2024: “Computing Generic Abstractions from Application Datasets”
- WWW 2023: “On Detecting Policy-Related Political Ads: An Exploratory Analysis of Meta Ads in 2022 French Election”
- IEEE ICDE 2023: “Integrating Connection Search in Graph Queries”
Latest News
- Nelly Barret’s PhD defense
- Fatemeh Nargesian “Tabular Data Discovery in Data Lakes”
- Six CEDAR short papers in Infox sur Seine 2024
- Two short papers have been accepted at SEAGraph24
More…
