Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical 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
a service of 
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.
last updated on 2024-04-22 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
