Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/BazganPT19,
  author       = {Cristina Bazgan and
                  Thomas Pontoizeau and
                  Zsolt Tuza},
  title        = {Finding a potential community in networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {769},
  pages        = {32--42},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.10.011},
  doi          = {10.1016/J.TCS.2018.10.011},
  timestamp    = {Wed, 08 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BazganPT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BergKW19,
  author       = {Mark de Berg and
                  S{\'{a}}ndor Kisfaludi{-}Bak and
                  Gerhard J. Woeginger},
  title        = {The complexity of Dominating Set in geometric intersection graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {769},
  pages        = {18--31},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.10.007},
  doi          = {10.1016/J.TCS.2018.10.007},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BergKW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DolevGGKK19,
  author       = {Shlomi Dolev and
                  Juan A. Garay and
                  Niv Gilboa and
                  Vladimir Kolesnikov and
                  Muni Venkateswarlu Kumaramangalam},
  title        = {Perennial secure multi-party computation of universal Turing machine},
  journal      = {Theor. Comput. Sci.},
  volume       = {769},
  pages        = {43--62},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.10.012},
  doi          = {10.1016/J.TCS.2018.10.012},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/DolevGGKK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LafondS19,
  author       = {Manuel Lafond and
                  C{\'{e}}line Scornavacca},
  title        = {On the Weighted Quartet Consensus problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {769},
  pages        = {1--17},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.10.005},
  doi          = {10.1016/J.TCS.2018.10.005},
  timestamp    = {Fri, 31 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/LafondS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/SadhuRNR19,
  author       = {Sanjib Sadhu and
                  Sasanka Roy and
                  Subhas C. Nandy and
                  Suchismita Roy},
  title        = {Linear time algorithm to cover and hit a set of line segments optimally
                  by two axis-parallel squares},
  journal      = {Theor. Comput. Sci.},
  volume       = {769},
  pages        = {63--74},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.10.013},
  doi          = {10.1016/J.TCS.2018.10.013},
  timestamp    = {Fri, 31 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/SadhuRNR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}