default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStéphane Vialette
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2010
[b3]Stéphane Vialette:
Algorithmic Contributions to Computational Molecular Biology. University of Paris-Est, France, 2010- 2009
- [b2]Guillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier, Stéphane Vialette:
Combinatorics of Genome Rearrangements. Computational molecular biology, MIT Press 2009, ISBN 978-0-262-06282-4, pp. I-XI, 1-288 - 2001
- [b1]Stéphane Vialette:
Aspects algorithmiques de la prédiction des structures secondaires d'ARN. Paris Diderot University, France, 2001
Journal Articles
- 2025
- [j44]Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora
, Stéphane Vialette:
Recognizing unit multiple interval graphs is hard. Discret. Appl. Math. 360: 258-274 (2025) - 2024
- [j43]Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette:
Parity Permutation Pattern Matching. Algorithmica 86(8): 2605-2624 (2024) - [j42]Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette:
The Maximum Zero-Sum Partition problem. Theor. Comput. Sci. 1019: 114811 (2024) - 2023
- [j41]Laurent Bulteau, Vincent Jugé, Stéphane Vialette:
On shuffled-square-free words. Theor. Comput. Sci. 941: 91-103 (2023) - [j40]Romeo Rizzi, Stéphane Vialette:
On recognising words that are squares for the shuffle product. Theor. Comput. Sci. 956: 111156 (2023) - 2021
- [j39]Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette:
Efficient, robust and effective rank aggregation for massive biological datasets. Future Gener. Comput. Syst. 124: 406-421 (2021) - 2020
- [j38]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting with forbidden intermediates. Discret. Appl. Math. 279: 49-68 (2020) - [j37]Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. Theory Comput. Syst. 64(1): 17-34 (2020) - [j36]Laurent Bulteau, Stéphane Vialette:
Recognizing binary shuffle squares is NP-hard. Theor. Comput. Sci. 806: 116-132 (2020) - 2018
- [j35]Guillaume Fertin, Irena Rusu, Stéphane Vialette:
The S-labeling problem: An algorithmic tour. Discret. Appl. Math. 246: 49-61 (2018) - [j34]Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Solving the tree containment problem in linear time for nearly stable phylogenetic networks. Discret. Appl. Math. 246: 62-79 (2018) - [j33]Samuele Giraudo, Stéphane Vialette:
Algorithmic and algebraic aspects of unshuffling permutations. Theor. Comput. Sci. 729: 20-41 (2018) - 2016
- [j32]Both Emerite Neou, Romeo Rizzi, Stéphane Vialette:
Permutation Pattern matching in (213, 231)-avoiding permutations. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - 2015
- [j31]Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. 115(1): 1-5 (2015) - 2013
- [j30]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) - [j29]Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette:
On the combinatorics of suffix arrays. Inf. Process. Lett. 113(22-24): 915-920 (2013) - [j28]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Finding approximate and constrained motifs in graphs. Theor. Comput. Sci. 483: 10-21 (2013) - 2012
- [j27]Guillaume Blin, Romeo Rizzi, Stéphane Vialette:
A Faster Algorithm for Finding Minimum Tucker Submatrices. Theory Comput. Syst. 51(3): 270-281 (2012) - 2011
- [j26]Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4): 799-811 (2011) - [j25]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Complexity issues in vertex-colored graph pattern matching. J. Discrete Algorithms 9(1): 82-99 (2011) - [j24]Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen:
Approximation of RNA multiple structural alignment. J. Discrete Algorithms 9(4): 365-376 (2011) - 2010
- [j23]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) - [j22]Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette:
Complexity issues in color-preserving graph embeddings. Theor. Comput. Sci. 411(4-5): 716-729 (2010) - [j21]Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Finding common structured patterns in linear graphs. Theor. Comput. Sci. 411(26-28): 2475-2486 (2010) - 2009
- [j20]Guillaume Fertin, Stéphane Vialette:
On the S-Labeling problem. Electron. Notes Discret. Math. 34: 273-277 (2009) - [j19]Craig E. Nelson, Stéphane Vialette:
RECOMB-Comparative Genomics Special Issue. J. Comput. Biol. 16(10): 1285-1286 (2009) - [j18]Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Finding occurrences of protein complexes in protein-protein interaction graphs. J. Discrete Algorithms 7(1): 90-101 (2009) - [j17]Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette:
On the Approximability of Comparing Genomes with Duplicates. J. Graph Algorithms Appl. 13(1): 19-53 (2009) - [j16]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette:
On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1): 53-61 (2009) - 2008
- [j15]Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
The Minimum Substring Cover problem. Inf. Comput. 206(11): 1303-1312 (2008) - [j14]Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette:
Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. J. Comput. Biol. 15(8): 1093-1115 (2008) - [j13]Isabelle Fagnot, Gaëlle Lelandais, Stéphane Vialette:
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs. J. Discrete Algorithms 6(2): 178-191 (2008) - [j12]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) - [j11]Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette:
Approximating the 2-interval pattern problem. Theor. Comput. Sci. 395(2-3): 283-297 (2008) - 2007
- [j10]Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette:
A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. J. Comput. Biol. 14(4): 379-393 (2007) - [j9]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) - [j8]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette:
Exemplar Longest Common Subsequence. IEEE ACM Trans. Comput. Biol. Bioinform. 4(4): 535-543 (2007) - [j7]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) - 2006
- [j6]Gaëlle Lelandais, Pierre Vincens, Anne Badel-Chagnon, Stéphane Vialette, Claude Jacq, Serge A. Hazout:
Comparing gene expression networks in a multi-dimensional space to extract similarities and differences between organisms. Bioinform. 22(11): 1359-1366 (2006) - [j5]Stéphane Vialette:
Packing of (0, 1)-matrices. RAIRO Theor. Informatics Appl. 40(4): 519-535 (2006) - 2005
- [j4]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) - 2004
- [j3]Gaëlle Lelandais, Philippe Marc, Pierre Vincens, Claude Jacq, Stéphane Vialette:
MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states. BMC Bioinform. 5: 20 (2004) - [j2]Gaëlle Lelandais, Stéphane Le Crom, Frédéric Devaux, Stéphane Vialette, George M. Church, Claude Jacq, Philippe Marc:
yMGV: a cross-species expression data mining tool. Nucleic Acids Res. 32(Database-Issue): 323-325 (2004) - [j1]Stéphane Vialette:
On the computational complexity of 2-interval pattern matching problems. Theor. Comput. Sci. 312(2-3): 223-249 (2004)
Conference and Workshop Papers
- 2024
- [c58]Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette:
Generalizing Roberts' Characterization of Unit Interval Graphs. MFCS 2024: 12:1-12:15 - 2023
- [c57]Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing Unit Multiple Intervals Is Hard. ISAAC 2023: 8:1-8:18 - [c56]Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette:
Parity Permutation Pattern Matching. WALCOM 2023: 384-395 - 2022
- [c55]Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette:
Permutation Pattern Matching for Doubly Partially Ordered Patterns. CPM 2022: 21:1-21:17 - [c54]Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette:
The Maximum Zero-Sum Partition Problem. ICS 2022: 73-85 - [c53]Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Algorithmic Aspects of Small Quasi-Kernels. WG 2022: 370-382 - 2021
- [c52]Laurent Bulteau, Samuele Giraudo, Stéphane Vialette:
Disorders and Permutations. CPM 2021: 11:1-11:15 - 2019
- [c51]Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CPM 2019: 20:1-20:14 - [c50]Pierre Andrieu, Bryan Brancotte, Laurent Bulteau, Sarah Cohen-Boulakia, Alain Denise, Adeline Pierrot, Stéphane Vialette:
Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data. eScience 2019: 136-145 - [c49]Guillaume Fertin, Samuele Giraudo, Sylvie Hamel, Stéphane Vialette:
Unshuffling Permutations: Trivial Bijections and Compositions. TAMC 2019: 242-261 - 2018
- [c48]Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. CSR 2018: 53-64 - [c47]Laurent Bulteau, Romeo Rizzi, Stéphane Vialette:
Pattern Matching for k-Track Permutations. IWOCA 2018: 102-114 - 2016
- [c46]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting with Forbidden Intermediates. AlCoB 2016: 133-144 - [c45]Samuele Giraudo, Stéphane Vialette:
Unshuffling Permutations. LATIN 2016: 509-521 - [c44]Both Emerite Neou, Romeo Rizzi, Stéphane Vialette:
Pattern Matching for Separable Permutations. SPIRE 2016: 260-272 - 2015
- [c43]Guillaume Fertin, Irena Rusu, Stéphane Vialette:
Obtaining a Triangular Matrix by Independent Row-Column Permutations. ISAAC 2015: 165-175 - [c42]Guillaume Fertin, Irena Rusu, Stéphane Vialette:
Algorithmic Aspects of the S-Labeling Problem. IWOCA 2015: 173-184 - [c41]Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. IWOCA 2015: 197-208 - [c40]Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Locating a Tree in a Phylogenetic Network in Quadratic Time. RECOMB 2015: 96-107 - 2014
- [c39]Guillaume Blin, Paul Morel, Romeo Rizzi, Stéphane Vialette:
Towards Unlocking the Full Potential of Multileaf Collimators. SOFSEM 2014: 138-149 - 2013
- [c38]Yu Zhou, Yann Ponty, Stéphane Vialette, Jérôme Waldispühl, Yi Zhang, Alain Denise:
Flexible RNA design under structure and sequence constraints using formal languages. BCB 2013: 229 - [c37]Romeo Rizzi, Stéphane Vialette:
On Recognizing Words That Are Squares for the Shuffle Product. CSR 2013: 235-245 - [c36]Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette:
Single and Multiple Consecutive Permutation Motif Search. ISAAC 2013: 66-77 - 2012
- [c35]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 - [c34]Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. ISAAC 2012: 465-474 - [c33]Guillaume Blin, Minghui Jiang, Stéphane Vialette:
The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. SPIRE 2012: 130-142 - 2011
- [c32]Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Minimum Mosaic Inference of a Set of Recombinants. CATS 2011: 23-30 - [c31]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 - [c30]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Finding Approximate and Constrained Motifs in Graphs. CPM 2011: 388-401 - [c29]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 - 2010
- [c28]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 - [c27]Guillaume Blin, Romeo Rizzi, Stéphane Vialette:
A Faster Algorithm for Finding Minimum Tucker Submatrices. CiE 2010: 69-77 - [c26]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 - 2009
- [c25]Isabelle Fagnot, Guillaume Fertin, Stéphane Vialette:
On Finding Small 2-Generating Sets. COCOON 2009: 378-387 - [c24]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Maximum Motif Problem in Vertex-Colored Graphs. CPM 2009: 221-235 - [c23]Sylvain Guillemot, Stéphane Vialette:
Pattern Matching for 321-Avoiding Permutations. ISAAC 2009: 1064-1073 - [c22]Guillaume Blin, Florian Sikora, Stéphane Vialette:
Querying Protein-Protein Interaction Networks. ISBRA 2009: 52-62 - [c21]Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette:
Pseudo Boolean Programming for Partially Ordered Genomes. RECOMB-CG 2009: 126-137 - [c20]Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette:
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM 2009: 357-368 - 2007
- [c19]Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252 - [c18]Mathilde Bouvel, Dominique Rossin, Stéphane Vialette:
Longest Common Separable Pattern Among Permutations. CPM 2007: 316-327 - [c17]Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette:
Pattern Matching in Protein-Protein Interaction Graphs. FCT 2007: 137-148 - [c16]Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette:
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP 2007: 340-351 - [c15]Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Weak pattern matching in colored graphs: Minimizing the number of connected components. ICTCS 2007: 27-38 - [c14]Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette:
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. RECOMB-CG 2007: 16-29 - [c13]Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
The Minimum Substring Cover Problem. WAOA 2007: 170-183 - [c12]Philippe Gambette, Stéphane Vialette:
On Restrictions of Balanced 2-Interval Graphs. WG 2007: 55-65 - [c11]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
- [c10]Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen:
Approximation of RNA Multiple Structural Alignment. CPM 2006: 211-222 - [c9]Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette:
Exemplar Longest Common Subsequence. International Conference on Computational Science (2) 2006: 622-629 - [c8]Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Genomes Containing Duplicates Are Hard to Compare. International Conference on Computational Science (2) 2006: 783-790 - [c7]Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette:
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. Comparative Genomics 2006: 75-86 - 2005
- [c6]Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette:
Approximating the 2-Interval Pattern Problem. ESA 2005: 426-437 - [c5]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 - [c4]Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. MFCS 2005: 328-339 - [c3]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
- [c2]Guillaume Blin, Guillaume Fertin, Stéphane Vialette:
New Results for the 2-Interval Pattern Problem. CPM 2004: 311-322 - 2002
- [c1]Stéphane Vialette:
Pattern Matching Problems over 2-Interval Sets. CPM 2002: 53-63
Editorship
- 2008
- [e1]Craig E. Nelson, Stéphane Vialette:
Comparative Genomics, International Workshop, RECOMB-CG 2008, Paris, France, October 13-15, 2008. Proceedings. Lecture Notes in Computer Science 5267, Springer 2008, ISBN 978-3-540-87988-6 [contents]
Reference Works
- 2016
- [r2]Stéphane Vialette:
Two-Interval Pattern Problems. Encyclopedia of Algorithms 2016: 2282-2287 - 2008
- [r1]Stéphane Vialette:
Two-Interval Pattern Problems. Encyclopedia of Algorithms 2008
Informal and Other Publications
- 2024
- [i17]Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stéphane Vialette:
Generalizing Roberts' characterization of unit interval graphs. CoRR abs/2404.17872 (2024) - 2023
- [i16]Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing unit multiple intervals is hard. CoRR abs/2309.11908 (2023) - [i15]Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Quasi-kernels in split graphs. CoRR abs/2312.15519 (2023) - 2021
- [i14]Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
Algorithmic aspects of quasi-kernels. CoRR abs/2107.03793 (2021) - 2018
- [i13]Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. CoRR abs/1802.07944 (2018) - [i12]Samuele Giraudo, Stéphane Vialette:
Algorithmic and algebraic aspects of unshuffling permutations. CoRR abs/1805.08255 (2018) - [i11]Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CoRR abs/1808.03561 (2018) - 2016
- [i10]Samuele Giraudo, Stéphane Vialette:
Unshuffling Permutations. CoRR abs/1601.05962 (2016) - [i9]Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting With Forbidden Intermediates. CoRR abs/1602.06283 (2016) - 2015
- [i8]Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang:
Locating a Tree in a Phylogenetic Network in Quadratic Time. CoRR abs/1502.03379 (2015) - [i7]Both Emerite Neou, Romeo Rizzi, Stéphane Vialette:
Pattern matching in $(213, 231)$-avoiding permutations. CoRR abs/1511.01770 (2015) - 2013
- [i6]Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette:
Single and multiple consecutive permutation motif search. CoRR abs/1301.4952 (2013) - 2012
- [i5]Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette:
On the combinatorics of suffix arrays. CoRR abs/1206.3877 (2012) - 2008
- [i4]Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette:
On the Approximability of Comparing Genomes with Duplicates. CoRR abs/0806.1103 (2008) - [i3]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
- [i2]Philippe Gambette, Stéphane Vialette:
On restrictions of balanced 2-interval graphs. CoRR abs/0704.1571 (2007) - [i1]Mathilde Bouvel, Dominique Rossin, Stéphane Vialette:
Longest Common Separable Pattern between Permutations. CoRR abs/math/0702109 (2007)
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-10-23 21:29 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:
