Neil Thapen

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 Vojtech Rödl

> Home > Persons > Neil Thapen

Publications

2017
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorica/LauriaPRT17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/LauriaPRT17
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. Comb. 37(2): 253-268 (2017)
2013
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/LauriaPRT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/LauriaPRT13
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The Complexity of Proving That a Graph Is Ramsey. ICALP (1) 2013: 684-695
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1303-3166
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1303-3166
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. CoRR abs/1303.3166 (2013)
[i5]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/LauriaPRT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/LauriaPRT13
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. Electron. Colloquium Comput. Complex. TR13 (2013)

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.