default search action
Jean-François Baffier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Bénoît Nougnanke, Justin Loye, Jean-François Baffier, Simone Ferlin, Marc Bruyere, Yann Labit:
gPerfIsol: GNN-Based Rate-Limits Allocation for Performance Isolation in Multi-Tenant Cloud. ICIN 2024: 194-201 - 2023
- [c12]Kenjiro Cho
, Jean-François Baffier
An Autonomous Resource Management Model towards Cloud Morphing. EdgeSys@EuroSys 2023: 7-12 - [c11]Florian Richoux, Jean-François Baffier, Philippe Codognet:
Learning qubo Models for Quantum Annealing: A Constraint-Based Approach. ICCS (5) 2023: 153-167 - 2021
- [c10]Florian Richoux, Jean-François Baffier:
Error function learning with interpretable compositional networks for constraint-based local search. GECCO Companion 2021: 137-138 - 2020
- [i5]Florian Richoux, Jean-François Baffier:
Automatic Cost Function Learning with Interpretable Compositional Networks. CoRR abs/2002.09811 (2020)
2010 – 2019
- 2019
- [c9]Pimprenelle Parmentier, Tiphaine Viard, Benjamin Renoust, Jean-François Baffier:
Introducing Multilayer Stream Graphs and Layer Centralities. COMPLEX NETWORKS (2) 2019: 684-696 - [r1]Alonso Gragera Aguaza, Jean-François Baffier, Vorapong Suppakitpaisarn:
Skull and Roses Card Game. Encyclopedia of Computer Graphics and Games 2019 - [i4]Pimprenelle Parmentier, Tiphaine Viard, Benjamin Renoust, Jean-François Baffier:
Introducing multilayer stream graphs and layer centralities. CoRR abs/1910.01511 (2019) - 2018
- [j7]Jean-François Baffier, Pierre-Louis Poirion, Vorapong Suppakitpaisarn:
Bilevel Model for Adaptive Network Flow Problem. Electron. Notes Discret. Math. 64: 105-114 (2018) - [j6]Sang Won Bae
Gap-planar graphs. Theor. Comput. Sci. 745: 36-52 (2018) - [c8]Jean-François Baffier, Yago Diez
Experimental Study of Compressed Stack Algorithms in Limited Memory Environments. SEA 2018: 19:1-19:13 - 2017
- [j5]Benjamin Renoust
Multiplex flows in citation networks. Appl. Netw. Sci. 2: 23 (2017) - [j4]Benjamin Renoust, Vivek Claver, Jean-François Baffier:
Erratum to: Multiplex flows in citation networks. Appl. Netw. Sci. 2: 27 (2017) - [j3]Jean-François Baffier, Man-Kwun Chiu, Yago Diez
Hanabi is NP-hard, even for cheaters who look at their cards. Theor. Comput. Sci. 675: 43-55 (2017) - [c7]Sang Won Bae
Gap-Planar Graphs. GD 2017: 531-545 - [i3]Jean-François Baffier, Yago Diez, Matias Korman:
Experimental Study of Compressed Stack Algorithms in Limited Memory Environments. CoRR abs/1706.04708 (2017) - [i2]Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth:
Gap-planar Graphs. CoRR abs/1708.07653 (2017) - 2016
- [j2]Jean-François Baffier, Vorapong Suppakitpaisarn
Parametric multiroute flow and its application to multilink-attack network. Discret. Optim. 22: 20-36 (2016) - [j1]Florian Richoux, Alberto Uriarte
ghost: A Combinatorial Optimization Framework for Real-Time Problems. IEEE Trans. Comput. Intell. AI Games 8(4): 377-388 (2016) - [c6]Benjamin Renoust, Vivek Claver, Jean-François Baffier:
Flows of Knowledge in Citation Networks. COMPLEX NETWORKS 2016: 159-170 - [c5]Jean-François Baffier, Man-Kwun Chiu, Yago Diez
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. FUN 2016: 4:1-4:17 - [i1]Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno:
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. CoRR abs/1603.01911 (2016) - 2015
- [c4]Vorapong Suppakitpaisarn, Wenkai Dai
Robust network flow against attackers with knowledge of routing method. HPSR 2015: 40-47 - [c3]Jean-François Baffier, Vorapong Suppakitpaisarn:
Algorithms for finding robust and sustainable network flows against multilink-attack. RNDM@WMNC 2015: 251-258 - 2014
- [c2]Jean-François Baffier, Vorapong Suppakitpaisarn
Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures. ISCO 2014: 26-37 - [c1]Jean-François Baffier, Vorapong Suppakitpaisarn
A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow. WALCOM 2014: 68-79
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-08-05 20:21 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: