default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAurélie Lagoutte
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy
, Arnaud Mary, Lucas Pastor:
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes. Discret. Appl. Math. 345: 34-51 (2024)- [c6]Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
The Canadian Traveller Problem on Outerplanar Graphs. MFCS 2024: 19:1-19:16 - [c5]Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond:
Local Certification of Geometric Graph Classes. MFCS 2024: 48:1-48:14 - [i15]Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev, Antoine Dailly, Yan Gerard, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
The Canadian Traveller Problem on outerplanar graphs. CoRR abs/2403.01872 (2024) - 2023
- [j11]Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni:
On Vizing's edge colouring question. J. Comb. Theory B 159: 126-139 (2023) - [i14]Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond:
Local certification of geometric graph classes. CoRR abs/2311.16953 (2023) - 2021
- [i13]Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni:
On Vizing's edge colouring question. CoRR abs/2107.07900 (2021) - [i12]Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. CoRR abs/2110.14003 (2021) - 2020
- [j10]Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni:
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27(1): 1 (2020) - [i11]Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor:
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes. CoRR abs/2007.01031 (2020)
2010 – 2019
- 2018
- [j9]Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor:
Decomposition techniques applied to the Clique-Stable set separation problem. Discret. Math. 341(5): 1492-1501 (2018) - 2017
- [j8]Aurélie Lagoutte:
Coloring Graphs with no Even Hole of Length at Least 6: the Triangle-Free Case. Electron. J. Comb. 24(3): 3 (2017) - [j7]Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl:
Colouring perfect graphs with bounded clique number. J. Comb. Theory B 122: 757-775 (2017) - [i10]Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray, Lucas Pastor:
Decomposition techniques applied to the Clique-Stable set Separation problem. CoRR abs/1703.07106 (2017) - [i9]Maria Chudnovsky, Aurélie Lagoutte, Paul D. Seymour, Sophie Spirkl:
Colouring perfect graphs with bounded clique number. CoRR abs/1707.03747 (2017) - 2016
- [j6]Julien Bensmail, Aurélie Lagoutte, Petru Valicov:
Strong edge-coloring of (3, Δ)-bipartite graphs. Discret. Math. 339(1): 391-398 (2016) - [j5]Aurélie Lagoutte, Théophile Trunck:
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions. Discret. Math. 339(6): 1809-1825 (2016) - 2015
- [b1]Aurélie Lagoutte:
Interactions between Cliques and Stable Sets in a Graph. (Interactions entre les Cliques et les Stables dans un Graphe). École normale supérieure de Lyon, France, 2015 - [j4]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
The Erdős-Hajnal conjecture for paths and antipaths. J. Comb. Theory B 113: 261-264 (2015) - [j3]Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé:
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension. SIAM J. Discret. Math. 29(4): 2047-2064 (2015) - [i8]Aurélie Lagoutte:
Coloring graphs with no even holes ≥ 6: the triangle-free case. CoRR abs/1503.08057 (2015) - 2014
- [j2]Aurélie Lagoutte, Mathilde Noual, Eric Thierry:
Flooding games on graphs. Discret. Appl. Math. 164: 532-538 (2014) - [j1]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
Clique versus independent set. Eur. J. Comb. 40: 73-92 (2014) - [i7]Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé:
Identifying codes in hereditary classes of graphs and VC-dimension. CoRR abs/1407.5833 (2014) - [i6]Julien Bensmail, Aurélie Lagoutte, Petru Valicov:
Strong edge-coloring of $(3, Δ)$-bipartite graphs. CoRR abs/1412.2624 (2014) - 2013
- [c4]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
Graph coloring, communication complexity and the stubborn problem (Invited talk). STACS 2013: 3-4 - [i5]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
Clique versus Independent Set. CoRR abs/1301.2474 (2013) - [i4]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé:
The Erdős-Hajnal Conjecture for Paths and Antipaths. CoRR abs/1303.5205 (2013) - [i3]Aurélie Lagoutte, Sébastien Tavenas:
The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters. CoRR abs/1309.0422 (2013) - [i2]Aurélie Lagoutte, Théophile Trunck:
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions. CoRR abs/1312.2730 (2013) - 2012
- [c3]Aurélie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti:
Composing extended top-down tree transducers. EACL 2012: 808-817 - 2011
- [c2]Aurélie Lagoutte, Andreas Maletti:
Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition. Algebraic Foundations in Computer Science 2011: 272-308 - [c1]Aurélie Lagoutte, Hadrien Salat, Corinne Vachier:
Alternative method for Hamilton-Jacobi PDEs in image processing. Image Processing: Algorithms and Systems 2011: 787010 - 2010
- [i1]Aurélie Lagoutte:
2-FREE-FLOOD-IT is polynomial. CoRR abs/1008.3091 (2010)
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 2024-10-07 21:21 CEST 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:
