Laurent Bulteau
11
Documents
Présentation
Since 2015, I am a **CNRS Researcher** affiliated at
**Laboratoire d'Informatique Gaspard Monge, Université Gustave Eiffel (Marne-la-Vallée)**
I was previously in:
- Inria/Université Lyon 1 (2014-2015) as a post-doc in the Erable Team, with Marie-France Sagot
- T.U. Berlin (2013-2014) as a post-doc in the AKT group, with Rolf Niedermeier
- Université de Nantes (2010-2013) as a Ph.d. student in the ComBi group, with Guillaume Fertin and Irena Rusu
Publications
- 11
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 4
- 2
- 1
- 1
|
Efficient, robust and effective rank aggregation for massive biological datasetsFuture Generation Computer Systems, 2021, 124, pp.406-421. ⟨10.1016/j.future.2021.06.013⟩
Article dans une revue
hal-03388443v1
|
Recognizing binary shuffle squares is NP-hardTheoretical Computer Science, 2020, 806, pp.116-132. ⟨10.1016/j.tcs.2019.01.012⟩
Article dans une revue
hal-01986646v1
|
|
The Clever Shopper ProblemTheory of Computing Systems, 2019, 64, pp.17-34. ⟨10.1007/s00224-019-09917-z⟩
Article dans une revue
hal-01998054v1
|
|
|
Some algorithmic results for [2]-sumset coversInformation Processing Letters, 2015, 115 (1), pp.1-5
Article dans une revue
hal-01044891v1
|
|
Disorders and Permutations32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), Jul 2021, Wroclaw, Poland. ⟨10.4230/LIPIcs.CPM.2021.11⟩
Communication dans un congrès
hal-03388489v1
|
|
Finding a Small Number of Colourful ComponentsCPM 2019, Jul 2019, Pise, Italy. ⟨10.4230/LIPIcs.CPM.2019.20⟩
Communication dans un congrès
hal-02304030v1
|
|
Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data2019 15th International Conference on eScience (eScience), Sep 2019, San Diego, France. pp.136-145, ⟨10.1109/eScience.2019.00022⟩
Communication dans un congrès
hal-02527738v1
|
The Clever Shopper ProblemThe 13th International Computer Science Symposium in Russia (CSR), Jun 2018, Moscow, Russia. ⟨10.1007/978-3-319-90530-3_6⟩
Communication dans un congrès
hal-01715824v1
|
|
Pattern Matching for k-Track PermutationsInternational Workshop on Combinatorial Algorithms (IWOCA), Jul 2018, Singapore, Singapore. pp.102-114, ⟨10.1007/978-3-319-94667-2_9⟩
Communication dans un congrès
hal-01935941v1
|
|
|
Hardness of longest common subsequence for sequences with bounded run-lengths23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Jul 2012, Helsinki, Finland. pp.138-148, ⟨10.1007/978-3-642-31265-6_11⟩
Communication dans un congrès
hal-00683311v1
|
Finding a Small Number of Colourful Components2019
Pré-publication, Document de travail
hal-01986725v1
|