![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Theoretical 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
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.