| Enumeration for FO queries over nowhere dense graphs N Schweikardt, L Segoufin, A Vigny Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2018 | 49* | 2018 |
| Constant delay enumeration for FO queries over databases with local bounded expansion L Segoufin, A Vigny 20th International Conference on Database Theory (ICDT 2017), 2017 | 31 | 2017 |
| Algorithms and data structures for first-order logic with connectivity under vertex failures M Pilipczuk, N Schirrmacher, S Siebertz, S Toruńczyk, A Vigny arXiv preprint arXiv:2111.03725, 2021 | 23 | 2021 |
| Elimination distance to bounded degree on planar graphs A Lindermayr, S Siebertz, A Vigny Fundamenta Informaticae 191, 2024 | 21 | 2024 |
| First-order logic with connectivity operators N Schirrmacher, S Siebertz, A Vigny ACM Transactions on Computational Logic 24 (4), 1-23, 2023 | 17* | 2023 |
| Model checking disjoint-paths logic on topological-minor-free graph classes N Schirrmacher, S Siebertz, G Stamoulis, DM Thilikos, A Vigny Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer …, 2024 | 9 | 2024 |
| Constant round distributed domination on graph classes with bounded expansion S Kublenz, S Siebertz, A Vigny International Colloquium on Structural Information and Communication …, 2021 | 9 | 2021 |
| Recursive backdoors for SAT N Mählmann, S Siebertz, A Vigny arXiv preprint arXiv:2102.04707, 2021 | 9 | 2021 |
| Combinatorial and Algorithmic Aspects of Monadic Stability J Dreier, N Mählmann, AE Mouawad, S Siebertz, A Vigny arXiv preprint arXiv:2206.14509, 2022 | 5 | 2022 |
| Local planar domination revisited O Heydt, S Siebertz, A Vigny International Colloquium on Structural Information and Communication …, 2022 | 5 | 2022 |
| Query enumeration and nowhere dense graphs A Vigny Université Paris-Diderot, 2018 | 5 | 2018 |
| Discrepancy and sparsity M Grobler, Y Jiang, PO de Mendez, S Siebertz, A Vigny Journal of Combinatorial Theory, Series B 169, 96-133, 2024 | 4 | 2024 |
| Dynamic query evaluation over structures with low degree A Vigny arXiv preprint arXiv:2010.02982, 2020 | 4 | 2020 |
| On set systems definable in sparse graph classes, discrepancy, and quantifier elimination M Grobler, Y Jiang, PO de Mendez, S Siebertz, A Vigny arXiv preprint arXiv:2010.02607, 2021 | 3 | 2021 |
| Parameterized distributed complexity theory: A logical approach S Siebertz, A Vigny arXiv preprint arXiv:1903.00505, 2019 | 3 | 2019 |
| Distributed domination on sparse graph classes O Heydt, S Kublenz, PO de Mendez, S Siebertz, A Vigny European Journal of Combinatorics 123, 103773, 2025 | 1 | 2025 |
| Advances in Algorithmic Meta Theorems S Siebertz, A Vigny arXiv preprint arXiv:2411.15365, 2024 | 1 | 2024 |
| Constant delay enumeration for First Order queries over classes of graphs with local bounded expansion A Vigny | | |
Sebastian SiebertzUniversität Bremen, AG Theoretische InformatikVerified email at uni-bremen.de
