default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 465
Volume 465, December 2012
- Tobias Jacobs:
Analytical aspects of tie breaking. 1-9 - Huazhong Lü
, Xianyue Li, Heping Zhang:
Matching preclusion for balanced hypercubes. 10-20 - Keaitsuda Nakprasit, Kittikorn Nakprasit:
Equitable colorings of planar graphs without short cycles. 21-27 - Toshinori Takabatake, Tomoki Nakamigawa:
Node-disjoint paths in a level block of generalized hierarchical completely connected networks. 28-34 - Torsten Tholey:
Linear time algorithms for two disjoint paths problems on directed acyclic graphs. 35-48 - Nodari Vakhania:
Branch less, cut more and minimize the number of late equal-length jobs on identical machines. 49-60 - Yan Wang, Jianxi Fan, Xiaohua Jia, He Huang:
An algorithm to construct independent spanning trees on parity cubes. 61-72
- L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
Corrigendum: "On Brlek-Reutenauer conjecture". 73-74
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-01-24 17:12 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:
