Guillaume Blin

Orcid: 0000-0002-0708-0838

According to our database1, Guillaume Blin authored at least 55 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graph neural network comparison for 2D nesting efficiency estimation.
J. Intell. Manuf., February, 2024

2023
Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem.
Proceedings of the String Processing and Information Retrieval, 2023

2022
REDIRECT: Mapping Drug Prescriptions and Evidence from Biomedical Literature.
Proceedings of the Challenges of Trustable AI and Added-Value on Health, 2022

Enabling Biomedical Semantic Knowledge Resource's Paths with the K-Ware Platform.
Proceedings of the 10th IEEE International Conference on Healthcare Informatics, 2022

2020
On the Approximability of the Minimum Weight $t$-partite Clique Problem.
J. Graph Algorithms Appl., 2020

Assessing Preferred Proximity Between Different Types of Embryonic Stem Cells.
Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2020), 2020

2019
Investigating Motility and Pattern Formation in Pluripotent Stem Cells Through Agent-Based Modeling.
Proceedings of the 19th IEEE International Conference on Bioinformatics and Bioengineering, 2019

2018
Nearest constrained circular words.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Agent-Based Modelling of Pattern Formation in Pluripotent Stem Cells: Initial Experiments and Results.
Proceedings of the 11th International Congress on Image and Signal Processing, 2018

2016
SOBRA - Shielding Optimization for BRAchytherapy.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015
Rank aggregation with ties: Experiments and Analysis.
Proc. VLDB Endow., 2015

xHeinz: an algorithm for mining cross-species network modules under a flexible conservation model.
Bioinform., 2015

Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

RDF Database Systems: Triples Storage and SPARQL Query Processing
Morgan Kaufmann, ISBN: 978-0-12-799957-9, 2015

2014
Complexity insights of the Minimum Duplication problem.
Theor. Comput. Sci., 2014

WaterFowl, a Compact, Self-indexed RDF Store with Inference-enabled Dictionaries.
CoRR, 2014

Towards Unlocking the Full Potential of Multileaf Collimators.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

An update strategy for the WaterFowl RDF data store.
Proceedings of the ISWC 2014 Posters & Demonstrations Track a track within the 13th International Semantic Web Conference, 2014

Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

WaterFowl: A Compact, Self-indexed and Inference-Enabled Immutable RDF Store.
Proceedings of the Semantic Web: Trends and Challenges - 11th International Conference, 2014

2013
Minimum Mosaic Inference of a Set of Recombinants.
Int. J. Found. Comput. Sci., 2013

Towards a better insight of RDF triples Ontology-guided Storage system abilities.
CoRR, 2013

2012
A Faster Algorithm for Finding Minimum Tucker Submatrices.
Theory Comput. Syst., 2012

On the parameterized complexity of the repetition free longest common subsequence problem.
Inf. Process. Lett., 2012

A survey of RDF storage approaches.
ARIMA J., 2012

An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval.
Proceedings of the Theory and Applications of Models of Computation, 2012

The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences.
Proceedings of the String Processing and Information Retrieval, 2012

Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Combinatorial Objects in Bio-Algorithmics: Related problems and complexities.
, 2012

2011
RDF triples management in roStore.
Proceedings of the IC 2011 : 22es journées Ingénierie des Connaissances (Proceedings of the 22nd French Knowledge Engineering Conference), 2011

A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row.
Proceedings of the Computer Science - Theory and Applications, 2011

Algorithmic Aspects of Heterogeneous Biological Networks Comparison.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Alignments of RNA Structures.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Finding Nested Common Intervals Efficiently.
J. Comput. Biol., 2010

Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks.
Proceedings of the ISCA 2nd International Conference on Bioinformatics and Computational Biology, 2010

2009
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Finding Nested Common Intervals Efficiently.
Proceedings of the Comparative Genomics, International Workshop, 2009

Querying Protein-Protein Interaction Networks.
Proceedings of the Bioinformatics Research and Applications, 5th International Symposium, 2009

2008
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints.
J. Discrete Algorithms, 2008

Comparing RNA structures using a full set of biologically relevant edit operations is intractable
CoRR, 2008

2007
Extracting constrained 2-interval subsets in 2-interval sets.
Theor. Comput. Sci., 2007

Comparing Genomes with Duplications: A Computational Complexity Point of View.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

Gene Maps Linearization Using Genomic Rearrangement Distances.
J. Comput. Biol., 2007

Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2007

Extending the Hardness of RNA Secondary Structure Comparison.
Proceedings of the Combinatorics, 2007

2006
How to Compare Arc-Annotated Sequences: The Alignment Hierarchy.
Proceedings of the String Processing and Information Retrieval, 2006

Inferring Positional Homologs with Common Intervals of Sequences.
Proceedings of the Comparative Genomics, 2006

Inferring Gene Orders from Gene Maps Using the Breakpoint Distance.
Proceedings of the Comparative Genomics, 2006

2005
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).
PhD thesis, 2005

What Makes the Arc-Preserving Subsequence Problem Hard?
Trans. Comp. Sys. Biology, 2005

Genes Order and Phylogenetic Reconstruction: Application to <i>gamma</i>-Proteobacteria.
Proceedings of the Comparative Genomics, 2005

Conserved Interval Distance Computation Between Non-trivial Genomes.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
New Results for the 2-Interval Pattern Problem.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004


  Loading...