default search action
Theoretical Computer Science, Volume 602
Volume 602, October 2015
- Jian Weng
, Yunlei Zhao, Robert H. Deng
A note on the security of KHL scheme. 1-6 - Tomasz Kociumaka
Linear-time version of Holub's algorithm for morphic imprimitivity testing. 7-21 - Bhadrachalam Chitturi
Tighter upper bound for sorting permutations with prefix transpositions. 22-31 - Dieter Rautenbach:
Two greedy consequences for maximum induced matchings. 32-38 - Van Bang Le, Andrea Oversberg, Oliver Schaudt:
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. 39-49 - Bertrand Le Cun
Bin packing with fragmentable items: Presentation and approximations. 50-59 - Bojian Xu:
Boosting distinct random sampling for basic counting on the union of distributed streams. 60-79 - Wen An Liu, Meile Zhao:
General restrictions of Wythoff-like games. 80-88 - Luérbio Faria, Laurent Gourvès, Carlos A. J. Martinhon, Jérôme Monnot:
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles. 89-102 - Michaël Gabay
Online bin stretching with bunch techniques. 103-113 - Haitao Wang
One-dimensional k-center on uncertain data. 114-124 - Che-Nan Kuo
Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults. 125-131 - Ruo-Wei Hung
The Hamiltonian properties of supergrid graphs. 132-148
- Ching-Lueh Chang:
A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection. 149-157
- Tiziana Calamoneri
Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40]. 524
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-12-15 01:26 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: