Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/Litow18,
  author       = {Bruce E. Litow},
  title        = {A transfer method from bounded existential Diophantine equations to
                  Tarski algebra formulas},
  journal      = {Theor. Comput. Sci.},
  volume       = {708},
  pages        = {91--95},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.10.013},
  doi          = {10.1016/J.TCS.2017.10.013},
  timestamp    = {Wed, 03 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Litow18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MaY18,
  author       = {Fei Ma and
                  Bing Yao},
  title        = {An iteration method for computing the total number of spanning trees
                  and its applications in graph theory},
  journal      = {Theor. Comput. Sci.},
  volume       = {708},
  pages        = {46--57},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.10.030},
  doi          = {10.1016/J.TCS.2017.10.030},
  timestamp    = {Wed, 03 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MaY18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MahajanT18,
  author       = {Meena Mahajan and
                  Anuj Tawari},
  title        = {Sums of read-once formulas: How many summands are necessary?},
  journal      = {Theor. Comput. Sci.},
  volume       = {708},
  pages        = {34--45},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.10.019},
  doi          = {10.1016/J.TCS.2017.10.019},
  timestamp    = {Fri, 21 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MahajanT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MarcilonS18,
  author       = {Thiago Braga Marcilon and
                  Rudini Menezes Sampaio},
  title        = {The maximum time of 2-neighbor bootstrap percolation: Complexity results},
  journal      = {Theor. Comput. Sci.},
  volume       = {708},
  pages        = {1--17},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.10.014},
  doi          = {10.1016/J.TCS.2017.10.014},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MarcilonS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Mikos18,
  author       = {Patryk Mikos},
  title        = {A new lower bound for the on-line coloring of intervals with bandwidth},
  journal      = {Theor. Comput. Sci.},
  volume       = {708},
  pages        = {96--100},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.10.029},
  doi          = {10.1016/J.TCS.2017.10.029},
  timestamp    = {Wed, 03 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Mikos18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/RaiS18,
  author       = {Ashutosh Rai and
                  Saket Saurabh},
  title        = {Bivariate complexity analysis of Almost Forest Deletion},
  journal      = {Theor. Comput. Sci.},
  volume       = {708},
  pages        = {18--33},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.10.021},
  doi          = {10.1016/J.TCS.2017.10.021},
  timestamp    = {Wed, 03 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RaiS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Talmon18,
  author       = {Nimrod Talmon},
  title        = {Structured proportional representation},
  journal      = {Theor. Comput. Sci.},
  volume       = {708},
  pages        = {58--74},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.10.028},
  doi          = {10.1016/J.TCS.2017.10.028},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Talmon18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/TsengCYL18,
  author       = {Kuo{-}Tsung Tseng and
                  De{-}Sheng Chan and
                  Chang{-}Biau Yang and
                  Shou{-}Fu Lo},
  title        = {Efficient merged longest common subsequence algorithms for similar
                  sequences},
  journal      = {Theor. Comput. Sci.},
  volume       = {708},
  pages        = {75--90},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.10.027},
  doi          = {10.1016/J.TCS.2017.10.027},
  timestamp    = {Wed, 03 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/TsengCYL18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}