![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs990.bht:"
@article{DBLP:journals/tcs/AcharyyaKMP24, author = {Ankush Acharyya and Vahideh Keikha and Diptapriyo Majumdar and Supantha Pandit}, title = {Constrained hitting set problem with intervals: Hardness, {FPT} and approximation algorithms}, journal = {Theor. Comput. Sci.}, volume = {990}, pages = {114402}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114402}, doi = {10.1016/J.TCS.2024.114402}, timestamp = {Fri, 31 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AcharyyaKMP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BasteW24, author = {Julien Baste and Dimitri Watel}, title = {An {FPT} algorithm for node-disjoint subtrees problems parameterized by treewidth}, journal = {Theor. Comput. Sci.}, volume = {990}, pages = {114406}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114406}, doi = {10.1016/J.TCS.2024.114406}, timestamp = {Sat, 18 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BasteW24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BrandstadtM24, author = {Andreas Brandst{\"{a}}dt and Raffaele Mosca}, title = {Finding dominating induced matchings in P10-free graphs in polynomial time}, journal = {Theor. Comput. Sci.}, volume = {990}, pages = {114404}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114404}, doi = {10.1016/J.TCS.2024.114404}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BrandstadtM24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CapraK24, author = {Lorenzo Capra and Michael K{\"{o}}hler{-}Bu{\ss}meier}, title = {Modular rewritable Petri nets: An efficient model for dynamic distributed systems}, journal = {Theor. Comput. Sci.}, volume = {990}, pages = {114397}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114397}, doi = {10.1016/J.TCS.2024.114397}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/CapraK24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DucheneGGIMP24, author = {{\'{E}}ric Duch{\^{e}}ne and Valentin Gledel and Sylvain Gravier and Fionn Mc Inerney and Mehdi Mhalla and Aline Parreau}, title = {Smash and grab: The 0{\unicode{8239}}{\(\cdot\)}{\unicode{8239}}6 scoring game on graphs}, journal = {Theor. Comput. Sci.}, volume = {990}, pages = {114417}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114417}, doi = {10.1016/J.TCS.2024.114417}, timestamp = {Sat, 08 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/DucheneGGIMP24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FeghaliM24, author = {Carl Feghali and Malory Marin}, title = {Three remarks on {W} graphs}, journal = {Theor. Comput. Sci.}, volume = {990}, pages = {114403}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114403}, doi = {10.1016/J.TCS.2024.114403}, timestamp = {Sat, 18 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/FeghaliM24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GeffertPS24, author = {Viliam Geffert and Dominika Palis{\'{\i}}nov{\'{a}} and Alexander Szabari}, title = {State complexity of binary coded regular languages}, journal = {Theor. Comput. Sci.}, volume = {990}, pages = {114399}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114399}, doi = {10.1016/J.TCS.2024.114399}, timestamp = {Sat, 18 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GeffertPS24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ShiL24, author = {Yishuo Shi and Xiaoyan Lai}, title = {Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint}, journal = {Theor. Comput. Sci.}, volume = {990}, pages = {114409}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114409}, doi = {10.1016/J.TCS.2024.114409}, timestamp = {Fri, 31 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ShiL24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/WangCDT24, author = {Luping Wang and Jie Chen and Huan Dai and Chongben Tao}, title = {Efficient code-based fully dynamic group signature scheme}, journal = {Theor. Comput. Sci.}, volume = {990}, pages = {114407}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114407}, doi = {10.1016/J.TCS.2024.114407}, timestamp = {Fri, 31 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/WangCDT24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/X24, title = {Preface: Special issue on theoretical aspects of computing}, journal = {Theor. Comput. Sci.}, volume = {990}, pages = {114408}, year = {2024}, url = {https://doi.org/10.1016/j.tcs.2024.114408}, doi = {10.1016/J.TCS.2024.114408}, timestamp = {Sat, 18 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/X24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.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.