Stéphane Vialette

128 papers A* 1A 2B 30C 8Misc 7Journal 63Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms. CPM Cyril Nicaud, Carine Pivoteau, Stéphane Vialette
2025	J	`jnl`	Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms. CoRR Cyril Nicaud, Carine Pivoteau, Stéphane Vialette
2025	J	`jnl`	Quasi-kernels in split graphs. Discret. Appl. Math. Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette, Yacong Zhou
2025	J	`jnl`	Recognizing unit multiple interval graphs is hard. Discret. Appl. Math. Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2024	B	`conf`	Generalizing Roberts' Characterization of Unit Interval Graphs. MFCS Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
2024	J	`jnl`	Generalizing Roberts' characterization of unit interval graphs. CoRR Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette
2024	J	`jnl`	Parity Permutation Pattern Matching. Algorithmica Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette
2024	J	`jnl`	The Maximum Zero-Sum Partition problem. Theor. Comput. Sci. Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette
2023	J	`jnl`	On recognising words that are squares for the shuffle product. Theor. Comput. Sci. Romeo Rizzi, Stéphane Vialette
2023	J	`jnl`	On shuffled-square-free words. Theor. Comput. Sci. Laurent Bulteau, Vincent Jugé, Stéphane Vialette
2023	B	`conf`	Parity Permutation Pattern Matching. WALCOM Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette
2023	J	`jnl`	Quasi-kernels in split graphs. CoRR Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
2023	B	`conf`	Recognizing Unit Multiple Intervals Is Hard. ISAAC Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2023	J	`jnl`	Recognizing unit multiple intervals is hard. CoRR Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2022	B	`conf`	Algorithmic Aspects of Small Quasi-Kernels. WG Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
2022	B	`conf`	Permutation Pattern Matching for Doubly Partially Ordered Patterns. CPM Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette
2022	A	`conf`	The Maximum Zero-Sum Partition Problem. ICS Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette
2021	J	`jnl`	Algorithmic aspects of quasi-kernels. CoRR Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette
2021	B	`conf`	Disorders and Permutations. CPM Laurent Bulteau, Samuele Giraudo, Stéphane Vialette
2021	J	`jnl`	Efficient, robust and effective rank aggregation for massive biological datasets. Future Gener. Comput. Syst. Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette
2020	J	`jnl`	Recognizing binary shuffle squares is NP-hard. Theor. Comput. Sci. Laurent Bulteau, Stéphane Vialette
2020	J	`jnl`	Sorting with forbidden intermediates. Discret. Appl. Math. Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
2020	J	`jnl`	The Clever Shopper Problem. Theory Comput. Syst. Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette
2019	B	`conf`	Finding a Small Number of Colourful Components. CPM Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
2019	—	`conf`	Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data. eScience Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette
2019	C	`conf`	Unshuffling Permutations: Trivial Bijections and Compositions. TAMC Guillaume Fertin, Samuele Giraudo, Sylvie Hamel, Stéphane Vialette
2018	J	`jnl`	Algorithmic and algebraic aspects of unshuffling permutations. CoRR Samuele Giraudo, Stéphane Vialette
2018	J	`jnl`	Algorithmic and algebraic aspects of unshuffling permutations. Theor. Comput. Sci. Samuele Giraudo, Stéphane Vialette
2018	J	`jnl`	Finding a Small Number of Colourful Components. CoRR Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
2018	C	`conf`	Pattern Matching for k-Track Permutations. IWOCA Laurent Bulteau, Romeo Rizzi, Stéphane Vialette
2018	J	`jnl`	Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discret. Appl. Math. Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang
2018	Misc	`conf`	The Clever Shopper Problem. CSR Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette
2018	J	`jnl`	The Clever Shopper Problem. CoRR Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette
2018	J	`jnl`	The S-labeling problem: An algorithmic tour. Discret. Appl. Math. Guillaume Fertin, Irena Rusu, Stéphane Vialette
2016	C	`conf`	Pattern Matching for Separable Permutations. SPIRE Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
2016	J	`jnl`	Permutation Pattern matching in (213, 231)-avoiding permutations. Discret. Math. Theor. Comput. Sci. Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
2016	J	`jnl`	Sorting With Forbidden Intermediates. CoRR Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
2016	—	`conf`	Sorting with Forbidden Intermediates. AlCoB Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette
2016	—	`ch.`	Two-Interval Pattern Problems. Encyclopedia of Algorithms Stéphane Vialette
2016	B	`conf`	Unshuffling Permutations. LATIN Samuele Giraudo, Stéphane Vialette
2016	J	`jnl`	Unshuffling Permutations. CoRR Samuele Giraudo, Stéphane Vialette
2015	C	`conf`	Algorithmic Aspects of the S-Labeling Problem. IWOCA Guillaume Fertin, Irena Rusu, Stéphane Vialette
2015	B	`conf`	Locating a Tree in a Phylogenetic Network in Quadratic Time. RECOMB Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang
2015	J	`jnl`	Locating a Tree in a Phylogenetic Network in Quadratic Time. CoRR Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang
2015	B	`conf`	Obtaining a Triangular Matrix by Independent Row-Column Permutations. ISAAC Guillaume Fertin, Irena Rusu, Stéphane Vialette
2015	J	`jnl`	Pattern matching in $(213, 231)$-avoiding permutations. CoRR Both Emerite Neou, Romeo Rizzi, Stéphane Vialette
2015	C	`conf`	Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. IWOCA Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang
2015	J	`jnl`	Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2014	B	`conf`	Towards Unlocking the Full Potential of Multileaf Collimators. SOFSEM Guillaume Blin, Paul Morel, Romeo Rizzi, Stéphane Vialette
2013	J	`jnl`	Finding approximate and constrained motifs in graphs. Theor. Comput. Sci. Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2013	—	`conf`	Flexible RNA design under structure and sequence constraints using formal languages. BCB Yu Zhou, Yann Ponty, Stéphane Vialette, Jérôme Waldispühl, Yi Zhang, Alain Denise
2013	J	`jnl`	Minimum Mosaic Inference of a Set of Recombinants. Int. J. Found. Comput. Sci. Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2013	Misc	`conf`	On Recognizing Words That Are Squares for the Shuffle Product. CSR Romeo Rizzi, Stéphane Vialette
2013	J	`jnl`	On the combinatorics of suffix arrays. Inf. Process. Lett. Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette
2013	B	`conf`	Single and Multiple Consecutive Permutation Motif Search. ISAAC Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
2013	J	`jnl`	Single and multiple consecutive permutation motif search CoRR Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
2012	J	`jnl`	A Faster Algorithm for Finding Minimum Tucker Submatrices. Theory Comput. Syst. Guillaume Blin, Romeo Rizzi, Stéphane Vialette
2012	B	`conf`	Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC Danny Hermelin, Romeo Rizzi, Stéphane Vialette
2012	B	`conf`	Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. CPM Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette
2012	J	`jnl`	On the combinatorics of suffix arrays CoRR Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette
2012	C	`conf`	The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. SPIRE Guillaume Blin, Minghui Jiang, Stéphane Vialette
2011	Misc	`conf`	A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. CSR Guillaume Blin, Romeo Rizzi, Stéphane Vialette
2011	C	`conf`	Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette
2011	J	`jnl`	Approximation of RNA multiple structural alignment. J. Discrete Algorithms Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen
2011	J	`jnl`	Complexity issues in vertex-colored graph pattern matching. J. Discrete Algorithms Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2011	B	`conf`	Finding Approximate and Constrained Motifs in Graphs. CPM Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2011	—	`conf`	Minimum Mosaic Inference of a Set of Recombinants. CATS Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette
2011	J	`jnl`	Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2010	C	`conf`	A Faster Algorithm for Finding Minimum Tucker Submatrices. CiE Guillaume Blin, Romeo Rizzi, Stéphane Vialette
2010	—	`book`	Algorithmic Contributions to Computational Molecular Biology. Stéphane Vialette
2010	B	`conf`	Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. WALCOM Guillaume Blin, Sylvie Hamel, Stéphane Vialette
2010	J	`jnl`	Complexity issues in color-preserving graph embeddings. Theor. Comput. Sci. Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
2010	J	`jnl`	Finding common structured patterns in linear graphs. Theor. Comput. Sci. Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
2010	—	`conf`	GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks. BICoB Guillaume Blin, Florian Sikora, Stéphane Vialette
2010	J	`jnl`	Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set. IEEE ACM Trans. Comput. Biol. Bioinform. Guillaume Blin, Florian Sikora, Stéphane Vialette
2009	—	`book`	Combinatorics of Genome Rearrangements. Guillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier, Stéphane Vialette
2009	J	`jnl`	Finding occurrences of protein complexes in protein-protein interaction graphs. J. Discrete Algorithms Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2009	B	`conf`	Maximum Motif Problem in Vertex-Colored Graphs. CPM Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2009	Misc	`conf`	On Finding Small 2-Generating Sets. COCOON Isabelle Fagnot, Guillaume Fertin, Stéphane Vialette
2009	J	`jnl`	On the Approximability of Comparing Genomes with Duplicates. J. Graph Algorithms Appl. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2009	J	`jnl`	On the S-Labeling problem. Electron. Notes Discret. Math. Guillaume Fertin, Stéphane Vialette
2009	J	`jnl`	On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette
2009	B	`conf`	Pattern Matching for 321-Avoiding Permutations. ISAAC Sylvain Guillemot, Stéphane Vialette
2009	—	`conf`	Pseudo Boolean Programming for Partially Ordered Genomes. RECOMB-CG Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette
2009	—	`conf`	Querying Protein-Protein Interaction Networks. ISBRA Guillaume Blin, Florian Sikora, Stéphane Vialette
2009	J	`jnl`	RECOMB-Comparative Genomics Special Issue. J. Comput. Biol. Craig E. Nelson, Stéphane Vialette
2009	B	`conf`	The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette
2008	J	`jnl`	Approximating the 2-interval pattern problem. Theor. Comput. Sci. Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette
2008	J	`jnl`	Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs. J. Discrete Algorithms Isabelle Fagnot, Gaëlle Lelandais, Stéphane Vialette
2008	—	`ed.`	Comparative Genomics, International Workshop, RECOMB-CG 2008, Paris, France, October 13-15, 2008. Proceedings RECOMB-CG Craig E. Nelson, Stéphane Vialette
2008	J	`jnl`	Comparing RNA structures using a full set of biologically relevant edit operations is intractable CoRR Guillaume Blin, Sylvie Hamel, Stéphane Vialette
2008	J	`jnl`	Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. J. Comput. Biol. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2008	J	`jnl`	Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2008	J	`jnl`	On the Approximability of Comparing Genomes with Duplicates CoRR Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2008	J	`jnl`	The Minimum Substring Cover problem. Inf. Comput. Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
2008	—	`ch.`	Two-Interval Pattern Problems. Encyclopedia of Algorithms Stéphane Vialette
2007	J	`jnl`	A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. J. Comput. Biol. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
2007	—	`conf`	A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. RECOMB-CG Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2007	B	`conf`	Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
2007	J	`jnl`	Comparing Genomes with Duplications: A Computational Complexity Point of View. IEEE ACM Trans. Comput. Biol. Bioinform. Guillaume Blin, Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2007	—	`conf`	Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. BSB Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette
2007	J	`jnl`	Exemplar Longest Common Subsequence. IEEE ACM Trans. Comput. Biol. Bioinform. Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette
2007	J	`jnl`	Extracting constrained 2-interval subsets in 2-interval sets. Theor. Comput. Sci. Guillaume Blin, Guillaume Fertin, Stéphane Vialette
2007	B	`conf`	Longest Common Separable Pattern Among Permutations. CPM Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
2007	J	`jnl`	Longest Common Separable Pattern between Permutations CoRR Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
2007	B	`conf`	On Restrictions of Balanced 2-Interval Graphs. WG Philippe Gambette, Stéphane Vialette
2007	J	`jnl`	On restrictions of balanced 2-interval graphs CoRR Philippe Gambette, Stéphane Vialette
2007	B	`conf`	Pattern Matching in Protein-Protein Interaction Graphs. FCT Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
2007	A*	`conf`	Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2007	B	`conf`	The Minimum Substring Cover Problem. WAOA Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
2007	—	`conf`	Weak pattern matching in colored graphs: Minimizing the number of connected components. ICTCS Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2006	B	`conf`	Approximation of RNA Multiple Structural Alignment. CPM Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen
2006	J	`jnl`	Comparing gene expression networks in a multi-dimensional space to extract similarities and differences between organisms. Bioinform. Gaëlle Lelandais, Pierre Vincens, Anne Badel-Chagnon, Stéphane Vialette, Claude Jacq, Serge A. Hazout
2006	Misc	`conf`	Exemplar Longest Common Subsequence. International Conference on Computational Science (2) Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2006	Misc	`conf`	Genomes Containing Duplicates Are Hard to Compare. International Conference on Computational Science (2) Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2006	—	`conf`	How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. Comparative Genomics Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
2006	J	`jnl`	Packing of (0, 1)-matrices. RAIRO Theor. Informatics Appl. Stéphane Vialette
2005	A	`conf`	Approximating the 2-Interval Pattern Problem. ESA Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette
2005	B	`conf`	Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. MFCS Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2005	B	`conf`	Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2005	Misc	`conf`	What Makes the Arc-Preserving Subsequence Problem Hard? International Conference on Computational Science (2) Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2005	J	`jnl`	What Makes the Arc-Preserving Subsequence Problem Hard? Trans. Comp. Sys. Biology Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2004	J	`jnl`	MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states. BMC Bioinform. Gaëlle Lelandais, Philippe Marc, Pierre Vincens, Claude Jacq, Stéphane Vialette
2004	B	`conf`	New Results for the 2-Interval Pattern Problem. CPM Guillaume Blin, Guillaume Fertin, Stéphane Vialette
2004	J	`jnl`	On the computational complexity of 2-interval pattern matching problems. Theor. Comput. Sci. Stéphane Vialette
2004	J	`jnl`	yMGV: a cross-species expression data mining tool. Nucleic Acids Res. Gaëlle Lelandais, Stéphane Le Crom, Frédéric Devaux, Stéphane Vialette, George M. Church, Claude Jacq, Philippe Marc
2002	B	`conf`	Pattern Matching Problems over 2-Interval Sets. CPM Stéphane Vialette
2001	—	`—`	Aspects algorithmiques de la prédiction des structures secondaires d'ARN. Stéphane Vialette