![](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 769
Volume 769, May 2019
- Manuel Lafond
, Céline Scornavacca:
On the Weighted Quartet Consensus problem. 1-17 - Mark de Berg
, Sándor Kisfaludi-Bak
, Gerhard J. Woeginger:
The complexity of Dominating Set in geometric intersection graphs. 18-31 - Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza:
Finding a potential community in networks. 32-42 - Shlomi Dolev
, Juan A. Garay, Niv Gilboa
, Vladimir Kolesnikov, Muni Venkateswarlu Kumaramangalam
:
Perennial secure multi-party computation of universal Turing machine. 43-62 - Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy
, Suchismita Roy:
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. 63-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.