@book(AptGra11, editor = "Krzysztof Apt and Erich Gr{\"a}del", year = "2011", title = "{Lectures in Game Theory for Computer Scientists}", publisher = "Cambridge University Press", doi = "10.1017/CBO9780511973468", ) @misc(BerwangerDawHunKreObd12, author = "Dietmar Berwanger and Anuj Dawar and Paul Hunter and Stephan Kreutzer and Jan Obdr\v {z}{\'a}lek", title = "{The {D}{A}{G}-Width of Directed Graphs}", doi = "10.1016/j.jctb.2012.04.004", note = "To appear", ) @inproceedings(BerwangerGra05, author = "Dietmar Berwanger and Erich Gr{\"a}del", year = "2005", title = "{Entanglement -- A Measure for the Complexity of Directed Graphs with Applications to Logic and Games}", booktitle = "{Proceedings of LPAR 2004, Montevideo, Uruguay}", series = "{LNCS}", volume = "3452", publisher = "Springer", pages = "209--223", doi = "10.1007/978-3-540-32275-7\_15", ) @article(BerwangerGraKaiRab12, author = "Dietmar Berwanger and Erich Gr{\"a}del and {\L }ukasz Kaiser and Roman Rabinovich", title = "{Entanglement and the Complexity of Directed Graphs}", journal = "Theoretical Computer Science", url = "http://logic.rwth-aachen.de/~rabinovich/entangle.pdf", note = "To appear", ) @article(CourcelleEngRoz93, author = "Bruno Courcelle and Joost Engelfriet and Grzegorz Rozenberg", year = "1993", title = "{Handle-Rewriting Hypergraph Grammars}", journal = "J. Comput. Syst. Sci.", volume = "46", number = "2", pages = "218--270", doi = "10.1016/0022-0000(93)90004-G", ) @inproceedings(Fearnley10, author = "John Fearnley", year = "2010", title = "{Non-oblivious Strategy Improvement}", editor = "Edmund M. Clarke and Andrei Voronkov", booktitle = "{LPAR (Dakar)}", series = "{LNCS}", volume = "6355", publisher = "Springer", pages = "212--230", doi = "10.1007/978-3-642-17511-4\_13", ) @misc(Friedmann12b, author = "Oliver Friedmann", title = "{A Subexponential Lower Bound for Policy Iteration Based on Snare Memorization}", url = "http://files.oliverfriedmann.de/papers/fearnley_lower_bound.pdf", note = "Submitted for publication", ) @misc(Friedmann12a, author = "Oliver Friedmann", title = "{A Subexponential Lower Bound for the Least Recently Considered Rule for Solving Linear Programs and Games}", url = "http://files.oliverfriedmann.de/papers/least_recently_considered_lower_bound.pdf", note = "Submitted for publication", ) @phdthesis(FriedmannPhD, author = "Oliver Friedmann", year = "2011", title = "{Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs}", school = "Ludwig-{}{M}aximilians-{}{U}niversity {M}unich", url = "http://edoc.ub.uni-muenchen.de/13294", ) @article(HunterKre08, author = "P. Hunter and S. Kreutzer", year = "2008", title = "{Digraph Measures: Kelly Decompositions, Games, and Orderings}", journal = "Theor. Comput. Sci.", volume = "399", number = "3", pages = "206--219", doi = "10.1016/j.tcs.2008.02.038", ) @article(Jurdzinski98, author = "Marcin Jurdzi{\'n}ski", year = "1998", title = "{Deciding the Winner in Parity Games is in {U}{P} ${}\cap {}$ co-{U}{P}}", journal = "Inf. Process. Lett.", volume = "68", number = "3", pages = "119--124", doi = "10.1016/S0020-0190(98)00150-1", ) @inproceedings(Jurdzinski00, author = "Marcin Jurdzi{\'n}ski", year = "2000", title = "{Small Progress Measures for Solving Parity Games}", editor = "Horst Reichel and Sophie Tison", booktitle = "{STACS}", series = "{LNCS}", volume = "1770", publisher = "Springer", pages = "290--301", doi = "10.1007/3-540-46541-3\newline \_24", ) @inproceedings(JurdzinskiPatZwi06, author = "Marcin Jurdzi{\'n}ski and Mike Paterson and Uri Zwick", year = "2006", title = "{A Deterministic Subexponential Algorithm for Solving Parity Games}", booktitle = "{SODA}", publisher = "ACM Press", pages = "117--123", doi = "10.1145/1109557.1109571", url = "http://dl.acm.org/citation.cfm?id=1109557", ) @inproceedings(JurdzinskiVoe00, author = "Marcin Jurdzi{\'n}ski and Jens V{\"o}ge", year = "2000", title = "{A Discrete Strategy Improvement Algorithm for Solving Parity Games ({E}xtended Abstract)}", editor = "E. A. Emerson and A. P. Sistla", booktitle = "{Computer Aided Verification, 12th International Conference, CAV 2000, Proceedings}", series = "{LBCS}", volume = "1855", publisher = "Springer", address = "Chicago, IL, USA", pages = "202--215", doi = "10.1007/10722167\_18", ) @inproceedings(Obdrzalek03, author = "Jan Obdr\v {z}{\'a}lek", year = "2003", title = "{Fast Mu-Calculus Model Checking when Tree-Width Is Bounded}", editor = "Warren A. Hunt Jr. and Fabio Somenzi", booktitle = "{CAV}", series = "{LNCS}", volume = "2725", publisher = "Springer", pages = "80--92", doi = "10.1007/978-3-540-45069-6\_7", ) @inproceedings(Obdrzalek07, author = "Jan Obdr\v {z}{\'a}lek", year = "2007", title = "{Clique-Width and Parity Games}", editor = "J. Duparc and T. A. Henzinger", booktitle = "{CSL '07}", series = "{LNCS}", volume = "4646", publisher = "Springer", pages = "54--68", doi = "10.1007/978-3-540-74915-8-8", ) @inproceedings(Schewe08, author = "Sven Schewe", year = "2008", title = "{An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games}", editor = "Michael Kaminski and Simone Martini", booktitle = "{CSL}", series = "{LNCS}", volume = "5213", publisher = "Springer", pages = "369--384", doi = "10.1007/978-3-540-87531-4\_27", )