default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 442

> Home > Journals > Theoretical Computer Science

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 442, July 2012

Preface

- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/NandyS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/NandyS12
Subhas C. Nandy, Sandeep Sen:
Preface. 1

Contributions

- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/AltS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AltS12
Helmut Alt, Ludmila Scharf:
Shape matching by random sampling. 2-12
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/MahajanNV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MahajanNV12
Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan:
The planar k-means problem is NP-hard. 13-21
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/YamanakaON12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/YamanakaON12
Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Efficient enumeration of ordered trees with k leaves. 22-27

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.