


default search action
Theoretical Computer Science, Volume 1028
Volume 1028, 2025
- Zonglei Bai, Yongzhi Cao
, Hanpin Wang:
The complexity of ferromagnetic 2-spin systems on bounded degree graphs. 114940 - Mujiangshan Wang
, Dong Xiang, Sun-Yuan Hsieh:
G-good-neighbor diagnosability under the modified comparison model for multiprocessor systems. 115027 - Tom Friedetzky
, David C. Kutner
, George B. Mertzios
, Iain A. Stewart
, Amitabh Trehan
:
Payment scheduling in the Interval Debt Model. 115028 - Henning Fernau, Florent Foucaud
, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N:
Parameterizing path partitions. 115029 - Francesco D'Amore
, Isabella Ziccardi
:
Phase transition of the 3-majority opinion dynamics with noisy interactions. 115030 - Adriano Barile
, Stefano Berardi
, Luca Roversi
:
Termination of rewriting on reversible Boolean circuits as a free 3-category problem. 115031 - Pasin Manurangsi:
Improved FPT approximation scheme and approximate kernel for biclique-free max k-weight SAT: Greedy strikes back. 115033 - Dekel Tsur
:
Faster parameterized algorithm for r-pseudoforest deletion. 115034 - Po Yuan Wang
, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa:
Approximation hardness of domination problems on generalized convex graphs. 115035

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.