Stop the war!
Остановите войну!
for scientists:
default search action
Theoretical Computer Science, Volume 868
Volume 868, May 2021
- Florian Lehner, Christian Lindorfer:
Comparing consecutive letter counts in multiple context-free languages. 1-5 - Wenjun Li, Yang Ding, Yongjie Yang, Guozhen Rong:
A (2 + ϵ)k-vertex kernel for the dual coloring problem. 6-11 - Qihao Shi, Can Wang, Deshi Ye, Jiawei Chen, Sheng Zhou, Yan Feng, Chun Chen, Yanhao Huang:
Profit maximization for competitive social advertising. 12-29 - Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Algorithms for gerrymandering over graphs. 30-45 - Klaus Heeger, Anne-Sophie Himmel, Frank Kammer, Rolf Niedermeier, Malte Renken, Andrej Sajenko:
Multistage graph problems on a global budget. 46-64 - Alexander Birx, Yann Disser, Alexander V. Hopp, Christina Karousatou:
An improved lower bound for competitive graph exploration. 65-86 - Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák:
Collaborative delivery on a fixed path with homogeneous energy-constrained agents. 87-96 - Andrea Frosini, Christophe Picouleau, Simone Rinaldi:
New sufficient conditions on the degree sequences of uniform hypergraphs. 97-111
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.