default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs725.bht:"
@article{DBLP:journals/tcs/AcharyyaNR18, author = {Ankush Acharyya and Subhas C. Nandy and Sasanka Roy}, title = {Minimum width color spanning annulus}, journal = {Theor. Comput. Sci.}, volume = {725}, pages = {16--30}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2017.11.031}, doi = {10.1016/J.TCS.2017.11.031}, timestamp = {Wed, 18 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AcharyyaNR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CohenMINPS18, author = {Nathann Cohen and Nicolas Almeida Martins and Fionn Mc Inerney and Nicolas Nisse and St{\'{e}}phane P{\'{e}}rennes and Rudini M. Sampaio}, title = {Spy-game on graphs: Complexity and simple topologies}, journal = {Theor. Comput. Sci.}, volume = {725}, pages = {1--15}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2017.11.015}, doi = {10.1016/J.TCS.2017.11.015}, timestamp = {Thu, 02 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CohenMINPS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Flores-LamasFT18, author = {Alejandro Flores{-}Lamas and Jos{\'{e}} Alberto Fern{\'{a}}ndez{-}Zepeda and Joel Antonio Trejo{-}S{\'{a}}nchez}, title = {Algorithm to find a maximum 2-packing set in a cactus}, journal = {Theor. Comput. Sci.}, volume = {725}, pages = {31--51}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2017.11.030}, doi = {10.1016/J.TCS.2017.11.030}, timestamp = {Wed, 18 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Flores-LamasFT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HongN18, author = {Seok{-}Hee Hong and Hiroshi Nagamochi}, title = {Simpler algorithms for testing two-page book embedding of partitioned graphs}, journal = {Theor. Comput. Sci.}, volume = {725}, pages = {79--98}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2015.12.039}, doi = {10.1016/J.TCS.2015.12.039}, timestamp = {Thu, 27 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/HongN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Jin00ZZ18, author = {Kai Jin and Jian Li and Haitao Wang and Bowei Zhang and Ningye Zhang}, title = {Near-linear time approximation schemes for geometric maximum coverage}, journal = {Theor. Comput. Sci.}, volume = {725}, pages = {64--78}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2017.11.026}, doi = {10.1016/J.TCS.2017.11.026}, timestamp = {Tue, 23 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Jin00ZZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LarssonNS18, author = {Urban Larsson and Richard J. Nowakowski and Carlos Pereira dos Santos}, title = {Game comparison through play}, journal = {Theor. Comput. Sci.}, volume = {725}, pages = {52--63}, year = {2018}, url = {https://doi.org/10.1016/j.tcs.2017.11.029}, doi = {10.1016/J.TCS.2017.11.029}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/LarssonNS18.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.