1![Opening Data aus(Open Documents) mit(Open Source Software) Barnaby Skinner, SonntagsZeitung & Tages-Anzeiger, Opendata.chJun 17, bsk Opening Data aus(Open Documents) mit(Open Source Software) Barnaby Skinner, SonntagsZeitung & Tages-Anzeiger, Opendata.chJun 17, bsk](https://www.pdfsearch.io/img/f2cd3f79584ccc752d77b172b5793a79.jpg) | Add to Reading ListSource URL: opendata.utou.ch- Date: 2017-06-27 10:32:03
|
---|
2![arXiv:1610.08496v1 [math.CO] 26 OctEXTREMES OF THE INTERNAL ENERGY OF THE POTTS MODEL ON CUBIC GRAPHS EWAN DAVIES, MATTHEW JENSSEN, WILL PERKINS, AND BARNABY ROBERTS arXiv:1610.08496v1 [math.CO] 26 OctEXTREMES OF THE INTERNAL ENERGY OF THE POTTS MODEL ON CUBIC GRAPHS EWAN DAVIES, MATTHEW JENSSEN, WILL PERKINS, AND BARNABY ROBERTS](https://www.pdfsearch.io/img/9c0f4605a3dadc57287a55ba87520d9d.jpg) | Add to Reading ListSource URL: arxiv.org- Date: 2016-10-26 20:21:08
|
---|
3![PARAMETERIZED PROOF COMPLEXITY Stefan Dantchev, Barnaby Martin, and Stefan Szeider Abstract. We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractabl PARAMETERIZED PROOF COMPLEXITY Stefan Dantchev, Barnaby Martin, and Stefan Szeider Abstract. We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractabl](https://www.pdfsearch.io/img/e07009fa1b5d4b881f5f65d3895ec2e5.jpg) | Add to Reading ListSource URL: www.bedewell.com- Date: 2010-09-03 07:57:16
|
---|
4![Finding vertex-surjective graph homomorphisms? Petr A. Golovach1 , Bernard Lidick´ y2 , 1 Barnaby Martin , and Dani¨el Paulusma1 Finding vertex-surjective graph homomorphisms? Petr A. Golovach1 , Bernard Lidick´ y2 , 1 Barnaby Martin , and Dani¨el Paulusma1](https://www.pdfsearch.io/img/8908efc6746d8ae48e131386d0ca433a.jpg) | Add to Reading ListSource URL: www.bedewell.com- Date: 2012-03-15 13:21:10
|
---|
5![The Computational Complexity of Disconnected Cut and 2K2 -Partition? Barnaby Martin1 and Dani¨el Paulusma1 School of Engineering and Computing Sciences, Durham University, Science Laboratories, South Road, Durham DH1 3L The Computational Complexity of Disconnected Cut and 2K2 -Partition? Barnaby Martin1 and Dani¨el Paulusma1 School of Engineering and Computing Sciences, Durham University, Science Laboratories, South Road, Durham DH1 3L](https://www.pdfsearch.io/img/bbeb79301cc1e51f9d27a0550a62dff9.jpg) | Add to Reading ListSource URL: www.bedewell.com- Date: 2011-06-07 13:58:40
|
---|
6![Introduction The systems Res(k) The limits of tractability in Resolution-based propositional proof systems Barnaby Martin (joint work with Stefan Dantchev) Introduction The systems Res(k) The limits of tractability in Resolution-based propositional proof systems Barnaby Martin (joint work with Stefan Dantchev)](https://www.pdfsearch.io/img/a758aea78df4b44d19eba7c0c4b50ba6.jpg) | Add to Reading ListSource URL: www.bedewell.com- Date: 2010-06-22 12:42:42
|
---|
7![Tight Rank Lower Bounds for the Sherali-Adams Proof System Stefan Dantchev, Barnaby Martin and Mark Rhodes 1 Department of Computer Science, University of Durham, South Road, Durham. DH1 3LE, U.K. Tight Rank Lower Bounds for the Sherali-Adams Proof System Stefan Dantchev, Barnaby Martin and Mark Rhodes 1 Department of Computer Science, University of Durham, South Road, Durham. DH1 3LE, U.K.](https://www.pdfsearch.io/img/3c188fbaf6c0a1af3d3f43f1fcbd5d80.jpg) | Add to Reading ListSource URL: www.bedewell.com- Date: 2009-11-10 10:56:32
|
---|
8![The Preservation Properties of Positive Horn Logic Barnaby Martin Department of Computer Science, University of Durham, Durham DH1 3LE, UK. Florent Madelaine The Preservation Properties of Positive Horn Logic Barnaby Martin Department of Computer Science, University of Durham, Durham DH1 3LE, UK. Florent Madelaine](https://www.pdfsearch.io/img/c2baa0588b88b34c79cb107ec9afd998.jpg) | Add to Reading ListSource URL: www.bedewell.com- Date: 2009-11-05 08:17:18
|
---|
9![BARNABY BEAR ST YLE GUIDELINES BARNABY BEAR BARNABY BEAR ST YLE GUIDELINES BARNABY BEAR](https://www.pdfsearch.io/img/cf3ddfd8f146c2a72b94eca9d28fb060.jpg) | Add to Reading ListSource URL: geography.org.uk |
---|
10![RANK COMPLEXITY GAP FOR ´ LOVASZ-SCHRIJVER AND SHERALI-ADAMS PROOF SYSTEMS Stefan Dantchev and Barnaby Martin RANK COMPLEXITY GAP FOR ´ LOVASZ-SCHRIJVER AND SHERALI-ADAMS PROOF SYSTEMS Stefan Dantchev and Barnaby Martin](https://www.pdfsearch.io/img/bff3d469be274f4a218278784f5bb3f4.jpg) | Add to Reading ListSource URL: www.bedewell.com- Date: 2011-01-10 19:35:42
|
---|