| dc.contributor.author | Jerrum, M | en_US |
| dc.contributor.author | Meeks, K | en_US |
| dc.date.accessioned | 2016-12-02T16:06:33Z | |
| dc.date.available | 2015-10-03 | en_US |
| dc.date.issued | 2017-10 | en_US |
| dc.date.submitted | 2016-11-03T10:43:40.424Z | |
| dc.identifier.issn | 0209-9683 | en_US |
| dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/18110 | |
| dc.description.sponsorship | Research supported by EPSRC grant EP/I011935/1 (“Computational Counting”) | en_US |
| dc.format.extent | 965 - 990 | en_US |
| dc.relation.ispartof | COMBINATORICA | en_US |
| dc.rights | This is a pre-copyedited, author-produced PDF of an article accepted for publication in Combinatorica following peer review. The version of record is available http://link.springer.com/article/10.1007/s00493-016-3338-5 | |
| dc.title | The parameterised complexity of counting even and odd induced subgraphs | en_US |
| dc.type | Article | |
| dc.rights.holder | © János Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg 2016 | |
| dc.identifier.doi | 10.1007/s00493-016-3338-5 | en_US |
| pubs.author-url | http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000418056000008&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6a | en_US |
| pubs.issue | 5 | en_US |
| pubs.notes | Not known | en_US |
| pubs.publication-status | Published | en_US |
| pubs.volume | 37 | en_US |
