


default search action
Theoretical Computer Science, Volume 1029
Volume 1029, 2025
- Shubhada Aute
, Fahad Panolan
:
Parameterized algorithms for minimum sum vertex cover. 115032 - Julien Bensmail, Malory Marin, Leandro Montero, Alexandre Talon:
Highly irregular graph decompositions. 115036 - Junqiang Peng, Mingyu Xiao
:
Fast exact algorithms for the SAT problem with bounded occurrences of variables. 115037 - Xiaoqian Wang, Eminjan Sabir:
Super spanning connectivity of the generalized hypercube network. 115038 - Yuejun Wang
, Baocang Wang, Qiqi Lai, Yu Zhan:
Identity-based matchmaking encryption with stronger security and instantiation on lattices. 115048 - Jingyang Zhao
, Mingyu Xiao
:
Approximation algorithms for cycle and path partitions in complete graphs. 115049 - Pengxiang Pan, Hongtao Zhu:
A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem. 115050 - Krzysztof Kapulkin
, Yufeng Li:
Extensional concepts in intensional type theory, revisited. 115051

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.