| 2023 | SPIRE | Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. | Guillaume Blin, Alexandru Popa, Mathieu Raffinot, Raluca Uricaru |
| 2019 | BIBE | Investigating Motility and Pattern Formation in Pluripotent Stem Cells Through Agent-Based Modeling. | Minhong Wang, Athanasios Tsanas, Guillaume Blin, Dave Robertson |
| 2018 | CPM | Nearest constrained circular words. | Guillaume Blin, Alexandre Blondin Mass, Marie Gasparoux, Sylvie Hamel, lise Vandomme |
| 2016 | IWOCA | SOBRA - Shielding Optimization for BRAchytherapy. | Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa |
| 2015 | SOFSEM | Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem. | Thomas Hume, Hayssam Soueidan, Macha Nikolski, Guillaume Blin |
| 2014 | IWOCA | Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. | Anna Adamaszek, Guillaume Blin, Alexandru Popa |
| 2014 | SOFSEM | Towards Unlocking the Full Potential of Multileaf Collimators. | Guillaume Blin, Paul Morel, Romeo Rizzi, Stphane Vialette |
| 2012 | CPM | Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. | Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stphane Vialette |
| 2012 | SOFSEM | Complexity Insights of the Minimum Duplication Problem. | Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora |
| 2012 | SPIRE | The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. | Guillaume Blin, Minghui Jiang, Stphane Vialette |
| 2012 | TAMC | An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. | Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi, Srinivas Aluru |
| 2011 | COCOA | Algorithmic Aspects of Heterogeneous Biological Networks Comparison. | Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stphane Vialette |
| 2011 | CSR | A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. | Guillaume Blin, Romeo Rizzi, Stphane Vialette |
| 2010 | CiE | A Faster Algorithm for Finding Minimum Tucker Submatrices. | Guillaume Blin, Romeo Rizzi, Stphane Vialette |
| 2010 | WALCOM | Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. | Guillaume Blin, Sylvie Hamel, Stphane Vialette |
| 2009 | RECOMB | Finding Nested Common Intervals Efficiently. | Guillaume Blin, Jens Stoye |
| 2009 | WALCOM | The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. | Guillaume Blin, Guillaume Fertin, Florian Sikora, Stphane Vialette |
| 2006 | RECOMB | Inferring Gene Orders from Gene Maps Using the Breakpoint Distance. | Guillaume Blin, Eric Blais, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk |
| 2006 | RECOMB | Inferring Positional Homologs with Common Intervals of Sequences. | Guillaume Blin, Annie Chateau, Cdric Chauve, Yannick Gingras |
| 2006 | SPIRE | How to Compare Arc-Annotated Sequences: The Alignment Hierarchy. | Guillaume Blin, Hlne Touzet |
| 2005 | COCOON | Conserved Interval Distance Computation Between Non-trivial Genomes. | Guillaume Blin, Romeo Rizzi |
| 2005 | ICCS | What Makes the Arc-Preserving Subsequence Problem Hard? | Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stphane Vialette |
| 2005 | RECOMB | Genes Order and Phylogenetic Reconstruction: Application to | Guillaume Blin, Cdric Chauve, Guillaume Fertin |
| 2005 | WG | Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. | Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stphane Vialette |
| 2004 | CPM | New Results for the 2-Interval Pattern Problem. | Guillaume Blin, Guillaume Fertin, Stphane Vialette |