Stéphane Vialette

According to our database1, Stéphane Vialette authored at least 88 papers between 2001 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Recognizing binary shuffle squares is NP-hard.
Theor. Comput. Sci., 2020

The Clever Shopper Problem.
Theory Comput. Syst., 2020

2019
Unshuffling Permutations: Trivial Bijections and Compositions.
Proceedings of the Theory and Applications of Models of Computation, 2019

Finding a Small Number of Colourful Components.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Algorithmic and algebraic aspects of unshuffling permutations.
Theor. Comput. Sci., 2018

Solving the tree containment problem in linear time for nearly stable phylogenetic networks.
Discret. Appl. Math., 2018

The S-labeling problem: An algorithmic tour.
Discret. Appl. Math., 2018

Pattern Matching for k-Track Permutations.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

The Clever Shopper Problem.
Proceedings of the Computer Science - Theory and Applications, 2018

2016
Two-Interval Pattern Problems.
Encyclopedia of Algorithms, 2016

Permutation Pattern matching in (213, 231)-avoiding permutations.
Discrete Mathematics & Theoretical Computer Science, 2016

Pattern Matching for Separable Permutations.
Proceedings of the String Processing and Information Retrieval, 2016

Unshuffling Permutations.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Sorting with Forbidden Intermediates.
Proceedings of the Algorithms for Computational Biology - Third International Conference, 2016

2015
Some algorithmic results for [2]-sumset covers.
Inf. Process. Lett., 2015

Pattern matching in $(213, 231)$-avoiding permutations.
CoRR, 2015

Locating a Tree in a Phylogenetic Network in Quadratic Time.
Proceedings of the Research in Computational Molecular Biology, 2015

Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

Algorithmic Aspects of the S-Labeling Problem.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

Obtaining a Triangular Matrix by Independent Row-Column Permutations.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

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

2013
Finding approximate and constrained motifs in graphs.
Theor. Comput. Sci., 2013

On the combinatorics of suffix arrays.
Inf. Process. Lett., 2013

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

Single and Multiple Consecutive Permutation Motif Search.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

On Recognizing Words That Are Squares for the Shuffle Product.
Proceedings of the Computer Science - Theory and Applications, 2013

Flexible RNA design under structure and sequence constraints using formal languages.
Proceedings of the ACM Conference on Bioinformatics, 2013

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

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

Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

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

2011
Approximation of RNA multiple structural alignment.
J. Discrete Algorithms, 2011

Complexity issues in vertex-colored graph pattern matching.
J. Discrete Algorithms, 2011

Upper and lower bounds for finding connected motifs in vertex-colored graphs.
J. Comput. Syst. Sci., 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
Finding common structured patterns in linear graphs.
Theor. Comput. Sci., 2010

Complexity issues in color-preserving graph embeddings.
Theor. Comput. Sci., 2010

Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set.
IEEE/ACM Trans. Comput. Biology Bioinform., 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

Algorithmic Contributions to Computational Molecular Biology.
, 2010

2009
On the parameterized complexity of multiple-interval graph problems.
Theor. Comput. Sci., 2009

On the Approximability of Comparing Genomes with Duplicates.
J. Graph Algorithms Appl., 2009

Finding occurrences of protein complexes in protein-protein interaction graphs.
J. Discrete Algorithms, 2009

RECOMB-Comparative Genomics Special Issue.
Journal of Computational Biology, 2009

On the S-Labeling problem.
Electron. Notes Discret. Math., 2009

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

Pseudo Boolean Programming for Partially Ordered Genomes.
Proceedings of the Comparative Genomics, International Workshop, 2009

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

Pattern Matching for 321-Avoiding Permutations.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Maximum Motif Problem in Vertex-Colored Graphs.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

On Finding Small 2-Generating Sets.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

Combinatorics of Genome Rearrangements.
Computational molecular biology, MIT Press, ISBN: 978-0-262-06282-4, 2009

2008
Two-Interval Pattern Problems.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Approximating the 2-interval pattern problem.
Theor. Comput. Sci., 2008

Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs.
J. Discrete Algorithms, 2008

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

Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes.
Journal of Computational Biology, 2008

The Minimum Substring Cover problem.
Inf. Comput., 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

Exemplar Longest Common Subsequence.
IEEE/ACM Trans. Comput. Biology Bioinform., 2007

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

A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates.
Journal of Computational Biology, 2007

Longest Common Separable Pattern between Permutations
CoRR, 2007

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

On Restrictions of Balanced 2-Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes.
Proceedings of the Comparative Genomics, RECOMB 2007 International Workshop, 2007

Weak pattern matching in colored graphs: Minimizing the number of connected components.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Pattern Matching in Protein-Protein Interaction Graphs.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Common Structured Patterns in Linear Graphs: Approximation and Combinatorics.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Longest Common Separable Pattern Among Permutations.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Packing of (0, 1)-matrices.
ITA, 2006

Comparing gene expression networks in a multi-dimensional space to extract similarities and differences between organisms.
Bioinformatics, 2006

How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation.
Proceedings of the Comparative Genomics, 2006

Genomes Containing Duplicates Are Hard to Compare.
Proceedings of the Computational Science, 2006

Exemplar Longest Common Subsequence.
Proceedings of the Computational Science, 2006

2005
What Makes the Arc-Preserving Subsequence Problem Hard?
Trans. Computational Systems Biology, 2005

Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Approximating the 2-Interval Pattern Problem.
Proceedings of the Algorithms, 2005

2004
On the computational complexity of 2-interval pattern matching problems.
Theor. Comput. Sci., 2004

yMGV: a cross-species expression data mining tool.
Nucleic Acids Research, 2004

MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states.
BMC Bioinformatics, 2004

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

2002
Pattern Matching Problems over 2-Interval Sets.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
Aspects algorithmiques de la prédiction des structures secondaires d'ARN.
PhD thesis, 2001


  Loading...