default search action
Journal of Computer and System Sciences, Volume 124
Volume 124, March 2022
- Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan:
On the threshold of intractability. 1-25 - Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos:
(In)approximability of maximum minimal FVS. 26-40 - Yufei Tao, Ke Yi:
Intersection joins under updates. 41-64 - Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn:
Normalized information distance and the oscillation hierarchy. 65-76 - Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
An extension of the Moran process using type-specific connection graphs. 77-96
- Panagiotis Charalampopoulos, Adam Karczmarz:
Single-source shortest paths and strong connectivity in dynamic planar graphs. 97-111 - Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström:
Many-visits TSP revisited. 112-128 - Friedrich Eisenbrand, Moritz Venzin:
Approximate CVPp in time 20.802n. 129-139
- Akanksha Agrawal:
Fine-grained complexity of rainbow coloring and its variants. 140-158
- Timothy M. Chan, Qizheng He:
More on change-making and related problems. 159-169
- Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen:
Induced Disjoint Paths in AT-free graphs. 170-191 - Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck:
Efficiently enumerating hitting sets of hypergraphs arising in data profiling. 192-213 - Marco Kuhlmann, Andreas Maletti, Lena Katharina Schiffer:
The tree-generative capacity of combinatory categorial grammars. 214-233
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.