![](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 500
Volume 500, August 2013
- Martin R. Ehmsen, Kim S. Larsen
:
Better bounds on online unit clustering. 1-24 - Kitty Meeks
, Alexander Scott:
The complexity of Free-Flood-It on 2×n boards. 25-43 - Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman:
Bandwidth and low dimensional embedding. 44-56 - Jarkko Peltomäki
:
Introducing privileged words: Privileged complexity of Sturmian words. 57-67 - Béla Csaba
, Thomas A. Plick, Ali Shokoufandeh:
Optimal random matchings, tours, and spanning trees in hierarchically separated trees. 68-89 - Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis:
A super-stabilizing log(n)log(n)-approximation algorithm for dynamic Steiner trees. 90-112
![](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.