Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/DangY18,
  author       = {Chuangyin Dang and
                  Yinyu Ye},
  title        = {On the complexity of an expanded Tarski's fixed point problem under
                  the componentwise ordering},
  journal      = {Theor. Comput. Sci.},
  volume       = {732},
  pages        = {26--45},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.021},
  doi          = {10.1016/J.TCS.2018.04.021},
  timestamp    = {Sun, 18 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DangY18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Dekking18,
  author       = {Michel Dekking},
  title        = {The Frobenius problem for homomorphic embeddings of languages into
                  the integers},
  journal      = {Theor. Comput. Sci.},
  volume       = {732},
  pages        = {73--79},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.023},
  doi          = {10.1016/J.TCS.2018.04.023},
  timestamp    = {Sat, 21 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Dekking18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DemaineR18,
  author       = {Erik D. Demaine and
                  Mikhail Rudoy},
  title        = {A simple proof that the (\emph{n}\({}^{\mbox{2}}\){\unicode{8239}}-{\unicode{8239}}1)-puzzle
                  is hard},
  journal      = {Theor. Comput. Sci.},
  volume       = {732},
  pages        = {80--84},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.031},
  doi          = {10.1016/J.TCS.2018.04.031},
  timestamp    = {Tue, 10 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/DemaineR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EeS18,
  author       = {Martijn van Ee and
                  Ren{\'{e}} Sitters},
  title        = {Approximation and complexity of multi-target graph search and the
                  Canadian traveler problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {732},
  pages        = {14--25},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.022},
  doi          = {10.1016/J.TCS.2018.04.022},
  timestamp    = {Tue, 12 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/EeS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FarrH18,
  author       = {Graham Farr and
                  Nhan Bao Ho},
  title        = {The Sprague-Grundy function for some nearly disjunctive sums of Nim
                  and Silver Dollar games},
  journal      = {Theor. Comput. Sci.},
  volume       = {732},
  pages        = {46--59},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.027},
  doi          = {10.1016/J.TCS.2018.04.027},
  timestamp    = {Tue, 10 Jul 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/FarrH18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HalavaHS18,
  author       = {Vesa Halava and
                  Tero Harju and
                  Esa Sahla},
  title        = {On fixed points of rational transductions},
  journal      = {Theor. Comput. Sci.},
  volume       = {732},
  pages        = {85--88},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.030},
  doi          = {10.1016/J.TCS.2018.04.030},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HalavaHS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MasseCGLNV18,
  author       = {Alexandre Blondin Mass{\'{e}} and
                  Julien de Carufel and
                  Alain Goupil and
                  M{\'{e}}lodie Lapointe and
                  {\'{E}}mile Nadeau and
                  {\'{E}}lise Vandomme},
  title        = {Leaf realization problem, caterpillar graphs and prefix normal words},
  journal      = {Theor. Comput. Sci.},
  volume       = {732},
  pages        = {1--13},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.019},
  doi          = {10.1016/J.TCS.2018.04.019},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MasseCGLNV18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Vagvolgyi18,
  author       = {S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
  title        = {Descendants of a recognizable tree language for prefix constrained
                  linear monadic term rewriting with position cutting strategy},
  journal      = {Theor. Comput. Sci.},
  volume       = {732},
  pages        = {60--72},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.026},
  doi          = {10.1016/J.TCS.2018.04.026},
  timestamp    = {Tue, 12 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Vagvolgyi18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}