Bonato, Anthony; Huggan, Melissa A.; Marbach, Trent G.; Mc Inerney, Fionn The game of cops and eternal robbers. (English) Zbl 1507.91027 Theor. Comput. Sci. 874, 80-93 (2021). MSC: 91A24 91A43 05C85 PDFBibTeX XMLCite \textit{A. Bonato} et al., Theor. Comput. Sci. 874, 80--93 (2021; Zbl 1507.91027) Full Text: DOI arXiv
Liotta, Giuseppe; Rutter, Ignaz; Tappini, Alessandra Simultaneous FPQ-ordering and hybrid planarity testing. (English) Zbl 1504.68177 Theor. Comput. Sci. 874, 59-79 (2021). MSC: 68R10 05C10 68Q25 PDFBibTeX XMLCite \textit{G. Liotta} et al., Theor. Comput. Sci. 874, 59--79 (2021; Zbl 1504.68177) Full Text: DOI arXiv
Bshouty, Nader H.; Haddad-Zaknoon, Catherine A. Optimal deterministic group testing algorithms to estimate the number of defectives. (English) Zbl 1506.68179 Theor. Comput. Sci. 874, 46-58 (2021). MSC: 68W25 60C05 68Q25 68R05 68W20 PDFBibTeX XMLCite \textit{N. H. Bshouty} and \textit{C. A. Haddad-Zaknoon}, Theor. Comput. Sci. 874, 46--58 (2021; Zbl 1506.68179) Full Text: DOI arXiv
Geneson, Jesse A note on the price of bandit feedback for mistake-bounded online learning. (English) Zbl 1504.68085 Theor. Comput. Sci. 874, 42-45 (2021). MSC: 68Q32 62H30 62L15 68T05 68W27 PDFBibTeX XMLCite \textit{J. Geneson}, Theor. Comput. Sci. 874, 42--45 (2021; Zbl 1504.68085) Full Text: DOI arXiv
Kurita, Kazuhiro; Wasa, Kunihiro; Uno, Takeaki; Arimura, Hiroki A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. (English) Zbl 1507.05091 Theor. Comput. Sci. 874, 32-41 (2021). MSC: 05C85 05C30 05C69 PDFBibTeX XMLCite \textit{K. Kurita} et al., Theor. Comput. Sci. 874, 32--41 (2021; Zbl 1507.05091) Full Text: DOI arXiv
Dey, Palash; Misra, Neeldhara; Nath, Swaprava; Shakya, Garima A parameterized perspective on protecting elections. (English) Zbl 1504.68082 Theor. Comput. Sci. 874, 15-31 (2021). MSC: 68Q27 91B12 PDFBibTeX XMLCite \textit{P. Dey} et al., Theor. Comput. Sci. 874, 15--31 (2021; Zbl 1504.68082) Full Text: DOI arXiv
Kim, Yonghwan; Shibata, Masahiro; Sudo, Yuichi; Nakamura, Junya; Katayama, Yoshiaki; Masuzawa, Toshimitsu A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets. (English) Zbl 1504.68173 Theor. Comput. Sci. 874, 1-14 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{Y. Kim} et al., Theor. Comput. Sci. 874, 1--14 (2021; Zbl 1504.68173) Full Text: DOI