![](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 442
Volume 442, July 2012
- Subhas C. Nandy, Sandeep Sen:
Preface. 1
- Helmut Alt, Ludmila Scharf:
Shape matching by random sampling. 2-12 - Meena Mahajan
, Prajakta Nimbhorkar
, Kasturi R. Varadarajan:
The planar k-means problem is NP-hard. 13-21 - Katsuhisa Yamanaka, Yota Otachi
, Shin-Ichi Nakano:
Efficient enumeration of ordered trees with k leaves. 22-27
![](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.