default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 640
Volume 640, August 2016
- Jørgen Bang-Jensen
, Nathann Cohen, Frédéric Havet:
Finding good 2-partitions of digraphs II. Enumerable properties. 1-19 - Marek Piotrów:
Faster merging networks with a small constant period. 20-40 - Francine Blanchet-Sadri, Daniel Seita, David Wise:
Computing abelian complexity of binary uniform morphic words. 41-51 - Mitre Costa Dourado, Lucia Draque Penso Rautenbach, Dieter Rautenbach:
On the geodetic hull number of Pk-free graphs. 52-60 - Minghui Jiang, Ge Xia, Yong Zhang:
Edge-disjoint packing of stars and cycles. 61-69 - Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced disjoint paths in circular-arc graphs in linear time. 70-83 - Chung-Shou Liao, Chih-Wei Liang, Sheung-Hung Poon:
Approximation algorithms on consistent dynamic map labeling. 84-93 - Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza:
New models of graph-bin packing. 94-103 - Hyung Tae Lee, San Ling, Huaxiong Wang:
Analysis of Gong et al.'s CCA2-secure homomorphic encryption. 104-114
- Shuli Zhao, Weihua Yang, Shurong Zhang:
Component connectivity of hypercubes. 115-118 - Shuangshuang Li, Zhao Zhang, Hong-Jian Lai:
Algorithm for constraint partial inverse matroid problem with weight increase forbidden. 119-124 - Hong Jie Song, Wen-Hua Pan, Xiang Nan Gong, Chang Qing Xu:
A note on the neighbor sum distinguishing total coloring of planar graphs. 125-129
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-12-09 00:28 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:
