default search action
Journal of Computer and System Sciences, Volume 117
Volume 117, May 2021
- Djamal Belazzougui, Manuel Cáceres
, Travis Gagie
Block trees. 1-22 - Victor Lagerkvist, Biman Roy:
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem. 23-39
- Ioannis Caragiannis, Angelo Fanelli:
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. 40-48 - Paola Flocchini:
46th International Colloquium on Automata, Languages and Programming (ICALP 2019) - Track C: Foundations of networks and multi-agent systems. 49
- Fedor V. Fomin
Parameterized k-Clustering: Tractability island. 50-74
- Argyrios Deligkas
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. 75-98
- Radu Grigore, Stefan Kiefer:
Selective monitoring. 99-129
- Keqin Li:
On the profits of competing cloud service providers: A game theoretic approach. 130-153 - Ester Livshits, Benny Kimelfeld, Jef Wijsen:
Counting subset repairs with functional dependencies. 154-164 - Mark Jones, Steven Kelk, Leen Stougie
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm. 165-181 - Yasushi Kawase, Tomomi Matsui
Additive approximation algorithms for modularity maximization. 182-201 - Lorenzo Clemente, Slawomir Lasota:
Reachability relations of timed pushdown automata. 202-241
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-11-22 19:42 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: