![](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 648
Volume 648, October 2016
- Bostjan Bresar, Paul Dorbec
, Sandi Klavzar
, Gasper Kosmrlj, Gabriel Renault:
Complexity of the game domination problem. 1-7 - Paolo Boldi
, Sebastiano Vigna
:
Efficient optimally lazy algorithms for minimal-interval semantics. 8-25 - Van Bang Le, Andrea Oversberg, Oliver Schaudt:
A unified approach to recognize squares of split graphs. 26-33 - Tridib Dutta, Lenwood S. Heath, V. S. Anil Kumar
, Madhav V. Marathe:
Labeled cuts in graphs. 34-39 - Meirav Zehavi
:
Parameterized approximation algorithms for packing problems. 40-55 - Carme Àlvarez, Maria J. Blesa, Amalia Duch, Arnau Messegué, Maria J. Serna
:
Celebrity games. 56-71 - Peng Zhang
, Bin Fu:
The label cut problem with respect to path length and label frequency. 72-83 - Tomasz Kociumaka
, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Maximum number of distinct and nonequivalent nonstandard squares in a word. 84-95 - Diodato Ferraioli, Paul W. Goldberg
, Carmine Ventre
:
Decentralized dynamics for finite opinion games. 96-115 - Guy Feigenblat, Ofra Itzhaki, Ely Porat:
Corrigendum to "The frequent items problem, under polynomial decay, in the streaming model" [Theoret. Comput. Sci. 411(34-36) (2010) 3048-3054]. 116
![](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.