Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems.

David Auger University of Versailles Saint-Quentin-en-Yvelines, France https://www.david.uvsq.fr/?profile=auger-david-2 https://orcid.org/0000-0003-1886-1901

David Auger Pierre Coucheney Kossi Roland Etse Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems. 2026 33 Electron. J. Comb. 2 https://doi.org/10.37236/13580 db/journals/combinatorics/combinatorics33.html#AugerCE26 streams/journals/combinatorics

David Auger Johanne Cohen Antoine Lobstein Nonatomic Non-Cooperative Neighbourhood Balancing Games. 239-268 2024 191 Fundam. Informaticae 3-4 https://fi.episciences.org/12555 https://doi.org/10.3233/FI-242181 db/journals/fuin/fuin191.html#AugerCL24 streams/journals/fuin

David Auger Pierre Coucheney Kossi Roland Etse Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems. 2024 abs/2411.18364 CoRR https://doi.org/10.48550/arXiv.2411.18364 db/journals/corr/corr2411.html#abs-2411-18364 streams/journals/corr

David Auger Pierre Coucheney Loric Duhazé Kossi Roland Etse Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs. 183-198 2023 RP https://doi.org/10.1007/978-3-031-45286-4_14 conf/rp/2023 db/conf/rp/rp2023.html#AugerCDE23

David Auger Johanne Cohen Antoine Lobstein Nonatomic Non-Cooperative Neighbourhood Balancing Games. 2023 abs/2303.08507 CoRR https://doi.org/10.48550/arXiv.2303.08507 db/journals/corr/corr2303.html#abs-2303-08507

David Auger Pierre Coucheney Loric Duhazé Kossi Roland Etse Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs. 2023 abs/2307.01897 CoRR https://doi.org/10.48550/arXiv.2307.01897 db/journals/corr/corr2307.html#abs-2307-01897

David Auger Pierre Coucheney Loric Duhaze Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs. 12:1-12:14 2022 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2022.12 conf/mfcs/2022 db/conf/mfcs/mfcs2022.html#AugerCD22

David Auger Pierre Coucheney Loric Duhaze Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs. 2022 abs/2204.13151 CoRR https://doi.org/10.48550/arXiv.2204.13151 db/journals/corr/corr2204.html#abs-2204-13151

David Auger Xavier Badin de Montjoye Yann Strozecki A Generic Strategy Improvement Method for Simple Stochastic Games. 12:1-12:22 2021 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2021.12 conf/mfcs/2021 db/conf/mfcs/mfcs2021.html#AugerMS21

David Auger Xavier Badin de Montjoye Yann Strozecki A Generic Strategy Iteration Method for Simple Stochastic Games. 2021 abs/2102.04922 CoRR https://arxiv.org/abs/2102.04922 db/journals/corr/corr2102.html#abs-2102-04922

David Auger Pierre Coucheney Yann Strozecki Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. 9:1-9:16 2019 STACS https://doi.org/10.4230/LIPIcs.STACS.2019.9 conf/stacs/2019 db/conf/stacs/stacs2019.html#AugerCS19

David Auger Pierre Coucheney Yann Strozecki Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule. 2019 abs/1901.05316 CoRR http://arxiv.org/abs/1901.05316 db/journals/corr/corr1901.html#abs-1901-05316

David Auger Irène Charon Olivier Hudry Antoine Lobstein Maximum size of a minimum watching system and the graphs achieving the bound. 20-33 2014 164 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2012.08.028 db/journals/dam/dam164.html#AugerCHL14

David Auger Gérard D. Cohen Sihem Mesnager Sphere coverings and identifying codes. 3-7 2014 70 Des. Codes Cryptogr. 1-2 https://doi.org/10.1007/s10623-012-9638-x db/journals/dcc/dcc70.html#AugerCM14

David Auger Jialin Liu 0001 Sylvie Ruette David Lupien St-Pierre Olivier Teytaud Sparse binary zero-sum games. 2014 ACML http://proceedings.mlr.press/v39/auger14.html conf/acml/2014 db/conf/acml/acml2014.html#AugerLRST14 David Auger Pierre Coucheney Yann Strozecki Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games. 67-85 2014 TAMC https://doi.org/10.1007/978-3-319-06089-7_6 conf/tamc/2014 db/conf/tamc/tamc2014.html#AugerCS14

David Auger Pierre Coucheney Yann Strozecki Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games. 2014 abs/1402.0471 CoRR http://arxiv.org/abs/1402.0471 db/journals/corr/corr1402.html#AugerCS14

David Auger Irène Charon Olivier Hudry Antoine Lobstein Watching systems in graphs: An extension of identifying codes. 1674-1685 2013 161 Discret. Appl. Math. 12 https://doi.org/10.1016/j.dam.2011.04.025 db/journals/dam/dam161.html#AugerCHL13

David Auger Iiro S. Honkala Watching Systems in the King Grid. 333-347 2013 29 Graphs Comb. 3 https://doi.org/10.1007/s00373-011-1124-0 db/journals/gc/gc29.html#AugerH13

