![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/jcss/jcss117.bht:"
@article{DBLP:journals/jcss/BelazzouguiCGGK21, author = {Djamal Belazzougui and Manuel C{\'{a}}ceres and Travis Gagie and Pawel Gawrychowski and Juha K{\"{a}}rkk{\"{a}}inen and Gonzalo Navarro and Alberto Ord{\'{o}}{\~{n}}ez Pereira and Simon J. Puglisi and Yasuo Tabei}, title = {Block trees}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {1--22}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.11.002}, doi = {10.1016/J.JCSS.2020.11.002}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/BelazzouguiCGGK21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/CaragiannisF21, author = {Ioannis Caragiannis and Angelo Fanelli}, title = {On approximate pure Nash equilibria in weighted congestion games with polynomial latencies}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {40--48}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.10.007}, doi = {10.1016/J.JCSS.2020.10.007}, timestamp = {Mon, 01 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/CaragiannisF21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/ClementeL21, author = {Lorenzo Clemente and Slawomir Lasota}, title = {Reachability relations of timed pushdown automata}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {202--241}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.11.003}, doi = {10.1016/J.JCSS.2020.11.003}, timestamp = {Mon, 01 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/ClementeL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DeligkasFMS21, author = {Argyrios Deligkas and John Fearnley and Themistoklis Melissourgos and Paul G. Spirakis}, title = {Computing exact solutions of consensus halving and the Borsuk-Ulam theorem}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {75--98}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.10.006}, doi = {10.1016/J.JCSS.2020.10.006}, timestamp = {Wed, 07 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/DeligkasFMS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Flocchini21, author = {Paola Flocchini}, title = {46th International Colloquium on Automata, Languages and Programming {(ICALP} 2019) - Track {C:} Foundations of networks and multi-agent systems}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {49}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.11.001}, doi = {10.1016/J.JCSS.2020.11.001}, timestamp = {Mon, 01 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Flocchini21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FominGS21, author = {Fedor V. Fomin and Petr A. Golovach and Kirill Simonov}, title = {Parameterized \emph{k}-Clustering: Tractability island}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {50--74}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.10.005}, doi = {10.1016/J.JCSS.2020.10.005}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FominGS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/GrigoreK21, author = {Radu Grigore and Stefan Kiefer}, title = {Selective monitoring}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {99--129}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.09.003}, doi = {10.1016/J.JCSS.2020.09.003}, timestamp = {Mon, 01 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/GrigoreK21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/JonesKS21, author = {Mark Jones and Steven Kelk and Leen Stougie}, title = {Maximum parsimony distance on phylogenetic trees: {A} linear kernel and constant factor approximation algorithm}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {165--181}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.10.003}, doi = {10.1016/J.JCSS.2020.10.003}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/JonesKS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/KawaseMM21, author = {Yasushi Kawase and Tomomi Matsui and Atsushi Miyauchi}, title = {Additive approximation algorithms for modularity maximization}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {182--201}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.11.005}, doi = {10.1016/J.JCSS.2020.11.005}, timestamp = {Fri, 19 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/KawaseMM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/LagerkvistR21, author = {Victor Lagerkvist and Biman Roy}, title = {Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {23--39}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.10.004}, doi = {10.1016/J.JCSS.2020.10.004}, timestamp = {Mon, 01 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/LagerkvistR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Li21, author = {Keqin Li}, title = {On the profits of competing cloud service providers: {A} game theoretic approach}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {130--153}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.10.008}, doi = {10.1016/J.JCSS.2020.10.008}, timestamp = {Tue, 21 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/Li21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/LivshitsKW21, author = {Ester Livshits and Benny Kimelfeld and Jef Wijsen}, title = {Counting subset repairs with functional dependencies}, journal = {J. Comput. Syst. Sci.}, volume = {117}, pages = {154--164}, year = {2021}, url = {https://doi.org/10.1016/j.jcss.2020.10.001}, doi = {10.1016/J.JCSS.2020.10.001}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/LivshitsKW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.