Aurélie Lagoutte

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Laurent Beaudou

> Home > Persons > Aurélie Lagoutte

Publications

2024
[c6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/mfcs/BeaudouBCDGLLP24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/BeaudouBCDGLLP24
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
[i15]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2403-01872
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2403-01872
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
[i12]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2110-14003
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2110-14003
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)

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.