Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs954.bht:"
@article{DBLP:journals/tcs/0001MT23, author = {R. Krithika and Pranabendu Misra and Prafullkumar Tale}, title = {A single exponential-time {FPT} algorithm for cactus contraction}, journal = {Theor. Comput. Sci.}, volume = {954}, pages = {113803}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113803}, doi = {10.1016/J.TCS.2023.113803}, timestamp = {Wed, 12 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/0001MT23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AravindS23, author = {N. R. Aravind and Roopam Saxena}, title = {Perfectly matched sets in graphs: Parameterized and exact computation}, journal = {Theor. Comput. Sci.}, volume = {954}, pages = {113797}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113797}, doi = {10.1016/J.TCS.2023.113797}, timestamp = {Wed, 12 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AravindS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/AshkenaziDKKOW23, author = {Yotam Ashkenazi and Shlomi Dolev and Sayaka Kamei and Yoshiaki Katayama and Fukuhito Ooshita and Koichi Wada}, title = {Location functions for self-stabilizing byzantine tolerant swarms}, journal = {Theor. Comput. Sci.}, volume = {954}, pages = {113755}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113755}, doi = {10.1016/J.TCS.2023.113755}, timestamp = {Fri, 19 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/AshkenaziDKKOW23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BramasLT23a, author = {Quentin Bramas and Anissa Lamani and S{\'{e}}bastien Tixeuil}, title = {The agreement power of disagreement}, journal = {Theor. Comput. Sci.}, volume = {954}, pages = {113772}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113772}, doi = {10.1016/J.TCS.2023.113772}, timestamp = {Sun, 16 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BramasLT23a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CantoneMO23, author = {Domenico Cantone and Pietro Maugeri and Eugenio G. Omodeo}, title = {Complexity assessments for decidable fragments of Set Theory. {III:} Testers for crucial, polynomial-maximal decidable Boolean languages}, journal = {Theor. Comput. Sci.}, volume = {954}, pages = {113786}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113786}, doi = {10.1016/J.TCS.2023.113786}, timestamp = {Wed, 01 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CantoneMO23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChenC23, author = {Hong{-}Bin Chen and Geng{-}Yu Chen}, title = {Optimal 2-traceability codes of length 4}, journal = {Theor. Comput. Sci.}, volume = {954}, pages = {113800}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113800}, doi = {10.1016/J.TCS.2023.113800}, timestamp = {Wed, 12 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ChenC23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Wang23, author = {Biing{-}Feng Wang}, title = {A new dynamic programming algorithm for the simplified partial digest problem}, journal = {Theor. Comput. Sci.}, volume = {954}, pages = {113801}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113801}, doi = {10.1016/J.TCS.2023.113801}, timestamp = {Sun, 16 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Wang23.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.