Daniel Le Berre

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 Takehide Soh

> Home > Persons > Daniel Le Berre

Publications

2023
[c37]
- view
  authority control:
- export record
  dblp key:
  - conf/biostec/SohMBBT23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/biostec/SohMBBT23
Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura:
SAT-Based Method for Finding Attractors in Asynchronous Multi-Valued Networks. BIOINFORMATICS 2023: 163-174
[c36]
- view
  authority control:
- export record
  dblp key:
  - conf/cmsb/SohMBBT23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cmsb/SohMBBT23
Takehide Soh, Morgan Magnin, Daniel Le Berre, Mutsunori Banbara, Naoyuki Tamura:
SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks. CMSB 2023: 175-183
2017
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/cp/SohBTB17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cp/SohBTB17
Takehide Soh, Mutsunori Banbara, Naoyuki Tamura, Daniel Le Berre:
Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation. CP 2017: 596-614
2014
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/jelia/SohBRBT14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/jelia/SohBRBT14
Takehide Soh, Daniel Le Berre, Stéphanie Roussel, Mutsunori Banbara, Naoyuki Tamura:
Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem. JELIA 2014: 684-693

a service of

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.