default search action
Journal of Computer and System Sciences, Volume 123
Volume 123, February 2022
- Sankardeep Chakraborty, Anish Mukherjee
, Venkatesh Raman, Srinivasa Rao Satti:
Frameworks for designing in-place graph algorithms. 1-19 - Chi-Yeh Chen, Sun-Yuan Hsieh:
An improved algorithm for the Steiner tree problem with bounded edge-length. 20-36
- Dariusz R. Kowalski, Miguel A. Mosteiro:
Polynomial anonymous dynamic distributed computing without a unique leader. 37-63
- Zeev Nutov
A 4 + ϵ approximation for k-connected subgraphs. 64-75 - Petr A. Golovach
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. 76-102 - Fabian Frei
Complexity of stability. 103-121 - Artur Jez
Word equations in non-deterministic linear space. 122-142
- Hanrui Zhang
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents. 143-156
- Silvia Bonomi, Giuseppe Antonio Di Luna, Othon Michail, Leonardo Querzoni
Special issue on Algorithmic Theory of Dynamic Networks and Its Applications - Preface. 157-158
- Hanlin Ren
Improved distance sensitivity oracles with subcubic preprocessing time. 159-170
- Andrea Marino, Ana Silva
Coloring temporal graphs. 171-185 - Priyanka Mukhopadhyay
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems. 186-201
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 2024-12-08 01:29 CET 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: