![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs468.bht:"
@article{DBLP:journals/tcs/BricenoR13, author = {Raimundo Brice{\~{n}}o and Ivan Rapaport}, title = {Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata}, journal = {Theor. Comput. Sci.}, volume = {468}, pages = {1--11}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.011}, doi = {10.1016/J.TCS.2012.11.011}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BricenoR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Bucci0F13, author = {Michelangelo Bucci and Alessandro De Luca and Gabriele Fici}, title = {Enumeration and structure of trapezoidal words}, journal = {Theor. Comput. Sci.}, volume = {468}, pages = {12--22}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.007}, doi = {10.1016/J.TCS.2012.11.007}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Bucci0F13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CalamoneriMPS13, author = {Tiziana Calamoneri and Eugenio Montefusco and Rossella Petreschi and Blerina Sinaimeri}, title = {Exploring pairwise compatibility graphs}, journal = {Theor. Comput. Sci.}, volume = {468}, pages = {23--36}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.015}, doi = {10.1016/J.TCS.2012.11.015}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CalamoneriMPS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChangL13, author = {Ching{-}Lueh Chang and Yuh{-}Dauh Lyuu}, title = {Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades}, journal = {Theor. Comput. Sci.}, volume = {468}, pages = {37--49}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.016}, doi = {10.1016/J.TCS.2012.11.016}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChangL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChenLC13, author = {Yebin Chen and Ying Li and Tao Chen}, title = {Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks}, journal = {Theor. Comput. Sci.}, volume = {468}, pages = {50--58}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.008}, doi = {10.1016/J.TCS.2012.11.008}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChenLC13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DavidN13, author = {J. David and Lhouari Nourine}, title = {A parameterizable enumeration algorithm for sequence mining}, journal = {Theor. Comput. Sci.}, volume = {468}, pages = {59--68}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.005}, doi = {10.1016/J.TCS.2012.11.005}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/DavidN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GaoMSZ13, author = {Yihan Gao and Jieming Mao and Xiaoming Sun and Song Zuo}, title = {On the sensitivity complexity of bipartite graph properties}, journal = {Theor. Comput. Sci.}, volume = {468}, pages = {83--91}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.006}, doi = {10.1016/J.TCS.2012.11.006}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GaoMSZ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Guillaume13, author = {Delalleau Guillaume}, title = {Ancestors graph and an upper bound for the subword complexity function}, journal = {Theor. Comput. Sci.}, volume = {468}, pages = {69--82}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.014}, doi = {10.1016/J.TCS.2012.11.014}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Guillaume13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LeeNPPS13, author = {Taehyung Lee and Joong Chae Na and Heejin Park and Kunsoo Park and Jeong Seop Sim}, title = {Finding consensus and optimal alignment of circular strings}, journal = {Theor. Comput. Sci.}, volume = {468}, pages = {92--101}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.018}, doi = {10.1016/J.TCS.2012.11.018}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/LeeNPPS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MouWL13, author = {Chenqi Mou and Dongming Wang and Xiaoliang Li}, title = {Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case}, journal = {Theor. Comput. Sci.}, volume = {468}, pages = {102--113}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.009}, doi = {10.1016/J.TCS.2012.11.009}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MouWL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ZhaoL13, author = {Kejun Zhao and Xiwen Lu}, title = {Approximation schemes for two-agent scheduling on parallel machines}, journal = {Theor. Comput. Sci.}, volume = {468}, pages = {114--121}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.002}, doi = {10.1016/J.TCS.2012.11.002}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ZhaoL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.