default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 531
Volume 531, April 2014
- Suna Bensch
, Frank Drewes, Helmut Jürgensen, Brink van der Merwe:
Graph transformation for incremental natural language analysis. 1-25 - Sook-Yeon Kim, Jung-Heum Park:
Many-to-many two-disjoint path covers in restricted hypercube-like graphs. 26-36 - Yong Wu, T. C. E. Cheng, Min Ji:
Optimal algorithms for semi-online machine covering on two hierarchical machines. 37-46 - Xianyong Li, Xiaofan Yang, Li He, Jing Zhang, Cui Yu:
Conditional diagnosability of optical multi-mesh hypercube networks under the comparison diagnosis model. 47-53 - Enrico Angelelli, Cristina Bazgan, Maria Grazia Speranza, Zsolt Tuza:
Complexity and approximation for Traveling Salesman Problems with profits. 54-65 - Masanobu Furuse, Koichi Yamazaki:
A revisit of the scheme for computing treewidth and minimum fill-in. 66-76 - Jacqueline W. Daykin, William F. Smyth:
A bijective variant of the Burrows-Wheeler Transform using V-order. 77-89
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-11-26 07:55 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:
