default search action
Lucas Pastor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]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) - [c2]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 - [i8]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) - 2021
- [j8]Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé:
Disproving the normal graph conjecture. J. Comb. Theory B 147: 238-251 (2021) - [i7]Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. CoRR abs/2110.14003 (2021) - 2020
- [j7]Marthe Bonamy, Pierre Charbit
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27(1): 1 (2020) - [i6]Caroline Brosse, Aurélie Lagoutte
Efficient enumeration of maximal split subgraphs and sub-cographs and related classes. CoRR abs/2007.01031 (2020)
2010 – 2019
- 2019
- [j6]T. Karthick, Frédéric Maffray
Polynomial Cases for the Vertex Coloring Problem. Algorithmica 81(3): 1053-1074 (2019) - 2018
- [j5]Frédéric Maffray, Lucas Pastor:
Maximum weight stable set in (P7, bull)-free graphs and (S1, 2, 3, bull)-free graphs. Discret. Math. 341(5): 1449-1458 (2018) - [j4]Nicolas Bousquet
Decomposition techniques applied to the Clique-Stable set separation problem. Discret. Math. 341(5): 1492-1501 (2018) - 2017
- [b1]Lucas Pastor:
Coloring, stable set and structure of graphs. (Coloration, ensemble indépendant et structure de graphe). Grenoble Alpes University, France, 2017 - [j3]Frédéric Maffray, Lucas Pastor:
4-coloring (P6, bull)-free graphs. Discret. Appl. Math. 231: 198-210 (2017) - [j2]Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor:
Colouring squares of claw-free graphs. Electron. Notes Discret. Math. 61: 663-669 (2017) - [i5]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) - [i4]T. Karthick, Frédéric Maffray, Lucas Pastor:
Polynomial Cases for the Vertex Coloring Problem. CoRR abs/1709.07712 (2017) - 2016
- [j1]Sylvain Gravier, Frédéric Maffray, Lucas Pastor:
On the Choosability of Claw-Free Perfect Graphs. Graphs Comb. 32(6): 2393-2413 (2016) - [c1]Frédéric Maffray, Lucas Pastor:
The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs. WG 2016: 85-96 - [i3]Frédéric Maffray, Lucas Pastor:
The maximum weight stable set problem in $(P_6, \mbox{bull})$-free graphs. CoRR abs/1602.06817 (2016) - [i2]Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor:
Colouring squares of claw-free graphs. CoRR abs/1609.08645 (2016) - [i1]Frédéric Maffray, Lucas Pastor:
Maximum Weight Stable Set in ($P_7$, bull)-free graphs. CoRR abs/1611.09663 (2016)
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-08-27 21:56 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: