


default search action
Theoretical Computer Science, Volume 874
Volume 874, June 2021
- Yonghwan Kim

, Masahiro Shibata, Yuichi Sudo
, Junya Nakamura
, Yoshiaki Katayama, Toshimitsu Masuzawa:
A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets. 1-14 - Palash Dey, Neeldhara Misra, Swaprava Nath

, Garima Shakya:
A parameterized perspective on protecting elections. 15-31 - Kazuhiro Kurita

, Kunihiro Wasa
, Takeaki Uno, Hiroki Arimura:
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. 32-41 - Jesse Geneson

:
A note on the price of bandit feedback for mistake-bounded online learning. 42-45 - Nader H. Bshouty, Catherine A. Haddad-Zaknoon:

Optimal deterministic group testing algorithms to estimate the number of defectives. 46-58 - Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini

:
Simultaneous FPQ-ordering and hybrid planarity testing. 59-79 - Anthony Bonato, Melissa A. Huggan, Trent G. Marbach

, Fionn Mc Inerney:
The game of Cops and Eternal Robbers. 80-93

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














