( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Recognizing Unit Multiple Intervals Is Hard.

, , , и . ISAAC, том 283 из LIPIcs, стр. 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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.

Stéphane Müller

Stéphane Haussler

Stéphane Klein

Stéphane Clinchant

Stéphane Aubry

 

Другие публикации лиц с тем же именем

RECOMB-Comparative Genomics Special Issue., и . J. Comput. Biol., 16 (10): 1285-1286 (2009)Permutation Pattern matching in (213, 231)-avoiding permutations., , и . Discret. Math. Theor. Comput. Sci., (2016)Finding approximate and constrained motifs in graphs., , и . Theor. Comput. Sci., (2013)The Minimum Substring Cover Problem., , , и . WAOA, том 4927 из Lecture Notes in Computer Science, стр. 170-183. Springer, (2007)Comparing gene expression networks in a multi-dimensional space to extract similarities and differences between organisms., , , , , и . Bioinform., 22 (11): 1359-1366 (2006)The Maximum Zero-Sum Partition Problem., , , и . ICS, том 1723 из Communications in Computer and Information Science, стр. 73-85. Springer, (2022)Parity Permutation Pattern Matching., , и . WALCOM, том 13973 из Lecture Notes in Computer Science, стр. 384-395. Springer, (2023)On Recognizing Words That Are Squares for the Shuffle Product., и . CSR, том 7913 из Lecture Notes in Computer Science, стр. 235-245. Springer, (2013)Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs., , и . MFCS, том 3618 из Lecture Notes in Computer Science, стр. 328-339. Springer, (2005)Finding Approximate and Constrained Motifs in Graphs., , и . CPM, том 6661 из Lecture Notes in Computer Science, стр. 388-401. Springer, (2011)