dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Laurent Bulteau Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Minghui Jiang: Inapproximability of (1, 2)-Exemplar Distance. ISBRA 2012: 13-23
2011
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu: Tractability and Approximability of Maximal Strip Recovery. CPM 2011: 336-349
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Sorting by Transpositions Is Difficult. ICALP (1) 2011: 654-665
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Pancake Flipping is Hard CoRR abs/1111.0434: (2011)
2010
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Revisiting the Minimum Breakpoint Linearization Problem. TAMC 2010: 163-174
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Sorting by Transpositions is Difficult CoRR abs/1011.1157: (2010)
2009
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLaurent Bulteau, Guillaume Fertin, Irena Rusu: Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC 2009: 710-719

Coauthor Index

1Guillaume Fertin [1] [2] [3] [4] [5] [6]
2Minghui Jiang [6] [7]
3Irena Rusu [1] [2] [3] [4] [5] [6]

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page