Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jcss/jcss124.bht:"
@article{DBLP:journals/jcss/Agrawal22, author = {Akanksha Agrawal}, title = {Fine-grained complexity of rainbow coloring and its variants}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {140--158}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.10.001}, doi = {10.1016/J.JCSS.2021.10.001}, timestamp = {Tue, 02 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Agrawal22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Ambos-SpiesMT22, author = {Klaus Ambos{-}Spies and Wolfgang Merkle and Sebastiaan A. Terwijn}, title = {Normalized information distance and the oscillation hierarchy}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {65--76}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.08.006}, doi = {10.1016/J.JCSS.2021.08.006}, timestamp = {Sat, 25 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Ambos-SpiesMT22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/BlasiusFLMS22, author = {Thomas Bl{\"{a}}sius and Tobias Friedrich and Julius Lischeid and Kitty Meeks and Martin Schirneck}, title = {Efficiently enumerating hitting sets of hypergraphs arising in data profiling}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {192--213}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.10.002}, doi = {10.1016/J.JCSS.2021.10.002}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/BlasiusFLMS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/ChanH22, author = {Timothy M. Chan and Qizheng He}, title = {More on change-making and related problems}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {159--169}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.09.005}, doi = {10.1016/J.JCSS.2021.09.005}, timestamp = {Sat, 25 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/ChanH22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Charalampopoulos22, author = {Panagiotis Charalampopoulos and Adam Karczmarz}, title = {Single-source shortest paths and strong connectivity in dynamic planar graphs}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {97--111}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.09.008}, doi = {10.1016/J.JCSS.2021.09.008}, timestamp = {Sat, 25 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Charalampopoulos22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DrangeDLS22, author = {P{\aa}l Gr{\o}n{\aa}s Drange and Markus Fanebust Dregi and Daniel Lokshtanov and Blair D. Sullivan}, title = {On the threshold of intractability}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {1--25}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.09.003}, doi = {10.1016/J.JCSS.2021.09.003}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/DrangeDLS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DubloisHGLM22, author = {Louis Dublois and Tesshu Hanaka and Mehdi Khosravian Ghadikolaei and Michael Lampis and Nikolaos Melissinos}, title = {(In)approximability of maximum minimal {FVS}}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {26--40}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.09.001}, doi = {10.1016/J.JCSS.2021.09.001}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/DubloisHGLM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/EisenbrandV22, author = {Friedrich Eisenbrand and Moritz Venzin}, title = {Approximate CVP\({}_{\mbox{\emph{p}}}\) in time 2\({}^{\mbox{0.802\emph{n}}}\)}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {129--139}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.09.006}, doi = {10.1016/J.JCSS.2021.09.006}, timestamp = {Sat, 25 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/EisenbrandV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/GolovachPL22, author = {Petr A. Golovach and Dani{\"{e}}l Paulusma and Erik Jan van Leeuwen}, title = {Induced Disjoint Paths in AT-free graphs}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {170--191}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.10.003}, doi = {10.1016/J.JCSS.2021.10.003}, timestamp = {Sat, 08 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/GolovachPL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/KowalikLNSW22, author = {Lukasz Kowalik and Shaohua Li and Wojciech Nadara and Marcin Smulewicz and Magnus Wahlstr{\"{o}}m}, title = {Many-visits {TSP} revisited}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {112--128}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.09.007}, doi = {10.1016/J.JCSS.2021.09.007}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/KowalikLNSW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/KuhlmannMS22, author = {Marco Kuhlmann and Andreas Maletti and Lena Katharina Schiffer}, title = {The tree-generative capacity of combinatory categorial grammars}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {214--233}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.10.005}, doi = {10.1016/J.JCSS.2021.10.005}, timestamp = {Mon, 27 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/KuhlmannMS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/MelissourgosNRS22, author = {Themistoklis Melissourgos and Sotiris E. Nikoletseas and Christoforos L. Raptopoulos and Paul G. Spirakis}, title = {An extension of the Moran process using type-specific connection graphs}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {77--96}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.07.007}, doi = {10.1016/J.JCSS.2021.07.007}, timestamp = {Sat, 25 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/MelissourgosNRS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/TaoY22, author = {Yufei Tao and Ke Yi}, title = {Intersection joins under updates}, journal = {J. Comput. Syst. Sci.}, volume = {124}, pages = {41--64}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.09.004}, doi = {10.1016/J.JCSS.2021.09.004}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/TaoY22.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.