default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Blin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Corentin Lallier
, Guillaume Blin, Bruno Pinaud, Laurent Vézard:
Graph neural network comparison for 2D nesting efficiency estimation. J. Intell. Manuf. 35(2): 859-873 (2024)- 2023
- [c37]Guillaume Blin, Alexandru Popa, Mathieu Raffinot, Raluca Uricaru:
Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. SPIRE 2023: 75-88 - 2022
- [c36]Bruno Thiao-Layel, Vianney Jouhet, Guillaume Blin, Gayo Diallo:
Enabling Biomedical Semantic Knowledge Resource's Paths with the K-Ware Platform. ICHI 2022: 513-514 - [c35]Bruno Thiao-Layel, Vianney Jouhet, Guillaume Blin, Gayo Diallo:
REDIRECT: Mapping Drug Prescriptions and Evidence from Biomedical Literature. MIE 2022: 419-420 - 2020
- [j16]Geoffrey Solano, Guillaume Blin, Mathieu Raffinot, Jhoirene B. Clemente, Jaime Caro:
On the Approximability of the Minimum Weight $t$-partite Clique Problem. J. Graph Algorithms Appl. 24(3): 171-190 (2020) - [c34]Minhong Wang, Athanasios Tsanas, Guillaume Blin, Dave Robertson:
Assessing Preferred Proximity Between Different Types of Embryonic Stem Cells. BIOSIGNALS 2020: 377-381
2010 – 2019
- 2019
- [c33]Minhong Wang, Athanasios Tsanas, Guillaume Blin, Dave Robertson:
Investigating Motility and Pattern Formation in Pluripotent Stem Cells Through Agent-Based Modeling. BIBE 2019: 909-913 - 2018
- [c32]Minhong Wang, David Robertson, Guillaume Blin, Sally Lowell, Thanasis Tsanas:
Agent-Based Modelling of Pattern Formation in Pluripotent Stem Cells: Initial Experiments and Results. CISP-BMEI 2018: 1-5 - [c31]Guillaume Blin, Alexandre Blondin Massé, Marie Gasparoux, Sylvie Hamel, Élise Vandomme:
Nearest constrained circular words. CPM 2018: 6:1-6:14 - 2016
- [c30]Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa:
SOBRA - Shielding Optimization for BRAchytherapy. IWOCA 2016: 309-320 - 2015
- [b3]Olivier Curé, Guillaume Blin:
RDF Database Systems: Triples Storage and SPARQL Query Processing. Morgan Kaufmann 2015, ISBN 978-0-12-799957-9 - [j15]Mohammed El-Kebir, Hayssam Soueidan, Thomas Hume, Daniela Beisser, Marcus T. Dittrich, Tobias Müller, Guillaume Blin, Jaap Heringa, Macha Nikolski, Lodewyk F. A. Wessels, Gunnar W. Klau:
xHeinz: an algorithm for mining cross-species network modules under a flexible conservation model. Bioinform. 31(19): 3147-3155 (2015) - [j14]Bryan Brancotte, Bo Yang, Guillaume Blin, Sarah Cohen Boulakia, Alain Denise, Sylvie Hamel:
Rank aggregation with ties: Experiments and Analysis. Proc. VLDB Endow. 8(11): 1202-1213 (2015) - [c29]Thomas Hume, Hayssam Soueidan, Macha Nikolski, Guillaume Blin:
Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem. SOFSEM 2015: 242-253 - 2014
- [j13]Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora:
Complexity insights of the Minimum Duplication problem. Theor. Comput. Sci. 530: 66-79 (2014) - [c28]Olivier Curé, Guillaume Blin, Dominique Revuz, David Célestin Faye:
WaterFowl: A Compact, Self-indexed and Inference-Enabled Immutable RDF Store. ESWC 2014: 302-316 - [c27]Anna Adamaszek, Guillaume Blin, Alexandru Popa:
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. IWOCA 2014: 13-23 - [c26]Olivier Curé, Guillaume Blin:
An update strategy for the WaterFowl RDF data store. ISWC (Posters & Demos) 2014: 377-380 - [c25]Guillaume Blin, Paul Morel, Romeo Rizzi, Stéphane Vialette:
Towards Unlocking the Full Potential of Multileaf Collimators. SOFSEM 2014: 138-149 - [i3]Olivier Curé, Guillaume Blin, Dominique Revuz, David C. Faye:
WaterFowl, a Compact, Self-indexed RDF Store with Inference-enabled Dictionaries. CoRR abs/1401.5051 (2014) - 2013
- [j12]Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Minimum Mosaic Inference of a Set of Recombinants. Int. J. Found. Comput. Sci. 24(1): 51-66 (2013) - [i2]Olivier Curé, David C. Faye, Guillaume Blin:
Towards a better insight of RDF triples Ontology-guided Storage system abilities. CoRR abs/1306.6670 (2013) - 2012
- [b2]Guillaume Blin:
Combinatorial Objects in Bio-Algorithmics: Related problems and complexities. University of Paris-Est, France, 2012 - [j11]David Célestin Faye, Olivier Curé, Guillaume Blin:
A survey of RDF storage approaches. ARIMA J. 15: 2 (2012) - [j10]Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora:
On the parameterized complexity of the repetition free longest common subsequence problem. Inf. Process. Lett. 112(7): 272-276 (2012) - [j9]Guillaume Blin, Romeo Rizzi, Stéphane Vialette:
A Faster Algorithm for Finding Minimum Tucker Submatrices. Theory Comput. Syst. 51(3): 270-281 (2012) - [c24]Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette:
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. CPM 2012: 138-148 - [c23]Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora:
Complexity Insights of the Minimum Duplication Problem. SOFSEM 2012: 153-164 - [c22]Guillaume Blin, Minghui Jiang, Stéphane Vialette:
The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. SPIRE 2012: 130-142 - [c21]Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi, Srinivas Aluru:
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. TAMC 2012: 319-329 - 2011
- [c20]Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Minimum Mosaic Inference of a Set of Recombinants. CATS 2011: 23-30 - [c19]Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette:
Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA 2011: 272-286 - [c18]Guillaume Blin, Romeo Rizzi, Stéphane Vialette:
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. CSR 2011: 373-384 - [c17]David C. Faye, Olivier Curé, Guillaume Blin, Cheikh Thiam:
RDF triples management in roStore. IC 2011: 755-770 - 2010
- [j8]Guillaume Blin, David C. Faye, Jens Stoye:
Finding Nested Common Intervals Efficiently. J. Comput. Biol. 17(9): 1183-1194 (2010) - [j7]Guillaume Blin, Alain Denise, Serge Dulucq, Claire Herrbach, Hélène Touzet:
Alignments of RNA Structures. IEEE ACM Trans. Comput. Biol. Bioinform. 7(2): 309-322 (2010) - [j6]Guillaume Blin, Florian Sikora, Stéphane Vialette:
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 628-635 (2010) - [c16]Guillaume Blin, Florian Sikora, Stéphane Vialette:
GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks. BICoB 2010: 38-43 - [c15]Guillaume Blin, Romeo Rizzi, Stéphane Vialette:
A Faster Algorithm for Finding Minimum Tucker Submatrices. CiE 2010: 69-77 - [c14]Guillaume Blin, Sylvie Hamel, Stéphane Vialette:
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. WALCOM 2010: 149-160
2000 – 2009
- 2009
- [c13]Guillaume Blin, Florian Sikora, Stéphane Vialette:
Querying Protein-Protein Interaction Networks. ISBRA 2009: 52-62 - [c12]Guillaume Blin, Jens Stoye:
Finding Nested Common Intervals Efficiently. RECOMB-CG 2009: 59-69 - [c11]Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette:
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM 2009: 357-368 - 2008
- [j5]Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms 6(4): 618-626 (2008) - [i1]Guillaume Blin, Sylvie Hamel, Stéphane Vialette:
Comparing RNA structures using a full set of biologically relevant edit operations is intractable. CoRR abs/0812.3946 (2008) - 2007
- [j4]Guillaume Blin, Eric Blais, Danny Hermelin, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk:
Gene Maps Linearization Using Genomic Rearrangement Distances. J. Comput. Biol. 14(4): 394-407 (2007) - [j3]Guillaume Blin, Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Comparing Genomes with Duplications: A Computational Complexity Point of View. IEEE ACM Trans. Comput. Biol. Bioinform. 4(4): 523-534 (2007) - [j2]Guillaume Blin, Guillaume Fertin, Stéphane Vialette:
Extracting constrained 2-interval subsets in 2-interval sets. Theor. Comput. Sci. 385(1-3): 241-263 (2007) - [c10]Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet:
Extending the Hardness of RNA Secondary Structure Comparison. ESCAPE 2007: 140-151 - [c9]Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette:
Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. BSB 2007: 101-112 - 2006
- [c8]Guillaume Blin, Annie Chateau, Cédric Chauve, Yannick Gingras:
Inferring Positional Homologs with Common Intervals of Sequences. Comparative Genomics 2006: 24-38 - [c7]Guillaume Blin, Eric Blais, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk:
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance. Comparative Genomics 2006: 99-112 - [c6]Guillaume Blin, Hélène Touzet:
How to Compare Arc-Annotated Sequences: The Alignment Hierarchy. SPIRE 2006: 291-303 - 2005
- [b1]Guillaume Blin:
Combinatoire and Bio-informatique : Comparaison de structures d'ARN et calcul de distances intergénomiques. (Combinatorics and Bioinformatic : RNA structure comparison and intergenomic distance computation). University of Nantes, France, 2005 - [j1]Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
What Makes the Arc-Preserving Subsequence Problem Hard? Trans. Comp. Sys. Biology 2: 1-36 (2005) - [c5]Guillaume Blin, Romeo Rizzi:
Conserved Interval Distance Computation Between Non-trivial Genomes. COCOON 2005: 22-31 - [c4]Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
What Makes the Arc-Preserving Subsequence Problem Hard? International Conference on Computational Science (2) 2005: 860-868 - [c3]Guillaume Blin, Cédric Chauve, Guillaume Fertin:
Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria. Comparative Genomics 2005: 11-20 - [c2]Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG 2005: 271-282 - 2004
- [c1]Guillaume Blin, Guillaume Fertin, Stéphane Vialette:
New Results for the 2-Interval Pattern Problem. CPM 2004: 311-322
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:01 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:
