Jean-François Baffier

According to our database1, Jean-François Baffier authored at least 18 papers between 2014 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Automatic Cost Function Learning with Interpretable Compositional Networks.
CoRR, 2020

2019
Skull and Roses Card Game.
Proceedings of the Encyclopedia of Computer Graphics and Games., 2019

Introducing multilayer stream graphs and layer centralities.
CoRR, 2019

Introducing Multilayer Stream Graphs and Layer Centralities.
Proceedings of the Complex Networks and Their Applications VIII, 2019

2018
Gap-planar graphs.
Theor. Comput. Sci., 2018

Bilevel Model for Adaptive Network Flow Problem.
Electron. Notes Discret. Math., 2018

Experimental Study of Compressed Stack Algorithms in Limited Memory Environments.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

2017
Hanabi is NP-hard, even for cheaters who look at their cards.
Theor. Comput. Sci., 2017

Erratum to: Multiplex flows in citation networks.
Appl. Netw. Sci., 2017

Multiplex flows in citation networks.
Appl. Netw. Sci., 2017

2016
ghost: A Combinatorial Optimization Framework for Real-Time Problems.
IEEE Trans. Comput. Intell. AI Games, 2016

Parametric multiroute flow and its application to multilink-attack network.
Discret. Optim., 2016

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

Flows of Knowledge in Citation Networks.
Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

2015
Algorithms for finding robust and sustainable network flows against multilink-attack.
Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015

Robust network flow against attackers with knowledge of routing method.
Proceedings of the 16th IEEE International Conference on High Performance Switching and Routing, 2015

2014
A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014


  Loading...