![](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 836
Volume 836, October 2020
- Chuang Liu, Hongwei Du
, Qiang Ye
, Wen Xu:
Group sweep coverage with guaranteed approximation ratio. 1-15 - Chia-Wei Lee:
Conditional diagnosability of component-composition graphs under the PMC model. 16-28 - Xiuyang Chen, Zhao Zhang:
A game theoretic approach for minimal connected dominating set. 29-36 - Ye Wang, Yusheng Li, Yan Li:
Maximum star deleted from Ramsey graphs of book and tree. 37-41 - Chuanwen Luo, Deying Li, Xingjian Ding, Weili Wu:
Delivery Route Optimization with automated vehicle in smart urban environment. 42-52 - Xuyang Cui, Wenshun Teng, Xing Liu, Huijuan Wang:
A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles. 53-58 - Pengcheng Liu, Zhao Zhang, Xiaohui Huang:
Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs. 59-64 - Luobing Dong
, Qiumin Guo, Weili Wu, Meghana N. Satpute:
A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization. 65-75 - Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce:
Gathering in the plane of location-aware robots in the presence of spies. 94-109 - Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld:
Leader-based de-anonymization of an anonymous read/write memory. 110-123
![](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.