default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 530
Volume 530, April 2014
- Wenbin Chen
, Zhengzhang Chen, Nagiza F. Samatova, Lingxi Peng, Jianxiong Wang, Maobin Tang:
Solving the maximum duo-preservation string mapping problem with linear programming. 1-11 - Yishay Mansour, Boaz Patt-Shamir, Dror Rawitz:
Competitive router scheduling with structured data. 12-22 - Hiroyuki Hanada, Mineichi Kudo, Atsuyoshi Nakamura:
Average-case linear-time similar substring searching by the q-gram distance. 23-41 - Francine Blanchet-Sadri, Yang Jiao, John M. Machacek, J. D. Quigley, Xufan Zhang:
Squares in partial words. 42-57 - Cheng-Kuan Lin, Yuan-Hsiang Teng:
The diagnosability of triangle-free graphs. 58-65 - Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora:
Complexity insights of the Minimum Duplication problem. 66-79 - Chung-Shou Liao, Yamming Huang:
The Covering Canadian Traveller Problem. 80-88 - Flavio Chierichetti, Ravi Kumar, Mohammad Mahdian:
The complexity of LSH feasibility. 89-101
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.
last updated on 2025-01-29 21:18 CET 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:
