1. Stephen Alstrup, Thore Husfeldt, and Theis Rauhe. 1998. hrefhttp://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.71.3834&rep=rep1&type=pdfMarked ancestor problems. In FOCS.
2. Antoine Amarilli, Pierre Bourhis, Louis Jachiet, and Stefan Mengel. 2017. hrefhttp://drops.dagstuhl.de/opus/volltexte/2017/7462/pdf/LIPIcs-ICALP-2017--111.pdf A Circuit-based approach to efficient enumeration. In mboxhrefhttp://icalp17.mimuw.edu.pl/ICALP .
3. Antoine Amarilli, Pierre Bourhis, Louis Jachiet, and Stefan Mengel. 2019 a. hrefhttps://arxiv.org/abs/1702.05589 A Circuit-based approach to efficient enumeration . Extended version with proofs. https://arxiv.org/abs/1702.05589.
4. Antoine Amarilli, Pierre Bourhis, and Stefan Mengel. 2018. hrefhttps://arxiv.org/abs/1709.06185?context=cs.LOEnumeration on trees under relabelings. In ICDT .
5. Antoine Amarilli, Pierre Bourhis, Stefan Mengel, and Matthias Niewerth. 2019 b. hrefhttps://arxiv.org/abs/1807.09320 Constant-delay enumeration for nondeterministic document spanners. In ICDT .