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
Hilfe
Suche: Author="Fertin, Guillaume"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Towards an algorithmic guide to Spiral Galaxies
Guillaume Fertin
,
Shahrad Jamshidi
,
Christian Komusiewicz
Theoretical Computer Science
586
, 2015, pp. 26-39
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
Revisiting the Minimum Breakpoint Linearization problem
Laurent Bulteau
,
Guillaume Fertin
,
Irena Rusu
Theoretical Computer Science
494
, 2013, pp. 122-133
Finding approximate and constrained motifs in graphs
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
Theoretical Computer Science
483
, 2013, pp. 10-21
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
Finding approximate and constrained motifs in graphs
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
Lecture Notes in Computer Science
6661
, 2011, pp. 388-401
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Michael R. Fellows
,
Guillaume Fertin
,
Danny Hermelin
,
Stéphane Vialette
Journal of Computer and System Sciences
77
(4), 2011, pp. 799-811
Finding common structured patterns in linear graphs
Guillaume Fertin
,
Danny Hermelin
,
Romeo Rizzi
,
Stéphane Vialette
Theoretical Computer Science
411
(26-28), 2010, pp. 2475-2486
Pseudo Boolean programming for partially ordered genomes
Sébastien Angibaud
,
Guillaume Fertin
,
Annelyse Thévenin
,
Stéphane Vialette
Lecture Notes in Computer Science
5817
, 2009, pp. 126-137
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
Maximum motif problem in vertex-colored graphs
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
Lecture Notes in Computer Science
5577
, 2009, pp. 221-235
On finding small 2-generating sets
Isabelle Fagnot
,
Guillaume Fertin
,
Stéphane Vialette
Lecture Notes in Computer Science
5609
, 2009, pp. 378-387
A pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes
Sébastien Angibaud
,
Guillaume Fertin
,
Irena Rusu
,
Annelyse Thévenin
,
Stéphane Vialette
LNCS/LNBI
4751
, 2007, pp. 16-29
Extracting constrained 2-interval subsets in 2-interval sets
Guillaume Blin
,
Guillaume Fertin
,
Stéphane Vialette
Theoretical Computer Science
385
(1-3), 2007, pp. 241-263
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
Michael R. Fellows
,
Guillaume Fertin
,
Danny Hermelin
,
Stéphane Vialette
Lecture Notes in Computer Science
4596
, 2007, pp. 340-351
Common structured patterns in linear graphs: Approximation and combinatorics
Guillaume Fertin
,
Danny Hermelin
,
Romeo Rizzi
,
Stéphane Vialette
Lecture Notes in Computer Science
4580
, 2007, pp. 241-252
Acyclic coloring of graphs of maximum degree five: Nine colors are enough
Guillaume Fertin
,
André Raspaud
Information Processing Letters
105
(2), 2007, pp. 65-72
How pseudo-Boolean programming can help genome rearrangement distance computation
Sébastien Angibaud
,
Guillaume Fertin
,
Irena Rusu
,
Stéphane Vialette
LNCS/LNBI
4205
, 2006, pp. 75-86
Genes order and phylogenetic reconstruction: Application to
\gamma
-proteobacteria
Guillaume Blin
,
Cedric Chauve
,
Guillaume Fertin
LNCS/LNBI
3678
, 2005, pp. 11-20
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
Guillaume Blin
,
Guillaume Fertin
,
Danny Hermelin
,
Stéphane Vialette
Lecture Notes in Computer Science
3787
, 2005, pp. 271-282
Finding exact and maximum occurrences of protein complexes in protein-protein interaction graphs
Guillaume Fertin
,
Romeo Rizzi
,
Stéphane Vialette
Lecture Notes in Computer Science
3618
, 2005, pp. 328-339
Seiten 1
2
>