![](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 613
Volume 613, February 2016
- Tomoyuki Yamakami:
Pseudorandom generators against advised context-free languages. 1-27 - Kevin A. Naudé:
Refined pivot selection for maximal clique enumeration in graphs. 28-37 - Fedor V. Fomin
, Pinar Heggernes, Erik Jan van Leeuwen:
The Firefighter problem on graph classes. 38-50 - Thomas Erlebach, Michael Hoffmann, Frank Kammer:
Query-competitive algorithms for cheapest set problems under uncertainty. 51-64 - Vittorio Bilò
, Angelo Fanelli
, Michele Flammini
, Gianpiero Monaco, Luca Moscardelli
:
The price of envy-freeness in machine scheduling. 65-78 - Tim Nonner
:
Capacitated Max-Batching with interval graph compatibilities. 79-93 - Miriam Di Ianni, Giorgio Gambosi, Gianluca Rossi
, Paola Vocca
:
Min-max communities in graphs: Complexity and computational properties. 94-114 - Bernd Meyer:
Generalized Pete's Pike is PSPACE-complete. 115-125
![](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.