default search action
Antoine Dailly
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c6]Antoine Dailly, Pascal Lafourcade, Gaël Marcadet:
How Did They Design This Game? Swish: Complexity and Unplayable Positions. FUN 2024: 10:1-10:19 - [c5]Jan Bok, Antoine Dailly, Tuomo Lehtilä
:
Resolving Sets in Temporal Graphs. IWOCA 2024: 287-300 - [c4]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 - [c3]Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing:
Algorithms and Complexity for Path Covers of Temporal DAGs. MFCS 2024: 38:1-38:17 - [i14]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) - [i13]Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing:
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? CoRR abs/2403.04589 (2024) - [i12]Jan Bok, Antoine Dailly, Tuomo Lehtilä:
Resolving Sets in Temporal Graphs. CoRR abs/2403.13183 (2024) - [i11]Kyle Burke, Antoine Dailly, Nacim Oijid:
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles. CoRR abs/2404.10390 (2024) - [i10]Antoine Dailly, Harmender Gahlawat, Zin Mar Myint:
The Closed Geodetic Game: algorithms and strategies. CoRR abs/2409.20505 (2024) - 2023
- [j10]Antoine Dailly, Laura Eslava
The Balancing Number and Generalized Balancing Number of Some Graph Classes. Electron. J. Comb. 30(1) (2023) - [j9]Antoine Dailly, Elzbieta Sidorowicz
Neighbour sum distinguishing edge-weightings with local constraints. Discret. Appl. Math. 336: 109-124 (2023) - [c2]Antoine Dailly, Florent Foucaud, Anni Hakanen:
Algorithms and Hardness for Metric Dimension on Digraphs. WG 2023: 232-245 - [i9]Antoine Dailly, Florent Foucaud, Anni Hakanen:
Algorithms and hardness for Metric Dimension on digraphs. CoRR abs/2307.09389 (2023) - 2022
- [j8]Antoine Dailly, Éric Duchêne, Aline Parreau, Elzbieta Sidorowicz:
The neighbour sum distinguishing relaxed edge colouring. Appl. Math. Comput. 419: 126864 (2022) - [c1]Dibyayan Chakraborty
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ISAAC 2022: 12:1-12:17 - [i8]Antoine Dailly, Elzbieta Sidorowicz:
The neighbour sum distinguishing edge-weighting with local constraints. CoRR abs/2203.11521 (2022) - 2021
- [j7]Antoine Dailly, Adriana Hansberg, Denae Ventura
On the balanceability of some graph classes. Discret. Appl. Math. 291: 51-63 (2021) - 2020
- [j6]Antoine Dailly, Éric Duchêne, Urban Larsson, Gabrielle Paris:
Partition games. Discret. Appl. Math. 285: 509-525 (2020) - [i7]Antoine Dailly, Adriana Hansberg, Denae Ventura:
On the balanceability of some graph classes. CoRR abs/2003.04804 (2020)
2010 – 2019
- 2019
- [j5]Antoine Dailly, Florent Foucaud, Adriana Hansberg:
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. Discret. Math. 342(11): 3142-3159 (2019) - [j4]Antoine Dailly, Valentin Gledel, Marc Heinrich:
A generalization of Arc-Kayles. Int. J. Game Theory 48(2): 491-511 (2019) - [j3]Antoine Dailly, Julien Moncel, Aline Parreau:
Connected Subtraction Games on Subdivided Stars. Integers 19: G3 (2019) - 2018
- [b1]Antoine Dailly:
Criticalité, identification et jeux de suppression de sommets dans les graphes. (Criticality, identification and vertex deletion games on graphs). University of Lyon, France, 2018 - [j2]Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena
Octal games on graphs: The game 0.33 on subdivided stars and bistars. Theor. Comput. Sci. 746: 19-35 (2018) - [i6]Antoine Dailly, Éric Duchêne, Urban Larsson, Gabrielle Paris:
Partition games are pure breaking games. CoRR abs/1803.02621 (2018) - [i5]Antoine Dailly, Julien Moncel, Aline Parreau:
Connected Subtraction Games on Subdivided Stars. CoRR abs/1807.10468 (2018) - [i4]Antoine Dailly, Florent Foucaud, Adriana Hansberg:
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. CoRR abs/1812.08420 (2018) - 2017
- [j1]Nicolas Bousquet
A Vizing-like theorem for union vertex-distinguishing edge coloring. Discret. Appl. Math. 232: 88-98 (2017) - [i3]Antoine Dailly, Valentin Gledel, Marc Heinrich:
A generalization of Arc-Kayles. CoRR abs/1709.05219 (2017) - 2016
- [i2]Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci, Aline Parreau:
A Vizing-like theorem for union vertex-distinguishing edge coloring. CoRR abs/1605.02588 (2016) - [i1]Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena:
Octal Games on Graphs: The game 0.33 on subdivided stars and bistars. CoRR abs/1612.05772 (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-10-22 20:17 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: