Nombre de documents

32

Publications de Laurent Bulteau


Since 2015, I am a CNRS Researcher (CR2) affiliated at

Laboratoire d'Informatique Gaspard Monge, Université de Marne-la-Vallée

I am alsoan external member of the ERABLE Team.

I was previously in:

  • Inria/Université Lyon 1 (2014-2015) as a post-doc in the Erable Team
  • T.U. Berlin (2013-2014) as a post-doc in the AKT group
  • Université de Nantes (2010-2013) as a Ph.d. student in the ComBi group

 


Article dans une revue14 documents

  • Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz. (Prefix) reversal distance for (signed) strings with few blocks or small alphabets. Journal of Discrete Algorithms, Elsevier, 2016, 37, pp.44-55. <10.1016/j.jda.2016.05.002>. <hal-01318663>
  • Alice Julien-Laferrière, Laurent Bulteau, Delphine Parrot, Alberto Marchetti-Spaccamela, Leen Stougie, et al.. A Combinatorial Algorithm for Microbial Consortia Synthetic Design. Scientific Reports, Nature Publishing Group, 2016, <http://www.nature.com/articles/srep29182>. <10.1038/srep29182>. <hal-01344296>
  • Laurent Bulteau, Guillaume Fertin, Eric Tannier. Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinformatics, BioMed Central, 2016, 17 (Suppl 14), pp.426. <10.1186/s12859-016-1264-6>. <hal-01396842>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Pancake Flipping Is Hard. Journal of Computer and System Sciences, Elsevier, 2015, 81 (8), pp.1556-1574. <10.1016/j.jcss.2015.02.003>. <hal-01053461>
  • Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri. Computing an Evolutionary Ordering is Hard. Electronic Notes in Discrete Mathematics, Elsevier, 2015, <10.1016/j.endm.2015.07.043>. <hal-01249259>
  • Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi. Fixed-parameter algorithms for scaffold filling. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 568, <10.1016/j.tcs.2014.12.005>. <hal-01260577>
  • Laurent Bulteau, Guillaume Fertin, Stéphane Vialette, Roméo Rizzi. Some algorithmic results for [2]-sumset covers. Information Processing Letters, Elsevier, 2015, 115 (1), pp.1-5. <hal-01044891>
  • Laurent Bulteau, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon. Combinatorial voter control in elections. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 589, pp.99-120. <10.1016/j.tcs.2015.04.023>. <hal-01260623>
  • Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier. Multivariate Algorithmics for NP-Hard String Problems. Bulletin of the EATCS, EATCS, 2014, 114. <hal-01260610>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science. Theoretical Computer Science, Elsevier, 2013, 494, pp.122-133. <hal-00826880>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. Journal of Discrete Algorithms, Elsevier, 2013, 19, pp.1-22. <hal-00826876>
  • Laurent Bulteau, Minghui Jiang. Inapproximability of (1,2)-Exemplar Distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2013, 10 (6), pp.1384-1390. <10.1109/TCBB.2012.144>. <hal-01171580>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Sorting by Transpositions is Difficult. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2012, 26 (3), pp.1148-1180. <10.1137/110851390>. <hal-00826867>
  • Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu. Tractability and approximability of maximal strip recovery. Theoretical Computer Science, Elsevier, 2012, 440-441, pp.14-28. <10.1016/j.tcs.2012.04.034>. <hal-00700598>

Communication dans un congrès16 documents

  • Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu. Decomposing Cubic Graphs into Connected Subgraphs of Size Three. The 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam. Proceedings of the 22nd International Computing and Combinatorics Conference (COCOON), 2016, <http://optnetsci.cise.ufl.edu/cocoon16/>. <hal-01309152>
  • Laurent Bulteau, Vincent Froese, Nimrod Talmon. Multi-player Diffusion Games on Graph Classes. TAMC, May 2015, Singapore, Singapore. Theory and Applications of Models of Computation 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings Lecture Notes in Computer Science, 2015, <10.1007/978-3-319-17142-5_18>. <hal-01260620>
  • Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon. The Complexity of Finding Effectors. TAMC, 2015, Singapore, China. 2015, <10.1007/978-3-319-17142-5_20>. <hal-01260613>
  • Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi. Fixed-Parameter Algorithms for Scaffold Filling. ISCO, 2014, Lisbon, Portugal. 2014, <10.1007/978-3-319-09174-7_12>. <hal-01260583>
  • Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz. Reversal Distances for Strings with Few Blocks or Small Alphabets. Springer-Verlag. 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Jun 2014, Moscou, Russia. Springer-Verlag, 8486, pp.50-59, 2014, Lecture notes in computer science. <10.1007/978-3-319-07566-2_6>. <hal-01044938>
  • Laurent Bulteau, Christian Komusiewicz. Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable. SODA, 2014, University of Illinois, Urbana-Champaign, Illinois, United States. pp.102-121, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. <10.1137/1.9781611973402.8>. <hal-01176597>
  • René Van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, et al.. Star Partitions of Perfect Graphs. ICALP, 2014, Copenhague, Denmark. Automata, Languages, and Programming 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings Lecture Notes in Computer Science, 2014, <10.1007/978-3-662-43948-7_15>. <hal-01260593>
  • Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier. Co-Clustering Under the Maximum Norm. ISAAC, 2014, Jeonju, South Korea. 2014, <10.1007/978-3-319-13075-0_24>. <hal-01260592>
  • Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu. A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. Springer. 13th Workshop on Algorithms in Bioinformatics (WABI2013), Sep 2013, Nice, France. 8126, pp.244-258, 2013, Lecture Notes in Bioinformatics. <10.1007/978-3-642-40453-5_19>. <hal-00906903>
  • Laurent Bulteau, Minghui Jiang. Inapproximability of (1,2)-Exemplar Distance. Bioinformatics Research and Applications, 2012, Dallas, United States. Springer Berlin Heidelberg, 7292, pp.13-23, 2012, Lecture Notes in Computer Science. <10.1007/978-3-642-30191-9_2>. <hal-01171579>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Pancake Flipping is Hard. Springer Verlag. 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Aug 2012, Bratislava, Slovakia. 7467, pp.247-258, 2012, Lecture Notes in Computer Science. <hal-00717712>
  • Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette. Hardness of longest common subsequence for sequences with bounded run-lengths. Juha Kärkkäinen and Jens Stoye. 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Jul 2012, Helsinki, Finland. Springer-Verlag, 7354, pp.138-148, 2012, Lecture Notes in Computer Science. <10.1007/978-3-642-31265-6_11>. <hal-00683311>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Sorting by Transpositions is Difficult. 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Switzerland. Springer, LNCS (6755), pp.654-665, 2011, Lecture Notes in Computer Science. <hal-00606223>
  • Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu. Tractability and Approximability of Maximal Strip Recovery. 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011, Palermo, Italy. Springer, LNCS (6661), pp.336-349, 2011, Lecture Notes in Computer Science. <hal-00606167>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Revisiting the Minimum Breakpoint Linearization Problem. 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Jun 2010, Prague, France. Springer, 6108, pp.163-174, 2010, Lecture Notes in Computer Science. <hal-00482856>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC 2009 (20th International Symposium on Algorithms and Computation), 2009, Hawaii, United States. Springer-Verlag, 5878, pp.710-719, 2009, Lecture Notes in Computer Science (LNCS). <hal-00425145>

Poster1 document

  • A Julien-Laferrière, Laurent Bulteau, D Parrot, A Marchetti-Spaccamela, L Stougie, et al.. MultiPus: Conception de communautés microbiennes pour la production de composés d'intérêt. Jobim, Jun 2016, Lyon, France. <hal-01394119>

Thèse1 document

  • Laurent Bulteau. Algorithmic Aspects of Genome Rearrangements. Data Structures and Algorithms [cs.DS]. Université de Nantes, 2013. English. <tel-00906929>