


default search action
Theoretical Computer Science, Volume 1052
Volume 1052, 2025
- Paul W. Goldberg, Kasper Høgh, Alexandros Hollender
:
The frontier of intractability for EFX with two agents. 115367 - Yifei Li
, Donghua Yang
, Jianzhong Li
:
K-balanced biclique partition: Kernelization and efficient algorithms. 115410 - Lu Wang, Qilong Feng, Jianxin Wang:
Approximation algorithms for facility location and k-median with differential privacy. 115417 - Tikhon Pshenitsyn
:
On decidability and expressive power of fusion grammars. 115420 - Xujun Bai, Yun Shang
:
A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits. 115423 - Susanna Caroppo
, Giordano Da Lozzo
, Giuseppe Di Battista
:
Quantum algorithms for one-sided crossing minimization. 115424 - Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki
, Yuma Tamura
, Xiao Zhou:
On the complexity of list H-packing for sparse graph classes. 115425 - Zhen Zhang
, Zhuohang Gao, Limei Liu, Yao Liu, Jie Chen, Qilong Feng:
Clustering under a knapsack constraint: Parameterized approximation for the knapsack median problem. 115426 - Retraction notice to "Corrigendum to 'A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem"" [Theoretical computer science 963 (2023) 113926]. 115427
- Felicia Lucke
:
Matching cut and variants on bipartite graphs of bounded radius and diameter. 115429 - Amit Shahar, Daniel Keren, Felipe Goncalves, Gal Yehuda:
Geometric covering using random fields. 115431 - Xinyu Fu
, Yitong Yin, Chaodong Zheng:
Locally-iterative (Δ + 1)-coloring in sublinear (in Δ) rounds. 115456 - Andriy Russyev
:
Finiteness problem for automaton groups over a binary alphabet is almost decidable. 115478

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.