default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexandre Vigny
Person information
- affiliation: Université Clermont-Auvergne, France
- affiliation (former): University of Bremen, Germany
- affiliation (former): Paris Diderot University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j5]Ozan Heydt, Simeon Kublenz, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny:
Distributed domination on sparse graph classes. Eur. J. Comb. 123: 103773 (2025)- 2024
- [j4]Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny:
Elimination Distance to Bounded Degree on Planar Graphs Preprint. Fundam. Informaticae 191(2): 129-140 (2024) - [j3]Mario Grobler, Yiting Jiang, Patrice Ossona de Mendez, Sebastian Siebertz
, Alexandre Vigny:
Discrepancy and sparsity. J. Comb. Theory B 169: 96-133 (2024) - [c11]Sebastian Siebertz, Alexandre Vigny:
Advances in Algorithmic Meta Theorems (Invited Paper). FSTTCS 2024: 2:1-2:29 - [c10]Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny:
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. LICS 2024: 68:1-68:12 - [i12]Sebastian Siebertz, Alexandre Vigny:
Advances in Algorithmic Meta Theorems. CoRR abs/2411.15365 (2024) - 2023
- [j2]Nicole Schirrmacher, Sebastian Siebertz, Alexandre Vigny:
First-order Logic with Connectivity Operators. ACM Trans. Comput. Log. 24(4): 30:1-30:23 (2023) - [i11]Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis, Dimitrios M. Thilikos, Alexandre Vigny:
Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes. CoRR abs/2302.07033 (2023) - 2022
- [j1]Nicole Schweikardt, Luc Segoufin, Alexandre Vigny:
Enumeration for FO Queries over Nowhere Dense Graphs. J. ACM 69(3): 22:1-22:37 (2022) - [c9]Nicole Schirrmacher, Sebastian Siebertz, Alexandre Vigny:
First-Order Logic with Connectivity Operators. CSL 2022: 34:1-34:17 - [c8]Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny:
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures. ICALP 2022: 102:1-102:18 - [c7]Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny:
Combinatorial and Algorithmic Aspects of Monadic Stability. ISAAC 2022: 11:1-11:17 - [c6]Ozan Heydt, Sebastian Siebertz, Alexandre Vigny:
Local Planar Domination Revisited. SIROCCO 2022: 154-173 - [i10]Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny:
Combinatorial and Algorithmic Aspects of Monadic Stability. CoRR abs/2206.14509 (2022) - [i9]Ozan Heydt, Simeon Kublenz, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny:
Distributed domination on sparse graph classes. CoRR abs/2207.02669 (2022) - 2021
- [c5]Nikolas Mählmann, Sebastian Siebertz, Alexandre Vigny:
Recursive Backdoors for SAT. MFCS 2021: 73:1-73:18 - [c4]Simeon Kublenz, Sebastian Siebertz, Alexandre Vigny:
Constant Round Distributed Domination on Graph Classes with Bounded Expansion. SIROCCO 2021: 334-351 - [i8]Nikolas Mählmann, Sebastian Siebertz, Alexandre Vigny:
Recursive Backdoors for SAT. CoRR abs/2102.04707 (2021) - [i7]Mario Grobler, Patrice Ossona de Mendez, Sebastian Siebertz, Alexandre Vigny:
On the discrepancy of set systems definable in sparse graph classes. CoRR abs/2105.03693 (2021) - [i6]Nicole Schrader, Sebastian Siebertz, Alexandre Vigny:
First-Order Logic with Connectivity Operators. CoRR abs/2107.05928 (2021) - [i5]Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny:
Algorithms and data structures for first-order logic with connectivity under vertex failures. CoRR abs/2111.03725 (2021) - [i4]Ozan Heydt, Sebastian Siebertz, Alexandre Vigny:
Local planar domination revisited. CoRR abs/2111.14506 (2021) - 2020
- [c3]Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny:
Elimination Distance to Bounded Degree on Planar Graphs. MFCS 2020: 65:1-65:12 - [i3]Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny:
Elimination distance to bounded degree on planar graphs. CoRR abs/2007.02413 (2020) - [i2]Alexandre Vigny:
Dynamic Query Evaluation Over Structures with Low Degree. CoRR abs/2010.02982 (2020) - [i1]Simeon Kublenz, Sebastian Siebertz, Alexandre Vigny:
Distributed domination on graph classes with bounded expansion. CoRR abs/2012.02701 (2020)
2010 – 2019
- 2018
- [b1]Alexandre Vigny:
Query enumeration and nowhere dense graphs. (Énumération des requêtes et graphes nulle-part denses). Paris Diderot University, France, 2018 - [c2]Nicole Schweikardt, Luc Segoufin, Alexandre Vigny:
Enumeration for FO Queries over Nowhere Dense Graphs. PODS 2018: 151-163 - 2017
- [c1]Luc Segoufin, Alexandre Vigny:
Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion. ICDT 2017: 20:1-20:16
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
