Guillaume Blin

From MaRDI portal
Person:413296

Available identifiers

zbMath Open blin.guillaumeDBLP11/2469WikidataQ59189720 ScholiaQ59189720MaRDI QIDQ413296

List of research outcomes





PublicationDate of PublicationType
Approximation and fixed parameter algorithms for the approximate cover problem2024-05-29Paper
Nesting Tasks Dataset for 2D-Nesting Efficiency Estimation2022-05-25Dataset
https://portal.mardi4nfdi.de/entity/Q51407682020-12-16Paper
On the Approximability of the Minimum Weight $t$-partite Clique Problem2020-09-04Paper
SOBRA - Shielding Optimization for BRAchytherapy2016-09-29Paper
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem2015-09-15Paper
Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem2015-02-20Paper
Complexity insights of the minimum duplication problem2014-03-27Paper
Minimum mosaic inference of a set of recombinants2013-07-30Paper
A faster algorithm for finding minimum Tucker submatrices2012-12-07Paper
Medians of an odd number of permutations2012-09-18Paper
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths2012-08-14Paper
An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval2012-07-16Paper
Complexity Insights of the Minimum Duplication Problem2012-06-15Paper
On the parameterized complexity of the repetition free longest common subsequence problem2012-05-04Paper
Algorithmic Aspects of Heterogeneous Biological Networks Comparison2011-08-12Paper
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row2011-06-17Paper
A Faster Algorithm for Finding Minimum Tucker Submatrices2010-07-29Paper
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions2010-02-09Paper
Extending the Hardness of RNA Secondary Structure Comparison2009-03-03Paper
The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated2009-02-24Paper
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints2009-02-23Paper
How to Compare Arc-Annotated Sequences: The Alignment Hierarchy2008-09-04Paper
What Makes the Arc-Preserving Subsequence Problem Hard?2008-03-19Paper
Extracting constrained 2-interval subsets in 2-interval sets2007-10-18Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
Computing and Combinatorics2006-01-11Paper
Computational Science – ICCS 20052005-11-30Paper
Combinatorial Pattern Matching2005-09-07Paper

Research outcomes over time

This page was built for person: Guillaume Blin