@inproceedings{
    bibdb-export-pkaski-2014-3,
    editor = "Chekuri, Chandra",
    author = {Bj{\"o}rklund, Andreas and Kaski, Petteri and Kowalik, {\L}ukasz},
    publisher = "Society for Industrial and Applied Mathematics",
    isbn = "978-1-61197-340-2",
    language = "eng",
    title = "Counting thin subgraphs via packings faster than meet-in-the-middle time",
    url = "http://dx.doi.org/10.1137/1.9781611973402.45",
    country = "United States",
    booktitle = "Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms",
    issn = "1557-9468",
    year = "2014",
    pages = "594-603",
    juforank = "2",
    responsibleauthor = "Kaski, Petteri",
    flags = "HIIT",
    il = "yes",
    eventdetails = "Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, January 5--7, Portland, Oregon, USA",
    address = "Philadelphia, PA",
    unitcode = "T306 - 99, T312 - 1",
    kay = "NA",
    impactfactor = "a4",
    doistring = "10.1137/1.9781611973402.45"
}