Laurent Bulteau
12
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
- 12
- 12
- 2
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 3
- 3
- 2
- 1
- 1
|
|
Pancake Flipping Is HardJournal of Computer and System Sciences, 2015, 81 (8), pp.1556-1574. ⟨10.1016/j.jcss.2015.02.003⟩
Article dans une revue
hal-01053461v1
|
|
|
Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer ScienceTheoretical Computer Science, 2013, 494, pp.122-133
Article dans une revue
hal-00826880v1
|
|
|
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsJournal of Discrete Algorithms, 2013, 19, pp.1-22
Article dans une revue
hal-00826876v1
|
|
|
Sorting by Transpositions is DifficultSIAM Journal on Discrete Mathematics, 2012, 26 (3), pp.1148-1180. ⟨10.1137/110851390⟩
Article dans une revue
hal-00826867v1
|
|
|
Tractability and approximability of maximal strip recoveryTheoretical Computer Science, 2012, 440-441, pp.14-28. ⟨10.1016/j.tcs.2012.04.034⟩
Article dans une revue
hal-00700598v1
|
|
|
Decomposing Cubic Graphs into Connected Subgraphs of Size ThreeThe 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam. ⟨10.1007/978-3-319-42634-1_32⟩
Communication dans un congrès
hal-01309152v1
|
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications13th Workshop on Algorithms in Bioinformatics (WABI2013), Sep 2013, Nice, France. pp.244-258, ⟨10.1007/978-3-642-40453-5_19⟩
Communication dans un congrès
hal-00906903v1
|
|
|
|
Pancake Flipping is Hard37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Aug 2012, Bratislava, Slovakia. pp.247-258
Communication dans un congrès
hal-00717712v1
|
|
|
Sorting by Transpositions is Difficult38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Switzerland. pp.654-665
Communication dans un congrès
hal-00606223v1
|
|
|
Tractability and Approximability of Maximal Strip Recovery22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011, Palermo, Italy. pp.336-349
Communication dans un congrès
hal-00606167v1
|
|
|
Revisiting the Minimum Breakpoint Linearization Problem7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Jun 2010, Prague, France. pp.163-174
Communication dans un congrès
hal-00482856v1
|
|
|
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsISAAC 2009 (20th International Symposium on Algorithms and Computation), 2009, Hawaii, United States. pp.710-719
Communication dans un congrès
hal-00425145v1
|