default search action
Theoretical Computer Science, Volume 782
Volume 782, August 2019
- Adi Shraibman:
Nondeterministic communication complexity with help and graph functions. 1-10 - Cédric Bentz:
Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees. 11-29 - Benjamin Bergougnoux, Mamadou Moustapha Kanté:
Fast exact algorithms for some connectivity problems parameterized by clique-width. 30-53 - Johanne Cohen, Jonas Lefèvre, Khaled Maâmra, George Manoussakis, Laurence Pilard:
The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs. 54-78 - Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura:
On structural parameterizations of firefighting. 79-90 - Nodari Vakhania:
Fast solution of single-machine scheduling problem with embedded jobs. 91-106 - Kingshuk Chatterjee, Kumar Sankar Ray:
Unary Watson-Crick automata. 107-112 - Birzhan Moldagaliyev:
Randomness of formal languages via automatic martingales. 113-128 - Ning Xie, Shuai Xu, Yekun Xu:
A new coding-based algorithm for finding closest pair of vectors. 129-144 - Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao:
Algorithms to compute the Burrows-Wheeler Similarity Distribution. 145-156
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.