Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs478.bht:"
@article{DBLP:journals/tcs/BabaIOKM13, author = {Daisuke Baba and Tomoko Izumi and Fukuhito Ooshita and Hirotsugu Kakugawa and Toshimitsu Masuzawa}, title = {Linear time and space gathering of anonymous mobile agents in asynchronous trees}, journal = {Theor. Comput. Sci.}, volume = {478}, pages = {118--126}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.01.022}, doi = {10.1016/J.TCS.2013.01.022}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BabaIOKM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BazganGMP13, author = {Cristina Bazgan and Laurent Gourv{\`{e}}s and J{\'{e}}r{\^{o}}me Monnot and Fanny Pascual}, title = {Single approximation for the biobjective Max {TSP}}, journal = {Theor. Comput. Sci.}, volume = {478}, pages = {41--50}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.01.021}, doi = {10.1016/J.TCS.2013.01.021}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BazganGMP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Blumensath13a, author = {Achim Blumensath}, title = {An algebraic proof of Rabin's Tree Theorem}, journal = {Theor. Comput. Sci.}, volume = {478}, pages = {1--21}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.01.026}, doi = {10.1016/J.TCS.2013.01.026}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Blumensath13a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChenPWLTXW13, author = {Wenbin Chen and Lingxi Peng and Jianxiong Wang and Fufang Li and Maobin Tang and Wei Xiong and Songtao Wang}, title = {Inapproximability results for the minimum integral solution problem with preprocessing over \emph{{\(\mathscr{l}\)}}\({}_{\mbox{\emph{{\(\infty\)}}}}\){\(\mathscr{l}\)}{\(\infty\)} norm}, journal = {Theor. Comput. Sci.}, volume = {478}, pages = {127--131}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.01.028}, doi = {10.1016/J.TCS.2013.01.028}, timestamp = {Fri, 03 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChenPWLTXW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DabrowskiDL13, author = {Konrad K. Dabrowski and Marc Demange and Vadim V. Lozin}, title = {New results on maximum induced matchings in bipartite graphs and beyond}, journal = {Theor. Comput. Sci.}, volume = {478}, pages = {33--40}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.01.027}, doi = {10.1016/J.TCS.2013.01.027}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DabrowskiDL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DuttingHW13, author = {Paul D{\"{u}}tting and Monika Henzinger and Ingmar Weber}, title = {Bidder optimal assignments for general utilities}, journal = {Theor. Comput. Sci.}, volume = {478}, pages = {22--32}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.01.030}, doi = {10.1016/J.TCS.2013.01.030}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DuttingHW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KanjZ13, author = {Iyad A. Kanj and Fenghui Zhang}, title = {On the independence number of graphs with maximum degree 3}, journal = {Theor. Comput. Sci.}, volume = {478}, pages = {51--75}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.01.031}, doi = {10.1016/J.TCS.2013.01.031}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KanjZ13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LibertY13, author = {Beno{\^{\i}}t Libert and Moti Yung}, title = {Adaptively secure non-interactive threshold cryptosystems}, journal = {Theor. Comput. Sci.}, volume = {478}, pages = {76--100}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.01.001}, doi = {10.1016/J.TCS.2013.01.001}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/LibertY13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/NevisiR13, author = {Hossein Nevisi and Daniel Reidenbach}, title = {Unambiguous 1-uniform morphisms}, journal = {Theor. Comput. Sci.}, volume = {478}, pages = {101--117}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2012.11.023}, doi = {10.1016/J.TCS.2012.11.023}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/NevisiR13.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.