( en | de | ru )

 

Disambiguation of "Vialette, Stéphane"

Author of the publication

copydeleteadd this publication to your clipboard
Pattern Matching for Separable Permutations.

, , and . SPIRE, volume 9954 of Lecture Notes in Computer Science, page 260-272. (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stéphane Klein

Stéphane Haussler

Stéphane Müller

Stéphane Aubry

Stéphane Audière

 

Other publications of authors with the same name

Finding Approximate and Constrained Motifs in Graphs., , and . CPM, volume 6661 of Lecture Notes in Computer Science, page 388-401. Springer, (2011)On Recognizing Words That Are Squares for the Shuffle Product., and . CSR, volume 7913 of Lecture Notes in Computer Science, page 235-245. Springer, (2013)Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs., , and . MFCS, volume 3618 of Lecture Notes in Computer Science, page 328-339. Springer, (2005)Finding a Small Number of Colourful Components., , , , , and . CPM, volume 128 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Two-Interval Pattern Problems.. Encyclopedia of Algorithms, (2016)On recognising words that are squares for the shuffle product., and . Theor. Comput. Sci., (May 2023)Upper and lower bounds for finding connected motifs in vertex-colored graphs., , , and . J. Comput. Syst. Sci., 77 (4): 799-811 (2011)Recognizing Unit Multiple Intervals Is Hard., , , and . ISAAC, volume 283 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Disorders and Permutations., , and . CPM, volume 191 of LIPIcs, page 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Pattern matching in $(213, 231)$-avoiding permutations., , and . CoRR, (2015)