![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 708
Volume 708, January 2018
- Thiago Braga Marcilon
, Rudini Menezes Sampaio
:
The maximum time of 2-neighbor bootstrap percolation: Complexity results. 1-17 - Ashutosh Rai, Saket Saurabh:
Bivariate complexity analysis of Almost Forest Deletion. 18-33 - Meena Mahajan
, Anuj Tawari
:
Sums of read-once formulas: How many summands are necessary? 34-45 - Fei Ma, Bing Yao:
An iteration method for computing the total number of spanning trees and its applications in graph theory. 46-57 - Nimrod Talmon
:
Structured proportional representation. 58-74 - Kuo-Tsung Tseng, De-Sheng Chan, Chang-Biau Yang, Shou-Fu Lo:
Efficient merged longest common subsequence algorithms for similar sequences. 75-90
- Bruce E. Litow:
A transfer method from bounded existential Diophantine equations to Tarski algebra formulas. 91-95 - Patryk Mikos:
A new lower bound for the on-line coloring of intervals with bandwidth. 96-100
![](https://dblp1.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.