| 2007 | ||
|---|---|---|
| 43 | EE | Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg: Subset Seed Automaton. CIAA 2007: 180-191 |
| 2006 | ||
| 42 | EE | Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov: Optimal Linear Arrangement of Interval Graphs. MFCS 2006: 267-279 |
| 41 | EE | Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg: A Unifying Framework for Seed Sensitivity and its Application to Subset Seeds. J. Bioinformatics and Computational Biology 4(2): 553-570 (2006) |
| 40 | EE | Gregory Kucherov, Andrey A. Mironov, Mikhail A. Roytberg: An Overview of the Algorithmic Session of MCCMB'05. J. Bioinformatics and Computational Biology 4(2): (2006) |
| 2005 | ||
| 39 | EE | Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg: A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds. WABI 2005: 251-263 |
| 38 | EE | Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov: Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey. WG 2005: 16-27 |
| 37 | EE | Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg: Multiseed Lossless Filtration. IEEE/ACM Trans. Comput. Biology Bioinform. 2(1): 51-61 (2005) |
| 36 | EE | Laurent Noé, Gregory Kucherov: YASS: enhancing the sensitivity of DNA similarity search. Nucleic Acids Research 33(Web-Server-Issue): 540-543 (2005) |
| 2004 | ||
| 35 | EE | Gregory Kucherov, Laurent Noé, Yann Ponty: Estimating Seed Sensitivity on Homogeneous Alignments. BIBE 2004: 387-394 |
| 34 | EE | Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg: Multi-seed Lossless Filtration (Extended Abstract). CPM 2004: 297-310 |
| 33 | EE | Laurent Noé, Gregory Kucherov: Improved hit criteria for DNA local alignment. BMC Bioinformatics 5: 149 (2004) |
| 32 | EE | Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre: Linear-time computation of local periods. Theor. Comput. Sci. 326(1-3): 229-240 (2004) |
| 2003 | ||
| 31 | EE | Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre: Linear-Time Computation of Local Periods. MFCS 2003: 388-397 |
| 30 | EE | Gregory Kucherov, Pascal Ochem, Michaël Rao: How Many Square Occurrences Must a Binary Sequence Contain? Electr. J. Comb. 10: (2003) |
| 29 | Roman M. Kolpakov, Ghizlane Bana, Gregory Kucherov: mreps: efficient and flexible detection of tandem repeats in DNA. Nucleic Acids Research 31(13): 3672-3678 (2003) | |
| 28 | EE | Roman M. Kolpakov, Gregory Kucherov: Finding approximate repetitions under Hamming distance. Theor. Comput. Sci. 1(303): 135-156 (2003) |
| 2001 | ||
| 27 | EE | Roman M. Kolpakov, Gregory Kucherov: Finding Approximate Repetitions under Hamming Distance. ESA 2001: 170-181 |
| 2000 | ||
| 26 | EE | Roman M. Kolpakov, Gregory Kucherov: Finding Repeats with Fixed Gap. SPIRE 2000: 162-168 |
| 25 | EE | Vladimir Grebinski, Gregory Kucherov: Optimal Reconstruction of Graphs under the Additive Model. Algorithmica 28(1): 104-124 (2000) |
| 1999 | ||
| 24 | EE | Gregory Kucherov, Michaël Rusinowitch: Patterns in Words versus Patterns in Trees: A Brief Survey and New Results. Ershov Memorial Conference 1999: 283-296 |
| 23 | EE | Roman M. Kolpakov, Gregory Kucherov: On Maximal Repetitions in Words. FCT 1999: 374-385 |
| 22 | EE | Roman M. Kolpakov, Gregory Kucherov: Finding Maximal Repetitions in a Word in Linear Time. FOCS 1999: 596-604 |
| 21 | EE | Vladimir Grebinski, Gregory Kucherov: Reconstructing Set Partitions. SODA 1999: 915-916 |
| 20 | EE | David A. Plaisted, Gregory Kucherov: The Complexity of Some Complementation Problems. Inf. Process. Lett. 71(3-4): 159-165 (1999) |
| 19 | EE | Roman M. Kolpakov, Gregory Kucherov, Yuriy Tarannikov: On Repetition-Free Binary Words of Minimal Density. Theor. Comput. Sci. 218(1): 161-175 (1999) |
| 1998 | ||
| 18 | EE | Roman M. Kolpakov, Gregory Kucherov, Yuriy Tarannikov: On Repetition-Free Binary Words of Minimal Density. MFCS 1998: 683-692 |
| 17 | EE | Vladimir Grebinski, Gregory Kucherov: Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping. Discrete Applied Mathematics 88(1-3): 147-165 (1998) |
| 1997 | ||
| 16 | Vladimir Grebinski, Gregory Kucherov: Optimal Reconstruction of Graphs Under the Additive Model. ESA 1997: 246-258 | |
| 15 | EE | Vladimir Grebinski, Gregory Kucherov: Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs. ISTCS 1997: 166-173 |
| 14 | Roman M. Kolpakov, Gregory Kucherov: Minimal Letter Frequency in n-th Power-Free Binary Words. MFCS 1997: 347-357 | |
| 13 | François Bertault, Gregory Kucherov: Visualization of Dynamic Automata Using Padnon. Workshop on Implementing Automata 1997: 25-28 | |
| 12 | EE | Gregory Kucherov, Michaël Rusinowitch: Matching a Set of Strings with Variable Length don't Cares. Theor. Comput. Sci. 178(1-2): 129-154 (1997) |
| 1996 | ||
| 11 | Gregory Kucherov, Pierre Lescanne, Peter D. Mosses: Valentin M. Antimirov (1961-1995). Theor. Comput. Sci. 155(2): 289-290 (1996) | |
| 1995 | ||
| 10 | Gregory Kucherov, Michaël Rusinowitch: Matching a Set of Strings with Variable Length Don't Cares. CPM 1995: 230-247 | |
| 9 | Gregory Kucherov, Mohamed Tajine: Decidability of Regularity and Related Properties of Ground Normal Form Languages Inf. Comput. 118(1): 91-100 (1995) | |
| 8 | EE | Gregory Kucherov, Michaël Rusinowitch: Undecidability of Ground Reducibility for Word Rewriting Systems with Variables. Inf. Process. Lett. 53(4): 209-215 (1995) |
| 1994 | ||
| 7 | Dieter Hofbauer, Maria Huber, Gregory Kucherov: Some Results on Top-Context-Free Tree Languages. CAAP 1994: 157-171 | |
| 6 | Gregory Kucherov, Michaël Rusinowitch: The Complexitiy of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables. CTRS 1994: 262-275 | |
| 5 | EE | Gregory Kucherov, Michaël Rusinowitch: On ground reducibility problem for word rewriting systems with variables. SAC 1994: 271-276 |
| 1992 | ||
| 4 | Gregory Kucherov, Mohamed Tajine: Decidability of Regularity and Related Properties of Ground Normal Form Languages. CTRS 1992: 272-286 | |
| 1991 | ||
| 3 | Gregory Kucherov: On Relationship Between Term Rewriting Systems and Regular Tree Languages. RTA 1991: 299-311 | |
| 1990 | ||
| 2 | Alexandre V. Zamulin, V. A. Kositov, Gregory Kucherov, E. V. Pak: The Database Programming Language Atlant: Principal Features and Implementation techniques. East/West Database Workshop 1990: 385-402 | |
| 1988 | ||
| 1 | Gregory Kucherov: A New Quasi-Reducibility Testing Algorithm and its Application to Proofs by Induction. ALP 1988: 204-213 | |
| 1 | Ghizlane Bana | [29] |
| 2 | François Bertault | [13] |
| 3 | Mathilde Bouvel | [38] |
| 4 | Johanne Cohen | [42] |
| 5 | Jean-Pierre Duval | [31] [32] |
| 6 | Fedor V. Fomin | [42] |
| 7 | Vladimir Grebinski | [15] [16] [17] [21] [25] [38] |
| 8 | Pinar Heggernes | [42] |
| 9 | Dieter Hofbauer | [7] |
| 10 | Maria Huber | [7] |
| 11 | Roman Kolpakov (Roman M. Kolpakov) | [14] [18] [19] [22] [23] [26] [27] [28] [29] [31] [32] |
| 12 | V. A. Kositov | [2] |
| 13 | Dieter Kratsch | [42] |
| 14 | Thierry Lecroq | [31] [32] |
| 15 | Arnaud Lefebvre | [31] [32] |
| 16 | Pierre Lescanne | [11] |
| 17 | Andrey A. Mironov | [40] |
| 18 | Peter D. Mosses | [11] |
| 19 | Laurent Noé | [33] [34] [35] [36] [37] [39] [41] [43] |
| 20 | Pascal Ochem | [30] |
| 21 | E. V. Pak | [2] |
| 22 | David A. Plaisted | [20] |
| 23 | Yann Ponty | [35] |
| 24 | Michaël Rao | [30] |
| 25 | Mikhail A. Roytberg | [34] [37] [39] [40] [41] [43] |
| 26 | Michaël Rusinowitch | [5] [6] [8] [10] [12] [24] |
| 27 | Mohamed Tajine | [4] [9] |
| 28 | Yuriy Tarannikov | [18] [19] |
| 29 | Alexandre V. Zamulin | [2] |
Colors in the list of coauthors