Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Nicholas J. A. Harvey

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ryuhei Uehara

> Home > Persons > Nicholas J. A. Harvey

Publications

2014
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/DemaineDHUUU14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DemaineDHUUU14
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
UNO is hard, even for a single player. Theor. Comput. Sci. 521: 51-61 (2014)
2011
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/ItoDHPSUU11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ItoDHPSUU11
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno:
On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12-14): 1054-1065 (2011)
2008
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/ItoDHPSUU08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/ItoDHPSUU08
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno:
On the Complexity of Reconfiguration Problems. ISAAC 2008: 28-39

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.