Combinatorial Pattern Matching
CPM
B
CORE rank
CORE rank (raw)
B
Fields of research
Computer Vision and Multimedia Computation
Papers indexed
1,016
1992–2026
Papers per year
199239 peak2026
Most published authors
CPM papers
1,016 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2017 | On the Weighted Quartet Consensus Problem. | Manuel Lafond, Cline Scornavacca |
| 2017 | Faster STR-IC-LCS Computation via RLE. | Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. | Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi |
| 2017 | Recompression of SLPs. | Artur Jez |
| 2017 | Longest Common Extensions with Recompression. | Tomohiro I |
| 2017 | On-Line Pattern Matching on Similar Texts. | Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari |
| 2017 | Path Queries on Functions. | Travis Gagie, Meng He, Gonzalo Navarro |
| 2017 | A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem. | Bartlomiej Dudek, Pawel Gawrychowski, Piotr Ostropolski-Nalewaja |
| 2017 | Gapped Pattern Statistics. | Philippe Duchon, Cyril Nicaud, Carine Pivoteau |
| 2017 | Position Heaps for Parameterized Strings. | Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara |
| 2017 | Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. | Lus Felipe I. Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis A. B. Kowada, Jens Stoye |
| 2017 | The Longest Filled Common Subsequence Problem. | Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis |
| 2017 | Optimal Omnitig Listing for Safe and Complete Contig Assembly. | Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu |
| 2017 | Beyond Adjacency Maximization: Scaffold Filling for New String Distances. | Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz |
| 2017 | Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. | Karl Bringmann, Philip Wellnitz |
| 2017 | Palindromic Length in Linear Time. | Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur |
| 2017 | Deterministic Indexing for Packed Strings. | Philip Bille, Inge Li Grtz, Frederik Rye Skjoldjensen |
| 2017 | Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. | Philip Bille, Mikko Berggren Ettienne, Inge Li Grtz, Hjalte Wedel Vildhj |
| 2017 | Lempel-Ziv Compression in a Sliding Window. | Philip Bille, Patrick Hagge Cording, Johannes Fischer, Inge Li Grtz |
| 2017 | Representing the Suffix Tree with the CDAWG. | Djamal Belazzougui, Fabio Cunial |
| 2017 | Synergistic Solutions on MultiSets. | Jrmy Barbay, Carlos Ochoa, Srinivasa Rao Satti |
| 2017 | Computing All Distinct Squares in Linear Time for Integer Alphabets. | Hideo Bannai, Shunsuke Inenaga, Dominik Kppl |
| 2017 | Approximate Cover of Strings. | Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat |
| 2017 | Can We Recover the Cover?. | Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat |
| 2016 | Front Matter, Table of Contents, Preface. |
276–300 of 1,016← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*CVPRIEEE Conference on Computer Vision and Pattern Recognition
- A*ICCVIEEE International Conference on Computer Vision
- A*ECCVEuropean Conference on Computer Vision
- AWACVIEEE Workshop on Applications of Computer Vision
- ABMVCBritish Machine Vision Conference
- A*ACMMMACM Multimedia
- AICMEIEEE International Conference on Multimedia and Expo