Gimbert, Hugo; Kelmendi, Edon Submixing and shift-invariant stochastic games. (English) Zbl 07783096 Int. J. Game Theory 52, No. 4, 1179-1214 (2023). MSC: 91A15 91A05 91A43 05C57 PDFBibTeX XMLCite \textit{H. Gimbert} and \textit{E. Kelmendi}, Int. J. Game Theory 52, No. 4, 1179--1214 (2023; Zbl 07783096) Full Text: DOI arXiv OA License
Loho, Georg Abstract tropical linear programming. (English) Zbl 1454.14157 Electron. J. Comb. 27, No. 2, Research Paper P2.51, 68 p. (2020). MSC: 14T90 90C05 52C40 91A50 05E45 PDFBibTeX XMLCite \textit{G. Loho}, Electron. J. Comb. 27, No. 2, Research Paper P2.51, 68 p. (2020; Zbl 1454.14157) Full Text: DOI arXiv
Dorfman, Dani; Kaplan, Haim; Zwick, Uri A faster deterministic exponential time algorithm for energy games and mean payoff games. (English) Zbl 1522.91066 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 114, 14 p. (2019). MSC: 91A68 91A43 05C57 PDFBibTeX XMLCite \textit{D. Dorfman} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 114, 14 p. (2019; Zbl 1522.91066) Full Text: DOI
Adve, Anshul; Colleen, Robichaux; Alexander, Yong Computational complexity, Newton polytopes, and Schubert polynomials. (English) Zbl 1436.05115 Sémin. Lothar. Comb. 82B, Article 52, 12 p. (2019). MSC: 05E10 05E05 05A15 14M15 68Q17 PDFBibTeX XMLCite \textit{A. Adve} et al., Sémin. Lothar. Comb. 82B, Article 52, 12 p. (2019; Zbl 1436.05115) Full Text: arXiv Link
Avni, Guy; Henzinger, Thomas A.; Ibsen-Jensen, Rasmus Infinite-duration poorman-bidding games. (English) Zbl 1443.91070 Christodoulou, George (ed.) et al., Web and Internet economics. 14th international conference, WINE 2018, Oxford, UK, December 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11316, 21-36 (2018). MSC: 91A43 91A05 05C57 91A68 PDFBibTeX XMLCite \textit{G. Avni} et al., Lect. Notes Comput. Sci. 11316, 21--36 (2018; Zbl 1443.91070) Full Text: DOI arXiv
Avni, Guy; Guha, Shibashis; Kupferman, Orna An abstraction-refinement methodology for reasoning about network games. (English) Zbl 1418.91097 Games 9, No. 3, Paper No. 39, 21 p. (2018). MSC: 91A43 05C57 68Q45 PDFBibTeX XMLCite \textit{G. Avni} et al., Games 9, No. 3, Paper No. 39, 21 p. (2018; Zbl 1418.91097) Full Text: DOI
Le Roux, Stéphane; Pauly, Arno Extending finite-memory determinacy to multi-player games. (English) Zbl 1396.91045 Inf. Comput. 261, Part 4, 676-694 (2018). MSC: 91A43 91A06 05C57 PDFBibTeX XMLCite \textit{S. Le Roux} and \textit{A. Pauly}, Inf. Comput. 261, Part 4, 676--694 (2018; Zbl 1396.91045) Full Text: DOI arXiv Link
Gottlob, Georg; Malizia, Enrico Achieving new upper bounds for the hypergraph duality problem through logic. (English) Zbl 1506.68037 SIAM J. Comput. 47, No. 2, 456-492 (2018). MSC: 68Q25 03B70 05C65 05C85 PDFBibTeX XMLCite \textit{G. Gottlob} and \textit{E. Malizia}, SIAM J. Comput. 47, No. 2, 456--492 (2018; Zbl 1506.68037) Full Text: DOI arXiv
Avni, Guy; Henzinger, Thomas A.; Chonev, Ventsislav Infinite-duration bidding games. (English) Zbl 1448.91061 Meyer, Roland (ed.) et al., 28th international conference on concurrency theory. CONCUR 2017, Berlin, Germany, September 5–8, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 85, Article 21, 18 p. (2017). MSC: 91A43 05C57 91A05 91A20 PDFBibTeX XMLCite \textit{G. Avni} et al., LIPIcs -- Leibniz Int. Proc. Inform. 85, Article 21, 18 p. (2017; Zbl 1448.91061) Full Text: DOI
Chatterjee, Krishnendu; Velner, Yaron Hyperplane separation technique for multidimensional mean-payoff games. (English) Zbl 1371.68107 J. Comput. Syst. Sci. 88, 236-259 (2017). MSC: 68Q25 05C57 91A43 PDFBibTeX XMLCite \textit{K. Chatterjee} and \textit{Y. Velner}, J. Comput. Syst. Sci. 88, 236--259 (2017; Zbl 1371.68107) Full Text: DOI
Dittmann, Christoph; Kreutzer, Stephan; Tomescu, Alexandru I. Graph operations on parity games and polynomial-time algorithms. (English) Zbl 1334.05088 Theor. Comput. Sci. 614, 97-108 (2016). MSC: 05C57 05C20 05C76 05C85 91A43 91A05 PDFBibTeX XMLCite \textit{C. Dittmann} et al., Theor. Comput. Sci. 614, 97--108 (2016; Zbl 1334.05088) Full Text: DOI arXiv
Huth, Michael; Kuo, Jim Huan-Pu; Piterman, Nir The Rabin index of parity games: its complexity and approximation. (English) Zbl 1332.68060 Inf. Comput. 245, 36-53 (2015). MSC: 68Q19 05C15 05C57 68Q17 68Q25 91A43 91A05 PDFBibTeX XMLCite \textit{M. Huth} et al., Inf. Comput. 245, 36--53 (2015; Zbl 1332.68060) Full Text: DOI
Henzinger, Monika; Krinninger, Sebastian; Loitzenbauer, Veronika Finding 2-edge and 2-vertex strongly connected components in quadratic time. (English) Zbl 1410.05203 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 713-724 (2015). MSC: 05C85 05C20 05C40 68W40 PDFBibTeX XMLCite \textit{M. Henzinger} et al., Lect. Notes Comput. Sci. 9134, 713--724 (2015; Zbl 1410.05203) Full Text: DOI arXiv
Canavoi, Felix; Grädel, Erich; Rabinovich, Roman The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs. (English) Zbl 1303.68066 Theor. Comput. Sci. 560, Part 3, 235-250 (2014). MSC: 68Q25 05C57 05C20 PDFBibTeX XMLCite \textit{F. Canavoi} et al., Theor. Comput. Sci. 560, Part 3, 235--250 (2014; Zbl 1303.68066) Full Text: DOI arXiv
Chatterjee, Krishnendu; Henzinger, Monika Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. (English) Zbl 1295.91019 J. ACM 61, No. 3, Article No. 15, 40 p. (2014). MSC: 91A43 05C85 68Q60 68Q87 68R10 91A10 PDFBibTeX XMLCite \textit{K. Chatterjee} and \textit{M. Henzinger}, J. ACM 61, No. 3, Article No. 15, 40 p. (2014; Zbl 1295.91019) Full Text: DOI
Fomin, Fedor V.; Villanger, Yngve Subexponential parameterized algorithm for minimum fill-in. (English) Zbl 1421.68061 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1737-1746 (2012). MSC: 68Q17 05C85 68Q25 68R10 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{Y. Villanger}, in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1737--1746 (2012; Zbl 1421.68061) Full Text: Link
Chatterjee, Krishnendu; Henzinger, Monika An \(O(n^2)\) time algorithm for alternating Büchi games. (English) Zbl 1421.68110 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1386-1399 (2012). MSC: 68R10 05C85 68W40 91A43 91A80 PDFBibTeX XMLCite \textit{K. Chatterjee} and \textit{M. Henzinger}, in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1386--1399 (2012; Zbl 1421.68110) Full Text: arXiv Link
Berwanger, Dietmar; Grädel, Erich; Kaiser, Łukasz; Rabinovich, Roman Entanglement and the complexity of directed graphs. (English) Zbl 1256.05086 Theor. Comput. Sci. 463, 2-25 (2012). MSC: 05C20 05C57 05C85 91A43 91A24 PDFBibTeX XMLCite \textit{D. Berwanger} et al., Theor. Comput. Sci. 463, 2--25 (2012; Zbl 1256.05086) Full Text: DOI
Berwanger, Dietmar; Serre, Olivier Parity games on undirected graphs. (English) Zbl 1248.68234 Inf. Process. Lett. 112, No. 23, 928-932 (2012). MSC: 68Q25 91A43 05C85 68R10 PDFBibTeX XMLCite \textit{D. Berwanger} and \textit{O. Serre}, Inf. Process. Lett. 112, No. 23, 928--932 (2012; Zbl 1248.68234) Full Text: DOI HAL
Friedmann, Oliver Recursive algorithm for parity games requires exponential time. (English) Zbl 1232.91064 RAIRO, Theor. Inform. Appl. 45, No. 4, 449-457 (2011). MSC: 91A43 91A05 05C57 PDFBibTeX XMLCite \textit{O. Friedmann}, RAIRO, Theor. Inform. Appl. 45, No. 4, 449--457 (2011; Zbl 1232.91064) Full Text: DOI EuDML Link
Fischer, Diana; Grädel, Erich; Kaiser, Łukasz Model checking games for the quantitative \(\mu \)-calculus. (English) Zbl 1205.68243 Theory Comput. Syst. 47, No. 3, 696-719 (2010). MSC: 68Q85 03B45 91A43 91A05 05C57 PDFBibTeX XMLCite \textit{D. Fischer} et al., Theory Comput. Syst. 47, No. 3, 696--719 (2010; Zbl 1205.68243) Full Text: DOI
Lozovanu, Dmitrii; Pickl, Stefan A constructive algorithm for max-min paths problems on energy networks. (English) Zbl 1161.90323 Appl. Math. Comput. 204, No. 2, 602-608 (2008). MSC: 90B15 91A43 90C47 05C20 PDFBibTeX XMLCite \textit{D. Lozovanu} and \textit{S. Pickl}, Appl. Math. Comput. 204, No. 2, 602--608 (2008; Zbl 1161.90323) Full Text: DOI
Cachat, Thierry Uniform solution of parity games on prefix-recognizable graphs. (English) Zbl 1270.91017 Kucera, Antonin (ed.) et al., Infinity 2002. Selected papers of the 4th international workshop on verification of infinite-state systems (CONCUR 2002 satellite workshop), Brno, Czech Republic, August 24, 2002. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 68, No. 6, 71-84 (2003). MSC: 91A43 05C85 PDFBibTeX XMLCite \textit{T. Cachat}, Electron. Notes Theor. Comput. Sci. 68, No. 6, 71--84 (2003; Zbl 1270.91017) Full Text: Link