@book(AhoHU1974,
 author       = "Alfred V. Aho and John E. Hopcroft and Jeffrey D. Ullman",
 year         = "1974",
 title        = "{The Design and Analysis of Computer Algorithms}",
 publisher    = "Addison-Wesley",
)
@book(AhujaMO1992,
 author       = "Ravindra K. Ahuja and Thomas L. Magnanti and James B. Orlin",
 year         = "1993",
 title        = "{Network flows: theory, algorithms, and applications}",
 publisher    = "Prentice Hall",
)
@article(AlonGM1997,
 author       = "Noga Alon and Zvi Galil and Oded Margalit",
 year         = "1997",
 title        = "{On the Exponent of the All Pairs Shortest Path Problem}",
 journal      = "Journal of Computer and System Sciences",
 volume       = "54",
 number       = "2",
 pages        = "255--262",
 doi          = "10.1006/jcss.1997.1388",
 note         = "Announced at FOCS '91",
)
@inproceedings(BGHJ09,
 author       = "Roderick Bloem and Karin Greimel and Thomas A. Henzinger and Barbara Jobstmann",
 year         = "2009",
 title        = "{Synthesizing robust systems}",
 booktitle    = "FMCAD",
 pages        = "85--92",
 doi          = "10.1109/FMCAD.2009.5351139",
)
@inproceedings(BorosEFGMM2011,
 author       = "Endre Boros and Khaled Elbassioni and Mahmoud Fouz and Vladimir Gurvich and Kazuhisa Makino and Bodo Manthey",
 year         = "2011",
 title        = "{Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes}",
 booktitle    = "ICALP",
 pages        = "147--158",
 doi          = "10.1007/978-3-642-22006-7\_13",
)
@article(ButkovicG1992,
 author       = "Peter Butkovic and Raymond A. Cuninghame-Green",
 year         = "1992",
 title        = "{An $ O(n^2) $ algorithm for the maximum cycle mean of an $ n \times n $ bivalent matrix.}",
 journal      = "Discrete Applied Mathematics",
 volume       = "35",
 number       = "2",
 pages        = "157--162",
 doi          = "10.1016/0166-218X(92)90039-D",
)
@article(Chan2010,
 author       = "Timothy M. Chan",
 year         = "2010",
 title        = "{More Algorithms for All-Pairs Shortest Paths in Weighted Graphs}",
 journal      = "SIAM Journal on Computing",
 volume       = "39",
 number       = "5",
 pages        = "2075--2089",
 doi          = "10.1137/08071990X",
 note         = "Announced at STOC '07",
)
@article(DasdanG1998,
 author       = "Ali Dasdan and Rajesh K. Gupta",
 year         = "1998",
 title        = "{Faster Maximum and Minimum Mean Cycle Algorithms for System-Performance Analysis}",
 journal      = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
 volume       = "17",
 number       = "10",
 pages        = "889--899",
 doi          = "10.1109/43.728912",
)
@inproceedings(DM10,
 author       = "Manfred Droste and Ingmar Meinecke",
 year         = "2010",
 title        = "{Describing Average- and Longtime-Behavior by Weighted {MSO} Logics}",
 booktitle    = "MFCS",
 pages        = "537--548",
 doi          = "10.1007/978-3-642-15155-2\_47",
)
@article(EhrenfeuchtM1979,
 author       = "Andrzej Ehrenfeucht and Jan Mycielski",
 year         = "1979",
 title        = "{P}ositional strategies for mean payoff games",
 journal      = "International Journal of Game Theory",
 volume       = "8",
 number       = "2",
 pages        = "109--113",
 doi          = "10.1007/BF01768705",
)
@article(Fredman1976,
 author       = "Michael L. Fredman",
 year         = "1976",
 title        = "{New Bounds on the Complexity of the Shortest Path Problem}",
 journal      = "SIAM Journal on Computing",
 volume       = "5",
 number       = "1",
 pages        = "83--89",
 doi          = "10.1137/0205006",
)
@article(Goldberg1995,
 author       = "Andrew V. Goldberg",
 year         = "1995",
 title        = "{Scaling Algorithms for the Shortest Paths Problem}",
 journal      = "SIAM Journal on Computing",
 volume       = "24",
 number       = "3",
 pages        = "494--504",
 doi          = "10.1137/S0097539792231179",
)
@article(GurvichKK1988,
 author       = "V.A. Gurvich and A.V. Karzanov and L.G. Khachiyan",
 year         = "1988",
 title        = "{C}yclic games and an algorithm to find minimax cycle means in directed graphs",
 journal      = "USSR Computational Mathematics and Mathematical Physics",
 volume       = "28",
 number       = "5",
 pages        = "85--91",
 doi          = "10.1016/0041-5553(88)90012-2",
)
@inproceedings(HansenZ2010,
 author       = "Thomas Dueholm Hansen and Uri Zwick",
 year         = "2010",
 title        = "{Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles}",
 booktitle    = "ISAAC",
 pages        = "415--426",
 doi          = "10.1007/978-3-642-17517-6\_37",
)
@article(HartmannO1993,
 author       = "Mark Hartmann and James B. Orlin",
 year         = "1993",
 title        = "{Finding Minimum Cost to Time Ratio Cycles With Small Integral Transit Times}",
 journal      = "Networks",
 volume       = "23",
 number       = "6",
 pages        = "567--574",
 doi          = "10.1002/net.3230230607",
)
@book(Howard1960,
 author       = "Ronald A. Howard",
 year         = "1960",
 title        = "{Dynamic Programming and Markov Processes}",
 publisher    = "MIT Press",
)
@article(Karp1978,
 author       = "Richard M. Karp",
 year         = "1978",
 title        = "{A characterization of the minimum cycle mean in a digraph}",
 journal      = "Discrete Mathematics",
 volume       = "23",
 number       = "3",
 pages        = "309--311",
 doi          = "10.1016/0012-365X(78)90011-0",
)
@article(KarpO1981,
 author       = "Richard M. Karp and James B. Orlin",
 year         = "1981",
 title        = "{Parametric shortest path algorithms with an application to cyclic staffing}",
 journal      = "Discrete Applied Mathematics",
 volume       = "3",
 number       = "1",
 pages        = "37--45",
 doi          = "10.1016/0166-218X(81)90026-3",
)
@book(Lawler1976,
 author       = "Eug\IeC {\`e}ne L. Lawler",
 year         = "1976",
 title        = "{Combinatorial optimization: Networks and Matroids}",
 publisher    = "Dover Publications",
)
@inproceedings(Madani2002,
 author       = "Omid Madani",
 year         = "2002",
 title        = "{Polynomial Value Iteration Algorithms for Deterministic MDPs}",
 booktitle    = "UAI",
 pages        = "311--318",
 url          = "http://dl.acm.org/citation.cfm?id=2073913",
)
@article(McCormick1993,
 author       = "S. Thomas McCormick",
 year         = "1993",
 title        = "{Approximate Binary Search Algorithms for Mean Cuts and Cycles}",
 journal      = "Operations Research Letters",
 volume       = "14",
 number       = "3",
 pages        = "129--132",
 doi          = "10.1016/0167-6377(93)90022-9",
)
@article(OrlinA1992,
 author       = "James B. Orlin and Ravindra K. Ahuja",
 year         = "1992",
 title        = "{New scaling algorithms for the assignment and minimum mean cycle problems}",
 journal      = "Mathematical Programming",
 volume       = "54",
 number       = "1-3",
 pages        = "41--56",
 doi          = "10.1007/BF01586040",
)
@inproceedings(RothBKM2010,
 author       = "Aaron Roth and Maria-Florina Balcan and Adam Kalai and Yishay Mansour",
 year         = "2010",
 title        = "{On the Equilibria of Alternating Move Games}",
 booktitle    = "SODA",
 pages        = "805--816",
 url          = "http://dl.acm.org/citation.cfm?id=1873667",
)
@inproceedings(Sankowski2005,
 author       = "Piotr Sankowski",
 year         = "2005",
 title        = "{Shortest Paths in Matrix Multiplication Time}",
 booktitle    = "ESA",
 pages        = "770--778",
 doi          = "10.1007/11561071\_68",
)
@inproceedings(Williams2012,
 author       = "Virginia Vassilevska Williams",
 year         = "2012",
 title        = "{Multiplying Matrices Faster Than Coppersmith-Winograd}",
 booktitle    = "STOC",
 pages        = "887--898",
 doi          = "10.1145/2213977.2214056",
)
@inproceedings(WilliamsW2010,
 author       = "Virginia Vassilevska Williams and Ryan Williams",
 year         = "2010",
 title        = "{Subcubic Equivalences between Path, Matrix and Triangle Problems}",
 booktitle    = "FOCS",
 pages        = "645--654",
 doi          = "10.1109/FOCS.2010.67",
)
@article(YoungTO1991,
 author       = "Neal E. Young and Robert Endre Tarjan and James B. Orlin",
 year         = "1991",
 title        = "{Faster Parametric Shortest Path and Minimum-Balance algorithms}",
 journal      = "Networks",
 volume       = "21",
 number       = "2",
 pages        = "205--221",
 doi          = "10.1002/net.3230210206",
)
@article(Yuval1976,
 author       = "Gideon Yuval",
 year         = "1976",
 title        = "{An algorithm for finding all shortest paths using $ N^{2.81} $ infinite-precision multiplications}",
 journal      = "Information Processing Letters",
 volume       = "4",
 number       = "6",
 pages        = "155--156",
 doi          = "10.1016/0020-0190(76)90085-5",
)
@article(Zemel1987,
 author       = "Eitan Zemel",
 year         = "1987",
 title        = "{A Linear Time Randomizing Algorithm for Searching Ranked Functions}",
 journal      = "Algorithmica",
 volume       = "2",
 number       = "1-4",
 pages        = "81--90",
 doi          = "10.1007/BF01840350",
)
@article(Zwick2002,
 author       = "Uri Zwick",
 year         = "2002",
 title        = "{All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication}",
 journal      = "Journal of the ACM",
 volume       = "49",
 number       = "3",
 pages        = "289--317",
 doi          = "10.1145/567112.567114",
 note         = "Announced at FOCS '98",
)
@article(ZwickP1996,
 author       = "Uri Zwick and Mike Paterson",
 year         = "1996",
 title        = "{The complexity of mean payoff games on graphs}",
 journal      = "Theoretical Computer Science",
 volume       = "158",
 number       = "1-2",
 pages        = "343--359",
 doi          = "10.1016/0304-3975(95)00188-3",
 note         = "Announced at COCOON '95",
)