( en | de | ru )

 

Disambiguation of "Pigné, Yoann"

Author of the publication

copydeleteadd this publication to your clipboard
A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs.

, , , and . Discret. Appl. Math., (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yoann Anselmetti

Yoann Dufresne

Yoann Altmann

Yoann Ventribout

Yoann Roth

 

Other publications of authors with the same name

New Selection Strategies of Actor's Substitute in DARA for Connectivity Restoration in WSANs., , and . ADHOCNETS, volume 184 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 38-49. Springer, (2016)Temporal fault diagnosis for k-bounded non-Markovian SPN., , , and . CoDIT, page 271-276. IEEE, (2018)A study of connectivity on dynamic graphs: computing persistent connected components., , and . 4OR, 21 (2): 205-233 (June 2023)Mobilité dans les graphes dynamiques: Mémoire d'Habilitation à Diriger des Recherches. (Mobility in Dynamic Graphs / Mobility in Dynamic Graphs: Habilitation to Supervise Research).. (2022)Cops and Robbers on Dynamic Graphs: Offline and Online Case., , , , and . SIROCCO, volume 12156 of Lecture Notes in Computer Science, page 203-219. Springer, (2020)Modélisation et traitement décentralisé des graphes dynamiquesApplication aux réseaux mobiles ad hoc. (Modeling and Processing Dynamic GraphsApplications to Mobile Ad Hoc Networks).. University of Le Havre, France, (2008)A Metapopulation Model for Chikungunya Including Populations Mobility on a Large-Scale Network, and . CoRR, (2012)Diagnosis of Structural and Temporal Faults for $k$ -Bounded Non-Markovian Stochastic Petri Nets., , , and . IEEE Trans. Syst. Man Cybern. Syst., 50 (9): 3369-3381 (2020)A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs., , , and . Discret. Appl. Math., (2021)Quay partitioning problem., , , , and . Int. Trans. Oper. Res., 31 (3): 1554-1584 (May 2024)