@incollection{Lincoln_2018,
    doi = {10.1137/1.9781611975031.80},
    url = {https://doi.org/10.1137%2F1.9781611975031.80},
    year = {2018},
    month = {jan},
    publisher = {Society for Industrial and Applied Mathematics},
    pages = {1236--1252},
    author = {Andrea Lincoln and Virginia Vassilevska Williams and Ryan Williams},
    title = {Tight Hardness for Shortest Cycles and Paths in Sparse Graphs},
    booktitle = {Proceedings of the Twenty-Ninth Annual {ACM}-{SIAM} Symposium on Discrete Algorithms}
}

@incollection{Lincoln_2018, doi = {10.1137/1.9781611975031.80}, url = {https://doi.org/10.1137%2F1.9781611975031.80}, year = {2018}, month = {jan}, publisher = {Society for Industrial and Applied Mathematics}, pages = {1236--1252}, author = {Andrea Lincoln and Virginia Vassilevska Williams and Ryan Williams}, title = {Tight Hardness for Shortest Cycles and Paths in Sparse Graphs}, booktitle = {Proceedings of the Twenty-Ninth Annual {ACM}-{SIAM} Symposium on Discrete Algorithms} }