103 citations · 300 across the 45 of their papers we have counts for
4 papers · 1 filter
Ranked Enumeration for MSO on Trees via Knowledge Compilation
Antoine Amarilli, Pierre Bourhis, Florent Capelli +1
We study the problem of enumerating the satisfying assignments for circuit classes from knowledge compilation, where assignments are ranked in a specific order. In particular, we s…
Approximating Queries on Probabilistic Graphs
Antoine Amarilli, Timothy van Bremen, Octave Gaspard +1
Query evaluation over probabilistic databases is notoriously intractable -- not only in combined complexity, but often in data complexity as well. This motivates the study of appro…
Skyline Operators for Document Spanners
Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé +1
When extracting a relation of spans (intervals) from a text document, a common practice is to filter out tuples of the relation that are deemed dominated by others. The domination…
Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time
Antoine Amarilli
In this note, we give a proof of the fact that we can efficiently find degree-3 planar graphs as topological minors of sufficiently large wall graphs. The result is needed as an in…