![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 760
Volume 760, February 2019
- Yulong Wei, Min Xu
:
Hybrid fault diagnosis capability analysis of regular graphs. 1-14 - Manuel Lafond
, Nadia El-Mabrouk, Katharina T. Huber, Vincent Moulton
:
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics. 15-34 - Karl Bringmann, Ralph Keusch, Johannes Lengler
:
Geometric inhomogeneous random graphs. 35-54 - Yongjie Yang
, Yash Raj Shrestha
, Jiong Guo:
On the complexity of bribery with distance restrictions. 55-71 - György Dósa, Hans Kellerer
, Zsolt Tuza:
Restricted assignment scheduling with resource constraints. 72-87
![](https://dblp.org/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.