![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 776
Volume 776, July 2019
- Luís M. S. Russo
:
A study on splay trees. 1-18 - Navin Goyal, Manoj Gupta
:
Better analysis of greedy binary search tree on decomposable sequences. 19-42 - Sanjay Jain
, Efim B. Kinber:
Intrinsic complexity of partial learning. 43-63 - Jørgen Bang-Jensen
, Stéphane Bessy
:
Degree-constrained 2-partitions of graphs. 64-74 - Carla Negri Lintzmayer
, Flávio Keidi Miyazawa, Eduardo Candido Xavier
:
Online circle and sphere packing. 75-94 - Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li
, Jirí Sgall
, Pavel Veselý
:
Online packet scheduling with bounded delay and lookahead. 95-113 - Bruce E. Litow:
Existential Diophantine definability of string length. 114-116 - Guangwei Wu, Jianer Chen, Jianxin Wang
:
Scheduling two-stage jobs on multiple flowshops. 117-124 - Jung-Heum Park
, Jae-Hoon Kim, Hyeong-Seok Lim:
Disjoint path covers joining prescribed source and sink sets in interval graphs. 125-137 - Mei-Mei Gu
, Rong-Xia Hao
, Shuming Zhou:
Fault diagnosability of data center networks. 138-147
![](https://dblp.dagstuhl.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.