Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 850
Volume 850, January 2021
- B. S. Panda, Pooja Goyal:
Global total k-domination: Approximation and hardness results. 1-19 - Wei Feng
, Shiying Wang:
Structure connectivity and substructure connectivity of wheel networks. 20-29 - James D. Currie, Jesse T. Johnson:
Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101. 30-39 - Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel:
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles. 40-97 - Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong:
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. 98-115 - Pavan Poudel, Aisha Aljohani, Gokarna Sharma:
Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement. 116-134 - Xiaowang Li, Shuming Zhou, Xia Guo, Tianlong Ma:
The h-restricted connectivity of the generalized hypercubes. 135-147 - Arpit Sharma:
The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism. 148-167 - Charl J. Ras, Marcus Brazil, Doreen A. Thomas:
Computational complexity of the 2-connected Steiner network problem in the ℓp plane. 168-184 - Hiroyuki Seki, Reo Yoshimura, Yoshiaki Takata:
Optimal run problem for weighted register automata. 185-201 - Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Exploration of dynamic tori by multiple agents. 202-220 - Hung-I Yu, Tien-Ching Lin, D. T. Lee:
Finding maximum sum segments in sequences with uncertainty. 221-235 - Sabrina Mantaci, Antonio Restivo, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino:
A combinatorial view on string attractors. 236-248 - Shaojie Tang:
Beyond pointwise submodularity: Non-monotone adaptive submodular maximization in linear time. 249-261
a service of 
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.
last updated on 2024-06-29 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
