default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 941
Volume 941, January 2023
- Putty Srividya
, Lavadya Nirmala Devi, A. Nageswar Rao:
A trusted effective approach for forecasting the failure of data link and intrusion in wireless sensor networks. 1-13 - Sravanthi Kantamaneni, A. Charles, Tummala Ranga Babu:
Speech enhancement with noise estimation and filtration using deep learning models. 14-28 - Sreejyothsna Ankam, N. Sudhakar Reddy:
A mechanism to detecting flooding attacks in quantum enabled cloud-based lowpower and lossy networks. 29-38 - Subhadra Perumalla, Santanu Chatterjee, A. P. Siva Kumar:
Modelling of oppositional Aquila Optimizer with machine learning enabled secure access control in Internet of drones environment. 39-54 - G. S. Karthick, P. B. Pankajavalli:
Chronic obstructive pulmonary disease prediction using Internet of things-spiro system and fuzzy-based quantum neural network classifier. 55-76 - M. Savitha, M. Senthilkumar:
A unique secure multimodal biometrics-based user anonymous authenticated key management protocol (SMUAAKAP) based on block chain mechanism for generic HIoTNs. 77-90 - Laurent Bulteau, Vincent Jugé, Stéphane Vialette:
On shuffled-square-free words. 91-103 - Wanting Li, Yongcai Wang, Deying Li, Xiaojia Xu:
A robust map matching method by considering memorized multiple matching candidates. 104-120 - Wenjie Zou, Longkun Guo, Chunlin Hao, Lei Liu:
Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane. 121-130 - Kittikorn Nakprasit, Watcharintorn Ruksasakchai, Pongpat Sittitrai:
Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles. 131-139 - Feiteng Zhang, Bin Liu, Zhenming Liu, Qizhi Fang:
Order based algorithms for the core maintenance problem on edge-weighted graphs. 140-155 - Sankardeep Chakraborty, Seungbum Jo:
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number. 156-166 - An Zhang, Liang Zhang, Yong Chen, Guangting Chen, Xing Wang:
Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints. 167-179 - Jian Sun, Gregory Z. Gutin, Ping Li, Peihao Shi, Xiaoyan Zhang:
An LP-based approximation algorithm for the generalized traveling salesman path problem. 180-190 - Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang:
Delay-constrained minimum shortest path trees and related problems. 191-201 - Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Complexity of planning for connected agents in a partially known environment. 202-220 - Pierre Bergé, Lou Salaün:
The influence of maximum (s, t)-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem. 221-240 - Satoshi Terai, Koichi Wada, Yoshiaki Katayama:
Gathering problems for autonomous mobile robots with lights. 241-261 - Karine Altisen, Pierre Corbineau, Stéphane Devismes:
Certification of an exact worst-case self-stabilization time. 262-277 - Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel:
Colouring graphs with no induced six-vertex path or diamond. 278-299
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 2025-05-19 20:54 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:
