Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs440.bht:"
@article{DBLP:journals/tcs/BaloghBG12, author = {J{\'{a}}nos Balogh and J{\'{o}}zsef B{\'{e}}k{\'{e}}si and G{\'{a}}bor Galambos}, title = {New lower bounds for certain classes of bin packing algorithms}, journal = {Theor. Comput. Sci.}, volume = {440-441}, pages = {1--13}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.017}, doi = {10.1016/J.TCS.2012.04.017}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BaloghBG12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BulteauFJR12, author = {Laurent Bulteau and Guillaume Fertin and Minghui Jiang and Irena Rusu}, title = {Tractability and approximability of maximal strip recovery}, journal = {Theor. Comput. Sci.}, volume = {440-441}, pages = {14--28}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.034}, doi = {10.1016/J.TCS.2012.04.034}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BulteauFJR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Challita12, author = {Khalil Challita}, title = {A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems}, journal = {Theor. Comput. Sci.}, volume = {440-441}, pages = {29--38}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.004}, doi = {10.1016/J.TCS.2012.04.004}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/Challita12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChuanH12, author = {Wai{-}Fong Chuan and Hui{-}Ling Ho}, title = {Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers}, journal = {Theor. Comput. Sci.}, volume = {440-441}, pages = {39--51}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.015}, doi = {10.1016/J.TCS.2012.04.015}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChuanH12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CzyzowiczGP12, author = {Jurek Czyzowicz and Leszek Gasieniec and Andrzej Pelc}, title = {Choosing the best among peers}, journal = {Theor. Comput. Sci.}, volume = {440-441}, pages = {52--59}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.005}, doi = {10.1016/J.TCS.2012.04.005}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CzyzowiczGP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/PintoPS12, author = {Paulo Eust{\'{a}}quio Duarte Pinto and F{\'{a}}bio Protti and Jayme Luiz Szwarcfiter}, title = {Exact and approximation algorithms for error-detecting even codes}, journal = {Theor. Comput. Sci.}, volume = {440-441}, pages = {60--72}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.03.047}, doi = {10.1016/J.TCS.2012.03.047}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/PintoPS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/RestivoV12a, author = {Antonio Restivo and Roberto Vaglica}, title = {Extremal minimality conditions on automata}, journal = {Theor. Comput. Sci.}, volume = {440-441}, pages = {73--84}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.03.049}, doi = {10.1016/J.TCS.2012.03.049}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/RestivoV12a.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.