


default search action
Theoretical Computer Science, Volume 1051
Volume 1051, 2025
- Yuichi Asahiro, Masafumi Yamashita:
Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots. 115397 - Diederik Aerts, Roberto Leporini, Sandro Sozzo:
Turing video-based cognitive tests to handle entangled concepts. 115398 - Yinghao Zhang
, Xuanzhe Xiao
, Jianxiong Guo
:
TransMCS: A hybrid CNN-transformer autoencoder for end-to-end multi-modal medical signals compressive sensing. 115409 - Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang:
Some Results on Critical (P5,H)-free Graphs. 115411 - Thomas Erlebach
, Nils Morawietz
, Petra Wolf
:
Parameterized algorithms for multi-label periodic temporal graph realization. 115412 - Xinlan Xia
, Lu Han
, Lili Mei
:
An approximation algorithm for the parity-constrained k-supplier problem. 115413 - Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Parameterized complexity of weighted target set selection. 115414 - Vijeth Aradhya
, Seth Gilbert, Aquinas Hobor:
Robust overlays meet blockchains: On handling high churn and catastrophic failures. 115415 - Youming Tao, Xiuzhen Cheng, Falko Dressler, Zhipeng Cai, Dongxiao Yu:
Robust matroid bandit optimization: Near-optimal rates under adversarial contamination. 115416 - Stoyan Dimitrov
:
Simple random sampling of binary forests with fixed number of nodes and trees. 115418 - Hajar Nouinou
, Taha Arbaoui
, Alice Yalaoui
:
Minimizing the total completion time for a class of semi-online single machine scheduling problems. 115422

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.