Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/AignerMM05,
  author       = {Martin Aigner and
                  Gianluca De Marco and
                  Manuela Montangero},
  title        = {The plurality problem with three colors and more},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {319--330},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2004.12.035},
  doi          = {10.1016/J.TCS.2004.12.035},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AignerMM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Bille05,
  author       = {Philip Bille},
  title        = {A survey on tree edit distance and related problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {217--239},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2004.12.030},
  doi          = {10.1016/J.TCS.2004.12.030},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Bille05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BruinV05,
  author       = {Henk Bruin and
                  Oksan Volkova},
  title        = {The complexity of Fibonacci-like kneading sequences},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {379--389},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.02.001},
  doi          = {10.1016/J.TCS.2005.02.001},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BruinV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChenK05,
  author       = {Jianer Chen and
                  Iyad A. Kanj},
  title        = {On approximating minimum vertex cover for graphs with perfect matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {305--318},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2004.12.034},
  doi          = {10.1016/J.TCS.2004.12.034},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChenK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChengKK05,
  author       = {T. C. Edwin Cheng and
                  Hans Kellerer and
                  Vladimir Kotov},
  title        = {Semi-on-line multiprocessor scheduling with given total processing
                  time},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {134--146},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2004.11.018},
  doi          = {10.1016/J.TCS.2004.11.018},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChengKK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChouK05,
  author       = {Arthur W. Chou and
                  Ker{-}I Ko},
  title        = {The computational complexity of distance functions of two-dimensional
                  domains},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {360--369},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2004.11.016},
  doi          = {10.1016/J.TCS.2004.11.016},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChouK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Chuan05,
  author       = {Wai{-}Fong Chuan},
  title        = {Factors of characteristic words of irrational numbers},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {169--182},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2004.12.028},
  doi          = {10.1016/J.TCS.2004.12.028},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Chuan05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CostagliolaFG05,
  author       = {Gennaro Costagliola and
                  Filomena Ferrucci and
                  Carmine Gravino},
  title        = {Adding symbolic information to picture models: definitions and properties},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {51--104},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.03.028},
  doi          = {10.1016/J.TCS.2005.03.028},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/CostagliolaFG05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DiasFS05,
  author       = {V{\^{a}}nia M. F{\'{e}}lix Dias and
                  Celina M. H. de Figueiredo and
                  Jayme Luiz Szwarcfiter},
  title        = {Generating bicliques of a graph in lexicographic order},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {240--248},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.014},
  doi          = {10.1016/J.TCS.2005.01.014},
  timestamp    = {Tue, 01 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DiasFS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ElkinP05,
  author       = {Michael Elkin and
                  David Peleg},
  title        = {Approximating \emph{k}-spanner problems for \emph{k}ge2},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {249--277},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2004.11.022},
  doi          = {10.1016/J.TCS.2004.11.022},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ElkinP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FlocchiniPSW05,
  author       = {Paola Flocchini and
                  Giuseppe Prencipe and
                  Nicola Santoro and
                  Peter Widmayer},
  title        = {Gathering of asynchronous robots with limited visibility},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {147--168},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.001},
  doi          = {10.1016/J.TCS.2005.01.001},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/FlocchiniPSW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GiacobazziM05,
  author       = {Roberto Giacobazzi and
                  Isabella Mastroeni},
  title        = {Transforming semantics by abstract interpretation},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {1--50},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2004.12.021},
  doi          = {10.1016/J.TCS.2004.12.021},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GiacobazziM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GuelevH05,
  author       = {Dimitar P. Guelev and
                  Dang Van Hung},
  title        = {On the completeness and decidability of duration calculus with iteration},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {278--304},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.017},
  doi          = {10.1016/J.TCS.2005.01.017},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GuelevH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HooryS05,
  author       = {Shlomo Hoory and
                  Stefan Szeider},
  title        = {Computing unsatisfiable k-SAT instances with few occurrences per variable},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {347--359},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.02.004},
  doi          = {10.1016/J.TCS.2005.02.004},
  timestamp    = {Sun, 04 Aug 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/HooryS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Hsieh05,
  author       = {Sun{-}Yuan Hsieh},
  title        = {Embedding longest fault-free paths onto star graphs with more vertex
                  faults},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {370--378},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.01.018},
  doi          = {10.1016/J.TCS.2005.01.018},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Hsieh05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HuangLZ05,
  author       = {Li{-}Sha Huang and
                  Minming Li and
                  Bo Zhang},
  title        = {Approximation of Walrasian equilibrium in single-minded auctions},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {390--398},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.03.008},
  doi          = {10.1016/J.TCS.2005.03.008},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HuangLZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KarhumakiPR05,
  author       = {Juhani Karhum{\"{a}}ki and
                  Wojciech Plandowski and
                  Wojciech Rytter},
  title        = {On the complexity of decidable cases of the commutation problem of
                  languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {105--118},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2004.03.073},
  doi          = {10.1016/J.TCS.2004.03.073},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KarhumakiPR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MantheyR05,
  author       = {Bodo Manthey and
                  R{\"{u}}diger Reischuk},
  title        = {The intractability of computing the Hamming distance},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {331--346},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2005.02.002},
  doi          = {10.1016/J.TCS.2005.02.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MantheyR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/McQuillan05,
  author       = {Ian McQuillan},
  title        = {The generative capacity of block-synchronized context-free grammars},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {119--133},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2004.11.003},
  doi          = {10.1016/J.TCS.2004.11.003},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/McQuillan05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MoriyaHHO05,
  author       = {Etsuro Moriya and
                  Dieter Hofbauer and
                  Maria Huber and
                  Friedrich Otto},
  title        = {On state-alternating context-free grammars},
  journal      = {Theor. Comput. Sci.},
  volume       = {337},
  number       = {1-3},
  pages        = {183--216},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.tcs.2004.12.029},
  doi          = {10.1016/J.TCS.2004.12.029},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MoriyaHHO05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.