Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/Bar-NatanCGMW22,
  author       = {Aviv Bar{-}Natan and
                  Panagiotis Charalampopoulos and
                  Pawel Gawrychowski and
                  Shay Mozes and
                  Oren Weimann},
  title        = {Fault-tolerant distance labeling for planar graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {918},
  pages        = {48--59},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2022.03.020},
  doi          = {10.1016/J.TCS.2022.03.020},
  timestamp    = {Wed, 18 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Bar-NatanCGMW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BockenhauerKW22,
  author       = {Hans{-}Joachim B{\"{o}}ckenhauer and
                  Dennis Komm and
                  Raphael Wegner},
  title        = {Call admission problems on grids with advice},
  journal      = {Theor. Comput. Sci.},
  volume       = {918},
  pages        = {77--93},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2022.03.022},
  doi          = {10.1016/J.TCS.2022.03.022},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BockenhauerKW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GeffertBS22,
  author       = {Viliam Geffert and
                  Zuzana Bedn{\'{a}}rov{\'{a}} and
                  Alexander Szabari},
  title        = {Input-driven pushdown automata for edit distance neighborhood},
  journal      = {Theor. Comput. Sci.},
  volume       = {918},
  pages        = {105--122},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2022.03.024},
  doi          = {10.1016/J.TCS.2022.03.024},
  timestamp    = {Mon, 16 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GeffertBS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GimaHKKO22,
  author       = {Tatsuya Gima and
                  Tesshu Hanaka and
                  Masashi Kiyomi and
                  Yasuaki Kobayashi and
                  Yota Otachi},
  title        = {Exploring the gap between treedepth and vertex cover through vertex
                  integrity},
  journal      = {Theor. Comput. Sci.},
  volume       = {918},
  pages        = {60--76},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2022.03.021},
  doi          = {10.1016/J.TCS.2022.03.021},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GimaHKKO22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/JahanniaNRS22,
  author       = {Marieh Jahannia and
                  Morteza Mohammad Noori and
                  Narad Rampersad and
                  Manon Stipulanti},
  title        = {Closed Ziv-Lempel factorization of the \emph{m}-bonacci words},
  journal      = {Theor. Comput. Sci.},
  volume       = {918},
  pages        = {32--47},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2022.03.019},
  doi          = {10.1016/J.TCS.2022.03.019},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/JahanniaNRS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LondonMP22,
  author       = {Andr{\'{a}}s London and
                  Ryan R. Martin and
                  Andr{\'{a}}s Pluh{\'{a}}r},
  title        = {Graph clustering via generalized colorings},
  journal      = {Theor. Comput. Sci.},
  volume       = {918},
  pages        = {94--104},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2022.03.023},
  doi          = {10.1016/J.TCS.2022.03.023},
  timestamp    = {Sun, 06 Oct 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/LondonMP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Poureidi22a,
  author       = {Abolfazl Poureidi},
  title        = {Algorithmic results in secure total dominating sets on graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {918},
  pages        = {1--17},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2022.03.016},
  doi          = {10.1016/J.TCS.2022.03.016},
  timestamp    = {Wed, 18 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Poureidi22a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Wang22a,
  author       = {Biing{-}Feng Wang},
  title        = {Efficient algorithms for the minmax regret path center problem with
                  length constraint on trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {918},
  pages        = {18--31},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2022.03.017},
  doi          = {10.1016/J.TCS.2022.03.017},
  timestamp    = {Wed, 18 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Wang22a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}