:facetid:toc:\"db/journals/tcs/tcs590.bht\"OK:facetid:toc:db/journals/tcs/tcs590.bhtTatsuya AkutsuTakeyuki TamuraAvraham A. MelkmanAtsuhiro TakasuOn the complexity of finding a largest common subtree of bounded degree.Theor. Comput. Sci.5902-162015Journal Articlesopenjournals/tcs/AkutsuTMT1510.1016/J.TCS.2014.10.012https://doi.org/10.1016/j.tcs.2014.10.012https://dblp.org/rec/journals/tcs/AkutsuTMT15URL#3489405Antonio Fernández AntaChryssis GeorgiouDariusz R. KowalskiElli ZavouOnline parallel scheduling of non-uniform tasks: Trading failures for energy.Theor. Comput. Sci.590129-1462015Journal Articlesopenjournals/tcs/AntaGKZ1510.1016/J.TCS.2015.01.027https://doi.org/10.1016/j.tcs.2015.01.027https://dblp.org/rec/journals/tcs/AntaGKZ15URL#3489419Vikraman ArvindJohannes KöblerSebastian KuhnertGaurav RattanYadu VasudevOn the isomorphism problem for decision trees and decision lists.Theor. Comput. Sci.59038-542015Journal Articlesopenjournals/tcs/ArvindKKRV1510.1016/J.TCS.2015.01.025https://doi.org/10.1016/j.tcs.2015.01.025https://dblp.org/rec/journals/tcs/ArvindKKRV15URL#3489425Neta BarkayEly PoratBar ShalemEfficient sampling of non-strict turnstile data streams.Theor. Comput. Sci.590106-1172015Journal Articlesopenjournals/tcs/BarkayPS1510.1016/J.TCS.2015.01.026https://doi.org/10.1016/j.tcs.2015.01.026https://dblp.org/rec/journals/tcs/BarkayPS15URL#3489446Joan BoyarMagnus Gausdal FindCancellation-free circuits in unbounded and bounded depth.Theor. Comput. Sci.59017-262015Journal Articlesopenjournals/tcs/BoyarF1510.1016/J.TCS.2014.10.014https://doi.org/10.1016/j.tcs.2014.10.014https://dblp.org/rec/journals/tcs/BoyarF15URL#3489485Arnaud CasteigtsPaola FlocchiniEmmanuel GodardNicola SantoroMasafumi YamashitaOn the expressivity of time-varying graphs.Theor. Comput. Sci.59027-372015Journal Articlesopenjournals/tcs/CasteigtsFGSY1510.1016/J.TCS.2015.04.004https://doi.org/10.1016/j.tcs.2015.04.004https://dblp.org/rec/journals/tcs/CasteigtsFGSY15URL#3489510Steven ChaplickJirí Fiala 0001Pim van 't HofDaniël PaulusmaMarek Tesar 0001Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.Theor. Comput. Sci.59086-952015Journal Articlesopenjournals/tcs/ChaplickFHPT1510.1016/J.TCS.2015.01.028https://doi.org/10.1016/j.tcs.2015.01.028https://dblp.org/rec/journals/tcs/ChaplickFHPT15URL#3489519Leszek GasieniecRussell MartinFrank WolterPrudence W. H. WongFundamentals of Computation Theory.Theor. Comput. Sci.59012015Journal Articlesopenjournals/tcs/GasieniecMWW1510.1016/J.TCS.2015.05.040https://doi.org/10.1016/j.tcs.2015.05.040https://dblp.org/rec/journals/tcs/GasieniecMWW15URL#3489628Miroslaw KowalukGabriela MajewskaNew sequential and parallel algorithms for computing the β-spectrum.Theor. Comput. Sci.59073-852015Journal Articlesopenjournals/tcs/KowalukM1510.1016/J.TCS.2015.03.033https://doi.org/10.1016/j.tcs.2015.03.033https://dblp.org/rec/journals/tcs/KowalukM15URL#3489732Evangelos KranakisFraser MacQuarrieOscar Morales-PonceConnectivity and stretch factor trade-offs in wireless sensor networks with directional antennae.Theor. Comput. Sci.59055-722015Journal Articlesopenjournals/tcs/KranakisMP1510.1016/J.TCS.2015.04.035https://doi.org/10.1016/j.tcs.2015.04.035https://dblp.org/rec/journals/tcs/KranakisMP15URL#3489733Kewen LiaoHong Shen 0001Longkun GuoImproved approximation algorithms for constrained fault-tolerant resource allocation.Theor. Comput. Sci.590118-1282015Journal Articlesopenjournals/tcs/LiaoSG1510.1016/J.TCS.2015.02.029https://doi.org/10.1016/j.tcs.2015.02.029https://dblp.org/rec/journals/tcs/LiaoSG15URL#3489761Sotiris E. NikoletseasPanagiota N. PanagopoulouChristoforos L. RaptopoulosPaul G. SpirakisOn the structure of equilibria in basic network formation.Theor. Comput. Sci.59096-1052015Journal Articlesopenjournals/tcs/NikoletseasPRS1510.1016/J.TCS.2015.03.029https://doi.org/10.1016/j.tcs.2015.03.029https://dblp.org/rec/journals/tcs/NikoletseasPRS15URL#3489796