Search dblp for Publications

export results for "toc:db/journals/tcs/tcs432.bht:"

 download as .bib file

@article{DBLP:journals/tcs/AnnYTH12,
  author       = {Hsing{-}Yen Ann and
                  Chang{-}Biau Yang and
                  Chiou{-}Ting Tseng and
                  Chiou{-}Yi Hor},
  title        = {Fast algorithms for computing the constrained {LCS} of run-length
                  encoded strings},
  journal      = {Theor. Comput. Sci.},
  volume       = {432},
  pages        = {1--9},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.038},
  doi          = {10.1016/J.TCS.2012.01.038},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AnnYTH12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BiroMM12,
  author       = {P{\'{e}}ter Bir{\'{o}} and
                  David F. Manlove and
                  Eric McDermid},
  title        = {"Almost stable" matchings in the Roommates problem with bounded preference
                  lists},
  journal      = {Theor. Comput. Sci.},
  volume       = {432},
  pages        = {10--20},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.022},
  doi          = {10.1016/J.TCS.2012.01.022},
  timestamp    = {Fri, 09 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BiroMM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Blanchet-SadriCMSS12,
  author       = {Francine Blanchet{-}Sadri and
                  Aleksandar Chakarov and
                  Lucas Manuelli and
                  Jarett Schwartz and
                  Slater Stich},
  title        = {Constructing partial words with subword complexities not achievable
                  by full words},
  journal      = {Theor. Comput. Sci.},
  volume       = {432},
  pages        = {21--27},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.039},
  doi          = {10.1016/J.TCS.2012.01.039},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Blanchet-SadriCMSS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChenHC12,
  author       = {Kuan{-}Yu Chen and
                  Ping{-}Hui Hsu and
                  Kun{-}Mao Chao},
  title        = {Efficient retrieval of approximate palindromes in a run-length encoded
                  string},
  journal      = {Theor. Comput. Sci.},
  volume       = {432},
  pages        = {28--37},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.023},
  doi          = {10.1016/J.TCS.2012.01.023},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChenHC12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ElberfeldST12,
  author       = {Michael Elberfeld and
                  Ilka Schnoor and
                  Till Tantau},
  title        = {Influence of tree topology restrictions on the complexity of haplotyping
                  with missing data},
  journal      = {Theor. Comput. Sci.},
  volume       = {432},
  pages        = {38--51},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.015},
  doi          = {10.1016/J.TCS.2012.01.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ElberfeldST12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GambiniV12,
  author       = {Ian Gambini and
                  Laurent Vuillon},
  title        = {Non-lattice-periodic tilings of R\({}^{\mbox{3}}\) by single polycubes},
  journal      = {Theor. Comput. Sci.},
  volume       = {432},
  pages        = {52--57},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.014},
  doi          = {10.1016/J.TCS.2012.01.014},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GambiniV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GuoS12,
  author       = {Longkun Guo and
                  Hong Shen},
  title        = {On the complexity of the edge-disjoint min-min problem in planar digraphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {432},
  pages        = {58--63},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2011.12.009},
  doi          = {10.1016/J.TCS.2011.12.009},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GuoS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Honkala12,
  author       = {Juha Honkala},
  title        = {Marked {D0L} systems and the 2n-conjecture},
  journal      = {Theor. Comput. Sci.},
  volume       = {432},
  pages        = {94--97},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.037},
  doi          = {10.1016/J.TCS.2012.01.037},
  timestamp    = {Sat, 21 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Honkala12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KontogiannisS12,
  author       = {Spyros C. Kontogiannis and
                  Paul G. Spirakis},
  title        = {On mutual concavity and strategically-zero-sum bimatrix games},
  journal      = {Theor. Comput. Sci.},
  volume       = {432},
  pages        = {64--76},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.016},
  doi          = {10.1016/J.TCS.2012.01.016},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/KontogiannisS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MatomakiS12,
  author       = {Kaisa Matom{\"{a}}ki and
                  Kalle Saari},
  title        = {A new geometric approach to Sturmian words},
  journal      = {Theor. Comput. Sci.},
  volume       = {432},
  pages        = {77--84},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.040},
  doi          = {10.1016/J.TCS.2012.01.040},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MatomakiS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Salomaa12,
  author       = {Arto Salomaa},
  title        = {Subword occurrences, weighted automata and iterated morphisms, especially
                  the Fibonacci morphism},
  journal      = {Theor. Comput. Sci.},
  volume       = {432},
  pages        = {85--93},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.tcs.2012.01.017},
  doi          = {10.1016/J.TCS.2012.01.017},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Salomaa12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.