Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/AhadiZ19,
  author       = {Arash Ahadi and
                  Alireza Zarei},
  title        = {Connecting guards with minimum Steiner points inside simple polygons},
  journal      = {Theor. Comput. Sci.},
  volume       = {775},
  pages        = {26--31},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.12.008},
  doi          = {10.1016/J.TCS.2018.12.008},
  timestamp    = {Wed, 03 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/AhadiZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BonardoFS19,
  author       = {Pierre Bonardo and
                  Anna E. Frid and
                  Jeffrey O. Shallit},
  title        = {The number of valid factorizations of Fibonacci prefixes},
  journal      = {Theor. Comput. Sci.},
  volume       = {775},
  pages        = {68--75},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.12.016},
  doi          = {10.1016/J.TCS.2018.12.016},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BonardoFS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChatterjeeDMSY19,
  author       = {Tanima Chatterjee and
                  Bhaskar DasGupta and
                  Nasim Mobasheri and
                  Venkatkumar Srinivasan and
                  Ismael Gonz{\'{a}}lez Yero},
  title        = {On the computational complexities of three problems related to a privacy
                  measure for large networks under active attack},
  journal      = {Theor. Comput. Sci.},
  volume       = {775},
  pages        = {53--67},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.12.013},
  doi          = {10.1016/J.TCS.2018.12.013},
  timestamp    = {Fri, 05 Jul 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ChatterjeeDMSY19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ColucciEGM19,
  author       = {Lucas Colucci and
                  P{\'{e}}ter L. Erd{\"{o}}s and
                  Ervin Gy{\"{o}}ri and
                  Tam{\'{a}}s R{\'{o}}bert Mezei},
  title        = {Terminal-pairability in complete bipartite graphs with non-bipartite
                  demands: Edge-disjoint paths in complete bipartite graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {775},
  pages        = {16--25},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.12.007},
  doi          = {10.1016/J.TCS.2018.12.007},
  timestamp    = {Tue, 16 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ColucciEGM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GencSSO19,
  author       = {Begum Genc and
                  Mohamed Siala and
                  Gilles Simonin and
                  Barry O'Sullivan},
  title        = {Complexity Study for the Robust Stable Marriage Problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {775},
  pages        = {76--92},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.12.017},
  doi          = {10.1016/J.TCS.2018.12.017},
  timestamp    = {Sun, 06 Oct 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GencSSO19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GurskiRR19,
  author       = {Frank Gurski and
                  Carolin Rehs and
                  Jochen Rethmann},
  title        = {Knapsack problems: {A} parameterized point of view},
  journal      = {Theor. Comput. Sci.},
  volume       = {775},
  pages        = {93--108},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.12.019},
  doi          = {10.1016/J.TCS.2018.12.019},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GurskiRR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KhoshkhahGMT19,
  author       = {Kaveh Khoshkhah and
                  Mehdi Khosravian Ghadikolaei and
                  J{\'{e}}r{\^{o}}me Monnot and
                  Dirk Oliver Theis},
  title        = {Complexity and approximability of extended Spanning Star Forest problems
                  in general and complete graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {775},
  pages        = {1--15},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.11.025},
  doi          = {10.1016/J.TCS.2018.11.025},
  timestamp    = {Tue, 16 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/KhoshkhahGMT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ZhangLGL19,
  author       = {Xiao Zhang and
                  Shengli Liu and
                  Dawu Gu and
                  Joseph K. Liu},
  title        = {A generic construction of tightly secure signatures in the multi-user
                  setting},
  journal      = {Theor. Comput. Sci.},
  volume       = {775},
  pages        = {32--52},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.12.012},
  doi          = {10.1016/J.TCS.2018.12.012},
  timestamp    = {Fri, 17 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ZhangLGL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}