Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/Alpern19,
  author       = {Steve Alpern},
  title        = {Search for an immobile Hider in a known subset of a network},
  journal      = {Theor. Comput. Sci.},
  volume       = {794},
  pages        = {20--26},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.06.022},
  doi          = {10.1016/J.TCS.2018.06.022},
  timestamp    = {Tue, 15 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Alpern19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/AngelopoulosNT19,
  author       = {Spyros Angelopoulos and
                  Nicolas Nisse and
                  Dimitrios M. Thilikos},
  title        = {Preface to special issue on Theory and Applications of Graph Searching},
  journal      = {Theor. Comput. Sci.},
  volume       = {794},
  pages        = {1--2},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.09.043},
  doi          = {10.1016/J.TCS.2019.09.043},
  timestamp    = {Tue, 15 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/AngelopoulosNT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BonatoCCFIM19,
  author       = {Anthony Bonato and
                  Nancy E. Clarke and
                  Danielle Cox and
                  Stephen Finbow and
                  Fionn Mc Inerney and
                  Margaret{-}Ellen Messinger},
  title        = {Hyperopic Cops and Robbers},
  journal      = {Theor. Comput. Sci.},
  volume       = {794},
  pages        = {59--68},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.10.004},
  doi          = {10.1016/J.TCS.2018.10.004},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BonatoCCFIM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BonatoL19,
  author       = {Anthony Bonato and
                  Thomas Lidbetter},
  title        = {Bounds on the burning numbers of spiders and path-forests},
  journal      = {Theor. Comput. Sci.},
  volume       = {794},
  pages        = {12--19},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.05.035},
  doi          = {10.1016/J.TCS.2018.05.035},
  timestamp    = {Tue, 15 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BonatoL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CoupechouxDEJ19,
  author       = {Pierre Coupechoux and
                  Marc Demange and
                  David Ellison and
                  Bertrand Jouve},
  title        = {Firefighting on trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {794},
  pages        = {69--84},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.01.040},
  doi          = {10.1016/J.TCS.2019.01.040},
  timestamp    = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CoupechouxDEJ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DereniowskiGK19,
  author       = {Dariusz Dereniowski and
                  Tomas Gavenciak and
                  Jan Kratochv{\'{\i}}l},
  title        = {Cops, a fast robber and defensive domination on interval graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {794},
  pages        = {47--58},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.09.031},
  doi          = {10.1016/J.TCS.2018.09.031},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DereniowskiGK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DereniowskiOR19,
  author       = {Dariusz Dereniowski and
                  Dorota Osula and
                  Pawel Rzazewski},
  title        = {Finding small-width connected path decompositions in polynomial time},
  journal      = {Theor. Comput. Sci.},
  volume       = {794},
  pages        = {85--100},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.03.039},
  doi          = {10.1016/J.TCS.2019.03.039},
  timestamp    = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DereniowskiOR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LamprouMS19,
  author       = {Ioannis Lamprou and
                  Russell Martin and
                  Sven Schewe},
  title        = {Eternally dominating large grids},
  journal      = {Theor. Comput. Sci.},
  volume       = {794},
  pages        = {27--46},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.09.008},
  doi          = {10.1016/J.TCS.2018.09.008},
  timestamp    = {Tue, 22 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/LamprouMS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Pralat19,
  author       = {Pawel Pralat},
  title        = {How many zombies are needed to catch the survivor on toroidal grids?},
  journal      = {Theor. Comput. Sci.},
  volume       = {794},
  pages        = {3--11},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.05.021},
  doi          = {10.1016/J.TCS.2018.05.021},
  timestamp    = {Tue, 15 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Pralat19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}