Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs657.bht:"
@article{DBLP:journals/tcs/AnselmoGM17, author = {Marcella Anselmo and Dora Giammarresi and Maria Madonia}, title = {Non-expandable non-overlapping sets of pictures}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {127--136}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.09.025}, doi = {10.1016/J.TCS.2016.09.025}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AnselmoGM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChengZZ17, author = {Jie Cheng and Daming Zhu and Binhai Zhu}, title = {Improved algorithms for intermediate dataset storage in a cloud-based dataflow}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {48--53}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.05.042}, doi = {10.1016/J.TCS.2016.05.042}, timestamp = {Thu, 10 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChengZZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DongTLWHXL17, author = {Jianming Dong and Weitian Tong and Taibo Luo and Xueshi Wang and Jueliang Hu and Yinfeng Xu and Guohui Lin}, title = {An {FPTAS} for the parallel two-stage flowshop problem}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {64--72}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.04.046}, doi = {10.1016/J.TCS.2016.04.046}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DongTLWHXL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DuMRSS17, author = {Chen Fei Du and Hamoon Mousavi and Eric Rowland and Luke Schaeffer and Jeffrey O. Shallit}, title = {Decision algorithms for Fibonacci-automatic words, {II:} Related sequences and avoidability}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {146--162}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.10.005}, doi = {10.1016/J.TCS.2016.10.005}, timestamp = {Mon, 09 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DuMRSS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Furer17, author = {Martin F{\"{u}}rer}, title = {Efficient computation of the characteristic polynomial of a threshold graph}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {3--10}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.07.013}, doi = {10.1016/J.TCS.2016.07.013}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Furer17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GuoL17, author = {Jia Guo and Mei Lu}, title = {Conditional diagnosability of the round matching composition networks}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {163--172}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.10.008}, doi = {10.1016/J.TCS.2016.10.008}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GuoL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/IvanyosS17, author = {G{\'{a}}bor Ivanyos and Miklos Santha}, title = {Solving systems of diagonal polynomial equations over finite fields}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {73--85}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.04.045}, doi = {10.1016/J.TCS.2016.04.045}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/IvanyosS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KawaharaKM17, author = {Jun Kawahara and Koji M. Kobayashi and Shuichi Miyazaki}, title = {Better bounds for online k-frame throughput maximization in network switches}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {173--190}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.10.009}, doi = {10.1016/J.TCS.2016.10.009}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/KawaharaKM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LiFCH17, author = {Wenjun Li and Qilong Feng and Jianer Chen and Shuai Hu}, title = {Improved kernel results for some {FPT} problems based on simple observations}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {20--27}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.06.012}, doi = {10.1016/J.TCS.2016.06.012}, timestamp = {Tue, 24 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/LiFCH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LinFCL17, author = {Mugang Lin and Qilong Feng and Jianer Chen and Wenjun Li}, title = {Partition on trees with supply and demand: Kernelization and algorithms}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {11--19}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.06.044}, doi = {10.1016/J.TCS.2016.06.044}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/LinFCL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LiuZ17, author = {Yang Liu and Shengyu Zhang}, title = {Fast quantum algorithms for least squares regression and statistic leverage scores}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {38--47}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.05.044}, doi = {10.1016/J.TCS.2016.05.044}, timestamp = {Sun, 19 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/LiuZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MeiraMP17, author = {Luis A. A. Meira and Fl{\'{a}}vio Keidi Miyazawa and Lehilton L. C. Pedrosa}, title = {Clustering through Continuous Facility Location Problems}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {137--145}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.10.001}, doi = {10.1016/J.TCS.2016.10.001}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MeiraMP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MohanRM17, author = {Usha Mohan and Sivaramakrishnan Ramani and Sounaka Mishra}, title = {Constant factor approximation algorithm for {TSP} satisfying a biased triangle inequality}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {111--126}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.09.017}, doi = {10.1016/J.TCS.2016.09.017}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/MohanRM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/WangY17, author = {Jianxin Wang and Chee K. Yap}, title = {Preface}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {1--2}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.11.024}, doi = {10.1016/J.TCS.2016.11.024}, timestamp = {Fri, 17 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/WangY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/WangYW17, author = {Jinyan Wang and Minghao Yin and Jingli Wu}, title = {Two approximate algorithms for model counting}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {28--37}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.04.047}, doi = {10.1016/J.TCS.2016.04.047}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/WangYW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/XianZZPL17, author = {Aiyong Xian and Kaiyuan Zhu and Daming Zhu and Lianrong Pu and Hong Liu}, title = {Approximating Max NAE-k-SAT by anonymous local search}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {54--63}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.05.040}, doi = {10.1016/J.TCS.2016.05.040}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/XianZZPL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/XiaoK17, author = {Mingyu Xiao and Shaowei Kou}, title = {Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {86--97}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.04.043}, doi = {10.1016/J.TCS.2016.04.043}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/XiaoK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ZhangG17, author = {Peng Zhang and Yong Gao}, title = {A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {98--110}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.04.041}, doi = {10.1016/J.TCS.2016.04.041}, timestamp = {Mon, 20 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ZhangG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ZhangW17, author = {Haixia Zhang and Yi Wang}, title = {The minimal Laplacian spectral radius of trees with diameter 4}, journal = {Theor. Comput. Sci.}, volume = {657}, pages = {191--195}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2016.10.002}, doi = {10.1016/J.TCS.2016.10.002}, timestamp = {Fri, 14 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ZhangW17.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.