default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 922
Volume 922, June 2022
- Gabriele Fici
, Jeffrey O. Shallit:
Properties of a class of Toeplitz words. 1-12 - Hao-Ping Yeh, Wei Lu, Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing, Sun-Yuan Hsieh:
Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs. 13-24 - Jalawi Alshudukhi, Kusum Yadav:
Survivability development of wireless sensor networks using neuro fuzzy-clonal selection optimization. 25-36 - Carl Barton:
On the average-case complexity of pattern matching with wildcards. 37-45 - Zhaoxia Tian, Mingzu Zhang, Xing Feng:
Reliability measure of the n-th cartesian product of complete graph K4 on h-extra edge-connectivity. 46-60 - Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble guided optimal treasure hunt in anonymous graphs. 61-80 - Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On vertex-weighted realizations of acyclic and general graphs. 81-95 - Chen Avin, Avi Cohen, Zvi Lotker, David Peleg:
Hotelling games in fault-prone settings. 96-107 - Zekun Ye, Lvzhou Li:
Sample complexity of hidden subgroup problem. 108-121 - Zimo Sheng, Mingyu Xiao:
An improved kernel for planar vertex-disjoint triangle packing. 122-130 - Pallavi Ahire, Jibi Abraham:
Secure cloud model for intellectual privacy protection of arithmetic expressions in source codes using data obfuscation techniques. 131-149 - Michael Elkin, Ofer Neiman:
Distributed strong diameter network decomposition. 150-157 - L'ubomíra Dvoráková, Edita Pelantová, Daniela Opocenská, Arseny M. Shur:
On minimal critical exponent of balanced sequences. 158-169 - Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Unique key Horn functions. 170-178 - Jun Yuan, Ying Li, Aixia Liu, Huijuan Qiao:
The non-inclusive g-good-neighbor diagnosability of interconnection networks. 179-192 - Yi Hong, Chuanwen Luo, Deying Li, Zhibo Chen, Xiyun Wang, Xiao Li:
Energy efficiency optimization for multiple chargers in Wireless Rechargeable Sensor Networks. 193-205 - Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld:
Avoiding square-free words on free groups. 206-217 - Ranendu Adhikary, Kaustav Bose, Manash Kumar Kundu, Buddhadeb Sau:
Mutual visibility on grid by asynchronous luminous robots. 218-247 - Zhao Shen:
Prime automata do not exist. 248-256 - Suying Wu, Jianxi Fan, Baolei Cheng, Jia Yu, Yan Wang:
Connectivity and constructive algorithms of disjoint paths in dragonfly networks. 257-270 - Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis:
Internal shortest absent word queries in constant time and linear space. 271-282 - Zohir Bouzid, Pierre Sutra, Corentin Travers:
Agreeing within a few writes. 283-299 - Doost Ali Mojdeh:
On the conjectures of neighbor locating coloring of graphs. 300-307 - Xuemei Liu, Jixiang Meng:
Strongly Menger-edge-connectedness of DCell networks. 308-311 - Florian Ingels, Romain Azaïs:
Enumeration of irredundant forests. 312-334 - Lina Ba, Heping Zhang:
The cycle-structure connectivity of crossed cubes. 335-345 - Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar:
On additive approximate submodularity. 346-360 - Hong Chen, Meirun Chen, Michel Habib, Cheng-Kuan Lin:
Connectivity for some families of composition networks. 361-367 - James Harland:
Generating candidate busy beaver machines (or how to build the zany zoo). 368-394 - Xiujuan Zhang, Yongcai Wang, Deying Li, Wenping Chen, Xingjian Ding:
Self-stabilizing spanner topology control solutions in wireless ad hoc networks. 395-409 - Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm:
Call admission problems on trees. 410-423 - Xuehou Tan, Qi Wei:
Improved exploration of unknown polygons. 424-437 - Weitian Tong, Yao Xu, Huili Zhang:
A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint. 438-446 - Peter Crawford-Kahrl, Bree Cummins, Tomás Gedeon:
Joint realizability of monotone Boolean functions. 447-474 - Ting-Wei Liang, Chang-Biau Yang, Kuo-Si Huang:
An efficient algorithm for the longest common palindromic subsequence problem. 475-485 - Christian Konrad, Viktor Zamaraev:
Distributed minimum vertex coloring and maximum independent set in chordal graphs. 486-502
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-10-25 20:02 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:
