Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Bulteau, Laurent"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fixed-parameter algorithms for scaffold filling
Laurent Bulteau
,
Anna Paola Carrieri
,
Riccardo Dondi
Theoretical Computer Science
568
, 2015, pp. 72-83
Combinatorial voter control in elections
Laurent Bulteau
,
Jiehua Chen
,
Piotr Faliszewski
,
Rolf Niedermeier
,
Nimrod Talmon
Theoretical Computer Science
589
, 2015, pp. 99-120
Reversal distances for strings with few blocks or small alphabets
Laurent Bulteau
,
Guillaume Fertin
,
Christian Komusiewicz
Lecture Notes in Computer Science
8486
, 2014, pp. 50-59
Co-clustering under the maximum norm
Laurent Bulteau
,
Vincent Froese
,
Sepp Hartung
,
Rolf Niedermeier
Lecture Notes in Computer Science
8889
, 2014, pp. 298-309
Star partitions of perfect graphs
René van Bevern
,
Robert Bredereck
,
Laurent Bulteau
,
Jiehua Chen
,
Vincent Froese
,
Rolf Niedermeier
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
8572
, 2014, pp. 174-185
Revisiting the Minimum Breakpoint Linearization problem
Laurent Bulteau
,
Guillaume Fertin
,
Irena Rusu
Theoretical Computer Science
494
, 2013, pp. 122-133
Hardness of longest common subsequence for sequences with bounded run-lengths
Guillaume Blin
,
Laurent Bulteau
,
Minghui Jiang
,
Pedro J. Tejada
,
Stéphane Vialette
Lecture Notes in Computer Science
7354
, 2012, pp. 138-148
Tractability and approximability of maximal strip recovery
Laurent Bulteau
,
Guillaume Fertin
,
Minghui Jiang
,
Irena Rusu
Theoretical Computer Science
440-441
, 2012, pp. 14-28
Pancake flipping is hard
Laurent Bulteau
,
Guillaume Fertin
,
Irena Rusu
Lecture Notes in Computer Science
7464
, 2012, pp. 247-258
Sorting by transpositions is difficult
Laurent Bulteau
,
Guillaume Fertin
,
Irena Rusu
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 1148-1180
Tractability and approximability of maximal strip recovery
Laurent Bulteau
,
Guillaume Fertin
,
Minghui Jiang
,
Irena Rusu
Lecture Notes in Computer Science
6661
, 2011, pp. 336-349
Sorting by transpositions is difficult
Laurent Bulteau
,
Guillaume Fertin
,
Irena Rusu
Lecture Notes in Computer Science
6755
, 2011, pp. 654-665
Maximal strip recovery problem with gaps: Hardness and approximation algorithms
Laurent Bulteau
,
Guillaume Fertin
,
Irena Rusu
Lecture Notes in Computer Science
5878
, 2009, pp. 710-719