Lise Rodier David Auger Johanne Cohen Hélia Pouyllau SLA learning from past failures, a Multi-Armed Bandit approach. 277-283 2013 CNSM https://doi.org/10.1109/CNSM.2013.6727847 https://doi.ieeecomputersociety.org/10.1109/CNSM.2013.6727847 conf/cnsm/2013 db/conf/cnsm/cnsm2013.html#RodierACP13 David Auger Johanne Cohen Pierre Coucheney Lise Rodier Distributed Selfish Algorithms for the Max-Cut Game. 45-54 2013 ISCIS https://doi.org/10.1007/978-3-319-01604-7_5 conf/iscis/2013 db/conf/iscis/iscis2013.html#AugerCCR13 David Auger Adrien Couëtoux Olivier Teytaud Continuous Upper Confidence Trees with Polynomial Exploration - Consistency. 194-209 2013 ECML/PKDD (1) https://doi.org/10.1007/978-3-642-40988-2_13 conf/pkdd/2013-1 db/conf/pkdd/pkdd2013-1.html#AugerCT13

David Auger Olivier Teytaud The Frontier of Decidability in Partially Observable Recursive Games. 1439-1450 2012 23 Int. J. Found. Comput. Sci. 7 https://doi.org/10.1142/S0129054112400576 db/journals/ijfcs/ijfcs23.html#AugerT12

David Auger Combinatorial identification problems and graph powers. 417-420 2011 9 4OR 4 https://doi.org/10.1007/s10288-011-0167-7 db/journals/4or/4or9.html#Auger11

David Auger Irène Charon Olivier Hudry Antoine Lobstein On the sizes of graphs and their powers: The undirected case. 1666-1675 2011 159 Discret. Appl. Math. 16 https://doi.org/10.1016/j.dam.2011.04.010 db/journals/dam/dam159.html#AugerCHL11

David Auger Multiple Tree for Partially Observable Monte-Carlo Tree Search. 53-62 2011 EvoApplications (1) https://doi.org/10.1007/978-3-642-20525-5_6 conf/evoW/2011a1 db/conf/evoW/evoappl2011-1.html#Auger11

David Auger Multiple Tree for Partially Observable Monte-Carlo Tree Search http://arxiv.org/abs/1102.1580 2011 CoRR abs/1102.1580 db/journals/corr/corr1102.html#abs-1102-1580

David Auger Problèmes d'identification combinatoire et puissances de graphes. (Combinatorial identification problems and graph powers). 2010 Télécom ParisTech, France https://tel.archives-ouvertes.fr/pastel-00593649

David Auger Irène Charon Olivier Hudry Antoine Lobstein On the sizes of the graphs G, Gr, Gr \ G: the directed case. 87-110 2010 48 Australas. J Comb. http://ajc.maths.uq.edu.au/pdf/48/ajc_v48_p087.pdf db/journals/ajc/ajc48.html#AugerCHL10

David Auger Irène Charon Olivier Hudry Antoine Lobstein On the existence of a cycle of length at least 7 in a (1, \le 2)-twin-free graph. 591-609 2010 30 Discuss. Math. Graph Theory 4 https://doi.org/10.7151/dmgt.1516 db/journals/dmgt/dmgt30.html#AugerCHL10

David Auger Minimal identifying codes in trees and planar graphs with large girth. 1372-1384 2010 31 Eur. J. Comb. 5 https://doi.org/10.1016/j.ejc.2009.11.012 db/journals/ejc/ejc31.html#Auger10

David Auger Irène Charon Olivier Hudry Antoine Lobstein Complexity results for identifying codes in planar graphs. 691-710 2010 17 Int. Trans. Oper. Res. 6 https://doi.org/10.1111/j.1475-3995.2009.00750.x db/journals/itor/itor17.html#AugerCHL10

David Auger Irène Charon Olivier Hudry Antoine Lobstein Watching Systems in graphs: an extension of Identifying Codes http://arxiv.org/abs/1005.0765 2010 CoRR abs/1005.0765 db/journals/corr/corr1005.html#abs-1005-0765

David Auger Irène Charon Iiro S. Honkala Olivier Hudry Antoine Lobstein Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. 97-114 2009 3 Adv. Math. Commun. 1 https://doi.org/10.3934/amc.2009.3.97 db/journals/amco/amco3.html#AugerCHHL09

David Auger Irène Charon Iiro S. Honkala Olivier Hudry Antoine Lobstein Erratum. 429-430 2009 3 Adv. Math. Commun. 4 https://doi.org/10.3934/amc.2009.3.429 db/journals/amco/amco3.html#AugerCHHL09a

David Auger Identifying Codes in Trees and Planar Graphs. 585-588 2009 34 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2009.07.097 db/journals/endm/endm34.html#Auger09

David Auger Induced Paths in Twin-Free Graphs. 2008 15 Electron. J. Comb. 1 http://www.combinatorics.org/Volume_15/Abstracts/v15i1n17.html db/journals/combinatorics/combinatorics15.html#Auger08

Irène Charon Gérard D. Cohen Johanne Cohen Pierre Coucheney Adrien Couëtoux Loric DuhazeLoric Duhazé Kossi Roland Etse Iiro S. Honkala Olivier Hudry Jialin Liu 0001 Antoine Lobstein Sihem Mesnager Xavier Badin de Montjoye Hélia Pouyllau Lise Rodier Sylvie Ruette David Lupien St-Pierre Yann Strozecki Olivier Teytaud