default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 510
Volume 510, October 2013
- Paul S. Bonsma:
The complexity of rerouting shortest paths. 1-12 - György Dósa, Rongheng Li, Xin Han, Zsolt Tuza:
Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9. 13-61 - Roberto De Prisco
, Alfredo De Santis:
Color visual cryptography schemes for black and white secret images. 62-86 - Hae-Sung Eom, Yo-Sub Han:
State complexity of combined operations for suffix-free regular languages. 87-93 - Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Conditional edge-fault pancyclicity of augmented cubes. 94-101 - György Dósa, Csanád Imreh:
The generalization of scheduling with machine cost. 102-110 - Endre Boros, Ondrej Cepek, Petr Kucera:
A decomposition method for CNF minimality proofs. 111-126 - Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter:
On the Carathéodory number of interval and graph convexities. 127-135
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 23:40 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:
