![](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 705
Volume 705, January 2018
- Ernst L. Leiss, Isaac Mackey:
The worst parallel Hanoi graphs. 1-8 - Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Move-optimal partial gathering of mobile agents in asynchronous trees. 9-30 - Benjamin Hackl
, Clemens Heuberger
, Helmut Prodinger:
Reductions of binary trees and lattice paths induced by the register function. 31-57 - Hung-I Yu
, Cheng-Chung Li, D. T. Lee:
The multi-service center problem. 58-74 - Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson
, Martin Milanic, Daniël Paulusma
:
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. 75-83 - Koji M. Kobayashi:
Improved lower bounds for online scheduling to minimize total stretch. 84-98 - Noam Greenberg, Joseph S. Miller
, Alexander Shen
, Linda Brown Westrick:
Dimension 1 sequences are close to randoms. 99-112
- Kingshuk Chatterjee
, Kumar Sankar Ray:
Non-regular unary language and parallel communicating Watson-Crick automata systems. 113-117
- Wantao Ning:
Erratum and corrections to "The h-connectivity of exchanged crossed cube" [Theoret. Comput. Sci. 696 (2017) 65-68]. 118-121
![](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.