default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 582
Volume 582, May 2015
- Carl Barton, Tomás Flouri
, Costas S. Iliopoulos, Solon P. Pissis:
Global and local sequence alignment with a bounded number of gaps. 1-16 - Ararat Harutyunyan, Sylvain Legay:
Linear time algorithms for weighted offensive and powerful alliances in trees. 17-26 - Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak:
Distinguishing views in symmetric networks: A tight lower bound. 27-34 - Nhan Bao Ho:
On the expansion of three-element subtraction sets. 35-47 - Sulin Song, Xiaoyan Li, Shuming Zhou, Mi Chen:
Fault tolerance and diagnosability of burnt pancake networks under the comparison model. 48-59 - Wen Chean Teh, Kiam Heong Kwa:
Core words and Parikh matrices. 60-69
- Aleksandar Ilic:
On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines. 70-73 - Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan:
On hardness of several string indexing problems. 74-82 - Jaroslaw Grytczuk, Karol Kosinski, Michal Zmarz:
How to play Thue games. 83-88
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 2024-11-21 20:30 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:
