( en | de | ru )

 

Disambiguation of "Fertin, Guillaume"

Author of the publication

copydeleteadd this publication to your clipboard
Pancake Flipping is hard.

, , and . J. Comput. Syst. Sci., 81 (8): 1556-1574 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Guillaume Pierre

Guillaume Klein

Guillaume Schurgers

Guillaume Weick

Guillaume Jacques

 

Other publications of authors with the same name

Combinatorics of Genome Rearrangements., , , , and . Computational molecular biology MIT Press, (2009)Maximum Motif Problem in Vertex-Colored Graphs., , and . CPM, volume 5577 of Lecture Notes in Computer Science, page 221-235. Springer, (2009)Exemplar Longest Common Subsequence., , , , and . International Conference on Computational Science (2), volume 3992 of Lecture Notes in Computer Science, page 622-629. Springer, (2006)Odd gossiping., , , and . Discret. Appl. Math., (2017)Towards an Algorithmic Guide to Spiral Galaxies., , and . FUN, volume 8496 of Lecture Notes in Computer Science, page 171-182. Springer, (2014)Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs., , , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 340-351. Springer, (2007)On Finding Small 2-Generating Sets., , and . COCOON, volume 5609 of Lecture Notes in Computer Science, page 378-387. Springer, (2009)Finding a Small Number of Colourful Components., , , , , and . CPM, volume 128 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs., , and . MFCS, volume 3618 of Lecture Notes in Computer Science, page 328-339. Springer, (2005)Finding Approximate and Constrained Motifs in Graphs., , and . CPM, volume 6661 of Lecture Notes in Computer Science, page 388-401. Springer, (2011)