( en | de | ru )

 

Disambiguation of "Baffier, Jean-François"

Author of the publication

copydeleteadd this publication to your clipboard
Multiplex flows in citation networks.

, , and . Appl. Netw. Sci., (2017)

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.

Jean-François Stumper

Jean-François Viaud

Jean-François Paillotin

Jean François Savoie

Jean-François Hren

 

Other publications of authors with the same name

Hanabi is NP-hard, even for cheaters who look at their cards., , , , , , , and . Theor. Comput. Sci., (2017)ghost: A Combinatorial Optimization Framework for Real-Time Problems., , and . IEEE Trans. Comput. Intellig. and AI in Games, 8 (4): 377-388 (2016)Hanabi is NP-complete, Even for Cheaters who Look at Their Cards., , , , , , , and . FUN, volume 49 of LIPIcs, page 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Automatic Cost Function Learning with Interpretable Compositional Networks., and . CoRR, (2020)Skull and Roses Card Game., , and . Encyclopedia of Computer Graphics and Games, Springer, Living reference work, snapshot April 2019.(2019)Algorithms for finding robust and sustainable network flows against multilink-attack., and . RNDM@WMNC, page 251-258. IEEE, (2015)Introducing Multilayer Stream Graphs and Layer Centralities., , , and . COMPLEX NETWORKS (2), volume 882 of Studies in Computational Intelligence, page 684-696. Springer, (2019)Experimental Study of Compressed Stack Algorithms in Limited Memory Environments., , and . SEA, volume 103 of LIPIcs, page 19:1-19:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures., , , and . ISCO, volume 8596 of Lecture Notes in Computer Science, page 26-37. Springer, (2014)A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow., and . WALCOM, volume 8344 of Lecture Notes in Computer Science, page 68-79. Springer, (2014)