default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCaroline Brosse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]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)- [j3]Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa:
On the hardness of inclusion-wise minimal separators enumeration. Inf. Process. Lett. 185: 106469 (2024) - [c2]Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci:
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. IWOCA 2024: 382-395 - [i7]Caroline Brosse, Alessio Conte, Vincent Limouzy, Giulia Punzi, Davide Rucci:
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space. CoRR abs/2402.18265 (2024) - [i6]Caroline Brosse, Nicolas Almeida Martins, Nicolas Nisse, Rudini Menezes Sampaio:
The Graph Coloring Game on 4⨉n-Grids. CoRR abs/2412.17668 (2024) - 2023
- [b1]Caroline Brosse:
Efficient enumeration algorithms for minimal graph completions and deletions. (Algorithmes d'énumération efficaces pour les complétions et délétions minimales de graphes). University of Clermont Auvergne, Clermont-Ferrand, France, 2023 - [j2]Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau:
Locating-dominating sets in local tournaments. Discret. Appl. Math. 337: 14-24 (2023) - [j1]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. Discret. Math. Theor. Comput. Sci. 25(2) (2023) - [i5]Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa:
On the hardness of inclusion-wise minimal separators enumeration. CoRR abs/2308.15444 (2023) - 2022
- [c1]Caroline Brosse, Vincent Limouzy, Arnaud Mary:
Polynomial Delay Algorithm for Minimal Chordal Completions. ICALP 2022: 33:1-33:16 - 2021
- [i4]Caroline Brosse, Vincent Limouzy, Arnaud Mary:
Polynomial delay algorithm for minimal chordal completions. CoRR abs/2107.05972 (2021) - [i3]Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau:
Locating Dominating Sets in local tournaments. CoRR abs/2109.03102 (2021) - [i2]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
- [i1]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)
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-27 21:43 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:
