Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Guillaume Fertin
@article{DBLP:journals/bmcbi/PrunierCLLBLBJFRT23,
author = {Gr{\'{e}}goire Prunier and
Mehdi Cherkaoui and
Albane Lysiak and
Olivier Langella and
M{\'{e}}lisande Blein{-}Nicolas and
Virginie Lollier and
Emile Benoist and
G{\'{e}}raldine Jean and
Guillaume Fertin and
H{\'{e}}l{\`{e}}ne Rogniaux and
Dominique Tessier},
title = {Fast alignment of mass spectra in large proteomics datasets, capturing
dissimilarities arising from multiple complex modifications of peptides},
journal = {{BMC} Bioinform.},
volume = {24},
number = {1},
pages = {421},
year = {2023},
url = {https://doi.org/10.1186/s12859-023-05555-y},
doi = {10.1186/S12859-023-05555-Y},
timestamp = {Mon, 13 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/PrunierCLLBLBJFRT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/AlexandrinoOJFDD23,
author = {Alexsandro Oliveira Alexandrino and
Andre Rodrigues Oliveira and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Ulisses Dias and
Zanoni Dias},
title = {Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic
Information},
journal = {J. Comput. Biol.},
volume = {30},
number = {8},
pages = {861--876},
year = {2023},
url = {https://doi.org/10.1089/cmb.2023.0087},
doi = {10.1089/CMB.2023.0087},
timestamp = {Sun, 24 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcb/AlexandrinoOJFDD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/OliveiraAJFDD23,
author = {Andre Rodrigues Oliveira and
Alexsandro Oliveira Alexandrino and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Ulisses Dias and
Zanoni Dias},
title = {Approximation algorithms for sorting by k-cuts on signed permutations},
journal = {J. Comb. Optim.},
volume = {45},
number = {1},
pages = {6},
year = {2023},
url = {https://doi.org/10.1007/s10878-022-00937-z},
doi = {10.1007/S10878-022-00937-Z},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/OliveiraAJFDD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isbra/SiqueiraAOJFD23,
author = {Gabriel Siqueira and
Alexsandro Oliveira Alexandrino and
Andre Rodrigues Oliveira and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Zanoni Dias},
editor = {Xuan Guo and
Serghei Mangul and
Murray Patterson and
Alexander Zelikovsky},
title = {Approximating Rearrangement Distances with Replicas and Flexible Intergenic
Regions},
booktitle = {Bioinformatics Research and Applications - 19th International Symposium,
{ISBRA} 2023, Wroc{\l}aw, Poland, October 9-12, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14248},
pages = {241--254},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-981-99-7074-2\_19},
doi = {10.1007/978-981-99-7074-2\_19},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isbra/SiqueiraAOJFD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BulteauFJV22,
author = {Laurent Bulteau and
Guillaume Fertin and
Vincent Jug{\'{e}} and
St{\'{e}}phane Vialette},
editor = {Hideo Bannai and
Jan Holub},
title = {Permutation Pattern Matching for Doubly Partially Ordered Patterns},
booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2022,
June 27-29, 2022, Prague, Czech Republic},
series = {LIPIcs},
volume = {223},
pages = {21:1--21:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CPM.2022.21},
doi = {10.4230/LIPICS.CPM.2022.21},
timestamp = {Wed, 22 Jun 2022 16:20:49 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BulteauFJV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/intcompsymp/FertinFJV22,
author = {Guillaume Fertin and
Oscar Fontaine and
G{\'{e}}raldine Jean and
St{\'{e}}phane Vialette},
editor = {Sun{-}Yuan Hsieh and
Ling{-}Ju Hung and
Ralf Klasing and
Chia{-}Wei Lee and
Sheng{-}Lung Peng},
title = {The Maximum Zero-Sum Partition Problem},
booktitle = {New Trends in Computer Technologies and Applications - 25th International
Computer Symposium, {ICS} 2022, Taoyuan, Taiwan, December 15-17, 2022,
Proceedings},
series = {Communications in Computer and Information Science},
volume = {1723},
pages = {73--85},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-981-19-9582-8\_7},
doi = {10.1007/978-981-19-9582-8\_7},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/intcompsymp/FertinFJV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isbra/AlexandrinoOJFD22,
author = {Alexsandro Oliveira Alexandrino and
Andre Rodrigues Oliveira and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Ulisses Dias and
Zanoni Dias},
editor = {Mukul S. Bansal and
Zhipeng Cai and
Serghei Mangul},
title = {Transposition Distance Considering Intergenic Regions for Unbalanced
Genomes},
booktitle = {Bioinformatics Research and Applications - 18th International Symposium,
{ISBRA} 2022, Haifa, Israel, November 14-17, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13760},
pages = {100--113},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-23198-8\_10},
doi = {10.1007/978-3-031-23198-8\_10},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isbra/AlexandrinoOJFD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recombcg/OliveiraAJFDD22,
author = {Andre Rodrigues Oliveira and
Alexsandro Oliveira Alexandrino and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Ulisses Dias and
Zanoni Dias},
editor = {Lingling Jin and
Dannie Durand},
title = {Sorting by k-Cuts on Signed Permutations},
booktitle = {Comparative Genomics - 19th International Conference, {RECOMB-CG}
2022, La Jolla, CA, USA, May 20-21, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13234},
pages = {189--204},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06220-9\_11},
doi = {10.1007/978-3-031-06220-9\_11},
timestamp = {Mon, 06 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/recombcg/OliveiraAJFDD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/FertinJL22,
author = {Guillaume Fertin and
G{\'{e}}raldine Jean and
Anthony Labarre},
editor = {Diego Arroyuelo and
Barbara Poblete},
title = {Sorting Genomes by Prefix Double-Cut-and-Joins},
booktitle = {String Processing and Information Retrieval - 29th International Symposium,
{SPIRE} 2022, Concepci{\'{o}}n, Chile, November 8-10, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13617},
pages = {178--190},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20643-6\_13},
doi = {10.1007/978-3-031-20643-6\_13},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/FertinJL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BenoistFJ22,
author = {Emile Benoist and
Guillaume Fertin and
G{\'{e}}raldine Jean},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {The Exact Subset MultiCover Problem},
booktitle = {Theory and Applications of Models of Computation - 17th Annual Conference,
{TAMC} 2022, Tianjin, China, September 16-18, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13571},
pages = {189--200},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20350-3\_16},
doi = {10.1007/978-3-031-20350-3\_16},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/BenoistFJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-14315,
author = {Guillaume Fertin and
G{\'{e}}raldine Jean and
Anthony Labarre},
title = {Sorting Genomes by Prefix Double-Cut-and-Joins},
journal = {CoRR},
volume = {abs/2208.14315},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.14315},
doi = {10.48550/ARXIV.2208.14315},
eprinttype = {arXiv},
eprint = {2208.14315},
timestamp = {Thu, 01 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-14315.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/BulteauFJK21,
author = {Laurent Bulteau and
Guillaume Fertin and
G{\'{e}}raldine Jean and
Christian Komusiewicz},
title = {Sorting by Multi-Cut Rearrangements},
journal = {Algorithms},
volume = {14},
number = {6},
pages = {169},
year = {2021},
url = {https://doi.org/10.3390/a14060169},
doi = {10.3390/A14060169},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/BulteauFJK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/LysiakFJT21,
author = {Albane Lysiak and
Guillaume Fertin and
G{\'{e}}raldine Jean and
Dominique Tessier},
title = {Evaluation of open search methods based on theoretical mass spectra
comparison},
journal = {{BMC} Bioinform.},
volume = {22-S},
number = {2},
pages = {65},
year = {2021},
url = {https://doi.org/10.1186/s12859-021-03963-6},
doi = {10.1186/S12859-021-03963-6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/LysiakFJT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BulteauFLRR21,
author = {Laurent Bulteau and
Guillaume Fertin and
Anthony Labarre and
Romeo Rizzi and
Irena Rusu},
title = {Decomposing subcubic graphs into claws, paths or triangles},
journal = {J. Graph Theory},
volume = {98},
number = {4},
pages = {557--588},
year = {2021},
url = {https://doi.org/10.1002/jgt.22713},
doi = {10.1002/JGT.22713},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/BulteauFLRR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/OliveiraJFBDD21,
author = {Andre Rodrigues Oliveira and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Klairton Lima Brito and
Ulisses Dias and
Zanoni Dias},
title = {Sorting Permutations by Intergenic Operations},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {18},
number = {6},
pages = {2080--2093},
year = {2021},
url = {https://doi.org/10.1109/TCBB.2021.3077418},
doi = {10.1109/TCBB.2021.3077418},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/OliveiraJFBDD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/OliveiraJFBBDD21,
author = {Andre Rodrigues Oliveira and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Klairton Lima Brito and
Laurent Bulteau and
Ulisses Dias and
Zanoni Dias},
title = {Sorting Signed Permutations by Intergenic Reversals},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {18},
number = {6},
pages = {2870--2876},
year = {2021},
url = {https://doi.org/10.1109/TCBB.2020.2993002},
doi = {10.1109/TCBB.2020.2993002},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/OliveiraJFBBDD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FertinFJ21,
author = {Guillaume Fertin and
Julien Fradin and
G{\'{e}}raldine Jean},
title = {The Maximum Colorful Arborescence problem: How (computationally) hard
can it be?},
journal = {Theor. Comput. Sci.},
volume = {852},
pages = {104--120},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.11.021},
doi = {10.1016/J.TCS.2020.11.021},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FertinFJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccS/DepresFM21,
author = {Hugues D{\'{e}}pr{\'{e}}s and
Guillaume Fertin and
{\'{E}}ric Monfroy},
editor = {Maciej Paszynski and
Dieter Kranzlm{\"{u}}ller and
Valeria V. Krzhizhanovskaya and
Jack J. Dongarra and
Peter M. A. Sloot},
title = {Improved Lower Bounds for the Cyclic Bandwidth Problem},
booktitle = {Computational Science - {ICCS} 2021 - 21st International Conference,
Krakow, Poland, June 16-18, 2021, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {12742},
pages = {555--569},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-77961-0\_45},
doi = {10.1007/978-3-030-77961-0\_45},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iccS/DepresFM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BulteauFJK21,
author = {Laurent Bulteau and
Guillaume Fertin and
G{\'{e}}raldine Jean and
Christian Komusiewicz},
editor = {Tom{\'{a}}s Bures and
Riccardo Dondi and
Johann Gamper and
Giovanna Guerrini and
Tomasz Jurdzinski and
Claus Pahl and
Florian Sikora and
Prudence W. H. Wong},
title = {Sorting by Multi-cut Rearrangements},
booktitle = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12607},
pages = {593--607},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-67731-2\_43},
doi = {10.1007/978-3-030-67731-2\_43},
timestamp = {Sun, 25 Jul 2021 11:44:25 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/BulteauFJK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/BritoJFODD20,
author = {Klairton Lima Brito and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Andre Rodrigues Oliveira and
Ulisses Dias and
Zanoni Dias},
title = {Sorting by Genome Rearrangements on Both Gene Order and Intergenic
Sizes},
journal = {J. Comput. Biol.},
volume = {27},
number = {2},
pages = {156--174},
year = {2020},
url = {https://doi.org/10.1089/cmb.2019.0293},
doi = {10.1089/CMB.2019.0293},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/BritoJFODD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FertinK20,
author = {Guillaume Fertin and
Christian Komusiewicz},
title = {Graph Motif Problems Parameterized by Dual},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {371--396},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00538},
doi = {10.7155/JGAA.00538},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/FertinK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alcob/OliveiraJFBDD20,
author = {Andre Rodrigues Oliveira and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Klairton Lima Brito and
Ulisses Dias and
Zanoni Dias},
editor = {Carlos Mart{\'{\i}}n{-}Vide and
Miguel A. Vega{-}Rodr{\'{\i}}guez and
Travis J. Wheeler},
title = {A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions},
booktitle = {Algorithms for Computational Biology - 7th International Conference,
AlCoB 2020, Missoula, MT, USA, April 13-15, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12099},
pages = {16--28},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-42266-0\_2},
doi = {10.1007/978-3-030-42266-0\_2},
timestamp = {Tue, 21 Jul 2020 12:07:35 +0200},
biburl = {https://dblp.org/rec/conf/alcob/OliveiraJFBDD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/OliveiraJFDD19,
author = {Andre Rodrigues Oliveira and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Ulisses Dias and
Zanoni Dias},
title = {Super short operations on both gene order and intergenic sizes},
journal = {Algorithms Mol. Biol.},
volume = {14},
number = {1},
pages = {21:1--21:17},
year = {2019},
url = {https://doi.org/10.1186/s13015-019-0156-5},
doi = {10.1186/S13015-019-0156-5},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/almob/OliveiraJFDD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cibb/FertinDRT19,
author = {Guillaume Fertin and
Matthieu David and
H{\'{e}}l{\`{e}}ne Rogniaux and
Dominique Tessier},
editor = {Paolo Cazzaniga and
Daniela Besozzi and
Ivan Merelli and
Luca Manzoni},
title = {Mass Spectra Interpretation and the Interest of SpecFit for Identifying
Uncommon Modifications},
booktitle = {Computational Intelligence Methods for Bioinformatics and Biostatistics
- 16th International Meeting, {CIBB} 2019, Bergamo, Italy, September
4-6, 2019, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {12313},
pages = {80--89},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-63061-4\_8},
doi = {10.1007/978-3-030-63061-4\_8},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cibb/FertinDRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BulteauDF0PV19,
author = {Laurent Bulteau and
Konrad K. Dabrowski and
Guillaume Fertin and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
St{\'{e}}phane Vialette},
editor = {Nadia Pisanti and
Solon P. Pissis},
title = {Finding a Small Number of Colourful Components},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019,
June 18-20, 2019, Pisa, Italy},
series = {LIPIcs},
volume = {128},
pages = {20:1--20:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CPM.2019.20},
doi = {10.4230/LIPICS.CPM.2019.20},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BulteauDF0PV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isbra/BritoJFODD19,
author = {Klairton Lima Brito and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Andre Rodrigues Oliveira and
Ulisses Dias and
Zanoni Dias},
editor = {Zhipeng Cai and
Pavel Skums and
Min Li},
title = {Sorting by Reversals, Transpositions, and Indels on Both Gene Order
and Intergenic Sizes},
booktitle = {Bioinformatics Research and Applications - 15th International Symposium,
{ISBRA} 2019, Barcelona, Spain, June 3-6, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11490},
pages = {28--39},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-20242-2\_3},
doi = {10.1007/978-3-030-20242-2\_3},
timestamp = {Thu, 20 Aug 2020 15:54:47 +0200},
biburl = {https://dblp.org/rec/conf/isbra/BritoJFODD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/FertinGHV19,
author = {Guillaume Fertin and
Samuele Giraudo and
Sylvie Hamel and
St{\'{e}}phane Vialette},
editor = {T. V. Gopal and
Junzo Watada},
title = {Unshuffling Permutations: Trivial Bijections and Compositions},
booktitle = {Theory and Applications of Models of Computation - 15th Annual Conference,
{TAMC} 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11436},
pages = {242--261},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-14812-6\_15},
doi = {10.1007/978-3-030-14812-6\_15},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/FertinGHV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-03870,
author = {Guillaume Fertin and
Christian Komusiewicz},
title = {Graph Motif Problems Parameterized by Dual},
journal = {CoRR},
volume = {abs/1908.03870},
year = {2019},
url = {http://arxiv.org/abs/1908.03870},
eprinttype = {arXiv},
eprint = {1908.03870},
timestamp = {Mon, 19 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-03870.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/OliveiraFDD18,
author = {Andre Rodrigues Oliveira and
Guillaume Fertin and
Ulisses Dias and
Zanoni Dias},
title = {Sorting signed circular permutations by super short operations},
journal = {Algorithms Mol. Biol.},
volume = {13},
number = {1},
pages = {13:1--13:16},
year = {2018},
url = {https://doi.org/10.1186/s13015-018-0131-6},
doi = {10.1186/S13015-018-0131-6},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/OliveiraFDD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candc/FertinHKS18,
author = {Guillaume Fertin and
Falk H{\"{u}}ffner and
Christian Komusiewicz and
Manuel Sorge},
title = {Matching algorithms for assigning orthologs after genome duplication
events},
journal = {Comput. Biol. Chem.},
volume = {74},
pages = {379--390},
year = {2018},
url = {https://doi.org/10.1016/j.compbiolchem.2018.03.015},
doi = {10.1016/J.COMPBIOLCHEM.2018.03.015},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/candc/FertinHKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FertinRV18,
author = {Guillaume Fertin and
Irena Rusu and
St{\'{e}}phane Vialette},
title = {The S-labeling problem: An algorithmic tour},
journal = {Discret. Appl. Math.},
volume = {246},
pages = {49--61},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.07.036},
doi = {10.1016/J.DAM.2017.07.036},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FertinRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FertinJJ18,
author = {Guillaume Fertin and
Lo{\"{\i}}c Jankowiak and
G{\'{e}}raldine Jean},
title = {Prefix and suffix reversals on strings},
journal = {Discret. Appl. Math.},
volume = {246},
pages = {140--153},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.07.031},
doi = {10.1016/J.DAM.2017.07.031},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FertinJJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FertinP18,
author = {Guillaume Fertin and
Joseph G. Peters},
title = {Optimal odd gossiping},
journal = {Discret. Appl. Math.},
volume = {247},
pages = {53--69},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.03.033},
doi = {10.1016/J.DAM.2018.03.033},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FertinP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LintzmayerFD18,
author = {Carla Negri Lintzmayer and
Guillaume Fertin and
Zanoni Dias},
title = {Sorting permutations and binary strings by length-weighted rearrangements},
journal = {Theor. Comput. Sci.},
volume = {715},
pages = {35--59},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.01.012},
doi = {10.1016/J.TCS.2018.01.012},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LintzmayerFD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DondiFM18,
author = {Riccardo Dondi and
Guillaume Fertin and
Giancarlo Mauri},
title = {Editorial},
journal = {Theor. Comput. Sci.},
volume = {717},
pages = {1},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.02.016},
doi = {10.1016/J.TCS.2018.02.016},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DondiFM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FertinFK18,
author = {Guillaume Fertin and
Julien Fradin and
Christian Komusiewicz},
editor = {Gonzalo Navarro and
David Sankoff and
Binhai Zhu},
title = {On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph
Structure},
booktitle = {Annual Symposium on Combinatorial Pattern Matching, {CPM} 2018, July
2-4, 2018 - Qingdao, China},
series = {LIPIcs},
volume = {105},
pages = {17:1--17:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CPM.2018.17},
doi = {10.4230/LIPICS.CPM.2018.17},
timestamp = {Wed, 28 Feb 2024 00:16:40 +0100},
biburl = {https://dblp.org/rec/conf/cpm/FertinFK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wob/OliveiraJFDD18,
author = {Andre Rodrigues Oliveira and
G{\'{e}}raldine Jean and
Guillaume Fertin and
Ulisses Dias and
Zanoni Dias},
editor = {Ronnie Alves},
title = {Super Short Reversals on Both Gene Order and Intergenic Sizes},
booktitle = {Advances in Bioinformatics and Computational Biology - 11th Brazilian
Symposium on Bioinformatics, {BSB} 2018, Niter{\'{o}}i, Brazil,
October 30 - November 1, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11228},
pages = {14--25},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-01722-4\_2},
doi = {10.1007/978-3-030-01722-4\_2},
timestamp = {Mon, 16 Sep 2019 15:30:44 +0200},
biburl = {https://dblp.org/rec/conf/wob/OliveiraJFDD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-03561,
author = {Laurent Bulteau and
Konrad K. Dabrowski and
Guillaume Fertin and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
St{\'{e}}phane Vialette},
title = {Finding a Small Number of Colourful Components},
journal = {CoRR},
volume = {abs/1808.03561},
year = {2018},
url = {http://arxiv.org/abs/1808.03561},
eprinttype = {arXiv},
eprint = {1808.03561},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-03561.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/FertinJT17,
author = {Guillaume Fertin and
G{\'{e}}raldine Jean and
Eric Tannier},
title = {Algorithms for computing the double cut and join distance on both
gene order and intergenic sizes},
journal = {Algorithms Mol. Biol.},
volume = {12},
number = {1},
pages = {16:1--16:11},
year = {2017},
url = {https://doi.org/10.1186/s13015-017-0107-y},
doi = {10.1186/S13015-017-0107-Y},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/almob/FertinJT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FertinPRX17,
author = {Guillaume Fertin and
Joseph G. Peters and
Lynette Raabe and
Charlie Xu},
title = {Odd gossiping},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {550--561},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.01.034},
doi = {10.1016/J.DAM.2016.01.034},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FertinPRX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/LintzmayerFD17,
author = {Carla Negri Lintzmayer and
Guillaume Fertin and
Zanoni Dias},
title = {Sorting permutations by prefix and suffix rearrangements},
journal = {J. Bioinform. Comput. Biol.},
volume = {15},
number = {1},
pages = {1750002:1--1750002:46},
year = {2017},
url = {https://doi.org/10.1142/S0219720017500020},
doi = {10.1142/S0219720017500020},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jbcb/LintzmayerFD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BulteauFK17,
author = {Laurent Bulteau and
Guillaume Fertin and
Christian Komusiewicz},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jakub Radoszewski and
Wojciech Rytter},
title = {Beyond Adjacency Maximization: Scaffold Filling for New String Distances},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
July 4-6, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {78},
pages = {27:1--27:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CPM.2017.27},
doi = {10.4230/LIPICS.CPM.2017.27},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BulteauFK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/FertinFJ17,
author = {Guillaume Fertin and
Julien Fradin and
G{\'{e}}raldine Jean},
editor = {T. V. Gopal and
Gerhard J{\"{a}}ger and
Silvia Steila},
title = {Algorithmic Aspects of the Maximum Colorful Arborescence Problem},
booktitle = {Theory and Applications of Models of Computation - 14th Annual Conference,
{TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10185},
pages = {216--230},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-55911-7\_16},
doi = {10.1007/978-3-319-55911-7\_16},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/FertinFJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-07584,
author = {Guillaume Fertin and
Julien Fradin and
Christian Komusiewicz},
title = {The Maximum Colorful Arborescence problem parameterized by the structure
of its color hierarchy graph},
journal = {CoRR},
volume = {abs/1710.07584},
year = {2017},
url = {http://arxiv.org/abs/1710.07584},
eprinttype = {arXiv},
eprint = {1710.07584},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-07584.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/BulteauFT16,
author = {Laurent Bulteau and
Guillaume Fertin and
Eric Tannier},
title = {Genome rearrangements with indels in intergenes restrict the scenario
space},
journal = {{BMC} Bioinform.},
volume = {17},
number = {{S-14}},
pages = {225--231},
year = {2016},
url = {https://doi.org/10.1186/s12859-016-1264-6},
doi = {10.1186/S12859-016-1264-6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/BulteauFT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BulteauFK16,
author = {Laurent Bulteau and
Guillaume Fertin and
Christian Komusiewicz},
title = {(Prefix) reversal distance for (signed) strings with few blocks or
small alphabets},
journal = {J. Discrete Algorithms},
volume = {37},
pages = {44--55},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2016.05.002},
doi = {10.1016/J.JDA.2016.05.002},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jda/BulteauFK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BulteauFLRR16,
author = {Laurent Bulteau and
Guillaume Fertin and
Anthony Labarre and
Romeo Rizzi and
Irena Rusu},
editor = {Thang N. Dinh and
My T. Thai},
title = {Decomposing Cubic Graphs into Connected Subgraphs of Size Three},
booktitle = {Computing and Combinatorics - 22nd International Conference, {COCOON}
2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9797},
pages = {393--404},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-42634-1\_32},
doi = {10.1007/978-3-319-42634-1\_32},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BulteauFLRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FertinK16,
author = {Guillaume Fertin and
Christian Komusiewicz},
editor = {Roberto Grossi and
Moshe Lewenstein},
title = {Graph Motif Problems Parameterized by Dual},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016,
June 27-29, 2016, Tel Aviv, Israel},
series = {LIPIcs},
volume = {54},
pages = {7:1--7:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CPM.2016.7},
doi = {10.4230/LIPICS.CPM.2016.7},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/FertinK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/DavidFT16,
author = {Matthieu David and
Guillaume Fertin and
Dominique Tessier},
editor = {Martin C. Frith and
Christian N{\o}rgaard Storm Pedersen},
title = {SpecTrees: An Efficient Without a Priori Data Structure for {MS/MS}
Spectra Identification},
booktitle = {Algorithms in Bioinformatics - 16th International Workshop, {WABI}
2016, Aarhus, Denmark, August 22-24, 2016. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9838},
pages = {65--76},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-43681-4\_6},
doi = {10.1007/978-3-319-43681-4\_6},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/DavidFT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/FertinJT16,
author = {Guillaume Fertin and
G{\'{e}}raldine Jean and
Eric Tannier},
editor = {Martin C. Frith and
Christian N{\o}rgaard Storm Pedersen},
title = {Genome Rearrangements on Both Gene Order and Intergenic Regions},
booktitle = {Algorithms in Bioinformatics - 16th International Workshop, {WABI}
2016, Aarhus, Denmark, August 22-24, 2016. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9838},
pages = {162--173},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-43681-4\_13},
doi = {10.1007/978-3-319-43681-4\_13},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/FertinJT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/aaim/2016,
editor = {Riccardo Dondi and
Guillaume Fertin and
Giancarlo Mauri},
title = {Algorithmic Aspects in Information and Management - 11th International
Conference, {AAIM} 2016, Bergamo, Italy, July 18-20, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9778},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-41168-2},
doi = {10.1007/978-3-319-41168-2},
isbn = {978-3-319-41167-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BulteauFLRR16,
author = {Laurent Bulteau and
Guillaume Fertin and
Anthony Labarre and
Romeo Rizzi and
Irena Rusu},
title = {Decomposing Cubic Graphs into Connected Subgraphs of Size Three},
journal = {CoRR},
volume = {abs/1604.08603},
year = {2016},
url = {http://arxiv.org/abs/1604.08603},
eprinttype = {arXiv},
eprint = {1604.08603},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BulteauFLRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/FertinKMR15,
author = {Guillaume Fertin and
Christian Komusiewicz and
Hafedh Mohamed{-}Babou and
Irena Rusu},
title = {Finding Supported Paths in Heterogeneous Networks},
journal = {Algorithms},
volume = {8},
number = {4},
pages = {810--831},
year = {2015},
url = {https://doi.org/10.3390/a8040810},
doi = {10.3390/A8040810},
timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithms/FertinKMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FertinMR15,
author = {Guillaume Fertin and
Hafedh Mohamed{-}Babou and
Irena Rusu},
title = {Path-driven orientation of mixed graphs},
journal = {Discret. Appl. Math.},
volume = {181},
pages = {98--108},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.10.016},
doi = {10.1016/J.DAM.2014.10.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FertinMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BulteauFRV15,
author = {Laurent Bulteau and
Guillaume Fertin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
title = {Some algorithmic results for [2]-sumset covers},
journal = {Inf. Process. Lett.},
volume = {115},
number = {1},
pages = {1--5},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.07.008},
doi = {10.1016/J.IPL.2014.07.008},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BulteauFRV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BulteauFR15,
author = {Laurent Bulteau and
Guillaume Fertin and
Irena Rusu},
title = {Pancake Flipping is hard},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {8},
pages = {1556--1574},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2015.02.003},
doi = {10.1016/J.JCSS.2015.02.003},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BulteauFR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FertinJK15,
author = {Guillaume Fertin and
Shahrad Jamshidi and
Christian Komusiewicz},
title = {Towards an algorithmic guide to Spiral Galaxies},
journal = {Theor. Comput. Sci.},
volume = {586},
pages = {26--39},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.01.051},
doi = {10.1016/J.TCS.2015.01.051},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FertinJK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LintzmayerFD15,
author = {Carla Negri Lintzmayer and
Guillaume Fertin and
Zanoni Dias},
title = {Approximation algorithms for sorting by length-weighted prefix and
suffix operations},
journal = {Theor. Comput. Sci.},
volume = {593},
pages = {26--41},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.05.039},
doi = {10.1016/J.TCS.2015.05.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LintzmayerFD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FertinRV15,
author = {Guillaume Fertin and
Irena Rusu and
St{\'{e}}phane Vialette},
editor = {Khaled M. Elbassioni and
Kazuhisa Makino},
title = {Obtaining a Triangular Matrix by Independent Row-Column Permutations},
booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC}
2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {165--175},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48971-0\_15},
doi = {10.1007/978-3-662-48971-0\_15},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FertinRV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/FertinRV15,
author = {Guillaume Fertin and
Irena Rusu and
St{\'{e}}phane Vialette},
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {Algorithmic Aspects of the S-Labeling Problem},
booktitle = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
pages = {173--184},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-29516-9\_15},
doi = {10.1007/978-3-319-29516-9\_15},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/FertinRV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/FertinJJ15,
author = {Guillaume Fertin and
Lo{\"{\i}}c Jankowiak and
G{\'{e}}raldine Jean},
editor = {Costas S. Iliopoulos and
Simon J. Puglisi and
Emine Yilmaz},
title = {Prefix and Suffix Reversals on Strings},
booktitle = {String Processing and Information Retrieval - 22nd International Symposium,
{SPIRE} 2015, London, UK, September 1-4, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9309},
pages = {165--176},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23826-5\_17},
doi = {10.1007/978-3-319-23826-5\_17},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/FertinJJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bibm/FertinJRR14,
author = {Guillaume Fertin and
G{\'{e}}raldine Jean and
Andreea Radulescu and
Irena Rusu},
editor = {Huiru Jane Zheng and
Werner Dubitzky and
Xiaohua Hu and
Jin{-}Kao Hao and
Daniel P. Berrar and
Kwang{-}Hyun Cho and
Yadong Wang and
David R. Gilbert},
title = {DExTaR: Detection of exact tandem repeats based on the de Bruijn graph},
booktitle = {2014 {IEEE} International Conference on Bioinformatics and Biomedicine,
{BIBM} 2014, Belfast, United Kingdom, November 2-5, 2014},
pages = {90--93},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/BIBM.2014.6999134},
doi = {10.1109/BIBM.2014.6999134},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/bibm/FertinJRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BulteauFK14,
author = {Laurent Bulteau and
Guillaume Fertin and
Christian Komusiewicz},
editor = {Alexander S. Kulikov and
Sergei O. Kuznetsov and
Pavel A. Pevzner},
title = {Reversal Distances for Strings with Few Blocks or Small Alphabets},
booktitle = {Combinatorial Pattern Matching - 25th Annual Symposium, {CPM} 2014,
Moscow, Russia, June 16-18, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8486},
pages = {50--59},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07566-2\_6},
doi = {10.1007/978-3-319-07566-2\_6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BulteauFK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/FertinJK14,
author = {Guillaume Fertin and
Shahrad Jamshidi and
Christian Komusiewicz},
editor = {Alfredo Ferro and
Fabrizio Luccio and
Peter Widmayer},
title = {Towards an Algorithmic Guide to Spiral Galaxies},
booktitle = {Fun with Algorithms - 7th International Conference, {FUN} 2014, Lipari
Island, Sicily, Italy, July 1-3, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8496},
pages = {171--182},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07890-8\_15},
doi = {10.1007/978-3-319-07890-8\_15},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/FertinJK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BulteauFR13,
author = {Laurent Bulteau and
Guillaume Fertin and
Irena Rusu},
title = {Maximal strip recovery problem with gaps: Hardness and approximation
algorithms},
journal = {J. Discrete Algorithms},
volume = {19},
pages = {1--22},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.12.006},
doi = {10.1016/J.JDA.2012.12.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BulteauFR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DondiFV13,
author = {Riccardo Dondi and
Guillaume Fertin and
St{\'{e}}phane Vialette},
title = {Finding approximate and constrained motifs in graphs},
journal = {Theor. Comput. Sci.},
volume = {483},
pages = {10--21},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.08.023},
doi = {10.1016/J.TCS.2012.08.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DondiFV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BulteauFR13,
author = {Laurent Bulteau and
Guillaume Fertin and
Irena Rusu},
title = {Revisiting the Minimum Breakpoint Linearization Problem},
journal = {Theor. Comput. Sci.},
volume = {494},
pages = {122--133},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.12.026},
doi = {10.1016/J.TCS.2012.12.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BulteauFR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/BulteauFKR13,
author = {Laurent Bulteau and
Guillaume Fertin and
Christian Komusiewicz and
Irena Rusu},
editor = {Aaron E. Darling and
Jens Stoye},
title = {A Fixed-Parameter Algorithm for Minimum Common String Partition with
Few Duplications},
booktitle = {Algorithms in Bioinformatics - 13th International Workshop, {WABI}
2013, Sophia Antipolis, France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8126},
pages = {244--258},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40453-5\_19},
doi = {10.1007/978-3-642-40453-5\_19},
timestamp = {Tue, 21 Mar 2023 21:00:29 +0100},
biburl = {https://dblp.org/rec/conf/wabi/BulteauFKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BulteauFKR13,
author = {Laurent Bulteau and
Guillaume Fertin and
Christian Komusiewicz and
Irena Rusu},
title = {A Fixed-Parameter Algorithm for Minimum Common String Partition with
Few Duplications},
journal = {CoRR},
volume = {abs/1307.7842},
year = {2013},
url = {http://arxiv.org/abs/1307.7842},
eprinttype = {arXiv},
eprint = {1307.7842},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BulteauFKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BulteauFR12,
author = {Laurent Bulteau and
Guillaume Fertin and
Irena Rusu},
title = {Sorting by Transpositions Is Difficult},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {3},
pages = {1148--1180},
year = {2012},
url = {https://doi.org/10.1137/110851390},
doi = {10.1137/110851390},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BulteauFR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BulteauFJR12,
author = {Laurent Bulteau and
Guillaume Fertin and
Minghui Jiang and
Irena Rusu},
title = {Tractability and approximability of maximal strip recovery},
journal = {Theor. Comput. Sci.},
volume = {440-441},
pages = {14--28},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.04.034},
doi = {10.1016/J.TCS.2012.04.034},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BulteauFJR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BulteauFR12,
author = {Laurent Bulteau and
Guillaume Fertin and
Irena Rusu},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {Pancake Flipping Is Hard},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {247--258},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_24},
doi = {10.1007/978-3-642-32589-2\_24},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BulteauFR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/FertinMR12,
author = {Guillaume Fertin and
Hafedh Mohamed{-}Babou and
Irena Rusu},
editor = {Ralf Klasing},
title = {Algorithms for Subnetwork Mining in Heterogeneous Networks},
booktitle = {Experimental Algorithms - 11th International Symposium, {SEA} 2012,
Bordeaux, France, June 7-9, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7276},
pages = {184--194},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30850-5\_17},
doi = {10.1007/978-3-642-30850-5\_17},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/FertinMR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FellowsFHV11,
author = {Michael R. Fellows and
Guillaume Fertin and
Danny Hermelin and
St{\'{e}}phane Vialette},
title = {Upper and lower bounds for finding connected motifs in vertex-colored
graphs},
journal = {J. Comput. Syst. Sci.},
volume = {77},
number = {4},
pages = {799--811},
year = {2011},
url = {https://doi.org/10.1016/j.jcss.2010.07.003},
doi = {10.1016/J.JCSS.2010.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FellowsFHV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DondiFV11,
author = {Riccardo Dondi and
Guillaume Fertin and
St{\'{e}}phane Vialette},
title = {Complexity issues in vertex-colored graph pattern matching},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {82--99},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.09.002},
doi = {10.1016/J.JDA.2010.09.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DondiFV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/BlinFMRSV11,
author = {Guillaume Blin and
Guillaume Fertin and
Hafedh Mohamed{-}Babou and
Irena Rusu and
Florian Sikora and
St{\'{e}}phane Vialette},
editor = {Weifan Wang and
Xuding Zhu and
Ding{-}Zhu Du},
title = {Algorithmic Aspects of Heterogeneous Biological Networks Comparison},
booktitle = {Combinatorial Optimization and Applications - 5th International Conference,
{COCOA} 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6831},
pages = {272--286},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22616-8\_22},
doi = {10.1007/978-3-642-22616-8\_22},
timestamp = {Tue, 28 Apr 2020 17:58:14 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/BlinFMRSV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BulteauFJR11,
author = {Laurent Bulteau and
Guillaume Fertin and
Minghui Jiang and
Irena Rusu},
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {Tractability and Approximability of Maximal Strip Recovery},
booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
Palermo, Italy, June 27-29, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6661},
pages = {336--349},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21458-5\_29},
doi = {10.1007/978-3-642-21458-5\_29},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BulteauFJR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/DondiFV11,
author = {Riccardo Dondi and
Guillaume Fertin and
St{\'{e}}phane Vialette},
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {Finding Approximate and Constrained Motifs in Graphs},
booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
Palermo, Italy, June 27-29, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6661},
pages = {388--401},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21458-5\_33},
doi = {10.1007/978-3-642-21458-5\_33},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/DondiFV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BulteauFR11,
author = {Laurent Bulteau and
Guillaume Fertin and
Irena Rusu},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Sorting by Transpositions Is Difficult},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {654--665},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_55},
doi = {10.1007/978-3-642-22006-7\_55},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BulteauFR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-0434,
author = {Laurent Bulteau and
Guillaume Fertin and
Irena Rusu},
title = {Pancake Flipping is Hard},
journal = {CoRR},
volume = {abs/1111.0434},
year = {2011},
url = {http://arxiv.org/abs/1111.0434},
eprinttype = {arXiv},
eprint = {1111.0434},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-0434.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FertinHRV10,
author = {Guillaume Fertin and
Danny Hermelin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
title = {Finding common structured patterns in linear graphs},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {26-28},
pages = {2475--2486},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.02.017},
doi = {10.1016/J.TCS.2010.02.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FertinHRV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/biocomp/CliquetFRT10,
author = {Freddy Cliquet and
Guillaume Fertin and
Irena Rusu and
Dominique Tessier},
editor = {Hamid R. Arabnia and
Quoc{-}Nam Tran and
Rui Chang and
Matthew He and
Andy Marsh and
Ashu M. G. Solo and
Jack Y. Yang},
title = {Proper Alignment of {MS/MS} Spectra from Unsequenced Species},
booktitle = {International Conference on Bioinformatics {\&} Computational
Biology, {BIOCOMP} 2010, July 12-15, 2010, Las Vegas Nevada, USA,
2 Volumes},
pages = {766--772},
publisher = {{CSREA} Press},
year = {2010},
timestamp = {Mon, 06 Dec 2010 13:28:59 +0100},
biburl = {https://dblp.org/rec/conf/biocomp/CliquetFRT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BulteauFR10,
author = {Laurent Bulteau and
Guillaume Fertin and
Irena Rusu},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {Revisiting the Minimum Breakpoint Linearization Problem},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {163--174},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_16},
doi = {10.1007/978-3-642-13562-0\_16},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/BulteauFR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-1157,
author = {Laurent Bulteau and
Guillaume Fertin and
Irena Rusu},
title = {Sorting by Transpositions is Difficult},
journal = {CoRR},
volume = {abs/1011.1157},
year = {2010},
url = {http://arxiv.org/abs/1011.1157},
eprinttype = {arXiv},
eprint = {1011.1157},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-1157.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0037390,
author = {Guillaume Fertin and
Anthony Labarre and
Irena Rusu and
Eric Tannier and
St{\'{e}}phane Vialette},
title = {Combinatorics of Genome Rearrangements},
series = {Computational molecular biology},
publisher = {{MIT} Press},
year = {2009},
url = {https://mitpress.mit.edu/books/combinatorics-genome-rearrangements},
isbn = {978-0-262-06282-4},
timestamp = {Mon, 15 Feb 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/0037390.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FertinV09,
author = {Guillaume Fertin and
St{\'{e}}phane Vialette},
title = {On the S-Labeling problem},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {273--277},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.044},
doi = {10.1016/J.ENDM.2009.07.044},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FertinV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FertinRV09,
author = {Guillaume Fertin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
title = {Finding occurrences of protein complexes in protein-protein interaction
graphs},
journal = {J. Discrete Algorithms},
volume = {7},
number = {1},
pages = {90--101},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.11.003},
doi = {10.1016/J.JDA.2008.11.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FertinRV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AngibaudFRTV09,
author = {S{\'{e}}bastien Angibaud and
Guillaume Fertin and
Irena Rusu and
Annelyse Th{\'{e}}venin and
St{\'{e}}phane Vialette},
title = {On the Approximability of Comparing Genomes with Duplicates},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {1},
pages = {19--53},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00175},
doi = {10.7155/JGAA.00175},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AngibaudFRTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bicob/AngibaudEFR09,
author = {S{\'{e}}bastien Angibaud and
Damien Eveillard and
Guillaume Fertin and
Irena Rusu},
editor = {Sanguthevar Rajasekaran},
title = {Comparing Bacterial Genomes by Searching Their Common Intervals},
booktitle = {Bioinformatics and Computational Biology, First International Conference,
BICoB 2009, New Orleans, LA, USA, April 8-10, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5462},
pages = {102--113},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00727-9\_12},
doi = {10.1007/978-3-642-00727-9\_12},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/bicob/AngibaudEFR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/FagnotFV09,
author = {Isabelle Fagnot and
Guillaume Fertin and
St{\'{e}}phane Vialette},
editor = {Hung Q. Ngo},
title = {On Finding Small 2-Generating Sets},
booktitle = {Computing and Combinatorics, 15th Annual International Conference,
{COCOON} 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5609},
pages = {378--387},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02882-3\_38},
doi = {10.1007/978-3-642-02882-3\_38},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/FagnotFV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/DondiFV09,
author = {Riccardo Dondi and
Guillaume Fertin and
St{\'{e}}phane Vialette},
editor = {Gregory Kucherov and
Esko Ukkonen},
title = {Maximum Motif Problem in Vertex-Colored Graphs},
booktitle = {Combinatorial Pattern Matching, 20th Annual Symposium, {CPM} 2009,
Lille, France, June 22-24, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5577},
pages = {221--235},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02441-2\_20},
doi = {10.1007/978-3-642-02441-2\_20},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/DondiFV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BulteauFR09,
author = {Laurent Bulteau and
Guillaume Fertin and
Irena Rusu},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Maximal Strip Recovery Problem with Gaps: Hardness and Approximation
Algorithms},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {710--719},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_72},
doi = {10.1007/978-3-642-10631-6\_72},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BulteauFR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/AngibaudFTV09,
author = {S{\'{e}}bastien Angibaud and
Guillaume Fertin and
Annelyse Th{\'{e}}venin and
St{\'{e}}phane Vialette},
editor = {Francesca D. Ciccarelli and
Istv{\'{a}}n Mikl{\'{o}}s},
title = {Pseudo Boolean Programming for Partially Ordered Genomes},
booktitle = {Comparative Genomics, International Workshop, {RECOMB-CG} 2009, Budapest,
Hungary, September 27-29, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5817},
pages = {126--137},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04744-2\_11},
doi = {10.1007/978-3-642-04744-2\_11},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/AngibaudFTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BlinFSV09,
author = {Guillaume Blin and
Guillaume Fertin and
Florian Sikora and
St{\'{e}}phane Vialette},
editor = {Sandip Das and
Ryuhei Uehara},
title = {The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {357--368},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_31},
doi = {10.1007/978-3-642-00202-1\_31},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/BlinFSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wob/CliquetFRT09,
author = {Freddy Cliquet and
Guillaume Fertin and
Irena Rusu and
Dominique Tessier},
editor = {Katia S. Guimar{\~{a}}es and
Anna R. Panchenko and
Teresa M. Przytycka},
title = {Comparison of Spectra in Unsequenced Species},
booktitle = {Advances in Bioinformatics and Computational Biology, 4th Brazilian
Symposium on Bioinformatics, {BSB} 2009, Porto Alegre, Brazil, July
29-31, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5676},
pages = {24--35},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03223-3\_3},
doi = {10.1007/978-3-642-03223-3\_3},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wob/CliquetFRT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FertinR08,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud},
title = {Acyclic coloring of graphs of maximum degree five: Nine colors are
enough},
journal = {Inf. Process. Lett.},
volume = {105},
number = {2},
pages = {65--72},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2007.08.022},
doi = {10.1016/J.IPL.2007.08.022},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FertinR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/AngibaudFRTV08,
author = {S{\'{e}}bastien Angibaud and
Guillaume Fertin and
Irena Rusu and
Annelyse Th{\'{e}}venin and
St{\'{e}}phane Vialette},
title = {Efficient Tools for Computing the Number of Breakpoints and the Number
of Adjacencies between Two Genomes with Duplicate Genes},
journal = {J. Comput. Biol.},
volume = {15},
number = {8},
pages = {1093--1115},
year = {2008},
url = {https://doi.org/10.1089/cmb.2008.0061},
doi = {10.1089/CMB.2008.0061},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/AngibaudFRTV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BlinFHV08,
author = {Guillaume Blin and
Guillaume Fertin and
Danny Hermelin and
St{\'{e}}phane Vialette},
title = {Fixed-parameter algorithms for protein similarity search under mRNA
structure constraints},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {618--626},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.03.004},
doi = {10.1016/J.JDA.2008.03.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BlinFHV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/AngibaudFR08,
author = {S{\'{e}}bastien Angibaud and
Guillaume Fertin and
Irena Rusu},
editor = {Shin{-}Ichi Nakano and
Md. Saidur Rahman},
title = {On the Approximability of Comparing Genomes with Duplicates},
booktitle = {{WALCOM:} Algorithms and Computation, Second International Workshop,
{WALCOM} 2008, Dhaka, Bangladesh, February 7-8, 2008},
series = {Lecture Notes in Computer Science},
volume = {4921},
pages = {34--45},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-77891-2\_4},
doi = {10.1007/978-3-540-77891-2\_4},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/AngibaudFR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-1103,
author = {S{\'{e}}bastien Angibaud and
Guillaume Fertin and
Irena Rusu and
Annelyse Th{\'{e}}venin and
St{\'{e}}phane Vialette},
title = {On the Approximability of Comparing Genomes with Duplicates},
journal = {CoRR},
volume = {abs/0806.1103},
year = {2008},
url = {http://arxiv.org/abs/0806.1103},
eprinttype = {arXiv},
eprint = {0806.1103},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-1103.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FertinR07,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud},
title = {L(p, q) labeling of d-dimensional grids},
journal = {Discret. Math.},
volume = {307},
number = {16},
pages = {2132--2140},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.12.057},
doi = {10.1016/J.DISC.2005.12.057},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FertinR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/AngibaudFRV07,
author = {S{\'{e}}bastien Angibaud and
Guillaume Fertin and
Irena Rusu and
St{\'{e}}phane Vialette},
title = {A Pseudo-Boolean Framework for Computing Rearrangement Distances between
Genomes with Duplicates},
journal = {J. Comput. Biol.},
volume = {14},
number = {4},
pages = {379--393},
year = {2007},
url = {https://doi.org/10.1089/cmb.2007.A001},
doi = {10.1089/CMB.2007.A001},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/AngibaudFRV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/BlinCFRV07,
author = {Guillaume Blin and
C{\'{e}}dric Chauve and
Guillaume Fertin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
title = {Comparing Genomes with Duplications: {A} Computational Complexity
Point of View},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {4},
number = {4},
pages = {523--534},
year = {2007},
url = {https://doi.org/10.1109/TCBB.2007.1069},
doi = {10.1109/TCBB.2007.1069},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/BlinCFRV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/BonizzoniVDFRV07,
author = {Paola Bonizzoni and
Gianluca Della Vedova and
Riccardo Dondi and
Guillaume Fertin and
Raffaella Rizzi and
St{\'{e}}phane Vialette},
title = {Exemplar Longest Common Subsequence},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {4},
number = {4},
pages = {535--543},
year = {2007},
url = {https://doi.org/10.1109/TCBB.2007.1066},
doi = {10.1109/TCBB.2007.1066},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/BonizzoniVDFRV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BlinFV07,
author = {Guillaume Blin and
Guillaume Fertin and
St{\'{e}}phane Vialette},
title = {Extracting constrained 2-interval subsets in 2-interval sets},
journal = {Theor. Comput. Sci.},
volume = {385},
number = {1-3},
pages = {241--263},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.07.002},
doi = {10.1016/J.TCS.2007.07.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BlinFV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/FertinHRV07,
author = {Guillaume Fertin and
Danny Hermelin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
editor = {Bin Ma and
Kaizhong Zhang},
title = {Common Structured Patterns in Linear Graphs: Approximation and Combinatorics},
booktitle = {Combinatorial Pattern Matching, 18th Annual Symposium, {CPM} 2007,
London, Canada, July 9-11, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4580},
pages = {241--252},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73437-6\_25},
doi = {10.1007/978-3-540-73437-6\_25},
timestamp = {Mon, 13 Mar 2023 16:58:28 +0100},
biburl = {https://dblp.org/rec/conf/cpm/FertinHRV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/escape/BlinFRS07,
author = {Guillaume Blin and
Guillaume Fertin and
Irena Rusu and
Christine Sinoquet},
editor = {Bo Chen and
Mike Paterson and
Guochuan Zhang},
title = {Extending the Hardness of {RNA} Secondary Structure Comparison},
booktitle = {Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
First International Symposium, {ESCAPE} 2007, Hangzhou, China, April
7-9, 2007, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4614},
pages = {140--151},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74450-4\_13},
doi = {10.1007/978-3-540-74450-4\_13},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/escape/BlinFRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FellowsFHV07,
author = {Michael R. Fellows and
Guillaume Fertin and
Danny Hermelin and
St{\'{e}}phane Vialette},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored
Graphs},
booktitle = {Automata, Languages and Programming, 34th International Colloquium,
{ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4596},
pages = {340--351},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_31},
doi = {10.1007/978-3-540-73420-8\_31},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FellowsFHV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/DondiFV07,
author = {Riccardo Dondi and
Guillaume Fertin and
St{\'{e}}phane Vialette},
editor = {Giuseppe F. Italiano and
Eugenio Moggi and
Luigi Laura},
title = {Weak pattern matching in colored graphs: Minimizing the number of
connected components},
booktitle = {Theoretical Computer Science, 10th Italian Conference, {ICTCS} 2007,
Rome, Italy, October 3-5, 2007, Proceedings},
pages = {27--38},
publisher = {World Scientific},
year = {2007},
timestamp = {Wed, 11 Jun 2008 08:55:26 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/DondiFV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/AngibaudFRTV07,
author = {S{\'{e}}bastien Angibaud and
Guillaume Fertin and
Irena Rusu and
Annelyse Th{\'{e}}venin and
St{\'{e}}phane Vialette},
editor = {Glenn Tesler and
Dannie Durand},
title = {A Pseudo-boolean Programming Approach for Computing the Breakpoint
Distance Between Two Genomes with Duplicate Genes},
booktitle = {Comparative Genomics, {RECOMB} 2007 International Workshop, {RECOMB-CG}
2007, San Diego, CA, USA, September 16-18, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4751},
pages = {16--29},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74960-8\_2},
doi = {10.1007/978-3-540-74960-8\_2},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/AngibaudFRTV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wob/BlinFHV07,
author = {Guillaume Blin and
Guillaume Fertin and
Ga{\"{e}}l Herry and
St{\'{e}}phane Vialette},
editor = {Marie{-}France Sagot and
Maria Em{\'{\i}}lia Telles Walter},
title = {Comparing {RNA} Structures: Towards an Intermediate Model Between
the Editand the LapcsProblems},
booktitle = {Advances in Bioinformatics and Computational Biology, Second Brazilian
Symposium on Bioinformatics, {BSB} 2007, Angra dos Reis, Brazil, August
29-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4643},
pages = {101--112},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73731-5\_10},
doi = {10.1007/978-3-540-73731-5\_10},
timestamp = {Tue, 02 Mar 2021 16:03:20 +0100},
biburl = {https://dblp.org/rec/conf/wob/BlinFHV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccS/BonizzoniVDFV06,
author = {Paola Bonizzoni and
Gianluca Della Vedova and
Riccardo Dondi and
Guillaume Fertin and
St{\'{e}}phane Vialette},
editor = {Vassil N. Alexandrov and
G. Dick van Albada and
Peter M. A. Sloot and
Jack J. Dongarra},
title = {Exemplar Longest Common Subsequence},
booktitle = {Computational Science - {ICCS} 2006, 6th International Conference,
Reading, UK, May 28-31, 2006, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {3992},
pages = {622--629},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758525\_85},
doi = {10.1007/11758525\_85},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/iccS/BonizzoniVDFV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccS/ChauveFRV06,
author = {C{\'{e}}dric Chauve and
Guillaume Fertin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
editor = {Vassil N. Alexandrov and
G. Dick van Albada and
Peter M. A. Sloot and
Jack J. Dongarra},
title = {Genomes Containing Duplicates Are Hard to Compare},
booktitle = {Computational Science - {ICCS} 2006, 6th International Conference,
Reading, UK, May 28-31, 2006, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {3992},
pages = {783--790},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758525\_105},
doi = {10.1007/11758525\_105},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iccS/ChauveFRV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/AngibaudFRV06,
author = {S{\'{e}}bastien Angibaud and
Guillaume Fertin and
Irena Rusu and
St{\'{e}}phane Vialette},
editor = {Guillaume Bourque and
Nadia El{-}Mabrouk},
title = {How Pseudo-boolean Programming Can Help Genome Rearrangement Distance
Computation},
booktitle = {Comparative Genomics, {RECOMB} 2006 International Workshop, {RCG}
2006, Montreal, Canada, September 24-26, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4205},
pages = {75--86},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11864127\_7},
doi = {10.1007/11864127\_7},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/AngibaudFRV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FertinLSS05,
author = {Guillaume Fertin and
Arthur L. Liestman and
Thomas C. Shermer and
Ladislav Stacho},
title = {Edge-disjoint spanners in Cartesian products of graphs},
journal = {Discret. Math.},
volume = {296},
number = {2-3},
pages = {167--186},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2005.04.004},
doi = {10.1016/J.DISC.2005.04.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FertinLSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcsb/BlinFRV05,
author = {Guillaume Blin and
Guillaume Fertin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
title = {What Makes the Arc-Preserving Subsequence Problem Hard?},
journal = {Trans. Comp. Sys. Biology},
volume = {2},
pages = {1--36},
year = {2005},
url = {https://doi.org/10.1007/11567752\_1},
doi = {10.1007/11567752\_1},
timestamp = {Thu, 14 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcsb/BlinFRV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccS/BlinFRV05,
author = {Guillaume Blin and
Guillaume Fertin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
editor = {Vaidy S. Sunderam and
G. Dick van Albada and
Peter M. A. Sloot and
Jack J. Dongarra},
title = {What Makes the Arc-Preserving Subsequence Problem Hard?},
booktitle = {Computational Science - {ICCS} 2005, 5th International Conference,
Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {3515},
pages = {860--868},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11428848\_110},
doi = {10.1007/11428848\_110},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/iccS/BlinFRV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FertinRV05,
author = {Guillaume Fertin and
Romeo Rizzi and
St{\'{e}}phane Vialette},
editor = {Joanna Jedrzejowicz and
Andrzej Szepietowski},
title = {Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein
Interaction Graphs},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International
Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3618},
pages = {328--339},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549345\_29},
doi = {10.1007/11549345\_29},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FertinRV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/BlinCF05,
author = {Guillaume Blin and
C{\'{e}}dric Chauve and
Guillaume Fertin},
editor = {Aoife McLysaght and
Daniel H. Huson},
title = {Genes Order and Phylogenetic Reconstruction: Application to \emph{gamma}-Proteobacteria},
booktitle = {Comparative Genomics, {RECOMB} 2005 International Workshop, {RCG}
2005, Dublin, Ireland, September 18-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3678},
pages = {11--20},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11554714\_2},
doi = {10.1007/11554714\_2},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/BlinCF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BlinFHV05,
author = {Guillaume Blin and
Guillaume Fertin and
Danny Hermelin and
St{\'{e}}phane Vialette},
editor = {Dieter Kratsch},
title = {Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA
Structure Constraints},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {271--282},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_24},
doi = {10.1007/11604686\_24},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BlinFHV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FertinR04,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud},
title = {A survey on Kn{\"{o}}del graphs},
journal = {Discret. Appl. Math.},
volume = {137},
number = {2},
pages = {173--195},
year = {2004},
url = {https://doi.org/10.1016/S0166-218X(03)00260-9},
doi = {10.1016/S0166-218X(03)00260-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FertinR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FertinRR04,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud and
Bruce A. Reed},
title = {Star coloring of graphs},
journal = {J. Graph Theory},
volume = {47},
number = {3},
pages = {163--182},
year = {2004},
url = {https://doi.org/10.1002/jgt.20029},
doi = {10.1002/JGT.20029},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FertinRR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChauveF04,
author = {C{\'{e}}dric Chauve and
Guillaume Fertin},
title = {On maximal instances for the original syntenic distance},
journal = {Theor. Comput. Sci.},
volume = {326},
number = {1-3},
pages = {29--43},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2004.05.006},
doi = {10.1016/J.TCS.2004.05.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChauveF04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BlinFV04,
author = {Guillaume Blin and
Guillaume Fertin and
St{\'{e}}phane Vialette},
editor = {S{\"{u}}leyman Cenk Sahinalp and
S. Muthukrishnan and
Ugur Dogrus{\"{o}}z},
title = {New Results for the 2-Interval Pattern Problem},
booktitle = {Combinatorial Pattern Matching, 15th Annual Symposium, {CPM} 2004,
Istanbul,Turkey, July 5-7, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3109},
pages = {311--322},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27801-6\_23},
doi = {10.1007/978-3-540-27801-6\_23},
timestamp = {Fri, 07 May 2021 12:57:04 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BlinFV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/FertinRS04,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud and
Ondrej S{\'{y}}kora},
editor = {Rastislav Kralovic and
Ondrej S{\'{y}}kora},
title = {No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes},
booktitle = {Structural Information and Communication Complexity, 11th International
Colloquium , {SIROCCO} 2004, Smolenice Castle, Slovakia, June 21-23,
2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3104},
pages = {138--148},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27796-5\_13},
doi = {10.1007/978-3-540-27796-5\_13},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/FertinRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AlonFLSS03,
author = {Noga Alon and
Guillaume Fertin and
Arthur L. Liestman and
Thomas C. Shermer and
Ladislav Stacho},
title = {Factor \emph{d}-domatic colorings of graphs},
journal = {Discret. Math.},
volume = {262},
number = {1-3},
pages = {17--25},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00518-6},
doi = {10.1016/S0012-365X(02)00518-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AlonFLSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FertinRR03,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud and
Arup Roychowdhury},
title = {On the oriented chromatic number of grids},
journal = {Inf. Process. Lett.},
volume = {85},
number = {5},
pages = {261--266},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(02)00405-2},
doi = {10.1016/S0020-0190(02)00405-2},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FertinRR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FertinGR03,
author = {Guillaume Fertin and
Emmanuel Godard and
Andr{\'{e}} Raspaud},
title = {Acyclic and k-distance coloring of the grid},
journal = {Inf. Process. Lett.},
volume = {87},
number = {1},
pages = {51--58},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(03)00232-1},
doi = {10.1016/S0020-0190(03)00232-1},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FertinGR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/ComellasFR03,
author = {Francesc Comellas and
Guillaume Fertin and
Andr{\'{e}} Raspaud},
editor = {Jop F. Sibeyn},
title = {Vertex Labeling and Routing in Recursive Clique-Trees, a New Family
of Small-World Scale-Free Graphs},
booktitle = {{SIROCCO} 10: Proceedings of the 10th Internaltional Colloquium on
Structural Information Complexity, June 18-20, 2003, Ume{\aa} Sweden},
series = {Proceedings in Informatics},
volume = {17},
pages = {73--87},
publisher = {Carleton Scientific},
year = {2003},
timestamp = {Thu, 05 Feb 2004 10:15:25 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/ComellasFR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FertinGR02,
author = {Guillaume Fertin and
Emmanuel Godard and
Andr{\'{e}} Raspaud},
title = {Minimum feedback vertex set and acyclic coloring},
journal = {Inf. Process. Lett.},
volume = {84},
number = {3},
pages = {131--139},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00265-X},
doi = {10.1016/S0020-0190(02)00265-X},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FertinGR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BaudonFH01,
author = {Olivier Baudon and
Guillaume Fertin and
Ivan Havel},
title = {Routing permutations and 2-1 routing requests in the hypercube},
journal = {Discret. Appl. Math.},
volume = {113},
number = {1},
pages = {43--58},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00386-3},
doi = {10.1016/S0166-218X(00)00386-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BaudonFH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FertinR01,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud},
title = {Neighborhood Communications in Networks},
journal = {Electron. Notes Discret. Math.},
volume = {10},
pages = {103--108},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00371-3},
doi = {10.1016/S1571-0653(04)00371-3},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FertinR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/FertinR01,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud},
editor = {Francesc Comellas and
Josep F{\`{a}}brega and
Pierre Fraigniaud},
title = {k-Neighborhood Broadcasting},
booktitle = {{SIROCCO} 8, Proceedings of the 8th International Colloquium on Structural
Information and Communication Complexity, Vall de N{\'{u}}ria,
Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001},
series = {Proceedings in Informatics},
volume = {8},
pages = {133--146},
publisher = {Carleton Scientific},
year = {2001},
timestamp = {Thu, 05 Feb 2004 10:15:17 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/FertinR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FertinRR01,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud and
Bruce A. Reed},
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {On Star Coloring of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
pages = {140--153},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2\_14},
doi = {10.1007/3-540-45477-2\_14},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FertinRR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fertin00,
author = {Guillaume Fertin},
title = {A study of minimum gossip graphs},
journal = {Discret. Math.},
volume = {215},
pages = {33--57},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00227-7},
doi = {10.1016/S0012-365X(99)00227-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fertin00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FertinR00,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud},
title = {Recognizing Recursive Circulant Graphs (Extended Abstract)},
journal = {Electron. Notes Discret. Math.},
volume = {5},
pages = {112--115},
year = {2000},
url = {https://doi.org/10.1016/S1571-0653(05)80139-8},
doi = {10.1016/S1571-0653(05)80139-8},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FertinR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Fertin00,
author = {Guillaume Fertin},
title = {Hierarchical broadcast and gossip networks},
journal = {Inf. Process. Lett.},
volume = {73},
number = {3-4},
pages = {131--136},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(00)00014-4},
doi = {10.1016/S0020-0190(00)00014-4},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Fertin00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FertinL00,
author = {Guillaume Fertin and
Roger Labahn},
title = {Compounding of gossip graphs},
journal = {Networks},
volume = {36},
number = {2},
pages = {126--137},
year = {2000},
url = {https://doi.org/10.1002/1097-0037(200009)36:2\&\#60;126::AID-NET8\&\#62;3.0.CO;2-3},
doi = {10.1002/1097-0037(200009)36:2\&\#60;126::AID-NET8\&\#62;3.0.CO;2-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FertinL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Fertin00,
author = {Guillaume Fertin},
title = {On the structure of minimum broadcast digraphs},
journal = {Theor. Comput. Sci.},
volume = {245},
number = {2},
pages = {203--216},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00282-0},
doi = {10.1016/S0304-3975(99)00282-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Fertin00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FertinRSSV00,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud and
Heiko Schr{\"{o}}der and
Ondrej S{\'{y}}kora and
Imrich Vrto},
editor = {Ulrik Brandes and
Dorothea Wagner},
title = {Diameter of the Kn{\"{o}}del Graph},
booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop,
{WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1928},
pages = {149--160},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40064-8\_15},
doi = {10.1007/3-540-40064-8\_15},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/FertinRSSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/Fertin99,
author = {Guillaume Fertin},
editor = {Cyril Gavoille and
Jean{-}Claude Bermond and
Andr{\'{e}} Raspaud},
title = {Trade-Offs for Add Gossiping},
booktitle = {SIROCCO'99, 6th International Colloquium on Structural Information
{\&} Communication Complexity, Lacanau-Ocean, France, 1-3 July,
1999},
pages = {137--152},
publisher = {Carleton Scientific},
year = {1999},
timestamp = {Tue, 18 Nov 2003 16:22:07 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/Fertin99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BaudonFH99,
author = {Olivier Baudon and
Guillaume Fertin and
Ivan Havel},
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan J. Eidenbenz},
title = {Routing Permutations in the Hypercube},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
{WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1665},
pages = {179--190},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46784-X\_19},
doi = {10.1007/3-540-46784-X\_19},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/wg/BaudonFH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FertinR98,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud},
editor = {Juraj Hromkovic and
Ondrej S{\'{y}}kora},
title = {Families of Graphs Having Broadcasting and Gossiping Properties},
booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
{WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1517},
pages = {63--77},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10692760\_6},
doi = {10.1007/10692760\_6},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FertinR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 01:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
