Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jcss/jcss107.bht:"
@article{DBLP:journals/jcss/AkridaMSZ20, author = {Eleni C. Akrida and George B. Mertzios and Paul G. Spirakis and Viktor Zamaraev}, title = {Temporal vertex cover with a sliding time window}, journal = {J. Comput. Syst. Sci.}, volume = {107}, pages = {108--123}, year = {2020}, url = {https://doi.org/10.1016/j.jcss.2019.08.002}, doi = {10.1016/J.JCSS.2019.08.002}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/AkridaMSZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/AnshuHMP20, author = {Anurag Anshu and Peter H{\o}yer and Mehdi Mhalla and Simon Perdrix}, title = {Contextuality in multipartite pseudo-telepathy graph games}, journal = {J. Comput. Syst. Sci.}, volume = {107}, pages = {156--165}, year = {2020}, url = {https://doi.org/10.1016/j.jcss.2019.06.005}, doi = {10.1016/J.JCSS.2019.06.005}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/AnshuHMP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FratiPR20, author = {Fabrizio Frati and Maurizio Patrignani and Vincenzo Roselli}, title = {LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs}, journal = {J. Comput. Syst. Sci.}, volume = {107}, pages = {28--53}, year = {2020}, url = {https://doi.org/10.1016/j.jcss.2019.08.001}, doi = {10.1016/J.JCSS.2019.08.001}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/FratiPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Gajser20, author = {David Gajser}, title = {Verifying whether one-tape Turing machines run in linear time}, journal = {J. Comput. Syst. Sci.}, volume = {107}, pages = {93--107}, year = {2020}, url = {https://doi.org/10.1016/j.jcss.2019.08.004}, doi = {10.1016/J.JCSS.2019.08.004}, timestamp = {Wed, 16 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/Gajser20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/GuoW20, author = {Heng Guo and Tyson Williams}, title = {The complexity of planar Boolean {\#}CSP with complex weights}, journal = {J. Comput. Syst. Sci.}, volume = {107}, pages = {1--27}, year = {2020}, url = {https://doi.org/10.1016/j.jcss.2019.07.005}, doi = {10.1016/J.JCSS.2019.07.005}, timestamp = {Wed, 16 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/GuoW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/HromkovicR20, author = {Juraj Hromkovic and Peter Rossmanith}, title = {What one has to know when attacking {P} vs. {NP}}, journal = {J. Comput. Syst. Sci.}, volume = {107}, pages = {142--155}, year = {2020}, url = {https://doi.org/10.1016/j.jcss.2019.06.004}, doi = {10.1016/J.JCSS.2019.06.004}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/HromkovicR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/JimenezLM20, author = {Ernesto Jim{\'{e}}nez and Jos{\'{e}} Luis L{\'{o}}pez{-}Presa and Javier Mart{\'{\i}}n{-}Rueda}, title = {Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures}, journal = {J. Comput. Syst. Sci.}, volume = {107}, pages = {54--71}, year = {2020}, url = {https://doi.org/10.1016/j.jcss.2019.06.003}, doi = {10.1016/J.JCSS.2019.06.003}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/JimenezLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/NiskanenPR20, author = {Reino Niskanen and Igor Potapov and Julien Reichert}, title = {On decidability and complexity of low-dimensional robot games}, journal = {J. Comput. Syst. Sci.}, volume = {107}, pages = {124--141}, year = {2020}, url = {https://doi.org/10.1016/j.jcss.2019.08.003}, doi = {10.1016/J.JCSS.2019.08.003}, timestamp = {Thu, 07 Nov 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/NiskanenPR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/ZschocheFMN20, author = {Philipp Zschoche and Till Fluschnik and Hendrik Molter and Rolf Niedermeier}, title = {The complexity of finding small separators in temporal graphs}, journal = {J. Comput. Syst. Sci.}, volume = {107}, pages = {72--92}, year = {2020}, url = {https://doi.org/10.1016/j.jcss.2019.07.006}, doi = {10.1016/J.JCSS.2019.07.006}, timestamp = {Wed, 16 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/ZschocheFMN20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.