Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/AsahiroJMO22,
  author       = {Yuichi Asahiro and
                  Jesper Jansson and
                  Eiji Miyano and
                  Hirotaka Ono},
  title        = {Upper and lower degree-constrained graph orientation with minimum
                  penalty},
  journal      = {Theor. Comput. Sci.},
  volume       = {900},
  pages        = {53--78},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2021.11.019},
  doi          = {10.1016/J.TCS.2021.11.019},
  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/AsahiroJMO22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BlasiusFS22,
  author       = {Thomas Bl{\"{a}}sius and
                  Tobias Friedrich and
                  Martin Schirneck},
  title        = {The complexity of dependency detection and discovery in relational
                  databases},
  journal      = {Theor. Comput. Sci.},
  volume       = {900},
  pages        = {79--96},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2021.11.020},
  doi          = {10.1016/J.TCS.2021.11.020},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BlasiusFS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChakrabortyMP22,
  author       = {Maumita Chakraborty and
                  Ranjan Mehera and
                  Rajat Kumar Pal},
  title        = {Divide-and-conquer based all spanning tree generation algorithm of
                  a simple connected graph},
  journal      = {Theor. Comput. Sci.},
  volume       = {900},
  pages        = {35--52},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2021.11.018},
  doi          = {10.1016/J.TCS.2021.11.018},
  timestamp    = {Wed, 12 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChakrabortyMP22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EmuraKW22,
  author       = {Keita Emura and
                  Shuichi Katsumata and
                  Yohei Watanabe},
  title        = {Identity-based encryption with security against the {KGC:} {A} formal
                  model and its instantiations},
  journal      = {Theor. Comput. Sci.},
  volume       = {900},
  pages        = {97--119},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2021.11.021},
  doi          = {10.1016/J.TCS.2021.11.021},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/EmuraKW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Moscarini22,
  author       = {Marina Moscarini},
  title        = {Computing a metric basis of a bipartite distance-hereditary graph},
  journal      = {Theor. Comput. Sci.},
  volume       = {900},
  pages        = {20--24},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2021.11.015},
  doi          = {10.1016/J.TCS.2021.11.015},
  timestamp    = {Wed, 12 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Moscarini22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NiesS22,
  author       = {Andr{\'{e}} Nies and
                  Frank Stephan},
  title        = {Randomness and initial segment complexity for measures},
  journal      = {Theor. Comput. Sci.},
  volume       = {900},
  pages        = {1--19},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2021.11.003},
  doi          = {10.1016/J.TCS.2021.11.003},
  timestamp    = {Fri, 21 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NiesS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Oitavem22,
  author       = {Isabel Oitavem},
  title        = {The polynomial hierarchy of functions and its levels},
  journal      = {Theor. Comput. Sci.},
  volume       = {900},
  pages        = {25--34},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.tcs.2021.11.016},
  doi          = {10.1016/J.TCS.2021.11.016},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Oitavem22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}