Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/Basic12,
  author       = {Bojan Basic},
  title        = {A note on the paper "On Brlek-Reutenauer conjecture"},
  journal      = {Theor. Comput. Sci.},
  volume       = {448},
  pages        = {94--96},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.04.039},
  doi          = {10.1016/J.TCS.2012.04.039},
  timestamp    = {Sat, 21 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Basic12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChenZL12,
  author       = {Lei Chen and
                  Weiming Zeng and
                  Changhong Lu},
  title        = {NP-completeness and APX-completeness of restrained domination in graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {448},
  pages        = {1--8},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.005},
  doi          = {10.1016/J.TCS.2012.05.005},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChenZL12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FotakisKS12,
  author       = {Dimitris Fotakis and
                  Alexis C. Kaporis and
                  Paul G. Spirakis},
  title        = {Efficient methods for selfish network design},
  journal      = {Theor. Comput. Sci.},
  volume       = {448},
  pages        = {9--20},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.04.033},
  doi          = {10.1016/J.TCS.2012.04.033},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FotakisKS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FreydenbergerNR12,
  author       = {Dominik D. Freydenberger and
                  Hossein Nevisi and
                  Daniel Reidenbach},
  title        = {Weakly unambiguous morphisms},
  journal      = {Theor. Comput. Sci.},
  volume       = {448},
  pages        = {21--40},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.04.045},
  doi          = {10.1016/J.TCS.2012.04.045},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FreydenbergerNR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GarciaLP12,
  author       = {Pedro Garc{\'{\i}}a and
                  Dami{\'{a}}n L{\'{o}}pez and
                  Manuel {V{\'a}zquez de Parga}},
  title        = {Polynomial characteristic sets for {DFA} identification},
  journal      = {Theor. Comput. Sci.},
  volume       = {448},
  pages        = {41--46},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.04.042},
  doi          = {10.1016/J.TCS.2012.04.042},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GarciaLP12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ghiyasvand12,
  author       = {Mehdi Ghiyasvand},
  title        = {An O(m(m + n log n) log(n C))-time algorithm to solve the minimum
                  cost tension problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {448},
  pages        = {47--55},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.03.042},
  doi          = {10.1016/J.TCS.2012.03.042},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ghiyasvand12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Koiran12,
  author       = {Pascal Koiran},
  title        = {Arithmetic circuits: The chasm at depth four gets wider},
  journal      = {Theor. Comput. Sci.},
  volume       = {448},
  pages        = {56--65},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.03.041},
  doi          = {10.1016/J.TCS.2012.03.041},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Koiran12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Nishida12,
  author       = {Taishin Y. Nishida},
  title        = {An extended Earley's algorithm for Petri net controlled grammars without
                  {\(\lambda\)} rules and cyclic rules},
  journal      = {Theor. Comput. Sci.},
  volume       = {448},
  pages        = {66--79},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.04.043},
  doi          = {10.1016/J.TCS.2012.04.043},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Nishida12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/StrandN12,
  author       = {Robin Strand and
                  Nicolas Normand},
  title        = {Distance transform computation for digital distance functions},
  journal      = {Theor. Comput. Sci.},
  volume       = {448},
  pages        = {80--93},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.05.010},
  doi          = {10.1016/J.TCS.2012.05.010},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/StrandN12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}