@InProceedings{GanianRamanujanSzeider17,
  author ={Robert Ganian and M. S. Ramanujan and Stefan Szeider},
  title ={{Combining Treewidth and Backdoors for CSP}},
  booktitle ={34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
  pages ={36:1--36:17},
  series ={Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN ={978-3-95977-028-6},
  ISSN ={1868-8969},
  year ={2017},
  volume ={66},
  editor ={Heribert Vollmer and Brigitte Vallée},
  publisher ={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address ={Dagstuhl, Germany},
  URL ={http://drops.dagstuhl.de/opus/volltexte/2017/6998},
  URN ={urn:nbn:de:0030-drops-69986},
  doi ={10.4230/LIPIcs.STACS.2017.36},
  annote ={Keywords: Algorithms and data structures, Fixed Parameter Tractability, Constraint Satisfaction},
  keywords={xtract}
}

{"_id":"ou3uDoXGJWyb5HRhB","bibbaseid":"ganian-ramanujan-szeider-combiningtreewidthandbackdoorsforcsp-2017","downloads":0,"creationDate":"2017-10-05T10:51:21.848Z","title":"Combining Treewidth and Backdoors for CSP","author_short":["Ganian, R.","Ramanujan, M. S.","Szeider, S."],"year":2017,"bibtype":"inproceedings","biburl":"https://www2.warwick.ac.uk/fac/sci/dcs/people/ramanujan_sridharan/publications-web_copy.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Robert"],"propositions":[],"lastnames":["Ganian"],"suffixes":[]},{"firstnames":["M.","S."],"propositions":[],"lastnames":["Ramanujan"],"suffixes":[]},{"firstnames":["Stefan"],"propositions":[],"lastnames":["Szeider"],"suffixes":[]}],"title":"Combining Treewidth and Backdoors for CSP","booktitle":"34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)","pages":"36:1--36:17","series":"Leibniz International Proceedings in Informatics (LIPIcs)","isbn":"978-3-95977-028-6","issn":"1868-8969","year":"2017","volume":"66","editor":[{"firstnames":["Heribert"],"propositions":[],"lastnames":["Vollmer"],"suffixes":[]},{"firstnames":["Brigitte"],"propositions":[],"lastnames":["Vallée"],"suffixes":[]}],"publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","address":"Dagstuhl, Germany","url":"http://drops.dagstuhl.de/opus/volltexte/2017/6998","urn":"urn:nbn:de:0030-drops-69986","doi":"10.4230/LIPIcs.STACS.2017.36","annote":"Keywords: Algorithms and data structures, Fixed Parameter Tractability, Constraint Satisfaction","keywords":"xtract","bibtex":"@InProceedings{GanianRamanujanSzeider17,\n author ={Robert Ganian and M. S. Ramanujan and Stefan Szeider},\n title ={{Combining Treewidth and Backdoors for CSP}},\n booktitle ={34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},\n pages ={36:1--36:17},\n series ={Leibniz International Proceedings in Informatics (LIPIcs)},\n ISBN ={978-3-95977-028-6},\n ISSN ={1868-8969},\n year ={2017},\n volume ={66},\n editor ={Heribert Vollmer and Brigitte Vallée},\n publisher ={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},\n address ={Dagstuhl, Germany},\n URL ={http://drops.dagstuhl.de/opus/volltexte/2017/6998},\n URN ={urn:nbn:de:0030-drops-69986},\n doi ={10.4230/LIPIcs.STACS.2017.36},\n annote ={Keywords: Algorithms and data structures, Fixed Parameter Tractability, Constraint Satisfaction},\n keywords={xtract}\n}\n \n","author_short":["Ganian, R.","Ramanujan, M. S.","Szeider, S."],"editor_short":["Vollmer, H.","Vallée, B."],"key":"GanianRamanujanSzeider17","id":"GanianRamanujanSzeider17","bibbaseid":"ganian-ramanujan-szeider-combiningtreewidthandbackdoorsforcsp-2017","role":"author","urls":{"Paper":"http://drops.dagstuhl.de/opus/volltexte/2017/6998"},"keyword":["xtract"],"downloads":0,"html":""},"search_terms":["combining","treewidth","backdoors","csp","ganian","ramanujan","szeider"],"keywords":["xtract"],"authorIDs":["59d60ea928edf54e23000035"],"dataSources":["NMnTopwcKW96LjkcR"]}