Jean-François Baffier

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Matias Korman

> Home > Persons > Jean-François Baffier

Publications

2018
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/BaeBCEE0HKMRT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BaeBCEE0HKMRT18
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. Theor. Comput. Sci. 745: 36-52 (2018)
[c8]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/wea/BaffierDK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wea/BaffierDK18
Jean-François Baffier, Yago Diez, Matias Korman:
Experimental Study of Compressed Stack Algorithms in Limited Memory Environments. SEA 2018: 19:1-19:13
2017
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/BaffierCDKMRRU17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BaffierCDKMRRU17
Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno:
Hanabi is NP-hard, even for cheaters who look at their cards. Theor. Comput. Sci. 675: 43-55 (2017)
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/gd/BaeBCEEGHKMRT17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gd/BaeBCEEGHKMRT17
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. GD 2017: 531-545
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BaffierDK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BaffierDK17
Jean-François Baffier, Yago Diez, Matias Korman:
Experimental Study of Compressed Stack Algorithms in Limited Memory Environments. CoRR abs/1706.04708 (2017)
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1708-07653
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1708-07653
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
[c5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fun/BaffierCDKMRRU16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fun/BaffierCDKMRRU16
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. FUN 2016: 4:1-4:17
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BaffierCDKMRRU16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BaffierCDKMRRU16
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)

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.