default search action
Theoretical Computer Science, Volume 780
Volume 780, August 2019
- Peter Damaschke:
Combinatorial search in two and more rounds. 1-11 - Dekel Tsur:
Succinct data structure for dynamic trees with faster queries. 12-19 - Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari:
Counting in one-hop beeping networks. 20-28 - Josef Florian, Tereza Veselá, L'ubomíra Dvoráková:
Normalization of ternary generalized pseudostandard words. 29-53 - Omid Etesami, Narges Ghareghani, Michel Habib, Mohammad Reza Hooshmandasl, Reza Naserasr, Pouyeh Sharifani:
When an optimal dominating set with given constraints exists. 54-65 - Jin Chen, Zhi-Xiong Wen:
On the abelian complexity of generalized Thue-Morse sequences. 66-73 - Petr Ambroz, Ondrej Kadlec, Zuzana Masáková, Edita Pelantová:
Palindromic length of words and morphisms in class P. 74-83 - Georgios Konstantinidis, Athanasios Kehagias:
Selfish cops and active robber: Multi-player pursuit evasion on graphs. 84-102
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.