
@Article{Csardi2006,
    title = {The igraph software package for complex network research},
    author = {Gabor Csardi and Tamas Nepusz},
    journal = {InterJournal},
    volume = {Complex Systems},
    pages = {1695},
    year = {2006},
    url = {https://igraph.org},
}


@article{Fredman1987,
    author = {Fredman, Michael L. and Tarjan, Robert Endre},
    title = {Fibonacci Heaps and Their Uses in Improved Network Optimization
        Algorithms},
    journal = {J. ACM},
    issue_date = {July 1987},
    volume = {34},
    number = {3},
    month = jul,
    year = {1987},
    issn = {0004-5411},
    pages = {596--615},
    numpages = {20},
    url = {https://doi.acm.org/10.1145/28869.28874},
    doi = {10.1145/28869.28874},
    acmid = {28874},
    publisher = {ACM},
    address = {New York, NY, USA},
} 

@article{Johnson1977,
    author = {Johnson, Donald B.},
    title = {Efficient Algorithms for Shortest Paths in Sparse Networks},
    journal = {J. ACM},
    issue_date = {Jan. 1977},
    volume = {24},
    number = {1},
    month = jan,
    year = {1977},
    issn = {0004-5411},
    pages = {1--13},
    numpages = {13},
    url = {https://doi.acm.org/10.1145/321992.321993},
    doi = {10.1145/321992.321993},
    acmid = {321993},
    publisher = {ACM},
    address = {New York, NY, USA},
} 


@article{Miller1960,
    ISSN = {00034851},
    URL = {https://www.jstor.org/stable/2237496},
    author = {Rupert G. Miller},
    journal = {The Annals of Mathematical Statistics},
    number = {1},
    pages = {86-103},
    publisher = {Institute of Mathematical Statistics},
    title = {Priority Queues},
    volume = {31},
    year = {1960}
}

@Article{Saunders2003,
    Title                    = {Improved shortest path algorithms for nearly acyclic graphs.},
    Author                   = {Saunders, S. and Takaoka, T.},
    Journal                  = {Theoretical Computer Science},
    Year                     = {2003},
    Number                   = {3},
    Pages                    = {535–-556},
    Volume                   = {293}
}


@PhdThesis{Saunders2004,
    Title                    = {Improved Shortest Path Algorithms for Nearly Acyclic Graphs},
    Author                   = {Saunders, Shane},
    Year                     = {2004},
    School                   = {Department of Computer Science and Software Engineering, University of Canterbury, New Zealand}
}

@InBook{Takaoka1999,
    Title                    = {Theory of 2-3 Heaps},
    Author                   = {Takaoka, Tadao},
    Editor                   = {Asano, Takano and Imai, Hideki and Lee, D. T. and Nakano, Shin-ichi and Tokuyama, Takeshi},
    Pages                    = {41--50},
    Publisher                = {Springer Berlin Heidelberg},
    Year                     = {1999},
    Booktitle                = {Computing and Combinatorics:
        5th Annual International Conference, COCOON'99 Tokyo,
        Japan, July 26--28, 1999 Proceedings},
    Doi                      = {10.1007/3-540-48686-0_4},
    ISBN                     = {978-3-540-48686-2},
    Url                      = {https://doi.org/10.1007/3-540-48686-0_4}
}

@InBook{Takaoka2000,
    Title                    = {Theory of Trinomial Heaps},
    Author                   = {Takaoka, Tadao},
    Editor                   = {Du, Ding-Zhu and Eades, Peter and
        Estivill-Castro, Vladimir and Lin, Xuemin and Sharma, Arun},
    Pages                    = {362--372},
    Publisher                = {Springer Berlin Heidelberg},
    Year                     = {2000},
    Booktitle                = {Computing and Combinatorics:
        6th Annual International Conference, COCOON 2000
            Sydney, Australia, July 26--28, 2000 Proceedings},
    Doi                      = {10.1007/3-540-44968-X_36},
    ISBN                     = {978-3-540-44968-3},
    Url                      = {https://doi.org/10.1007/3-540-44968-X_36}
}



@Book{Tarjan1983,
    Title                    = {Data Structures and Network Algorithms},
    Author                   = {Tarjan, R.},
    Publisher                = {Society for Industrial and Applied Mathematics},
    Year                     = {1983},
    Doi                      = {10.1137/1.9781611970265},
    Eprint = {https://epubs.siam.org/doi/pdf/10.1137/1.9781611970265},
    Owner                    = {markus},
    Review                   = {reference for priority queues and heaps},
    Timestamp                = {2017.08.22},
    Url = {https://epubs.siam.org/doi/abs/10.1137/1.9781611970265}
}

@InCollection{Williams1964,
    Title                    = {Algorithm 232 - Heapsort},
    Author                   = {Williams, J.W.J.},
    Booktitle                = {Algorithms},
    Publisher                = {Communications of the ACM},
    Year                     = {1964},
    Address                  = {New York NY, USA},
    Editor                   = {Forsyth, G.E.},
    Number                   = {6},
    Pages                    = {347--349},
    Volume                   = {7},
    Doi                      = {10.1145/512274.512284},
    Url                      = {https://doi.acm.org/10.1145/512274.512284}
}
