Gabow, Harold N.; Sankowski, Piotr Algorithms for weighted matching generalizations. II: \(f\)-factors and the special case of shortest paths. (English) Zbl 1461.05212 SIAM J. Comput. 50, No. 2, 555-601 (2021). MSC: 05C85 68W05 68W20 PDFBibTeX XMLCite \textit{H. N. Gabow} and \textit{P. Sankowski}, SIAM J. Comput. 50, No. 2, 555--601 (2021; Zbl 1461.05212) Full Text: DOI
Gabow, Harold N.; Sankowski, Piotr Algorithms for weighted matching generalizations. I: Bipartite graphs, \(b\)-matching, and unweighted \(f\)-factors. (English) Zbl 1461.05211 SIAM J. Comput. 50, No. 2, 440-486 (2021). MSC: 05C85 68W05 68W20 PDFBibTeX XMLCite \textit{H. N. Gabow} and \textit{P. Sankowski}, SIAM J. Comput. 50, No. 2, 440--486 (2021; Zbl 1461.05211) Full Text: DOI
Bosek, Bartłomiej; Leniowski, Dariusz; Sankowski, Piotr; Zych-Pawlewicz, Anna Shortest augmenting paths for online matchings on trees. (English) Zbl 1390.68768 Theory Comput. Syst. 62, No. 2, 337-348 (2018). MSC: 68W27 05C70 05C85 PDFBibTeX XMLCite \textit{B. Bosek} et al., Theory Comput. Syst. 62, No. 2, 337--348 (2018; Zbl 1390.68768) Full Text: DOI
Sankowski, Piotr; Węgrzycki, Karol Improved distance queries and cycle counting by Frobenius normal form. (English) Zbl 1402.68107 Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 56, 14 p. (2017). MSC: 68Q25 05C30 05C38 05C50 05C85 PDFBibTeX XMLCite \textit{P. Sankowski} and \textit{K. Węgrzycki}, LIPIcs -- Leibniz Int. Proc. Inform. 66, Article 56, 14 p. (2017; Zbl 1402.68107) Full Text: DOI arXiv
Cygan, Marek; Gabow, Harold N.; Sankowski, Piotr Algorithmic applications of Baur-Strassen’s theorem, shortest cycles, diameter, and matchings. (English) Zbl 1426.05164 J. ACM 62, No. 4, Article No. 28, 30 p. (2015). MSC: 05C85 05C22 05C38 05C50 05C70 68Q25 90C35 PDFBibTeX XMLCite \textit{M. Cygan} et al., J. ACM 62, No. 4, Article No. 28, 30 p. (2015; Zbl 1426.05164) Full Text: DOI arXiv
Sankowski, Piotr Maximum weight bipartite matching in matrix multiplication time. (English) Zbl 1228.05238 Theor. Comput. Sci. 410, No. 44, 4480-4488 (2009). MSC: 05C70 05C85 68R10 68W20 PDFBibTeX XMLCite \textit{P. Sankowski}, Theor. Comput. Sci. 410, No. 44, 4480--4488 (2009; Zbl 1228.05238) Full Text: DOI
Sankowski, Piotr Weighted bipartite matching in matrix multiplication time. (English) Zbl 1223.05241 Bugliesi, Michele (ed.) et al., Automata, languages and programming. 33rd international colloquium, ICALP 2006, Venice, Italy, July 10–14, 2006. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-35904-3/pbk). Lecture Notes in Computer Science 4051, 274-285 (2006). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{P. Sankowski}, Lect. Notes Comput. Sci. 4051, 274--285 (2006; Zbl 1223.05241) Full Text: DOI