Alexandre Vigny

Orcid: 0000-0002-4298-8876

Affiliations:
  • Université Clermont-Auvergne, France
  • University of Bremen, Germany (former)
  • Paris Diderot University, France (former)


According to our database1, Alexandre Vigny authored at least 19 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Distributed domination on sparse graph classes.
Eur. J. Comb., 2025

2024
Discrepancy and sparsity.
J. Comb. Theory B, 2024

Elimination Distance to Bounded Degree on Planar Graphs Preprint.
Fundam. Informaticae, 2024

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Advances in Algorithmic Meta Theorems (Invited Paper).
Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023
First-order Logic with Connectivity Operators.
ACM Trans. Comput. Log., October, 2023

2022
Enumeration for FO Queries over Nowhere Dense Graphs.
J. ACM, 2022

Local Planar Domination Revisited.
Proceedings of the Structural Information and Communication Complexity, 2022

Combinatorial and Algorithmic Aspects of Monadic Stability.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
First-Order Logic with Connectivity Operators.
CoRR, 2021

On the discrepancy of set systems definable in sparse graph classes.
CoRR, 2021

Constant Round Distributed Domination on Graph Classes with Bounded Expansion.
Proceedings of the Structural Information and Communication Complexity, 2021

Recursive Backdoors for SAT.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
Distributed domination on graph classes with bounded expansion.
CoRR, 2020

Dynamic Query Evaluation Over Structures with Low Degree.
CoRR, 2020

Elimination Distance to Bounded Degree on Planar Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2018
Query enumeration and nowhere dense graphs. (Énumération des requêtes et graphes nulle-part denses).
PhD thesis, 2018

2017
Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion.
Proceedings of the 20th International Conference on Database Theory, 2017


  Loading...