:facetid:stream:\"streams/journals/tcs\"OK:facetid:stream:streams/journals/tcsNada Almalki 0002Othon MichailOn geometric shape construction via growth operations.Theor. Comput. Sci.9841143242024Journal Articlesclosedjournals/tcs/AlmalkiM2410.1016/J.TCS.2023.114324https://doi.org/10.1016/j.tcs.2023.114324https://dblp.org/rec/journals/tcs/AlmalkiM24URL#36572Amihood AmirEitan KondratovskyGad M. LandauShoshana MarcusDina SokolReconstructing parameterized strings from parameterized suffix and LCP arrays.Theor. Comput. Sci.9811142302024Journal Articlesclosedjournals/tcs/AmirKLMS2410.1016/J.TCS.2023.114230https://doi.org/10.1016/j.tcs.2023.114230https://dblp.org/rec/journals/tcs/AmirKLMS24URL#36573Rocco AsconeGiulia Bernardini 0001Luca ManzoniFixed points and attractors of reactantless and inhibitorless reaction systems.Theor. Comput. Sci.9841143222024Journal Articlesclosedjournals/tcs/AsconeBM2410.1016/J.TCS.2023.114322https://doi.org/10.1016/j.tcs.2023.114322https://dblp.org/rec/journals/tcs/AsconeBM24URL#36574Oliver BachtlerTim BergnerSven O. KrumkeAlmost disjoint paths and separating by forbidden pairs.Theor. Comput. Sci.9821142722024Journal Articlesclosedjournals/tcs/BachtlerBK2410.1016/J.TCS.2023.114272https://doi.org/10.1016/j.tcs.2023.114272https://dblp.org/rec/journals/tcs/BachtlerBK24URL#36575Tian Bai 0003Mingyu Xiao 0001Exact algorithms for restricted subset feedback vertex set in chordal and split graphs.Theor. Comput. Sci.9841143262024Journal Articlesclosedjournals/tcs/BaiX2410.1016/J.TCS.2023.114326https://doi.org/10.1016/j.tcs.2023.114326https://dblp.org/rec/journals/tcs/BaiX24URL#36576Michael A. BekosMartin GronemannFabrizio MontecchianiAntonios SymvonisConvex grid drawings of planar graphs with constant edge-vertex resolution.Theor. Comput. Sci.9821142902024Journal Articlesclosedjournals/tcs/BekosGMS2410.1016/J.TCS.2023.114290https://doi.org/10.1016/j.tcs.2023.114290https://dblp.org/rec/journals/tcs/BekosGMS24URL#36577Daniel BerendLiat CohenOmrit FiltserA tour of general Hanoi graphs.Theor. Comput. Sci.9831142892024Journal Articlesclosedjournals/tcs/BerendCF2410.1016/J.TCS.2023.114289https://doi.org/10.1016/j.tcs.2023.114289https://dblp.org/rec/journals/tcs/BerendCF24URL#36578Daniel BerendS. MamanaA probabilistic algorithm for vertex cover.Theor. Comput. Sci.9831143062024Journal Articlesclosedjournals/tcs/BerendM2410.1016/J.TCS.2023.114306https://doi.org/10.1016/j.tcs.2023.114306https://dblp.org/rec/journals/tcs/BerendM24URL#36579Bernard BerthomieuDmitry A. ZaitsevSleptsov nets are Turing-complete.Theor. Comput. Sci.9861143462024Journal Articlesclosedjournals/tcs/BerthomieuZ2410.1016/J.TCS.2023.114346https://doi.org/10.1016/j.tcs.2023.114346https://dblp.org/rec/journals/tcs/BerthomieuZ24URL#36580Subhash BhagatAndrzej PelcDeterministic rendezvous in infinite trees.Theor. Comput. Sci.9841143132024Journal Articlesclosedjournals/tcs/BhagatP2410.1016/J.TCS.2023.114313https://doi.org/10.1016/j.tcs.2023.114313https://dblp.org/rec/journals/tcs/BhagatP24URL#36581Joan BoyarKim S. LarsenDenis PankratovAdvice complexity of adaptive priority algorithms.Theor. Comput. Sci.9841143182024Journal Articlesopenjournals/tcs/BoyarLP2410.1016/J.TCS.2023.114318https://doi.org/10.1016/j.tcs.2023.114318https://dblp.org/rec/journals/tcs/BoyarLP24URL#36582Florian BruseMaurice HerwigMartin LangeWeights of formal languages based on geometric series with an application to automatic grading.Theor. Comput. Sci.9831142952024Journal Articlesclosedjournals/tcs/BruseHL2410.1016/J.TCS.2023.114295https://doi.org/10.1016/j.tcs.2023.114295https://dblp.org/rec/journals/tcs/BruseHL24URL#36583Martin BullingerWarut SuksompongTopological distance games.Theor. Comput. Sci.9811142382024Journal Articlesclosedjournals/tcs/BullingerS2410.1016/J.TCS.2023.114238https://doi.org/10.1016/j.tcs.2023.114238https://dblp.org/rec/journals/tcs/BullingerS24URL#36584Ioannis CaragiannisShivika NarangRepeatedly matching items to agents fairly and efficiently.Theor. Comput. Sci.9811142462024Journal Articlesclosedjournals/tcs/CaragiannisN2410.1016/J.TCS.2023.114246https://doi.org/10.1016/j.tcs.2023.114246https://dblp.org/rec/journals/tcs/CaragiannisN24URL#36585Davide CastelnovoFabio GadducciMarino MiculanA simple criterion for M,N-adhesivity.Theor. Comput. Sci.9821142802024Journal Articlesclosedjournals/tcs/CastelnovoGM2410.1016/J.TCS.2023.114280https://doi.org/10.1016/j.tcs.2023.114280https://dblp.org/rec/journals/tcs/CastelnovoGM24URL#36586T.-H. Hubert ChanZhihao Gavin TangQuan XueMax-min greedy matching problem: Hardness for the adversary and fractional variant.Theor. Comput. Sci.9861143292024Journal Articlesclosedjournals/tcs/ChanTX2410.1016/J.TCS.2023.114329https://doi.org/10.1016/j.tcs.2023.114329https://dblp.org/rec/journals/tcs/ChanTX24URL#36587Yi-Jun ChangThe energy complexity of diameter and minimum cut computation in bounded-genus networks.Theor. Comput. Sci.9821142792024Journal Articlesclosedjournals/tcs/Chang2410.1016/J.TCS.2023.114279https://doi.org/10.1016/j.tcs.2023.114279https://dblp.org/rec/journals/tcs/Chang24URL#36588Shengminjie ChenDonglei DuRuiqi YangWenguo YangYapu ZhangA single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity.Theor. Comput. Sci.9811142542024Journal Articlesclosedjournals/tcs/ChenDYYZ2410.1016/J.TCS.2023.114254https://doi.org/10.1016/j.tcs.2023.114254https://dblp.org/rec/journals/tcs/ChenDYYZ24URL#36589Xianrun ChenSai JiChenchen WuYicheng XuYang YangAn approximation algorithm for diversity-aware fair k-supplier problem.Theor. Comput. Sci.9831143052024Journal Articlesclosedjournals/tcs/ChenJWXY2410.1016/J.TCS.2023.114305https://doi.org/10.1016/j.tcs.2023.114305https://dblp.org/rec/journals/tcs/ChenJWXY24URL#36590Sam CoyArtur CzumajChristian ScheidelerPhilipp SchneiderJulian WerthmannRouting schemes for hybrid communication networks.Theor. Comput. Sci.9851143522024Journal Articlesclosedjournals/tcs/CoyCSSW2410.1016/J.TCS.2023.114352https://doi.org/10.1016/j.tcs.2023.114352https://dblp.org/rec/journals/tcs/CoyCSSW24URL#36591Ren Tristan A. de la CruzFrancis George C. CabarleHenry N. AdornaSteps toward a homogenization procedure for spiking neural P systems.Theor. Comput. Sci.9811142502024Journal Articlesclosedjournals/tcs/CruzCA2410.1016/J.TCS.2023.114250https://doi.org/10.1016/j.tcs.2023.114250https://dblp.org/rec/journals/tcs/CruzCA24URL#36592Sameep DahalJukka SuomelaDistributed half-integral matching and beyond.Theor. Comput. Sci.9821142782024Journal Articlesclosedjournals/tcs/DahalS2410.1016/J.TCS.2023.114278https://doi.org/10.1016/j.tcs.2023.114278https://dblp.org/rec/journals/tcs/DahalS24URL#36593Éric DuchêneNacim OijidAline ParreauBipartite instances of INFLUENCE.Theor. Comput. Sci.9821142742024Journal Articlesclosedjournals/tcs/DucheneOP2410.1016/J.TCS.2023.114274https://doi.org/10.1016/j.tcs.2023.114274https://dblp.org/rec/journals/tcs/DucheneOP24URL#36594Tomás DvorákMei-Mei GuPaired 2-disjoint path covers of burnt pancake graphs with faulty elements.Theor. Comput. Sci.9861143272024Journal Articlesclosedjournals/tcs/DvorakG2410.1016/J.TCS.2023.114327https://doi.org/10.1016/j.tcs.2023.114327https://dblp.org/rec/journals/tcs/DvorakG24URL#36595L'ubomíra DvorákováString attractors of episturmian sequences.Theor. Comput. Sci.9861143412024Journal Articlesclosedjournals/tcs/Dvorakova2410.1016/J.TCS.2023.114341https://doi.org/10.1016/j.tcs.2023.114341https://dblp.org/rec/journals/tcs/Dvorakova24URL#36596Ling GaiWeiwei ZhangZhao Zhang 0002Selfish bin packing with punishment.Theor. Comput. Sci.9821142762024Journal Articlesclosedjournals/tcs/GaiZZ2410.1016/J.TCS.2023.114276https://doi.org/10.1016/j.tcs.2023.114276https://dblp.org/rec/journals/tcs/GaiZZ24URL#36597Dimitrios GerontitisChangxin MoPredrag S. StanimirovicVasilios N. KatsikisImproved zeroing neural models based on two novel activation functions with exponential behavior.Theor. Comput. Sci.9861143282024Journal Articlesclosedjournals/tcs/GerontitisMSK2410.1016/J.TCS.2023.114328https://doi.org/10.1016/j.tcs.2023.114328https://dblp.org/rec/journals/tcs/GerontitisMSK24URL#36598Laurent GourvèsArarat HarutyunyanMichael LampisNikolaos MelissinosFilling crosswords is very hard.Theor. Comput. Sci.9821142752024Journal Articlesclosedjournals/tcs/GourvesHLM2410.1016/J.TCS.2023.114275https://doi.org/10.1016/j.tcs.2023.114275https://dblp.org/rec/journals/tcs/GourvesHLM24URL#36599Eléa Thibault GreugnyFrançois FagesOvidiu RadulescuPeter SzmolyanGeorgios N. StamatasA skin microbiome model with AMP interactions and analysis of quasi-stability vs stability in population dynamics.Theor. Comput. Sci.9831142942024Journal Articlesclosedjournals/tcs/GreugnyFRSS2410.1016/J.TCS.2023.114294https://doi.org/10.1016/j.tcs.2023.114294https://dblp.org/rec/journals/tcs/GreugnyFRSS24URL#36600Michael A. HenningArti PandeyGopika SharmaVikash TripathiAlgorithms and hardness results for edge total domination problem in graphs.Theor. Comput. Sci.9821142702024Journal Articlesclosedjournals/tcs/HenningPST2410.1016/J.TCS.2023.114270https://doi.org/10.1016/j.tcs.2023.114270https://dblp.org/rec/journals/tcs/HenningPST24URL#36601Danny HermelinLeon KellerhalsRolf NiedermeierRami PugatchApproximating sparse quadratic programs.Theor. Comput. Sci.9841143192024Journal Articlesclosedjournals/tcs/HermelinKNP2410.1016/J.TCS.2023.114319https://doi.org/10.1016/j.tcs.2023.114319https://dblp.org/rec/journals/tcs/HermelinKNP24URL#36602Sumin HuangSergey KitaevOn ordering of β-description trees.Theor. Comput. Sci.9821142732024Journal Articlesclosedjournals/tcs/HuangK2410.1016/J.TCS.2023.114273https://doi.org/10.1016/j.tcs.2023.114273https://dblp.org/rec/journals/tcs/HuangK24URL#36603Xiaowei HuangShihao ZhangLvzhou LiQuantum algorithms for learning hidden strings with applications to matroid problems.Theor. Comput. Sci.9811142552024Journal Articlesclosedjournals/tcs/HuangZL2410.1016/J.TCS.2023.114255https://doi.org/10.1016/j.tcs.2023.114255https://dblp.org/rec/journals/tcs/HuangZL24URL#36604Rahul Jain 0015Raghunath TewariSpace efficient algorithm for solving reachability using tree decomposition and separators.Theor. Comput. Sci.9821142512024Journal Articlesclosedjournals/tcs/JainT2410.1016/J.TCS.2023.114251https://doi.org/10.1016/j.tcs.2023.114251https://dblp.org/rec/journals/tcs/JainT24URL#36605Satyabrata JanaSouvik Saha 0002Abhishek SahuSaket Saurabh 0001Shaily VermaPartitioning subclasses of chordal graphs with few deletions.Theor. Comput. Sci.9831142882024Journal Articlesclosedjournals/tcs/JanaSSSV2410.1016/J.TCS.2023.114288https://doi.org/10.1016/j.tcs.2023.114288https://dblp.org/rec/journals/tcs/JanaSSSV24URL#36606Naonori KakimuraRiku NittaRandomized counter-based algorithms for frequency estimation over data streams in O(loglogN) space.Theor. Comput. Sci.9841143172024Journal Articlesclosedjournals/tcs/KakimuraN2410.1016/J.TCS.2023.114317https://doi.org/10.1016/j.tcs.2023.114317https://dblp.org/rec/journals/tcs/KakimuraN24URL#36607Masaaki KanzakiYota OtachiGiovanni VigliettaRyuhei UeharaComputational complexity of jumping block puzzles.Theor. Comput. Sci.9831142922024Journal Articlesclosedjournals/tcs/KanzakiOVU2410.1016/J.TCS.2023.114292https://doi.org/10.1016/j.tcs.2023.114292https://dblp.org/rec/journals/tcs/KanzakiOVU24URL#36608Firat KiyakA. C. Cem SayEnergy complexity of regular languages.Theor. Comput. Sci.9821142912024Journal Articlesclosedjournals/tcs/KiyakS2410.1016/J.TCS.2023.114291https://doi.org/10.1016/j.tcs.2023.114291https://dblp.org/rec/journals/tcs/KiyakS24URL#36609Yan LanYuan Yuan 0020Yinling WangXin HanYong ZhouFlow shop scheduling problems with transportation constraints revisited.Theor. Comput. Sci.9851143492024Journal Articlesclosedjournals/tcs/LanYWHZ2410.1016/J.TCS.2023.114349https://doi.org/10.1016/j.tcs.2023.114349https://dblp.org/rec/journals/tcs/LanYWHZ24URL#36610Qin LeiHong JinJia LeeJiang ZhongLand use and land cover change simulation enhanced by asynchronous communicating cellular automata.Theor. Comput. Sci.9851143312024Journal Articlesclosedjournals/tcs/LeiJLZ2410.1016/J.TCS.2023.114331https://doi.org/10.1016/j.tcs.2023.114331https://dblp.org/rec/journals/tcs/LeiJLZ24URL#36611Shuo LiA note on the Lie complexity and beyond.Theor. Comput. Sci.9861143432024Journal Articlesclosedjournals/tcs/Li2410.1016/J.TCS.2023.114343https://doi.org/10.1016/j.tcs.2023.114343https://dblp.org/rec/journals/tcs/Li24URL#36612Xiaoqing LiuBaolei ChengYan Wang 0078Jia Yu 0005Jianxi FanEnhancing fault tolerance of balanced hypercube networks by the edge partition method.Theor. Comput. Sci.9861143402024Journal Articlesclosedjournals/tcs/LiuCWYF2410.1016/J.TCS.2023.114340https://doi.org/10.1016/j.tcs.2023.114340https://dblp.org/rec/journals/tcs/LiuCWYF24URL#36613Xiao-Tao LüJin ChenZhi-Xiong WenWen Wu 0002On the 2-binomial complexity of the generalized Thue-Morse words.Theor. Comput. Sci.9861143422024Journal Articlesclosedjournals/tcs/LuCWW2410.1016/J.TCS.2023.114342https://doi.org/10.1016/j.tcs.2023.114342https://dblp.org/rec/journals/tcs/LuCWW24URL#36614Hengzhao MaJianzhong Li 0001Tianpeng GaoXiangyu GaoTuring machines with two-level memory: New computational models for analyzing the input/output complexity.Theor. Comput. Sci.9851143472024Journal Articlesclosedjournals/tcs/MaLGG2410.1016/J.TCS.2023.114347https://doi.org/10.1016/j.tcs.2023.114347https://dblp.org/rec/journals/tcs/MaLGG24URL#36615Syohei MaruyamaYuichi SudoSayaka KameiHirotsugu KakugawaSelf-stabilizing 2-minimal dominating set algorithms based on loop composition.Theor. Comput. Sci.9831143142024Journal Articlesclosedjournals/tcs/MaruyamaSKK2410.1016/J.TCS.2023.114314https://doi.org/10.1016/j.tcs.2023.114314https://dblp.org/rec/journals/tcs/MaruyamaSKK24URL#36616Kian MirjalaliHamid Zarrabi-ZadehMassively parallel and streaming algorithms for balanced clustering.Theor. Comput. Sci.9831142962024Journal Articlesclosedjournals/tcs/MirjalaliZ2410.1016/J.TCS.2023.114296https://doi.org/10.1016/j.tcs.2023.114296https://dblp.org/rec/journals/tcs/MirjalaliZ24URL#36617Meghana NasrePrajakta NimbhorkarKeshav RanjanAnkita SarkarPopular critical matchings in the many-to-many setting.Theor. Comput. Sci.9821142812024Journal Articlesclosedjournals/tcs/NasreNRS2410.1016/J.TCS.2023.114281https://doi.org/10.1016/j.tcs.2023.114281https://dblp.org/rec/journals/tcs/NasreNRS24URL#36618Olga G. ParshinaSvetlana PuzyninaFinite and infinite closed-rich words.Theor. Comput. Sci.9841143152024Journal Articlesclosedjournals/tcs/ParshinaP2410.1016/J.TCS.2023.114315https://doi.org/10.1016/j.tcs.2023.114315https://dblp.org/rec/journals/tcs/ParshinaP24URL#36619Ghajendran PoovanandranJamie SimpsonWen Chean TehCounting subwords in circular words and their Parikh matrices.Theor. Comput. Sci.9851143442024Journal Articlesclosedjournals/tcs/PoovanandranST2410.1016/J.TCS.2023.114344https://doi.org/10.1016/j.tcs.2023.114344https://dblp.org/rec/journals/tcs/PoovanandranST24URL#36620Dmitry RabinovichMichael AmirAlfred M. BrucksteinOptimally reordering mobile agents on parallel rows.Theor. Comput. Sci.9851143302024Journal Articlesclosedjournals/tcs/RabinovichAB2410.1016/J.TCS.2023.114330https://doi.org/10.1016/j.tcs.2023.114330https://dblp.org/rec/journals/tcs/RabinovichAB24URL#36621Elisabeth RemyPaul RuetFrom multivalued to Boolean functions: Preservation of soft nested canalization.Theor. Comput. Sci.9821142772024Journal Articlesclosedjournals/tcs/RemyR2410.1016/J.TCS.2023.114277https://doi.org/10.1016/j.tcs.2023.114277https://dblp.org/rec/journals/tcs/RemyR24URL#36622Nicola Rizzo 0001Massimo EquiTuukka NorriVeli MäkinenElastic founder graphs improved and enhanced.Theor. Comput. Sci.9821142692024Journal Articlesclosedjournals/tcs/RizzoENM2410.1016/J.TCS.2023.114269https://doi.org/10.1016/j.tcs.2023.114269https://dblp.org/rec/journals/tcs/RizzoENM24URL#36623Xiaoming Sun 0001Jialin ZhangShuo ZhangZhijie ZhangImproved deterministic algorithms for non-monotone submodular maximization.Theor. Comput. Sci.9841142932024Journal Articlesclosedjournals/tcs/SunZZZ2410.1016/J.TCS.2023.114293https://doi.org/10.1016/j.tcs.2023.114293https://dblp.org/rec/journals/tcs/SunZZZ24URL#36624Yuzuru TanakaDesigning aperture 22k hexagonal grids and their indexing as factor rings of Eisenstein integers.Theor. Comput. Sci.9821142572024Journal Articlesopenjournals/tcs/Tanaka2410.1016/J.TCS.2023.114257https://doi.org/10.1016/j.tcs.2023.114257https://dblp.org/rec/journals/tcs/Tanaka24URL#36625Zhongzheng TangJingwen ChenChenhao Wang 0001Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization.Theor. Comput. Sci.9841143202024Journal Articlesclosedjournals/tcs/TangCW2410.1016/J.TCS.2023.114320https://doi.org/10.1016/j.tcs.2023.114320https://dblp.org/rec/journals/tcs/TangCW24URL#36626Dekel TsurAlgorithms for 2-club cluster deletion problems using automated generation of branching rules.Theor. Comput. Sci.9841143212024Journal Articlesclosedjournals/tcs/Tsur2410.1016/J.TCS.2023.114321https://doi.org/10.1016/j.tcs.2023.114321https://dblp.org/rec/journals/tcs/Tsur24URL#36627Binbin TuYu Chen 0003Hongrui CuiXianfang WangFast two-party signature for upgrading ECDSA to two-party scenario easily.Theor. Comput. Sci.9861143252024Journal Articlesclosedjournals/tcs/TuCCW2410.1016/J.TCS.2023.114325https://doi.org/10.1016/j.tcs.2023.114325https://dblp.org/rec/journals/tcs/TuCCW24URL#36628Hoa T. VuRevisiting maximum satisfiability and related problems in data streams.Theor. Comput. Sci.9821142712024Journal Articlesclosedjournals/tcs/Vu2410.1016/J.TCS.2023.114271https://doi.org/10.1016/j.tcs.2023.114271https://dblp.org/rec/journals/tcs/Vu24URL#36629Yong Wang 0027Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals.Theor. Comput. Sci.9861143232024Journal Articlesclosedjournals/tcs/Wang2410.1016/J.TCS.2023.114323https://doi.org/10.1016/j.tcs.2023.114323https://dblp.org/rec/journals/tcs/Wang24URL#36630Liguan WangYuan LiHaibin KanObtaining simulation extractable NIZKs in the updatable CRS model generically.Theor. Comput. Sci.9811142522024Journal Articlesclosedjournals/tcs/WangLK2410.1016/J.TCS.2023.114252https://doi.org/10.1016/j.tcs.2023.114252https://dblp.org/rec/journals/tcs/WangLK24URL#36631Di Wang 0015Jinhui Xu 0001Gradient complexity and non-stationary views of differentially private empirical risk minimization.Theor. Comput. Sci.9821142592024Journal Articlesclosedjournals/tcs/WangX2410.1016/J.TCS.2023.114259https://doi.org/10.1016/j.tcs.2023.114259https://dblp.org/rec/journals/tcs/WangX24URL#36632Xiwen WangKai Zhang 0016Junqing Gong 0001Shi-Feng Sun 0001Jianting NingUpdatable searchable symmetric encryption: Definitions and constructions.Theor. Comput. Sci.9831143042024Journal Articlesclosedjournals/tcs/WangZGSN2410.1016/J.TCS.2023.114304https://doi.org/10.1016/j.tcs.2023.114304https://dblp.org/rec/journals/tcs/WangZGSN24URL#36633Di WuQilong FengJianxin Wang 0001Approximation algorithms for fair k-median problem without fairness violation.Theor. Comput. Sci.9851143322024Journal Articlesclosedjournals/tcs/WuFW2410.1016/J.TCS.2023.114332https://doi.org/10.1016/j.tcs.2023.114332https://dblp.org/rec/journals/tcs/WuFW24URL#36634Peng YangYuan HuangZhiguo FuThe computational complexity of Holant problems on 3-regular graphs.Theor. Comput. Sci.9821142562024Journal Articlesclosedjournals/tcs/YangHF2410.1016/J.TCS.2023.114256https://doi.org/10.1016/j.tcs.2023.114256https://dblp.org/rec/journals/tcs/YangHF24URL#36635Wen YinJiarong LiangYuhao XieChangzhen LiThe t/k-diagnosability of m-ary n-cube networks.Theor. Comput. Sci.9861143452024Journal Articlesclosedjournals/tcs/YinLXL2410.1016/J.TCS.2023.114345https://doi.org/10.1016/j.tcs.2023.114345https://dblp.org/rec/journals/tcs/YinLXL24URL#36636Shenxing ZhangOn the linearity of the periods of subtraction games.Theor. Comput. Sci.9851143502024Journal Articlesclosedjournals/tcs/Zhang2410.1016/J.TCS.2023.114350https://doi.org/10.1016/j.tcs.2023.114350https://dblp.org/rec/journals/tcs/Zhang24URL#36637Xiaojin Zhang 0002Improved algorithm for permutation testing.Theor. Comput. Sci.9861143162024Journal Articlesclosedjournals/tcs/Zhang24a10.1016/J.TCS.2023.114316https://doi.org/10.1016/j.tcs.2023.114316https://dblp.org/rec/journals/tcs/Zhang24aURL#36638Xiaojun ZhaoQingying DengXiaowang LiRelating g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph network.Theor. Comput. Sci.9821142582024Journal Articlesclosedjournals/tcs/ZhaoDL2410.1016/J.TCS.2023.114258https://doi.org/10.1016/j.tcs.2023.114258https://dblp.org/rec/journals/tcs/ZhaoDL24URL#36639Qianru ZhouBaolei ChengJingya ZhouJia Yu 0005Yan Wang 0078Jianxi FanReliability evaluation for a class of recursive match networks.Theor. Comput. Sci.9811142532024Journal Articlesclosedjournals/tcs/ZhouCZYWF2410.1016/J.TCS.2023.114253https://doi.org/10.1016/j.tcs.2023.114253https://dblp.org/rec/journals/tcs/ZhouCZYWF24URL#36640Samuel Epstein 0001The Kolmogorov birthday paradox.Theor. Comput. Sci.9631139642023Journal Articlesclosedjournals/tcs/00012310.1016/J.TCS.2023.113964https://doi.org/10.1016/j.tcs.2023.113964https://dblp.org/rec/journals/tcs/000123URL#251898R. Krithika 0001Pranabendu MisraPrafullkumar TaleA single exponential-time FPT algorithm for cactus contraction.Theor. Comput. Sci.9541138032023Journal Articlesclosedjournals/tcs/0001MT2310.1016/J.TCS.2023.113803https://doi.org/10.1016/j.tcs.2023.113803https://dblp.org/rec/journals/tcs/0001MT23URL#251899Alastair A. AbbottCezar CâmpeanuLudwig StaigerMarius ZimandArto SalomaaFrontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude).Theor. Comput. Sci.9521138192023Journal Articlesclosedjournals/tcs/AbbottCSZS2310.1016/J.TCS.2023.113819https://doi.org/10.1016/j.tcs.2023.113819https://dblp.org/rec/journals/tcs/AbbottCSZS23URL#251900Ankit AbhinavSusobhan BandopadhyayAritra BanikSaket Saurabh 0001Parameterized algorithms for finding highly connected solution.Theor. Comput. Sci.94247-562023Journal Articlesclosedjournals/tcs/AbhinavBBS2310.1016/J.TCS.2022.11.024https://doi.org/10.1016/j.tcs.2022.11.024https://dblp.org/rec/journals/tcs/AbhinavBBS23URL#251901V. P. AbidhaPradeesha AshokAvi TomarDolly YadavColouring a dominating set without conflicts: q-Subset Square Colouring.Theor. Comput. Sci.9761141602023Journal Articlesclosedjournals/tcs/AbidhaATY2310.1016/J.TCS.2023.114160https://doi.org/10.1016/j.tcs.2023.114160https://dblp.org/rec/journals/tcs/AbidhaATY23URL#251902Faisal N. Abu-KhzamNorma MakaremMaryam ShehabAn improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion.Theor. Comput. Sci.9581138642023Journal Articlesclosedjournals/tcs/AbuKhzamMS2310.1016/J.TCS.2023.113864https://doi.org/10.1016/j.tcs.2023.113864https://dblp.org/rec/journals/tcs/AbuKhzamMS23URL#251903Akanksha Agrawal 0001Sutanay BhattacharjeeSatyabrata JanaAbhishek SahuParameterized complexity of perfectly matched sets.Theor. Comput. Sci.9581138612023Journal Articlesclosedjournals/tcs/AgrawalBJS2310.1016/J.TCS.2023.113861https://doi.org/10.1016/j.tcs.2023.113861https://dblp.org/rec/journals/tcs/AgrawalBJS23URL#251904Oswin AichholzerMatias KormanYoshio OkamotoIrene ParadaDaniel PerzAndré van RenssenBirgit VogtenhuberGraphs with large total angular resolution.Theor. Comput. Sci.94373-882023Journal Articlesopenjournals/tcs/AichholzerKOPPR2310.1016/J.TCS.2022.12.010https://doi.org/10.1016/j.tcs.2022.12.010https://dblp.org/rec/journals/tcs/AichholzerKOPPR23URL#251905AishwaryaprajnaJonathan E. RoweThe Voting algorithm is robust to various noise models.Theor. Comput. Sci.9571138442023Journal Articlesopenjournals/tcs/AishwaryaprajnaR2310.1016/J.TCS.2023.113844https://doi.org/10.1016/j.tcs.2023.113844https://dblp.org/rec/journals/tcs/AishwaryaprajnaR23URL#251906Seda AlbayrakJason P. BellQuantitative estimates for the size of an intersection of sparse automatic sets.Theor. Comput. Sci.9771141442023Journal Articlesclosedjournals/tcs/AlbayrakB2310.1016/J.TCS.2023.114144https://doi.org/10.1016/j.tcs.2023.114144https://dblp.org/rec/journals/tcs/AlbayrakB23URL#251907Timothé AlbouyDavide FreyMichel RaynalFrançois TaïaniAsynchronous Byzantine reliable broadcast with a message adversary.Theor. Comput. Sci.9781141102023Journal Articlesclosedjournals/tcs/AlbouyFRT2310.1016/J.TCS.2023.114110https://doi.org/10.1016/j.tcs.2023.114110https://dblp.org/rec/journals/tcs/AlbouyFRT23URL#251908Artiom AlhazovVincent Ferrari-DominguezRudolf FreundNicolas GladeSergiu Ivanov 0001A P systems variant for reasoning about sequential controllability of Boolean networks.Theor. Comput. Sci.9701140562023Journal Articlesclosedjournals/tcs/AlhazovFFGI2310.1016/J.TCS.2023.114056https://doi.org/10.1016/j.tcs.2023.114056https://dblp.org/rec/journals/tcs/AlhazovFFGI23URL#251909Artiom AlhazovRudolf FreundSergiu Ivanov 0001Sergey VerlanNumerical networks of cells.Theor. Comput. Sci.9581138732023Journal Articlesclosedjournals/tcs/AlhazovFIV2310.1016/J.TCS.2023.113873https://doi.org/10.1016/j.tcs.2023.113873https://dblp.org/rec/journals/tcs/AlhazovFIV23URL#251910Dan AlistarhFaith EllenJoel RybickiWait-free approximate agreement on graphs.Theor. Comput. Sci.9481137332023Journal Articlesopenjournals/tcs/AlistarhER2310.1016/J.TCS.2023.113733https://doi.org/10.1016/j.tcs.2023.113733https://dblp.org/rec/journals/tcs/AlistarhER23URL#251911Eric AllenderJohn GouwarShuichi HiraharaCaleb RobelleCryptographic hardness under projections for time-bounded Kolmogorov complexity.Theor. Comput. Sci.940Part206-2242023Journal Articlesclosedjournals/tcs/AllenderGHR2310.1016/J.TCS.2022.10.040https://doi.org/10.1016/j.tcs.2022.10.040https://dblp.org/rec/journals/tcs/AllenderGHR23URL#251912Abdullah AlmethenOthon MichailIgor PotapovDistributed transformations of Hamiltonian shapes based on line moves.Theor. Comput. Sci.942142-1682023Journal Articlesopenjournals/tcs/AlmethenMP2310.1016/J.TCS.2022.11.029https://doi.org/10.1016/j.tcs.2022.11.029https://dblp.org/rec/journals/tcs/AlmethenMP23URL#251913Karam AlouiDamien JametHajime KanekoSteffen KopeckiPierre PopoliThomas StollOn the binary digits of n and n2.Theor. Comput. Sci.939119-1392023Journal Articlesclosedjournals/tcs/AlouiJKKPS2310.1016/J.TCS.2022.10.018https://doi.org/10.1016/j.tcs.2022.10.018https://dblp.org/rec/journals/tcs/AlouiJKKPS23URL#251914Steve AlpernThe Faulty Satnav (GPS) Problem: Search for home in networks with unreliable directions.Theor. Comput. Sci.9751141092023Journal Articlesclosedjournals/tcs/Alpern2310.1016/J.TCS.2023.114109https://doi.org/10.1016/j.tcs.2023.114109https://dblp.org/rec/journals/tcs/Alpern23URL#251915Karine AltisenPierre CorbineauStéphane DevismesCertification of an exact worst-case self-stabilization time.Theor. Comput. Sci.941262-2772023Journal Articlesclosedjournals/tcs/AltisenCD2310.1016/J.TCS.2022.11.019https://doi.org/10.1016/j.tcs.2022.11.019https://dblp.org/rec/journals/tcs/AltisenCD23URL#251916Karine AltisenStéphane DevismesAnaïs DurandColette JohnenFranck PetitSelf-stabilizing systems in spite of high dynamics.Theor. Comput. Sci.9641139662023Journal Articlesclosedjournals/tcs/AltisenDDJP2310.1016/J.TCS.2023.113966https://doi.org/10.1016/j.tcs.2023.113966https://dblp.org/rec/journals/tcs/AltisenDDJP23URL#251917Mai AlzamelChristopher HampsonCostas S. IliopoulosZara LimSolon P. PissisDimitrios VlachakisSteven WattsMaximal degenerate palindromes with gaps and mismatches.Theor. Comput. Sci.9781141822023Journal Articlesopenjournals/tcs/AlzamelHILPVW2310.1016/J.TCS.2023.114182https://doi.org/10.1016/j.tcs.2023.114182https://dblp.org/rec/journals/tcs/AlzamelHILPVW23URL#251918Bogdan AmanGabriel CiobanuRelating randomized right-hand sides to communicating rewriting rules.Theor. Comput. Sci.9711140622023Journal Articlesclosedjournals/tcs/AmanC2310.1016/J.TCS.2023.114062https://doi.org/10.1016/j.tcs.2023.114062https://dblp.org/rec/journals/tcs/AmanC23URL#251919Zhiyuan AnJing PanYamin WenFangguo ZhangSecret handshakes: Full dynamicity, deniability and lattice-based design.Theor. Comput. Sci.940Part14-352023Journal Articlesclosedjournals/tcs/AnPWZ2310.1016/J.TCS.2022.10.035https://doi.org/10.1016/j.tcs.2022.10.035https://dblp.org/rec/journals/tcs/AnPWZ23URL#251920M. AnandKishan Bhushan SahayMohammed Altaf AhmedDaniyar SultanRadha Raman ChandanBharat SinghDeep learning and natural language processing in computation for offensive language detection in online social networks by feature selection and ensemble classification techniques.Theor. Comput. Sci.943203-2182023Journal Articlesclosedjournals/tcs/AnandSASCS2310.1016/J.TCS.2022.06.020https://doi.org/10.1016/j.tcs.2022.06.020https://dblp.org/rec/journals/tcs/AnandSASCS23URL#251921Davide AnconaPietro BarbieriElena ZuccaChecked corecursive streams: Expressivity and completeness.Theor. Comput. Sci.9741140812023Journal Articlesclosedjournals/tcs/AnconaBZ2310.1016/J.TCS.2023.114081https://doi.org/10.1016/j.tcs.2023.114081https://dblp.org/rec/journals/tcs/AnconaBZ23URL#251922Joshua AniErik D. DemaineDylan H. HendricksonJayson LynchTrains, games, and complexity: 0/1/2-player motion planning through input/output gadgets.Theor. Comput. Sci.9691139452023Journal Articlesclosedjournals/tcs/AniDHL2310.1016/J.TCS.2023.113945https://doi.org/10.1016/j.tcs.2023.113945https://dblp.org/rec/journals/tcs/AniDHL23URL#251923Sreejyothsna AnkamN. Sudhakar ReddyA mechanism to detecting flooding attacks in quantum enabled cloud-based lowpower and lossy networks.Theor. Comput. Sci.94129-382023Journal Articlesclosedjournals/tcs/AnkamR2310.1016/J.TCS.2022.08.018https://doi.org/10.1016/j.tcs.2022.08.018https://dblp.org/rec/journals/tcs/AnkamR23URL#251924Melissa AntonelliUgo Dal LagoPaolo PistoneOn counting propositional logic and Wagner's hierarchy.Theor. Comput. Sci.966-9671139282023Journal Articlesopenjournals/tcs/AntonelliLP2310.1016/J.TCS.2023.113928https://doi.org/10.1016/j.tcs.2023.113928https://dblp.org/rec/journals/tcs/AntonelliLP23URL#251925N. R. AravindRoopam SaxenaPerfectly matched sets in graphs: Parameterized and exact computation.Theor. Comput. Sci.9541137972023Journal Articlesclosedjournals/tcs/AravindS2310.1016/J.TCS.2023.113797https://doi.org/10.1016/j.tcs.2023.113797https://dblp.org/rec/journals/tcs/AravindS23URL#251926Yuichi AsahiroHiroshi EtoTesshu HanakaGuohui LinEiji MiyanoIppei TerabaruCorrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144].Theor. Comput. Sci.9751141142023Journal Articlesclosedjournals/tcs/AsahiroEHLMT2310.1016/J.TCS.2023.114114https://doi.org/10.1016/j.tcs.2023.114114https://dblp.org/rec/journals/tcs/AsahiroEHLMT23URL#251927Yotam AshkenaziShlomi DolevSayaka KameiYoshiaki KatayamaFukuhito OoshitaKoichi Wada 0001Location functions for self-stabilizing byzantine tolerant swarms.Theor. Comput. Sci.9541137552023Journal Articlesclosedjournals/tcs/AshkenaziDKKOW2310.1016/J.TCS.2023.113755https://doi.org/10.1016/j.tcs.2023.113755https://dblp.org/rec/journals/tcs/AshkenaziDKKOW23URL#251928Mohamed Amine BaaziziDario ColazzoGiorgio GhelliCarlo SartianiStefanie ScherzingerNegation-closure for JSON Schema.Theor. Comput. Sci.9551138232023Journal Articlesclosedjournals/tcs/BaaziziCGSS2310.1016/J.TCS.2023.113823https://doi.org/10.1016/j.tcs.2023.113823https://dblp.org/rec/journals/tcs/BaaziziCGSS23URL#251929Tian Bai 0003Mingyu Xiao 0001A parameterized algorithm for subset feedback vertex set in tournaments.Theor. Comput. Sci.9751141392023Journal Articlesclosedjournals/tcs/BaiX2310.1016/J.TCS.2023.114139https://doi.org/10.1016/j.tcs.2023.114139https://dblp.org/rec/journals/tcs/BaiX23URL#251930Susobhan BandopadhyaySuman Banerjee 0002Aritra BanikVenkatesh Raman 0001Structural parameterizations of budgeted graph coloring.Theor. Comput. Sci.940Part209-2212023Journal Articlesclosedjournals/tcs/BandopadhyayBBR2310.1016/J.TCS.2022.11.002https://doi.org/10.1016/j.tcs.2022.11.002https://dblp.org/rec/journals/tcs/BandopadhyayBBR23URL#251931Jørgen Bang-JensenFlorian HörschMatthias KriesellComplexity of (arc)-connectivity problems involving arc-reversals or deorientations.Theor. Comput. Sci.9731140972023Journal Articlesclosedjournals/tcs/BangJensenHK2310.1016/J.TCS.2023.114097https://doi.org/10.1016/j.tcs.2023.114097https://dblp.org/rec/journals/tcs/BangJensenHK23URL#251932Jørgen Bang-JensenAnders YeoThe complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties.Theor. Comput. Sci.9491137582023Journal Articlesopenjournals/tcs/BangJensenY2310.1016/J.TCS.2023.113758https://doi.org/10.1016/j.tcs.2023.113758https://dblp.org/rec/journals/tcs/BangJensenY23URL#251933George BarmpaliasAlexander ShenThe Kučera-Gács theorem revisited by Levin.Theor. Comput. Sci.9471136932023Journal Articlesclosedjournals/tcs/BarmpaliasS2310.1016/J.TCS.2023.113693https://doi.org/10.1016/j.tcs.2023.113693https://dblp.org/rec/journals/tcs/BarmpaliasS23URL#251934Nikolay BazhenovVittorio CiprianiLuca San MauroLearning algebraic structures with the help of Borel equivalence relations.Theor. Comput. Sci.9511137622023Journal Articlesopenjournals/tcs/BazhenovCM2310.1016/J.TCS.2023.113762https://doi.org/10.1016/j.tcs.2023.113762https://dblp.org/rec/journals/tcs/BazhenovCM23URL#251935Wolfgang BeinLawrence L. LarmoreBreaking the 2-competitiveness barrier for two servers in a tree.Theor. Comput. Sci.9771141522023Journal Articlesclosedjournals/tcs/BeinL2310.1016/J.TCS.2023.114152https://doi.org/10.1016/j.tcs.2023.114152https://dblp.org/rec/journals/tcs/BeinL23URL#251936Michael A. BekosGiordano Da LozzoFabrizio FratiMartin GronemannTamara MchedlidzeChrysanthi N. RaftopoulouRecognizing DAGs with page-number 2 is NP-complete.Theor. Comput. Sci.9461136892023Journal Articlesopenjournals/tcs/BekosLFGMR2310.1016/J.TCS.2023.113689https://doi.org/10.1016/j.tcs.2023.113689https://dblp.org/rec/journals/tcs/BekosLFGMR23URL#251937Julien BensmailFoivos FioravantesFionn Mc InerneyNicolas NisseNacim OijidThe Maker-Breaker Largest Connected Subgraph game.Theor. Comput. Sci.943102-1202023Journal Articlesclosedjournals/tcs/BensmailFINO2310.1016/J.TCS.2022.12.014https://doi.org/10.1016/j.tcs.2022.12.014https://dblp.org/rec/journals/tcs/BensmailFINO23URL#251938Julien BensmailHervé HocquardDimitri LajouOn the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs.Theor. Comput. Sci.939105-1182023Journal Articlesclosedjournals/tcs/BensmailHL2310.1016/J.TCS.2022.10.017https://doi.org/10.1016/j.tcs.2022.10.017https://dblp.org/rec/journals/tcs/BensmailHL23URL#251939Somnath BeraAtulya K. NagarSastha SriramK. G. Subramanian 0001An array P system based on a new variant of pure 2D context-free grammars.Theor. Comput. Sci.9681140272023Journal Articlesopenjournals/tcs/BeraNSS2310.1016/J.TCS.2023.114027https://doi.org/10.1016/j.tcs.2023.114027https://dblp.org/rec/journals/tcs/BeraNSS23URL#251940Dmitry BerdinskySanjay Jain 0001Bakhadyr KhoussainovFrank Stephan 0001String compression in FA-presentable structures.Theor. Comput. Sci.9471137052023Journal Articlesclosedjournals/tcs/BerdinskyJKS2310.1016/J.TCS.2023.113705https://doi.org/10.1016/j.tcs.2023.113705https://dblp.org/rec/journals/tcs/BerdinskyJKS23URL#251941Pierre BergéLou SalaünThe influence of maximum (s, t)-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem.Theor. Comput. Sci.941221-2402023Journal Articlesclosedjournals/tcs/BergeS2310.1016/J.TCS.2022.11.017https://doi.org/10.1016/j.tcs.2022.11.017https://dblp.org/rec/journals/tcs/BergeS23URL#251942Martin BerglundBrink van der MerweRe-examining regular expressions with backreferences.Theor. Comput. Sci.940Part66-802023Journal Articlesclosedjournals/tcs/BerglundM2310.1016/J.TCS.2022.10.041https://doi.org/10.1016/j.tcs.2022.10.041https://dblp.org/rec/journals/tcs/BerglundM23URL#251943Murphy BerzishJoel D. DayVijay GaneshMitja KulczynskiFlorin ManeaFederico MoraDirk NowotkaTowards more efficient methods for solving regular-expression heavy string constraints.Theor. Comput. Sci.94350-722023Journal Articlesclosedjournals/tcs/BerzishDGKMMN2310.1016/J.TCS.2022.12.009https://doi.org/10.1016/j.tcs.2022.12.009https://dblp.org/rec/journals/tcs/BerzishDGKMMN23URL#251944Guram BezhanishviliJohn HardingPatrick J. MorandiRemarks on hyperspaces for Priestley spaces.Theor. Comput. Sci.943187-2022023Journal Articlesclosedjournals/tcs/BezhanishviliHM2310.1016/J.TCS.2022.12.001https://doi.org/10.1016/j.tcs.2022.12.001https://dblp.org/rec/journals/tcs/BezhanishviliHM23URL#251945Sujoy BhoreRahul Jain 0015Space-efficient algorithms for reachability in directed geometric graphs.Theor. Comput. Sci.9611139382023Journal Articlesclosedjournals/tcs/BhoreJ2310.1016/J.TCS.2023.113938https://doi.org/10.1016/j.tcs.2023.113938https://dblp.org/rec/journals/tcs/BhoreJ23URL#251946Riccardo BianchiniFrancesco DagninoPaola GianniniElena ZuccaA Java-like calculus with heterogeneous coeffects.Theor. Comput. Sci.9711140632023Journal Articlesopenjournals/tcs/BianchiniDGZ2310.1016/J.TCS.2023.114063https://doi.org/10.1016/j.tcs.2023.114063https://dblp.org/rec/journals/tcs/BianchiniDGZ23URL#251947Tristan BiceWieslaw KubisLattice-free and point-free: Vickers duality for subbases of stably locally compact spaces.Theor. Comput. Sci.9601138952023Journal Articlesclosedjournals/tcs/BiceK2310.1016/J.TCS.2023.113895https://doi.org/10.1016/j.tcs.2023.113895https://dblp.org/rec/journals/tcs/BiceK23URL#251948Laurent BienvenuValentino Delle RoseWolfgang MerkleRelativized depth.Theor. Comput. Sci.9491136942023Journal Articlesclosedjournals/tcs/BienvenuRM2310.1016/J.TCS.2023.113694https://doi.org/10.1016/j.tcs.2023.113694https://dblp.org/rec/journals/tcs/BienvenuRM23URL#251949Vittorio BilòLaurent GourvèsJérôme MonnotProject games.Theor. Comput. Sci.940Part97-1112023Journal Articlesclosedjournals/tcs/BiloGM2310.1016/J.TCS.2022.10.043https://doi.org/10.1016/j.tcs.2022.10.043https://dblp.org/rec/journals/tcs/BiloGM23URL#251950Vittorio BilòCosimo VinciCongestion games with priority-based scheduling.Theor. Comput. Sci.9741140942023Journal Articlesopenjournals/tcs/BiloV2310.1016/J.TCS.2023.114094https://doi.org/10.1016/j.tcs.2023.114094https://dblp.org/rec/journals/tcs/BiloV23URL#251951Liad BlumrosenYehonatan MizrahiHow bad is the merger paradox?Theor. Comput. Sci.9781141572023Journal Articlesclosedjournals/tcs/BlumrosenM2310.1016/J.TCS.2023.114157https://doi.org/10.1016/j.tcs.2023.114157https://dblp.org/rec/journals/tcs/BlumrosenM23URL#251952Toni BöhnleinOliver SchaudtJoachim SchauerStackelberg packing games.Theor. Comput. Sci.94316-352023Journal Articlesclosedjournals/tcs/BohnleinSS2310.1016/J.TCS.2022.12.006https://doi.org/10.1016/j.tcs.2022.12.006https://dblp.org/rec/journals/tcs/BohnleinSS23URL#251953Anthony BonatoTrent G. MarbachMichael MolnarJD NirThe one-visibility localization game.Theor. Comput. Sci.9781141862023Journal Articlesclosedjournals/tcs/BonatoMMN2310.1016/J.TCS.2023.114186https://doi.org/10.1016/j.tcs.2023.114186https://dblp.org/rec/journals/tcs/BonatoMMN23URL#251954Silvia BonomiAntonella Del PozzoMaria Potop-ButucaruSébastien TixeuilOptimal self-stabilizing mobile byzantine-tolerant regular register with bounded timestamps.Theor. Comput. Sci.942123-1412023Journal Articlesclosedjournals/tcs/BonomiPPT2310.1016/J.TCS.2022.11.028https://doi.org/10.1016/j.tcs.2022.11.028https://dblp.org/rec/journals/tcs/BonomiPPT23URL#251955Piotr BorowieckiDariusz DereniowskiDorota OsulaThe complexity of bicriteria tree-depth.Theor. Comput. Sci.9471136822023Journal Articlesclosedjournals/tcs/BorowieckiDO2310.1016/J.TCS.2022.12.032https://doi.org/10.1016/j.tcs.2022.12.032https://dblp.org/rec/journals/tcs/BorowieckiDO23URL#251956Jakob BossekDirk SudholtDo additional target points speed up evolutionary algorithms?Theor. Comput. Sci.9501137572023Journal Articlesclosedjournals/tcs/BossekS2310.1016/J.TCS.2023.113757https://doi.org/10.1016/j.tcs.2023.113757https://dblp.org/rec/journals/tcs/BossekS23URL#251957Vincenzo BottaIvan ViscontiDoubly adaptive zero-knowledge proofs.Theor. Comput. Sci.9681140142023Journal Articlesclosedjournals/tcs/BottaV2310.1016/J.TCS.2023.114014https://doi.org/10.1016/j.tcs.2023.114014https://dblp.org/rec/journals/tcs/BottaV23URL#251958Nicolas BousquetFelix HommelsheimYusuke Kobayashi 0001Moritz MühlenthalerAkira SuzukiFeedback vertex set reconfiguration in planar graphs.Theor. Comput. Sci.9791141882023Journal Articlesclosedjournals/tcs/BousquetHKMS2310.1016/J.TCS.2023.114188https://doi.org/10.1016/j.tcs.2023.114188https://dblp.org/rec/journals/tcs/BousquetHKMS23URL#251959Marius BozgaRadu IosifJoseph SifakisVerification of component-based systems with recursive architectures.Theor. Comput. Sci.940Part146-1752023Journal Articlesclosedjournals/tcs/BozgaIS2310.1016/J.TCS.2022.10.022https://doi.org/10.1016/j.tcs.2022.10.022https://dblp.org/rec/journals/tcs/BozgaIS23URL#251960Quentin BramasPascal Lafourcade 0001Stéphane DevismesOptimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality.Theor. Comput. Sci.9771141622023Journal Articlesclosedjournals/tcs/BramasLD2310.1016/J.TCS.2023.114162https://doi.org/10.1016/j.tcs.2023.114162https://dblp.org/rec/journals/tcs/BramasLD23URL#251961Quentin BramasAnissa LamaniSébastien TixeuilStand up indulgent gathering.Theor. Comput. Sci.93963-772023Journal Articlesclosedjournals/tcs/BramasLT2310.1016/J.TCS.2022.10.015https://doi.org/10.1016/j.tcs.2022.10.015https://dblp.org/rec/journals/tcs/BramasLT23URL#251962Quentin BramasAnissa LamaniSébastien TixeuilThe agreement power of disagreement.Theor. Comput. Sci.9541137722023Journal Articlesclosedjournals/tcs/BramasLT23a10.1016/J.TCS.2023.113772https://doi.org/10.1016/j.tcs.2023.113772https://dblp.org/rec/journals/tcs/BramasLT23aURL#251963Andreas BrandstädtRaffaele MoscaCombining decomposition approaches for the Maximum Weight Stable Set problem.Theor. Comput. Sci.9601139142023Journal Articlesclosedjournals/tcs/BrandstadtM2310.1016/J.TCS.2023.113914https://doi.org/10.1016/j.tcs.2023.113914https://dblp.org/rec/journals/tcs/BrandstadtM23URL#251964Luke BransonAndrew M. SuttonFocused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs.Theor. Comput. Sci.9511137192023Journal Articlesclosedjournals/tcs/BransonS2310.1016/J.TCS.2023.113719https://doi.org/10.1016/j.tcs.2023.113719https://dblp.org/rec/journals/tcs/BransonS23URL#251965Franz BraußeKonstantin KorovinMargarita V. KorovinaNorbert Th. MüllerThe ksmt calculus is a δ-complete decision procedure for non-linear constraints.Theor. Comput. Sci.9751141252023Journal Articlesopenjournals/tcs/BrausseKKM2310.1016/J.TCS.2023.114125https://doi.org/10.1016/j.tcs.2023.114125https://dblp.org/rec/journals/tcs/BrausseKKM23URL#251966Manfred BroySpecification and verification of concurrent systems by causality and realizability.Theor. Comput. Sci.9741141062023Journal Articlesclosedjournals/tcs/Broy2310.1016/J.TCS.2023.114106https://doi.org/10.1016/j.tcs.2023.114106https://dblp.org/rec/journals/tcs/Broy23URL#251967Nader H. BshoutyAn optimal tester for k-linear.Theor. Comput. Sci.9501137592023Journal Articlesclosedjournals/tcs/Bshouty2310.1016/J.TCS.2023.113759https://doi.org/10.1016/j.tcs.2023.113759https://dblp.org/rec/journals/tcs/Bshouty23URL#251968Gewu BuZvi LotkerMaria Potop-ButucaruMikaël RabieLower and upper bounds for deterministic convergecast with labeling schemes.Theor. Comput. Sci.9521137752023Journal Articlesclosedjournals/tcs/BuLPR2310.1016/J.TCS.2023.113775https://doi.org/10.1016/j.tcs.2023.113775https://dblp.org/rec/journals/tcs/BuLPR23URL#251969Csilla BujtásNima GhanbariSandi KlavzarComputational complexity aspects of super domination.Theor. Comput. Sci.9751141372023Journal Articlesopenjournals/tcs/BujtasGK2310.1016/J.TCS.2023.114137https://doi.org/10.1016/j.tcs.2023.114137https://dblp.org/rec/journals/tcs/BujtasGK23URL#251970Dora V. BulgakovaNicolas BuzhinskyYegor O. GoncharovOn balanced and abelian properties of circular words over a ternary alphabet.Theor. Comput. Sci.939227-2362023Journal Articlesclosedjournals/tcs/BulgakovaBG2310.1016/J.TCS.2022.10.027https://doi.org/10.1016/j.tcs.2022.10.027https://dblp.org/rec/journals/tcs/BulgakovaBG23URL#251971Laurent BulteauVincent JugéStéphane VialetteOn shuffled-square-free words.Theor. Comput. Sci.94191-1032023Journal Articlesclosedjournals/tcs/BulteauJV2310.1016/J.TCS.2022.10.028https://doi.org/10.1016/j.tcs.2022.10.028https://dblp.org/rec/journals/tcs/BulteauJV23URL#251972Kelvin C. BuñoHenry N. AdornaSolving 3-SAT in distributed P systems with string objects.Theor. Comput. Sci.9641139762023Journal Articlesclosedjournals/tcs/BunoA2310.1016/J.TCS.2023.113976https://doi.org/10.1016/j.tcs.2023.113976https://dblp.org/rec/journals/tcs/BunoA23URL#251973Gabriele BuriolaDomenico CantoneGianluca CincottiEugenio G. OmodeoGaetano T. SpartàA decidable theory involving addition of differentiable real functions.Theor. Comput. Sci.940Part124-1482023Journal Articlesclosedjournals/tcs/BuriolaCCOS2310.1016/J.TCS.2022.10.045https://doi.org/10.1016/j.tcs.2022.10.045https://dblp.org/rec/journals/tcs/BuriolaCCOS23URL#251974John BurkardtMarcus R. GarvieAn integer linear programming approach to solving the Eternity Puzzle.Theor. Comput. Sci.9751141382023Journal Articlesclosedjournals/tcs/BurkardtG2310.1016/J.TCS.2023.114138https://doi.org/10.1016/j.tcs.2023.114138https://dblp.org/rec/journals/tcs/BurkardtG23URL#251975Costas BuschBogdan S. ChlebusMaurice HerlihyMiroslav PopovicPavan PoudelGokarna SharmaFlexible scheduling of transactional memory on trees.Theor. Comput. Sci.9781141842023Journal Articlesclosedjournals/tcs/BuschCHPPS2310.1016/J.TCS.2023.114184https://doi.org/10.1016/j.tcs.2023.114184https://dblp.org/rec/journals/tcs/BuschCHPPS23URL#251976Jianping CaiXimeng LiuJiayin LiShuangyue ZhangGeneration matrix: An embeddable matrix representation for hierarchical trees.Theor. Comput. Sci.9791141802023Journal Articlesclosedjournals/tcs/CaiLLZ2310.1016/J.TCS.2023.114180https://doi.org/10.1016/j.tcs.2023.114180https://dblp.org/rec/journals/tcs/CaiLLZ23URL#251977Francesca CairoliFabio AnselmiAlberto d'OnofrioLuca BortolussiGenerative abstraction of Markov population processes.Theor. Comput. Sci.9771141692023Journal Articlesclosedjournals/tcs/CairoliAdB2310.1016/J.TCS.2023.114169https://doi.org/10.1016/j.tcs.2023.114169https://dblp.org/rec/journals/tcs/CairoliAdB23URL#251978Ben CameronChính T. HoàngA refinement on the structure of vertex-critical (P5, gem)-free graphs.Theor. Comput. Sci.9611139362023Journal Articlesclosedjournals/tcs/CameronH2310.1016/J.TCS.2023.113936https://doi.org/10.1016/j.tcs.2023.113936https://dblp.org/rec/journals/tcs/CameronH23URL#251979Domenico CantonePietro MaugeriEugenio G. OmodeoComplexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages.Theor. Comput. Sci.9541137862023Journal Articlesopenjournals/tcs/CantoneMO2310.1016/J.TCS.2023.113786https://doi.org/10.1016/j.tcs.2023.113786https://dblp.org/rec/journals/tcs/CantoneMO23URL#251980Ilir ÇapuniJarkko KariAlexander ShenTaming randomness and complexity - Essays in honour of Professor Péter Gács.Theor. Comput. Sci.9491137762023Journal Articlesclosedjournals/tcs/CapuniKS2310.1016/J.TCS.2023.113776https://doi.org/10.1016/j.tcs.2023.113776https://dblp.org/rec/journals/tcs/CapuniKS23URL#251981André CarvalhoAlgebraic and context-free subsets of subgroups.Theor. Comput. Sci.9801142292023Journal Articlesclosedjournals/tcs/Carvalho2310.1016/J.TCS.2023.114229https://doi.org/10.1016/j.tcs.2023.114229https://dblp.org/rec/journals/tcs/Carvalho23URL#251982Guilhem CastagnosDario CatalanoFabien LaguillaumieFederico SavastaIda TuckerBandwidth-efficient threshold EC-DSA revisited: Online/offline extensions, identifiable aborts proactive and adaptive security.Theor. Comput. Sci.93978-1042023Journal Articlesclosedjournals/tcs/CastagnosCLST2310.1016/J.TCS.2022.10.016https://doi.org/10.1016/j.tcs.2022.10.016https://dblp.org/rec/journals/tcs/CastagnosCLST23URL#251983Ilaria CastellanoAnna Giordano BrunoNicolò ZavaWeakly weighted generalised quasi-metric spaces and semilattices.Theor. Comput. Sci.9771141292023Journal Articlesclosedjournals/tcs/CastellanoBZ2310.1016/J.TCS.2023.114129https://doi.org/10.1016/j.tcs.2023.114129https://dblp.org/rec/journals/tcs/CastellanoBZ23URL#251984Jannik CastenowJonas HarbigDaniel Jung 0001Till KnollmannFriedhelm Meyer auf der HeideGathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation.Theor. Comput. Sci.939261-2912023Journal Articlesclosedjournals/tcs/CastenowHJKH2310.1016/J.TCS.2022.10.031https://doi.org/10.1016/j.tcs.2022.10.031https://dblp.org/rec/journals/tcs/CastenowHJKH23URL#251985Andrea CaucchioloFerdinando CicaleseHardness and approximation of multiple sequence alignment with column score.Theor. Comput. Sci.9461136832023Journal Articlesclosedjournals/tcs/CaucchioloC2310.1016/J.TCS.2022.12.033https://doi.org/10.1016/j.tcs.2022.12.033https://dblp.org/rec/journals/tcs/CaucchioloC23URL#251986Dibyayan ChakrabortyKshitij GajjarFinding geometric representations of apex graphs is NP-hard.Theor. Comput. Sci.9711140642023Journal Articlesclosedjournals/tcs/ChakrabortyG2310.1016/J.TCS.2023.114064https://doi.org/10.1016/j.tcs.2023.114064https://dblp.org/rec/journals/tcs/ChakrabortyG23URL#251987Dibyayan ChakrabortyHarmender GahlawatBodhayan RoyAlgorithms and complexity for geodetic sets on partial grids.Theor. Comput. Sci.9791142172023Journal Articlesclosedjournals/tcs/ChakrabortyGR2310.1016/J.TCS.2023.114217https://doi.org/10.1016/j.tcs.2023.114217https://dblp.org/rec/journals/tcs/ChakrabortyGR23URL#251988Sankardeep ChakrabortySeungbum JoCompact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number.Theor. Comput. Sci.941156-1662023Journal Articlesclosedjournals/tcs/ChakrabortyJ2310.1016/J.TCS.2022.11.010https://doi.org/10.1016/j.tcs.2022.11.010https://dblp.org/rec/journals/tcs/ChakrabortyJ23URL#251989Hau ChanZifan GongMinming LiChenhao Wang 0001Yingchao Zhao 0001Facility location games with ordinal preferences.Theor. Comput. Sci.9791142082023Journal Articlesclosedjournals/tcs/ChanGLWZ2310.1016/J.TCS.2023.114208https://doi.org/10.1016/j.tcs.2023.114208https://dblp.org/rec/journals/tcs/ChanGLWZ23URL#251990Hong ChangJing JinZhicheng LiuPing Li 0053Xiaoyan Zhang 0001Two-stage non-submodular maximization.Theor. Comput. Sci.9681140172023Journal Articlesclosedjournals/tcs/ChangJLLZ2310.1016/J.TCS.2023.114017https://doi.org/10.1016/j.tcs.2023.114017https://dblp.org/rec/journals/tcs/ChangJLLZ23URL#251991Yi-Jun ChangJan StudenýJukka SuomelaDistributed graph problems through an automata-theoretic lens.Theor. Comput. Sci.9511137102023Journal Articlesopenjournals/tcs/ChangSS2310.1016/J.TCS.2023.113710https://doi.org/10.1016/j.tcs.2023.113710https://dblp.org/rec/journals/tcs/ChangSS23URL#251992Siddhesh ChaubalAnna GálTight bounds on sensitivity and block sensitivity of some classes of transitive functions.Theor. Comput. Sci.9461136872023Journal Articlesclosedjournals/tcs/ChaubalG2310.1016/J.TCS.2022.12.037https://doi.org/10.1016/j.tcs.2022.12.037https://dblp.org/rec/journals/tcs/ChaubalG23URL#251993Hong-Bin ChenGeng-Yu ChenOptimal 2-traceability codes of length 4.Theor. Comput. Sci.9541138002023Journal Articlesclosedjournals/tcs/ChenC2310.1016/J.TCS.2023.113800https://doi.org/10.1016/j.tcs.2023.113800https://dblp.org/rec/journals/tcs/ChenC23URL#251994Yijia ChenPierre-Louis CurienYuxin DengMin ZhangPreface for the special issue of Theoretical Computer Science in honor of the 60th birthday of Yuxi Fu.Theor. Comput. Sci.9451137202023Journal Articlesclosedjournals/tcs/ChenCDZ2310.1016/J.TCS.2023.113720https://doi.org/10.1016/j.tcs.2023.113720https://dblp.org/rec/journals/tcs/ChenCDZ23URL#251995Lv ChenLingli ChenQin Li 0009Practical multi-party quantum homomorphic encryption.Theor. Comput. Sci.9711140672023Journal Articlesclosedjournals/tcs/ChenCL2310.1016/J.TCS.2023.114067https://doi.org/10.1016/j.tcs.2023.114067https://dblp.org/rec/journals/tcs/ChenCL23URL#251996Jinmian ChenYukun ChengZhiqi XuYan CaoDecision on block size in blockchain systems by evolutionary equilibrium analysis.Theor. Comput. Sci.94293-1062023Journal Articlesclosedjournals/tcs/ChenCXC2310.1016/J.TCS.2022.11.026https://doi.org/10.1016/j.tcs.2022.11.026https://dblp.org/rec/journals/tcs/ChenCXC23URL#251997Eddie Cheng 0001László LiptákKe Qiu 0001Zhizhang ShenAbhishek VangipuramOn the g-extra connectivity of augmented cubes.Theor. Comput. Sci.9701140592023Journal Articlesclosedjournals/tcs/ChengLQSV2310.1016/J.TCS.2023.114059https://doi.org/10.1016/j.tcs.2023.114059https://dblp.org/rec/journals/tcs/ChengLQSV23URL#251998Yunlong ChengHao ZhouXiaofeng Gao 0001Jiaqi Zheng 0001Guihai ChenOptimizing incremental SDN upgrades for load balancing in ISP networks.Theor. Comput. Sci.9621139272023Journal Articlesclosedjournals/tcs/ChengZGZC2310.1016/J.TCS.2023.113927https://doi.org/10.1016/j.tcs.2023.113927https://dblp.org/rec/journals/tcs/ChengZGZC23URL#251999Janka ChlebíkováClément DallardNiklas PaulsenImpact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems.Theor. Comput. Sci.9601139232023Journal Articlesclosedjournals/tcs/ChlebikovaDP2310.1016/J.TCS.2023.113923https://doi.org/10.1016/j.tcs.2023.113923https://dblp.org/rec/journals/tcs/ChlebikovaDP23URL#252000Serafino CiceroneAlessia Di FonsoGabriele Di StefanoAlfredo NavarraArbitrary pattern formation on infinite regular tessellation graphs.Theor. Comput. Sci.9421-202023Journal Articlesclosedjournals/tcs/CiceroneFSN2310.1016/J.TCS.2022.11.021https://doi.org/10.1016/j.tcs.2022.11.021https://dblp.org/rec/journals/tcs/CiceroneFSN23URL#252001Serafino CiceroneGabriele Di StefanoLara DrozdekJaka HedzetSandi KlavzarIsmael G. YeroVariety of mutual-visibility problems in graphs.Theor. Comput. Sci.9741140962023Journal Articlesopenjournals/tcs/CiceroneSDHKY2310.1016/J.TCS.2023.114096https://doi.org/10.1016/j.tcs.2023.114096https://dblp.org/rec/journals/tcs/CiceroneSDHKY23URL#252002R. CirponsJames D. MitchellPolynomial time multiplication and normal forms in free bands.Theor. Comput. Sci.9531137832023Journal Articlesopenjournals/tcs/CirponsM2310.1016/J.TCS.2023.113783https://doi.org/10.1016/j.tcs.2023.113783https://dblp.org/rec/journals/tcs/CirponsM23URL#252003Ali ÇivrilA new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem.Theor. Comput. Sci.943121-1302023Journal Articlesclosedjournals/tcs/Civril2310.1016/J.TCS.2022.12.013https://doi.org/10.1016/j.tcs.2022.12.013https://dblp.org/rec/journals/tcs/Civril23URL#252004Ali ÇivrilCorrigendum to "A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem" [Theor. Comput. Sci. 943 (2023) 121-130].Theor. Comput. Sci.9631139262023Journal Articlesclosedjournals/tcs/Civril23a10.1016/J.TCS.2023.113926https://doi.org/10.1016/j.tcs.2023.113926https://dblp.org/rec/journals/tcs/Civril23aURL#252005Alon CohenArgyrios DeligkasMoran KorenLearning approximately optimal contracts.Theor. Comput. Sci.9801142192023Journal Articlesclosedjournals/tcs/CohenDK2310.1016/J.TCS.2023.114219https://doi.org/10.1016/j.tcs.2023.114219https://dblp.org/rec/journals/tcs/CohenDK23URL#252006Giovanna D'AgostinoDavide MartincighAlberto PolicritiOrdering regular languages and automata: Complexity.Theor. Comput. Sci.9491137092023Journal Articlesclosedjournals/tcs/DAgostinoMP2310.1016/J.TCS.2023.113709https://doi.org/10.1016/j.tcs.2023.113709https://dblp.org/rec/journals/tcs/DAgostinoMP23URL#252007Paolo D'ArcoZahra Ebadi AnsaroudiFrancesco MogaveroMulti-stage Proof-of-Works: Properties and vulnerabilities.Theor. Comput. Sci.9761141082023Journal Articlesclosedjournals/tcs/DArcoAM2310.1016/J.TCS.2023.114108https://doi.org/10.1016/j.tcs.2023.114108https://dblp.org/rec/journals/tcs/DArcoAM23URL#252008Yogesh DahiyaMeena MahajanOn (simple) decision tree rank.Theor. Comput. Sci.9781141772023Journal Articlesclosedjournals/tcs/DahiyaM2310.1016/J.TCS.2023.114177https://doi.org/10.1016/j.tcs.2023.114177https://dblp.org/rec/journals/tcs/DahiyaM23URL#252009Omar DarwichAhmet-Sefa UlucanQuentin BramasAnissa LamaniAnaïs DurandPascal Lafourcade 0001Perpetual torus exploration by myopic luminous robots.Theor. Comput. Sci.9761141432023Journal Articlesclosedjournals/tcs/DarwichUBLDL2310.1016/J.TCS.2023.114143https://doi.org/10.1016/j.tcs.2023.114143https://dblp.org/rec/journals/tcs/DarwichUBLDL23URL#252010Bhaskar DasGuptaElena GrigorescuTamalika MukherjeeOn computing discretized Ricci curvatures of graphs: Local algorithms and (localized) fine-grained reductions.Theor. Comput. Sci.9751141272023Journal Articlesclosedjournals/tcs/DasGuptaGM2310.1016/J.TCS.2023.114127https://doi.org/10.1016/j.tcs.2023.114127https://dblp.org/rec/journals/tcs/DasGuptaGM23URL#252011Ajoy K. DattaStéphane DevismesColette JohnenLawrence L. LarmoreAnalysis of a memory-efficient self-stabilizing BFS spanning tree construction.Theor. Comput. Sci.9551138042023Journal Articlesclosedjournals/tcs/DattaDJL2310.1016/J.TCS.2023.113804https://doi.org/10.1016/j.tcs.2023.113804https://dblp.org/rec/journals/tcs/DattaDJL23URL#252012Carole Delporte-GalletHugues FauconnierMichel RaynalMouna SafirOptimal algorithms for synchronous Byzantine k-set agreement.Theor. Comput. Sci.9731140982023Journal Articlesclosedjournals/tcs/DelporteGalletFRS2310.1016/J.TCS.2023.114098https://doi.org/10.1016/j.tcs.2023.114098https://dblp.org/rec/journals/tcs/DelporteGalletFRS23URL#252013Subhadeep Ranjan DevSanjana DeyFlorent FoucaudRalf KlasingTuomo LehtiläThe RED-BLUE SEPARATION problem on graphs.Theor. Comput. Sci.9701140612023Journal Articlesclosedjournals/tcs/DevDFKL2310.1016/J.TCS.2023.114061https://doi.org/10.1016/j.tcs.2023.114061https://dblp.org/rec/journals/tcs/DevDFKL23URL#252014Palash DeyPriced Gerrymandering.Theor. Comput. Sci.9721140802023Journal Articlesclosedjournals/tcs/Dey2310.1016/J.TCS.2023.114080https://doi.org/10.1016/j.tcs.2023.114080https://dblp.org/rec/journals/tcs/Dey23URL#252015Alejandro Díaz-CaroGilles DowekA new connective in natural deduction, and its application to quantum computing.Theor. Comput. Sci.9571138402023Journal Articlesclosedjournals/tcs/DiazCaroD2310.1016/J.TCS.2023.113840https://doi.org/10.1016/j.tcs.2023.113840https://dblp.org/rec/journals/tcs/DiazCaroD23URL#252016Alejandro Díaz-CaroGilles DowekExtensional proofs in a propositional logic modulo isomorphisms.Theor. Comput. Sci.9771141722023Journal Articlesclosedjournals/tcs/DiazCaroD23a10.1016/J.TCS.2023.114172https://doi.org/10.1016/j.tcs.2023.114172https://dblp.org/rec/journals/tcs/DiazCaroD23aURL#252017Tongtong DingMin Xu 0005Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model.Theor. Comput. Sci.9441136762023Journal Articlesclosedjournals/tcs/DingX2310.1016/J.TCS.2022.12.026https://doi.org/10.1016/j.tcs.2022.12.026https://dblp.org/rec/journals/tcs/DingX23URL#252018Michael J. DinneenPankaj S. GhodlaSimone LinzA QUBO formulation for the Tree Containment problem.Theor. Comput. Sci.940Part60-792023Journal Articlesclosedjournals/tcs/DinneenGL2310.1016/J.TCS.2022.09.012https://doi.org/10.1016/j.tcs.2022.09.012https://dblp.org/rec/journals/tcs/DinneenGL23URL#252019Michael J. DinneenAlec HendersonRadu NicolescuSublinear P system solutions to NP-complete problems.Theor. Comput. Sci.9581138482023Journal Articlesopenjournals/tcs/DinneenHN2310.1016/J.TCS.2023.113848https://doi.org/10.1016/j.tcs.2023.113848https://dblp.org/rec/journals/tcs/DinneenHN23URL#252020Benjamin DoerrMartin S. KrejcaBivariate estimation-of-distribution algorithms can find an exponential number of optima.Theor. Comput. Sci.9711140742023Journal Articlesclosedjournals/tcs/DoerrK2310.1016/J.TCS.2023.114074https://doi.org/10.1016/j.tcs.2023.114074https://dblp.org/rec/journals/tcs/DoerrK23URL#252021Benjamin DoerrAmirhossein RajabiStagnation detection meets fast mutation.Theor. Comput. Sci.9461136702023Journal Articlesopenjournals/tcs/DoerrR2310.1016/J.TCS.2022.12.020https://doi.org/10.1016/j.tcs.2022.12.020https://dblp.org/rec/journals/tcs/DoerrR23URL#252022Francesco DolceL'ubomíra DvorákováEdita PelantováOn balanced sequences and their critical exponent.Theor. Comput. Sci.93918-472023Journal Articlesclosedjournals/tcs/DolceDP2310.1016/J.TCS.2022.10.014https://doi.org/10.1016/j.tcs.2022.10.014https://dblp.org/rec/journals/tcs/DolceDP23URL#252023Riccardo DondiUntangling temporal graphs of bounded degree.Theor. Comput. Sci.9691140402023Journal Articlesopenjournals/tcs/Dondi2310.1016/J.TCS.2023.114040https://doi.org/10.1016/j.tcs.2023.114040https://dblp.org/rec/journals/tcs/Dondi23URL#252024Hui DongMengjie LvWeibei FanGuijuan WangReliability evaluation of half hypercube networks.Theor. Comput. Sci.9751141422023Journal Articlesclosedjournals/tcs/DongLFW2310.1016/J.TCS.2023.114142https://doi.org/10.1016/j.tcs.2023.114142https://dblp.org/rec/journals/tcs/DongLFW23URL#252025Luobing DongZhilong SunYongsong QinAn attention-driven nonlinear optimization method for CS-based hyperspectral image reconstruction.Theor. Comput. Sci.9591138452023Journal Articlesclosedjournals/tcs/DongSQ2310.1016/J.TCS.2023.113845https://doi.org/10.1016/j.tcs.2023.113845https://dblp.org/rec/journals/tcs/DongSQ23URL#252026Wlodzimierz DrabentA relaxed condition for avoiding the occur-check.Theor. Comput. Sci.9751141072023Journal Articlesclosedjournals/tcs/Drabent2310.1016/J.TCS.2023.114107https://doi.org/10.1016/j.tcs.2023.114107https://dblp.org/rec/journals/tcs/Drabent23URL#252027Frank DrewesRichard MörbitzHeiko VoglerHybrid tree automata and the yield theorem for constituent tree automata.Theor. Comput. Sci.9791141852023Journal Articlesopenjournals/tcs/DrewesMV2310.1016/J.TCS.2023.114185https://doi.org/10.1016/j.tcs.2023.114185https://dblp.org/rec/journals/tcs/DrewesMV23URL#252028Liman DuWenguo YangSuixiang GaoCompetition-based generalized self-profit maximization in dual-attribute network.Theor. Comput. Sci.9611139402023Journal Articlesclosedjournals/tcs/DuYG2310.1016/J.TCS.2023.113940https://doi.org/10.1016/j.tcs.2023.113940https://dblp.org/rec/journals/tcs/DuYG23URL#252029Guillaume DucoffeDistance problems within Helly graphs and k-Helly graphs.Theor. Comput. Sci.9461136902023Journal Articlesclosedjournals/tcs/Ducoffe2310.1016/J.TCS.2023.113690https://doi.org/10.1016/j.tcs.2023.113690https://dblp.org/rec/journals/tcs/Ducoffe23URL#252030Anaïs DurandMichel RaynalGadi TaubenfeldReaching agreement in the presence of contention-related crash failures.Theor. Comput. Sci.966-9671139822023Journal Articlesclosedjournals/tcs/DurandRT2310.1016/J.TCS.2023.113982https://doi.org/10.1016/j.tcs.2023.113982https://dblp.org/rec/journals/tcs/DurandRT23URL#252031Romaric DuvignauMichel RaynalElad Michael SchillerSelf-stabilizing Byzantine fault-tolerant repeated reliable broadcast.Theor. Comput. Sci.9721140702023Journal Articlesopenjournals/tcs/DuvignauRS2310.1016/J.TCS.2023.114070https://doi.org/10.1016/j.tcs.2023.114070https://dblp.org/rec/journals/tcs/DuvignauRS23URL#252032Matthias EberlHigher-order concepts for the potential infinite.Theor. Comput. Sci.9451136672023Journal Articlesclosedjournals/tcs/Eberl2310.1016/J.TCS.2022.12.017https://doi.org/10.1016/j.tcs.2022.12.017https://dblp.org/rec/journals/tcs/Eberl23URL#252033Abbas EdalatAmin FarjudianYiran LiRecursive solution of initial value problems with temporal discretization.Theor. Comput. Sci.9801142212023Journal Articlesclosedjournals/tcs/EdalatFL2310.1016/J.TCS.2023.114221https://doi.org/10.1016/j.tcs.2023.114221https://dblp.org/rec/journals/tcs/EdalatFL23URL#252034Eduard EibenGregory Z. GutinPhilip R. NearyClément RambaudMagnus WahlströmAnders YeoPreference swaps for the stable matching problem.Theor. Comput. Sci.940Part222-2302023Journal Articlesopenjournals/tcs/EibenGNRWY2310.1016/J.TCS.2022.11.003https://doi.org/10.1016/j.tcs.2022.11.003https://dblp.org/rec/journals/tcs/EibenGNRWY23URL#252035Edith ElkindPiotr FaliszewskiAyumi Igarashi 0001Pasin ManurangsiUlrike Schmidt-KraepelinWarut SuksompongJustifying groups in multiwinner approval voting.Theor. Comput. Sci.9691140392023Journal Articlesopenjournals/tcs/ElkindFIMSS2310.1016/J.TCS.2023.114039https://doi.org/10.1016/j.tcs.2023.114039https://dblp.org/rec/journals/tcs/ElkindFIMSS23URL#252036Ioannis Z. EmirisVasilis MargonisIoannis PsarrosNear-neighbor preserving dimension reduction via coverings for doubling subsets of ℓ1.Theor. Comput. Sci.942169-1792023Journal Articlesclosedjournals/tcs/EmirisMP2310.1016/J.TCS.2022.11.031https://doi.org/10.1016/j.tcs.2022.11.031https://dblp.org/rec/journals/tcs/EmirisMP23URL#252037Leah EpsteinSeveral methods of analysis for cardinality constrained bin packing.Theor. Comput. Sci.942213-2292023Journal Articlesclosedjournals/tcs/Epstein2310.1016/J.TCS.2022.11.034https://doi.org/10.1016/j.tcs.2022.11.034https://dblp.org/rec/journals/tcs/Epstein23URL#252038Massimo EquiVeli MäkinenAlexandru I. TomescuGraphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails.Theor. Comput. Sci.9751141282023Journal Articlesopenjournals/tcs/EquiMT2310.1016/J.TCS.2023.114128https://doi.org/10.1016/j.tcs.2023.114128https://dblp.org/rec/journals/tcs/EquiMT23URL#252039Martín EscardóPaulo OlivaHigher-order games with dependent types.Theor. Comput. Sci.9741141112023Journal Articlesopenjournals/tcs/EscardoO2310.1016/J.TCS.2023.114111https://doi.org/10.1016/j.tcs.2023.114111https://dblp.org/rec/journals/tcs/EscardoO23URL#252040Louis EsperetSébastien JulliotArnaud de MesmayDistributed coloring and the local structure of unit-disk graphs.Theor. Comput. Sci.9441136742023Journal Articlesclosedjournals/tcs/EsperetJM2310.1016/J.TCS.2022.12.024https://doi.org/10.1016/j.tcs.2022.12.024https://dblp.org/rec/journals/tcs/EsperetJM23URL#252041Austen Z. FanJin-Yi CaiDichotomy result on 3-regular bipartite non-negative functions.Theor. Comput. Sci.9491137452023Journal Articlesclosedjournals/tcs/FanC2310.1016/J.TCS.2023.113745https://doi.org/10.1016/j.tcs.2023.113745https://dblp.org/rec/journals/tcs/FanC23URL#252042Rasha FaqehAndré MartinValerio SchiavoniPramod BhatotiaPascal FelberChristof FetzerCapacity planning for dependable services.Theor. Comput. Sci.9761141262023Journal Articlesclosedjournals/tcs/FaqehMSBFF2310.1016/J.TCS.2023.114126https://doi.org/10.1016/j.tcs.2023.114126https://dblp.org/rec/journals/tcs/FaqehMSBFF23URL#252043Simone FaroFrancesco Pio MarinoArianna PavoneImproved characters distance sampling for online and offline text searching.Theor. Comput. Sci.9461136842023Journal Articlesclosedjournals/tcs/FaroMP2310.1016/J.TCS.2022.12.034https://doi.org/10.1016/j.tcs.2022.12.034https://dblp.org/rec/journals/tcs/FaroMP23URL#252044Simone FaroStefano ScafitiCompact suffix automata representations for searching long patterns.Theor. Comput. Sci.940Part254-2682023Journal Articlesclosedjournals/tcs/FaroS2310.1016/J.TCS.2022.11.005https://doi.org/10.1016/j.tcs.2022.11.005https://dblp.org/rec/journals/tcs/FaroS23URL#252045Raymond FengJesse GenesonAndrew LeeEspen SlettnesSharp bounds on the price of bandit feedback for several models of mistake-bounded online learning.Theor. Comput. Sci.9651139802023Journal Articlesclosedjournals/tcs/FengGLS2310.1016/J.TCS.2023.113980https://doi.org/10.1016/j.tcs.2023.113980https://dblp.org/rec/journals/tcs/FengGLS23URL#252046Junkai FengRuiqi YangHaibin ZhangZhenning ZhangA bi-criteria algorithm for online non-monotone maximization problems: DR-submodular+concave.Theor. Comput. Sci.9791142072023Journal Articlesclosedjournals/tcs/FengYZZ2310.1016/J.TCS.2023.114207https://doi.org/10.1016/j.tcs.2023.114207https://dblp.org/rec/journals/tcs/FengYZZ23URL#252047Pamela FleischmannLukas HaschkeJonas HöferAnnika HuchAnnika MayrockDirk NowotkaNearly k-universal words - Investigating a part of Simon's congruence.Theor. Comput. Sci.9741141132023Journal Articlesclosedjournals/tcs/FleischmannHHHMN2310.1016/J.TCS.2023.114113https://doi.org/10.1016/j.tcs.2023.114113https://dblp.org/rec/journals/tcs/FleischmannHHHMN23URL#252048Klaus-Tycho FoersterTomasz JurdzinskiStefan Schmid 0001Guest editorial: Structural Information and Communication Complexity 2021.Theor. Comput. Sci.9711139132023Journal Articlesclosedjournals/tcs/FoersterJS2310.1016/J.TCS.2023.113913https://doi.org/10.1016/j.tcs.2023.113913https://dblp.org/rec/journals/tcs/FoersterJS23URL#252049Willem L. FouchéSafari MukeruOn local times of Martin-Löf random Brownian motion.Theor. Comput. Sci.9791141992023Journal Articlesclosedjournals/tcs/FoucheM2310.1016/J.TCS.2023.114199https://doi.org/10.1016/j.tcs.2023.114199https://dblp.org/rec/journals/tcs/FoucheM23URL#252050Tobias Friedrich 0001Andreas Göbel 0001Martin S. KrejcaMarcus PappikPolymer dynamics via cliques: New conditions for approximations.Theor. Comput. Sci.942230-2522023Journal Articlesclosedjournals/tcs/FriedrichGKP2310.1016/J.TCS.2022.11.035https://doi.org/10.1016/j.tcs.2022.11.035https://dblp.org/rec/journals/tcs/FriedrichGKP23URL#252051Tobias FritzTomás GondaPaolo PerroneEigil Fjeldgren RischelRepresentable Markov categories and comparison of statistical experiments in categorical probability.Theor. Comput. Sci.9611138962023Journal Articlesclosedjournals/tcs/FritzGPR2310.1016/J.TCS.2023.113896https://doi.org/10.1016/j.tcs.2023.113896https://dblp.org/rec/journals/tcs/FritzGPR23URL#252052Bin FuYumei HuoHairong ZhaoStreaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity.Theor. Comput. Sci.9611139372023Journal Articlesclosedjournals/tcs/FuHZ2310.1016/J.TCS.2023.113937https://doi.org/10.1016/j.tcs.2023.113937https://dblp.org/rec/journals/tcs/FuHZ23URL#252053Michael Fuchs 0001Tsan-Cheng YuAsymptotic normality for the size of graph tries built from M-ary tree labelings.Theor. Comput. Sci.9681140112023Journal Articlesclosedjournals/tcs/FuchsY2310.1016/J.TCS.2023.114011https://doi.org/10.1016/j.tcs.2023.114011https://dblp.org/rec/journals/tcs/FuchsY23URL#252054Yuta FujishigeYuki TsujimaruShunsuke InenagaHideo BannaiMasayuki TakedaLinear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets.Theor. Comput. Sci.9731140932023Journal Articlesclosedjournals/tcs/FujishigeTIBT2310.1016/J.TCS.2023.114093https://doi.org/10.1016/j.tcs.2023.114093https://dblp.org/rec/journals/tcs/FujishigeTIBT23URL#252055Andreas GalanisLeslie Ann GoldbergDaniel StefankovicImplementations and the independent set polynomial below the Shearer threshold.Theor. Comput. Sci.939194-2152023Journal Articlesopenjournals/tcs/GalanisGS2310.1016/J.TCS.2022.10.025https://doi.org/10.1016/j.tcs.2022.10.025https://dblp.org/rec/journals/tcs/GalanisGS23URL#252056Esther GalbyThe complexity of blocking (semi)total dominating sets with edge contractions.Theor. Comput. Sci.9501136782023Journal Articlesclosedjournals/tcs/Galby2310.1016/J.TCS.2022.12.028https://doi.org/10.1016/j.tcs.2022.12.028https://dblp.org/rec/journals/tcs/Galby23URL#252057Esther GalbyPaloma T. LimaFelix MannBernard RiesUsing edge contractions to reduce the semitotal domination number.Theor. Comput. Sci.939140-1602023Journal Articlesopenjournals/tcs/GalbyLMR2310.1016/J.TCS.2022.10.020https://doi.org/10.1016/j.tcs.2022.10.020https://dblp.org/rec/journals/tcs/GalbyLMR23URL#252058Esther GalbyDániel MarxPhilipp SchepperRoohani SharmaPrafullkumar TaleParameterized complexity of multicut in weighted trees.Theor. Comput. Sci.9781141742023Journal Articlesclosedjournals/tcs/GalbyMSST2310.1016/J.TCS.2023.114174https://doi.org/10.1016/j.tcs.2023.114174https://dblp.org/rec/journals/tcs/GalbyMSST23URL#252059Hortensia Galeana-SánchezFelipe Hernández-LorenzanaRocío Sánchez-LópezA generalization of properly colored paths and cycles in edge-colored graphs.Theor. Comput. Sci.9461136792023Journal Articlesclosedjournals/tcs/GaleanaSanchezHS2310.1016/J.TCS.2022.12.029https://doi.org/10.1016/j.tcs.2022.12.029https://dblp.org/rec/journals/tcs/GaleanaSanchezHS23URL#252060Ashwin GanesanPerformance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model.Theor. Comput. Sci.9471137182023Journal Articlesclosedjournals/tcs/Ganesan2310.1016/J.TCS.2023.113718https://doi.org/10.1016/j.tcs.2023.113718https://dblp.org/rec/journals/tcs/Ganesan23URL#252061Jugal GargAniket MurhekarComputing fair and efficient allocations with few utility values.Theor. Comput. Sci.9621139322023Journal Articlesclosedjournals/tcs/GargM2310.1016/J.TCS.2023.113932https://doi.org/10.1016/j.tcs.2023.113932https://dblp.org/rec/journals/tcs/GargM23URL#252062Zsolt GazdagKároly HajagosA characterisation of P by DLOGTIME-uniform families of polarizationless P systems using only dissolution rules.Theor. Comput. Sci.9651139742023Journal Articlesclosedjournals/tcs/GazdagH2310.1016/J.TCS.2023.113974https://doi.org/10.1016/j.tcs.2023.113974https://dblp.org/rec/journals/tcs/GazdagH23URL#252063Jesse GenesonEthan ZhouOnline learning of smooth functions.Theor. Comput. Sci.9791142032023Journal Articlesclosedjournals/tcs/GenesonZ2310.1016/J.TCS.2023.114203https://doi.org/10.1016/j.tcs.2023.114203https://dblp.org/rec/journals/tcs/GenesonZ23URL#252064Konstantinos GeorgiouJesse LucierWeighted group search on a line & implications to the priority evacuation problem.Theor. Comput. Sci.9391-172023Journal Articlesclosedjournals/tcs/GeorgiouL2310.1016/J.TCS.2022.10.013https://doi.org/10.1016/j.tcs.2022.10.013https://dblp.org/rec/journals/tcs/GeorgiouL23URL#252065Konstantinos GeorgiouSean LeizerovichJesse LucierSomnath KunduEvacuating from ℓp unit disks in the wireless model.Theor. Comput. Sci.9441136752023Journal Articlesclosedjournals/tcs/GeorgiouLLK2310.1016/J.TCS.2022.12.025https://doi.org/10.1016/j.tcs.2022.12.025https://dblp.org/rec/journals/tcs/GeorgiouLLK23URL#252066M. Utkan GezerÖzdeniz DoluNevzat ErsoyA. C. Cem SayReal-time, constant-space, constant-randomness verifiers.Theor. Comput. Sci.9761141552023Journal Articlesclosedjournals/tcs/GezerDES2310.1016/J.TCS.2023.114155https://doi.org/10.1016/j.tcs.2023.114155https://dblp.org/rec/journals/tcs/GezerDES23URL#252067Pratik GhosalAdam KunyszKatarzyna Paluch 0001The dynamics of rank-maximal and popular matchings.Theor. Comput. Sci.9721140832023Journal Articlesclosedjournals/tcs/GhosalKP2310.1016/J.TCS.2023.114083https://doi.org/10.1016/j.tcs.2023.114083https://dblp.org/rec/journals/tcs/GhosalKP23URL#252068Frédéric GiroireStéphane PérennesThibaud TrollietA random growth model with any real or theoretical degree distribution.Theor. Comput. Sci.940Part36-512023Journal Articlesclosedjournals/tcs/GiroirePT2310.1016/J.TCS.2022.10.036https://doi.org/10.1016/j.tcs.2022.10.036https://dblp.org/rec/journals/tcs/GiroirePT23URL#252069Robert GlückTetsuo YokoyamaReversible computing from a programming language perspective.Theor. Comput. Sci.9531134292023Journal Articlesopenjournals/tcs/GluckY2310.1016/J.TCS.2022.06.010https://doi.org/10.1016/j.tcs.2022.06.010https://dblp.org/rec/journals/tcs/GluckY23URL#252070Jan GoedgebeurShenwei HuangYiao JuOwen D. MerkelColouring graphs with no induced six-vertex path or diamond.Theor. Comput. Sci.941278-2992023Journal Articlesclosedjournals/tcs/GoedgebeurHJM2310.1016/J.TCS.2022.11.020https://doi.org/10.1016/j.tcs.2022.11.020https://dblp.org/rec/journals/tcs/GoedgebeurHJM23URL#252071Paul W. GoldbergMatthew J. KatzmanLower bounds for the query complexity of equilibria in Lipschitz games.Theor. Comput. Sci.9621139312023Journal Articlesopenjournals/tcs/GoldbergK2310.1016/J.TCS.2023.113931https://doi.org/10.1016/j.tcs.2023.113931https://dblp.org/rec/journals/tcs/GoldbergK23URL#252072Paul W. GoldbergMatthew J. KatzmanPPAD-complete approximate pure Nash equilibria in Lipschitz games.Theor. Comput. Sci.9801142182023Journal Articlesclosedjournals/tcs/GoldbergK23a10.1016/J.TCS.2023.114218https://doi.org/10.1016/j.tcs.2023.114218https://dblp.org/rec/journals/tcs/GoldbergK23aURL#252073Massimiliano GoldwurmJianyi LinMarco VignatiLocal limit laws for symbol statistics in bicomponent rational models.Theor. Comput. Sci.9701140512023Journal Articlesopenjournals/tcs/GoldwurmLV2310.1016/J.TCS.2023.114051https://doi.org/10.1016/j.tcs.2023.114051https://dblp.org/rec/journals/tcs/GoldwurmLV23URL#252074Guilherme C. M. GomesBruno Porto MasquioPaulo E. D. PintoVinícius Fernandes dos SantosJayme Luiz SzwarcfiterDisconnected matchings.Theor. Comput. Sci.9561138212023Journal Articlesclosedjournals/tcs/GomesMPSS2310.1016/J.TCS.2023.113821https://doi.org/10.1016/j.tcs.2023.113821https://dblp.org/rec/journals/tcs/GomesMPSS23URL#252075Renzo GómezFlávio Keidi MiyazawaYoshiko WakabayashiImproved NP-hardness results for the minimum t-spanner problem on bounded-degree graphs.Theor. Comput. Sci.9471136912023Journal Articlesclosedjournals/tcs/GomezMW2310.1016/J.TCS.2023.113691https://doi.org/10.1016/j.tcs.2023.113691https://dblp.org/rec/journals/tcs/GomezMW23URL#252076Thorsten GötteChristina KolbChristian ScheidelerJulian WerthmannBeep-and-Sleep: Message and Energy Efficient Set Cover.Theor. Comput. Sci.9501137562023Journal Articlesclosedjournals/tcs/GotteKSW2310.1016/J.TCS.2023.113756https://doi.org/10.1016/j.tcs.2023.113756https://dblp.org/rec/journals/tcs/GotteKSW23URL#252077Georg GottlobMatthias LanzingerReinhard PichlerIgor RazgonFractional covers of hypergraphs with bounded multi-intersection.Theor. Comput. Sci.9791142042023Journal Articlesopenjournals/tcs/GottlobLPR2310.1016/J.TCS.2023.114204https://doi.org/10.1016/j.tcs.2023.114204https://dblp.org/rec/journals/tcs/GottlobLPR23URL#252078Dishant GoyalRagesh JaiswalTight FPT approximation for constrained k-center and k-supplier.Theor. Comput. Sci.940Part190-2082023Journal Articlesclosedjournals/tcs/GoyalJ2310.1016/J.TCS.2022.11.001https://doi.org/10.1016/j.tcs.2022.11.001https://dblp.org/rec/journals/tcs/GoyalJ23URL#252079Shuyang GuChuangen GaoJun HuangWeili Wu 0001Profit maximization in social networks and non-monotone DR-submodular maximization.Theor. Comput. Sci.9571138472023Journal Articlesclosedjournals/tcs/GuGHW2310.1016/J.TCS.2023.113847https://doi.org/10.1016/j.tcs.2023.113847https://dblp.org/rec/journals/tcs/GuGHW23URL#252080Jianxiong GuoXingjian DingTian Wang 0001Weijia Jia 0001Theoretical design of decentralized auction framework under mobile crowdsourcing environment.Theor. Comput. Sci.939250-2602023Journal Articlesclosedjournals/tcs/GuoDWJ2310.1016/J.TCS.2022.10.030https://doi.org/10.1016/j.tcs.2022.10.030https://dblp.org/rec/journals/tcs/GuoDWJ23URL#252081Litao GuoGülnaz Boruzanli EkinciConnectivity and super connectivity of folded hypercube-like networks.Theor. Comput. Sci.9761141512023Journal Articlesclosedjournals/tcs/GuoE2310.1016/J.TCS.2023.114151https://doi.org/10.1016/j.tcs.2023.114151https://dblp.org/rec/journals/tcs/GuoE23URL#252082Longkun GuoKewen LiaoDi Xiao 0005Pei YaoSubmodular maximization over data streams with differential privacy noise.Theor. Comput. Sci.9441136252023Journal Articlesclosedjournals/tcs/GuoLXY2310.1016/J.TCS.2022.11.011https://doi.org/10.1016/j.tcs.2022.11.011https://dblp.org/rec/journals/tcs/GuoLXY23URL#252083Sainan GuoRan MaYuefang SunXiaoyan Zhang 0001Yong Zhang 0001Online scheduling with deterioration and unexpected processor breakdown.Theor. Comput. Sci.9721140582023Journal Articlesclosedjournals/tcs/GuoMSZZ2310.1016/J.TCS.2023.114058https://doi.org/10.1016/j.tcs.2023.114058https://dblp.org/rec/journals/tcs/GuoMSZZ23URL#252084Sahab HajebiRamin JavadiOn the parameterized complexity of the acyclic matching problem.Theor. Comput. Sci.9581138622023Journal Articlesclosedjournals/tcs/HajebiJ2310.1016/J.TCS.2023.113862https://doi.org/10.1016/j.tcs.2023.113862https://dblp.org/rec/journals/tcs/HajebiJ23URL#252085Magnús M. HalldórssonAlexandre NolinSuperfast coloring in CONGEST via efficient color sampling.Theor. Comput. Sci.9481137112023Journal Articlesclosedjournals/tcs/HalldorssonN2310.1016/J.TCS.2023.113711https://doi.org/10.1016/j.tcs.2023.113711https://dblp.org/rec/journals/tcs/HalldorssonN23URL#252086Yo-Sub HanSang-Ki KoKai SalomaaDeciding path size of nondeterministic (and input-driven) pushdown automata.Theor. Comput. Sci.939170-1812023Journal Articlesclosedjournals/tcs/HanKS2310.1016/J.TCS.2022.10.023https://doi.org/10.1016/j.tcs.2022.10.023https://dblp.org/rec/journals/tcs/HanKS23URL#252087Kazuya HaraguchiHiroshi NagamochiPolynomial-delay enumeration algorithms in set systems.Theor. Comput. Sci.9631139632023Journal Articlesclosedjournals/tcs/HaraguchiN2310.1016/J.TCS.2023.113963https://doi.org/10.1016/j.tcs.2023.113963https://dblp.org/rec/journals/tcs/HaraguchiN23URL#252088Kenji HashimotoSebastian ManethCharacterizing attributed tree translations in terms of macro tree transducers.Theor. Comput. Sci.9631139432023Journal Articlesclosedjournals/tcs/HashimotoM2310.1016/J.TCS.2023.113943https://doi.org/10.1016/j.tcs.2023.113943https://dblp.org/rec/journals/tcs/HashimotoM23URL#252089Tatsuhiko HatanakaFelix HommelsheimTakehiro ItoYusuke Kobayashi 0001Moritz MühlenthalerAkira SuzukiFixed-parameter algorithms for graph constraint logic.Theor. Comput. Sci.9591138632023Journal Articlesclosedjournals/tcs/HatanakaHIKMS2310.1016/J.TCS.2023.113863https://doi.org/10.1016/j.tcs.2023.113863https://dblp.org/rec/journals/tcs/HatanakaHIKMS23URL#252090Yuqiao HeGuoliang Qiu 0001Chihao Zhang 0001Approximability of the complementarily symmetric Holant problems on cubic graphs.Theor. Comput. Sci.9751141402023Journal Articlesclosedjournals/tcs/HeQZ2310.1016/J.TCS.2023.114140https://doi.org/10.1016/j.tcs.2023.114140https://dblp.org/rec/journals/tcs/HeQZ23URL#252091Yuchen He 0006Chihao Zhang 0001Improved algorithms for bandit with graph feedback via regret decomposition.Theor. Comput. Sci.9791142002023Journal Articlesclosedjournals/tcs/HeZ2310.1016/J.TCS.2023.114200https://doi.org/10.1016/j.tcs.2023.114200https://dblp.org/rec/journals/tcs/HeZ23URL#252092Jonathan HeinsJakob BossekJanina PohlMoritz SeilerHeike TrautmannPascal KerschkeA study on the effects of normalized TSP features for automated algorithm selection.Theor. Comput. Sci.940Part123-1452023Journal Articlesclosedjournals/tcs/HeinsBPSTK2310.1016/J.TCS.2022.10.019https://doi.org/10.1016/j.tcs.2022.10.019https://dblp.org/rec/journals/tcs/HeinsBPSTK23URL#252093Michael A. HenningArti PandeyVikash TripathiAlgorithmic aspects of paired disjunctive domination in graphs.Theor. Comput. Sci.966-9671139902023Journal Articlesclosedjournals/tcs/HenningPT2310.1016/J.TCS.2023.113990https://doi.org/10.1016/j.tcs.2023.113990https://dblp.org/rec/journals/tcs/HenningPT23URL#252094Danny HermelinYuval ItzhakiHendrik MolterRolf NiedermeierTemporal interval cliques and independent sets.Theor. Comput. Sci.9611138852023Journal Articlesclosedjournals/tcs/HermelinIMN2310.1016/J.TCS.2023.113885https://doi.org/10.1016/j.tcs.2023.113885https://dblp.org/rec/journals/tcs/HermelinIMN23URL#252095Peter HertlingRemarks on the effective Jordan decomposition.Theor. Comput. Sci.940Part176-1882023Journal Articlesclosedjournals/tcs/Hertling2310.1016/J.TCS.2022.10.038https://doi.org/10.1016/j.tcs.2022.10.038https://dblp.org/rec/journals/tcs/Hertling23URL#252096Ross HorneSjouke MauwSemen YurkovWhen privacy fails, a formula describes an attack: A complete and compositional verification method for the applied π-calculus.Theor. Comput. Sci.9591138422023Journal Articlesclosedjournals/tcs/HorneMY2310.1016/J.TCS.2023.113842https://doi.org/10.1016/j.tcs.2023.113842https://dblp.org/rec/journals/tcs/HorneMY23URL#252097Florian HörschOn orientations maximizing total arc-connectivity.Theor. Comput. Sci.9781141762023Journal Articlesclosedjournals/tcs/Horsch2310.1016/J.TCS.2023.114176https://doi.org/10.1016/j.tcs.2023.114176https://dblp.org/rec/journals/tcs/Horsch23URL#252098Michal HospodárViktor OlejárThe cut operation in subclasses of convex languages.Theor. Comput. Sci.9691140502023Journal Articlesclosedjournals/tcs/HospodarO2310.1016/J.TCS.2023.114050https://doi.org/10.1016/j.tcs.2023.114050https://dblp.org/rec/journals/tcs/HospodarO23URL#252099Michal HospodárViktor OlejárNondeterministic operational complexity in subregular languages.Theor. Comput. Sci.9721140752023Journal Articlesclosedjournals/tcs/HospodarO23a10.1016/J.TCS.2023.114075https://doi.org/10.1016/j.tcs.2023.114075https://dblp.org/rec/journals/tcs/HospodarO23aURL#252100Chien-Chung HuangFrançois SellierMatroid-constrained vertex cover.Theor. Comput. Sci.9651139772023Journal Articlesclosedjournals/tcs/HuangS2310.1016/J.TCS.2023.113977https://doi.org/10.1016/j.tcs.2023.113977https://dblp.org/rec/journals/tcs/HuangS23URL#252101Ruo-Wei HungRestrained domination and its variants in extended supergrid graphs.Theor. Comput. Sci.9561138322023Journal Articlesclosedjournals/tcs/Hung2310.1016/J.TCS.2023.113832https://doi.org/10.1016/j.tcs.2023.113832https://dblp.org/rec/journals/tcs/Hung23URL#252102Ethan HunterJessica A. EnrightAlice Miller 0001Feasibility assessments of a dynamical approach to compartmental modelling on graphs: Scaling limits and performance analysis.Theor. Comput. Sci.9801142472023Journal Articlesclosedjournals/tcs/HunterEM2310.1016/J.TCS.2023.114247https://doi.org/10.1016/j.tcs.2023.114247https://dblp.org/rec/journals/tcs/HunterEM23URL#252103Miriam Di IanniOpinion evolution among friends and foes: The deterministic majority rule.Theor. Comput. Sci.9591138752023Journal Articlesopenjournals/tcs/Ianni2310.1016/J.TCS.2023.113875https://doi.org/10.1016/j.tcs.2023.113875https://dblp.org/rec/journals/tcs/Ianni23URL#252104Yusuke InoueKenji HashimotoHiroyuki SekiAn ambiguity hierarchy of weighted context-free grammars.Theor. Comput. Sci.9741141122023Journal Articlesopenjournals/tcs/InoueHS2310.1016/J.TCS.2023.114112https://doi.org/10.1016/j.tcs.2023.114112https://dblp.org/rec/journals/tcs/InoueHS23URL#252105Stavros D. IoannidisBart de KeijzerCarmine VentreFinancial networks with singleton liability priorities.Theor. Comput. Sci.9631139652023Journal Articlesopenjournals/tcs/IoannidisKV2310.1016/J.TCS.2023.113965https://doi.org/10.1016/j.tcs.2023.113965https://dblp.org/rec/journals/tcs/IoannidisKV23URL#252106Florentin IpateIonut-Mihai NiculescuRaluca LefticaruSavas KonurMarian Gheorghe 0001A model learning based testing approach for kernel P systems.Theor. Comput. Sci.9651139752023Journal Articlesopenjournals/tcs/IpateNLK02310.1016/J.TCS.2023.113975https://doi.org/10.1016/j.tcs.2023.113975https://dblp.org/rec/journals/tcs/IpateNLK023URL#252107Gabriel IstrateCosmin BonchisA parametric worst-case approach to fairness in cooperative games with transferable utility.Theor. Comput. Sci.940Part189-2052023Journal Articlesclosedjournals/tcs/IstrateB2310.1016/J.TCS.2022.10.039https://doi.org/10.1016/j.tcs.2022.10.039https://dblp.org/rec/journals/tcs/IstrateB23URL#252108Takehiro ItoYuni IwamasaYasuaki KobayashiYu NakahataYota OtachiKunihiro WasaReconfiguring (non-spanning) arborescences.Theor. Comput. Sci.943131-1412023Journal Articlesclosedjournals/tcs/ItoIKNOW2310.1016/J.TCS.2022.12.007https://doi.org/10.1016/j.tcs.2022.12.007https://dblp.org/rec/journals/tcs/ItoIKNOW23URL#252109Takehiro ItoNaonori KakimuraNaoyuki KamiyamaYusuke Kobayashi 0001Yuta NozakiYoshio OkamotoKenta OzekiOn reachable assignments under dichotomous preferences.Theor. Comput. Sci.9791141962023Journal Articlesclosedjournals/tcs/ItoKKKNOO2310.1016/J.TCS.2023.114196https://doi.org/10.1016/j.tcs.2023.114196https://dblp.org/rec/journals/tcs/ItoKKKNOO23URL#252110Takehiro ItoJun KawaharaShin-ichi MinatoYota OtachiToshiki SaitohAkira SuzukiRyuhei UeharaTakeaki UnoKatsuhisa YamanakaRyo YoshinakaSorting balls and water: Equivalence and computational complexity.Theor. Comput. Sci.9781141582023Journal Articlesclosedjournals/tcs/ItoKMOSSUUYY2310.1016/J.TCS.2023.114158https://doi.org/10.1016/j.tcs.2023.114158https://dblp.org/rec/journals/tcs/ItoKMOSSUUYY23URL#252111Duri JanettJohannes LenglerTwo-dimensional drift analysis: Optimizing two functions simultaneously can be hard.Theor. Comput. Sci.9711140722023Journal Articlesopenjournals/tcs/JanettL2310.1016/J.TCS.2023.114072https://doi.org/10.1016/j.tcs.2023.114072https://dblp.org/rec/journals/tcs/JanettL23URL#252112G. JaykrishnanAsaf LevinEPTAS for the dual of splittable bin packing with cardinality constraint.Theor. Comput. Sci.9791142022023Journal Articlesclosedjournals/tcs/JaykrishnanL2310.1016/J.TCS.2023.114202https://doi.org/10.1016/j.tcs.2023.114202https://dblp.org/rec/journals/tcs/JaykrishnanL23URL#252113Suxia JiangBowen XuTao LiangXiaoliang ZhuTingfang WuNumerical spiking neural P systems with production functions on synapses.Theor. Comput. Sci.940Part80-892023Journal Articlesclosedjournals/tcs/JiangXLZW2310.1016/J.TCS.2022.09.021https://doi.org/10.1016/j.tcs.2022.09.021https://dblp.org/rec/journals/tcs/JiangXLZW23URL#252114Naoyuki KamiyamaPareto efficient matchings with pairwise preferences.Theor. Comput. Sci.9481137072023Journal Articlesclosedjournals/tcs/Kamiyama2310.1016/J.TCS.2023.113707https://doi.org/10.1016/j.tcs.2023.113707https://dblp.org/rec/journals/tcs/Kamiyama23URL#252115Panagiotis KanellopoulosMaria KyropoulouAlexandros A. VoudourisNot all strangers are the same: The impact of tolerance in Schelling games.Theor. Comput. Sci.9711140652023Journal Articlesopenjournals/tcs/KanellopoulosKV2310.1016/J.TCS.2023.114065https://doi.org/10.1016/j.tcs.2023.114065https://dblp.org/rec/journals/tcs/KanellopoulosKV23URL#252116Sravanthi KantamaneniA. CharlesT. Ranga BabuSpeech enhancement with noise estimation and filtration using deep learning models.Theor. Comput. Sci.94114-282023Journal Articlesclosedjournals/tcs/KantamaneniCB2310.1016/J.TCS.2022.08.017https://doi.org/10.1016/j.tcs.2022.08.017https://dblp.org/rec/journals/tcs/KantamaneniCB23URL#252117Lila KariEditorial.Theor. Comput. Sci.940Part12023Journal Articlesclosedjournals/tcs/Kari2310.1016/S0304-3975(22)00698-3https://doi.org/10.1016/S0304-3975(22)00698-3https://dblp.org/rec/journals/tcs/Kari23URL#252118Neel KariaFaraaz MallickPalash DeyHow hard is safe bribery?Theor. Comput. Sci.9791141562023Journal Articlesclosedjournals/tcs/KariaMD2310.1016/J.TCS.2023.114156https://doi.org/10.1016/j.tcs.2023.114156https://dblp.org/rec/journals/tcs/KariaMD23URL#252119Juha KärkkäinenMarcin PiatkowskiSimon J. PuglisiString inference from longest-common-prefix array.Theor. Comput. Sci.942180-1992023Journal Articlesclosedjournals/tcs/KarkkainenPP2310.1016/J.TCS.2022.11.032https://doi.org/10.1016/j.tcs.2022.11.032https://dblp.org/rec/journals/tcs/KarkkainenPP23URL#252120G. S. KarthickP. B. PankajavalliChronic obstructive pulmonary disease prediction using Internet of things-spiro system and fuzzy-based quantum neural network classifier.Theor. Comput. Sci.94155-762023Journal Articlesclosedjournals/tcs/KarthickP2310.1016/J.TCS.2022.08.021https://doi.org/10.1016/j.tcs.2022.08.021https://dblp.org/rec/journals/tcs/KarthickP23URL#252121Danish KashaevRichard SantiagoA simple optimal contention resolution scheme for uniform matroids.Theor. Comput. Sci.940Part81-962023Journal Articlesopenjournals/tcs/KashaevS2310.1016/J.TCS.2022.10.042https://doi.org/10.1016/j.tcs.2022.10.042https://dblp.org/rec/journals/tcs/KashaevS23URL#252122Marc KaufmannMaxime LarcherJohannes LenglerXun ZouSelf-adjusting population sizes for the (1,λ)-EA on monotone functions.Theor. Comput. Sci.9791141812023Journal Articlesopenjournals/tcs/KaufmannLLZ2310.1016/J.TCS.2023.114181https://doi.org/10.1016/j.tcs.2023.114181https://dblp.org/rec/journals/tcs/KaufmannLLZ23URL#252123Sungmin KimYo-Sub HanSang-Ki KoKai SalomaaOn Simon's congruence closure of a string.Theor. Comput. Sci.9721140782023Journal Articlesclosedjournals/tcs/KimHKS2310.1016/J.TCS.2023.114078https://doi.org/10.1016/j.tcs.2023.114078https://dblp.org/rec/journals/tcs/KimHKS23URL#252124Evangelos KipouridisPaul G. SpirakisKostas TsichlasThreshold-based network structural dynamics.Theor. Comput. Sci.9441136692023Journal Articlesclosedjournals/tcs/KipouridisST2310.1016/J.TCS.2022.12.019https://doi.org/10.1016/j.tcs.2022.12.019https://dblp.org/rec/journals/tcs/KipouridisST23URL#252125Dominique KomanderCarolin RehsTwin-distance-hereditary digraphs.Theor. Comput. Sci.9681140092023Journal Articlesclosedjournals/tcs/KomanderR2310.1016/J.TCS.2023.114009https://doi.org/10.1016/j.tcs.2023.114009https://dblp.org/rec/journals/tcs/KomanderR23URL#252126Stavros KonstantinidisAntónio MachiaveloNelma MoreiraRogério ReisOn the average complexity of partial derivative transducers.Theor. Comput. Sci.9561138302023Journal Articlesopenjournals/tcs/KonstantinidisMMR2310.1016/J.TCS.2023.113830https://doi.org/10.1016/j.tcs.2023.113830https://dblp.org/rec/journals/tcs/KonstantinidisMMR23URL#252127Stavros KonstantinidisMitja MastnakNelma MoreiraRogério ReisApproximate NFA universality and related problems motivated by information theory.Theor. Comput. Sci.9721140762023Journal Articlesclosedjournals/tcs/KonstantinidisMMR23a10.1016/J.TCS.2023.114076https://doi.org/10.1016/j.tcs.2023.114076https://dblp.org/rec/journals/tcs/KonstantinidisMMR23aURL#252128Nils KöppHelmut SchwichtenbergLookahead analysis in exact real arithmetic with logical methods.Theor. Comput. Sci.943171-1862023Journal Articlesclosedjournals/tcs/KoppS2310.1016/J.TCS.2022.10.003https://doi.org/10.1016/j.tcs.2022.10.003https://dblp.org/rec/journals/tcs/KoppS23URL#252129Johan KopraRapid left expansivity, a commonality between Wolfram's Rule 30 and powers of p/q.Theor. Comput. Sci.9461136682023Journal Articlesopenjournals/tcs/Kopra2310.1016/J.TCS.2022.12.018https://doi.org/10.1016/j.tcs.2022.12.018https://dblp.org/rec/journals/tcs/Kopra23URL#252130Nicolai KrausFredrik Nordvall ForsbergChuangjie XuType-theoretic approaches to ordinals.Theor. Comput. Sci.9571138432023Journal Articlesclosedjournals/tcs/KrausFX2310.1016/J.TCS.2023.113843https://doi.org/10.1016/j.tcs.2023.113843https://dblp.org/rec/journals/tcs/KrausFX23URL#252131Narendra KumarSiddhartha Siddhiprada BhoiAbhay Kumar SinghA study of primer design with w-constacyclic shift over F4.Theor. Comput. Sci.9601139252023Journal Articlesclosedjournals/tcs/KumarBS2310.1016/J.TCS.2023.113925https://doi.org/10.1016/j.tcs.2023.113925https://dblp.org/rec/journals/tcs/KumarBS23URL#252132Orna KupfermanAsaf PetruschkaLazy regular sensing.Theor. Comput. Sci.9711140572023Journal Articlesclosedjournals/tcs/KupfermanP2310.1016/J.TCS.2023.114057https://doi.org/10.1016/j.tcs.2023.114057https://dblp.org/rec/journals/tcs/KupfermanP23URL#252133Martin KutribUwe Meyer 0003Syntax checking either way.Theor. Comput. Sci.966-9671140002023Journal Articlesclosedjournals/tcs/Kutrib02310.1016/J.TCS.2023.114000https://doi.org/10.1016/j.tcs.2023.114000https://dblp.org/rec/journals/tcs/Kutrib023URL#252134Martin KutribAndreas MalcherCarlo MereghettiBeatrice PalanoIterated uniform finite-state transducers on unary languages.Theor. Comput. Sci.9691140492023Journal Articlesopenjournals/tcs/KutribMMP2310.1016/J.TCS.2023.114049https://doi.org/10.1016/j.tcs.2023.114049https://dblp.org/rec/journals/tcs/KutribMMP23URL#252135Martin KutribMatthias WendlandtState complexity of finite partial languages.Theor. Comput. Sci.966-9671140012023Journal Articlesclosedjournals/tcs/KutribW2310.1016/J.TCS.2023.114001https://doi.org/10.1016/j.tcs.2023.114001https://dblp.org/rec/journals/tcs/KutribW23URL#252136Anthony LabarreSorting by prefix block-interchanges.Theor. Comput. Sci.9581138572023Journal Articlesclosedjournals/tcs/Labarre2310.1016/J.TCS.2023.113857https://doi.org/10.1016/j.tcs.2023.113857https://dblp.org/rec/journals/tcs/Labarre23URL#252137Eduardo Sany LaberLucas MurtinhoNearly tight bounds on the price of explainability for the k-center and the maximum-spacing clustering problems.Theor. Comput. Sci.9491137442023Journal Articlesclosedjournals/tcs/LaberM2310.1016/J.TCS.2023.113744https://doi.org/10.1016/j.tcs.2023.113744https://dblp.org/rec/journals/tcs/LaberM23URL#252138Takkolu Sree LakshmiMuthukumarasamy GovindarajanAsadi SreenivasuluMalware visual resemblance analysis with minimum losses using Siamese neural networks.Theor. Comput. Sci.943219-2292023Journal Articlesclosedjournals/tcs/LakshmiGS2310.1016/J.TCS.2022.07.018https://doi.org/10.1016/j.tcs.2022.07.018https://dblp.org/rec/journals/tcs/LakshmiGS23URL#252139Ting LanHuazhong LüHamiltonian cycles of balanced hypercube with more faulty edges.Theor. Comput. Sci.9471137082023Journal Articlesclosedjournals/tcs/LanL2310.1016/J.TCS.2023.113708https://doi.org/10.1016/j.tcs.2023.113708https://dblp.org/rec/journals/tcs/LanL23URL#252140Rongling LangHui Lei 0002Junxue Zhang 0002On the saturation spectrum of families of cycle subdivisions.Theor. Comput. Sci.9621139412023Journal Articlesclosedjournals/tcs/LangLZ2310.1016/J.TCS.2023.113941https://doi.org/10.1016/j.tcs.2023.113941https://dblp.org/rec/journals/tcs/LangLZ23URL#252141Matthias LanzingerTractability beyond β-acyclicity for conjunctive queries with negation and SAT.Theor. Comput. Sci.942276-2962023Journal Articlesopenjournals/tcs/Lanzinger2310.1016/J.TCS.2022.12.002https://doi.org/10.1016/j.tcs.2022.12.002https://dblp.org/rec/journals/tcs/Lanzinger23URL#252142V. L. Padma LathaN. Sudhakar ReddyA. Suresh BabuOptimizing Scalability and Availability of Cloud Based Software Services Using Modified Scale Rate Limiting Algorithm.Theor. Comput. Sci.943230-2402023Journal Articlesclosedjournals/tcs/LathaRB2310.1016/J.TCS.2022.07.019https://doi.org/10.1016/j.tcs.2022.07.019https://dblp.org/rec/journals/tcs/LathaRB23URL#252143Jean-Christophe LéchenetNikolai KosmatovPascale Le GallEfficient computation of arbitrary control dependencies.Theor. Comput. Sci.9691140292023Journal Articlesclosedjournals/tcs/LechenetKG2310.1016/J.TCS.2023.114029https://doi.org/10.1016/j.tcs.2023.114029https://dblp.org/rec/journals/tcs/LechenetKG23URL#252144Thierry LecroqSvetlana PuzyninaTCS special issue: Combinatorics on Words - WORDS 2021.Theor. Comput. Sci.9521136882023Journal Articlesclosedjournals/tcs/LecroqP2310.1016/J.TCS.2023.113688https://doi.org/10.1016/j.tcs.2023.113688https://dblp.org/rec/journals/tcs/LecroqP23URL#252145Per Kristian LehreAneta NeumannChao Qian 0001Special Issue on Theoretical Foundations of Evolutionary Computation.Theor. Comput. Sci.9501137852023Journal Articlesclosedjournals/tcs/LehreNQ2310.1016/J.TCS.2023.113785https://doi.org/10.1016/j.tcs.2023.113785https://dblp.org/rec/journals/tcs/LehreNQ23URL#252146William J. LenhartGiuseppe LiottaMutual witness Gabriel drawings of complete bipartite graphs.Theor. Comput. Sci.9741141152023Journal Articlesopenjournals/tcs/LenhartL2310.1016/J.TCS.2023.114115https://doi.org/10.1016/j.tcs.2023.114115https://dblp.org/rec/journals/tcs/LenhartL23URL#252147Nikos LeonardosAris PagourtzisIoannis PapaioannouByzantine fault tolerant symmetric-persistent circle evacuation.Theor. Comput. Sci.9561138392023Journal Articlesclosedjournals/tcs/LeonardosPP2310.1016/J.TCS.2023.113839https://doi.org/10.1016/j.tcs.2023.113839https://dblp.org/rec/journals/tcs/LeonardosPP23URL#252148Yiming LiShengli Liu 0001Shuai Han 0001Dawu GuJian Weng 0001Simulatable verifiable random function from the LWE assumption.Theor. Comput. Sci.9571138262023Journal Articlesclosedjournals/tcs/LiLHGW2310.1016/J.TCS.2023.113826https://doi.org/10.1016/j.tcs.2023.113826https://dblp.org/rec/journals/tcs/LiLHGW23URL#252149Weifeng LiLongxin LinZhen Zhang 0017Shuqiang HuangThe family of generalized variational network of cube-connected cycles.Theor. Comput. Sci.9441136722023Journal Articlesclosedjournals/tcs/LiLZH2310.1016/J.TCS.2022.12.022https://doi.org/10.1016/j.tcs.2022.12.022https://dblp.org/rec/journals/tcs/LiLZH23URL#252150Fu LiC. Gregory PlaxtonVaibhav B. SinhaThe obnoxious facility location game with dichotomous preferences.Theor. Comput. Sci.9611139302023Journal Articlesclosedjournals/tcs/LiPS2310.1016/J.TCS.2023.113930https://doi.org/10.1016/j.tcs.2023.113930https://dblp.org/rec/journals/tcs/LiPS23URL#252151Weian LiQi Qi 0003Changjun WangChangyuan YuOptimally integrating ad auction into e-commerce platforms.Theor. Comput. Sci.9761141412023Journal Articlesclosedjournals/tcs/LiQWY2310.1016/J.TCS.2023.114141https://doi.org/10.1016/j.tcs.2023.114141https://dblp.org/rec/journals/tcs/LiQWY23URL#252152Yanyan LiBosheng SongXiangxiang ZengSpiking neural P systems with weights and delays on synapses.Theor. Comput. Sci.9681140282023Journal Articlesclosedjournals/tcs/LiSZ2310.1016/J.TCS.2023.114028https://doi.org/10.1016/j.tcs.2023.114028https://dblp.org/rec/journals/tcs/LiSZ23URL#252153Wanting LiYongcai WangDeying Li 0001Xiaojia XuA robust map matching method by considering memorized multiple matching candidates.Theor. Comput. Sci.941104-1202023Journal Articlesclosedjournals/tcs/LiWLX2310.1016/J.TCS.2022.10.032https://doi.org/10.1016/j.tcs.2022.10.032https://dblp.org/rec/journals/tcs/LiWLX23URL#252154Jiangkun LiPeng Zhang 0008New approximation algorithms for the rooted Budgeted Cycle Cover problem.Theor. Comput. Sci.940Part283-2952023Journal Articlesclosedjournals/tcs/LiZ2310.1016/J.TCS.2022.11.009https://doi.org/10.1016/j.tcs.2022.11.009https://dblp.org/rec/journals/tcs/LiZ23URL#252155Ping LiShurong ZhangXiaomin HuWeihua YangStructural diagnosability of hypercubes under the PMC and MM* models.Theor. Comput. Sci.9801142312023Journal Articlesclosedjournals/tcs/LiZHY2310.1016/J.TCS.2023.114231https://doi.org/10.1016/j.tcs.2023.114231https://dblp.org/rec/journals/tcs/LiZHY23URL#252156Junran LichenLijian CaiJianping LiSuding LiuPengxiang PanWencheng WangDelay-constrained minimum shortest path trees and related problems.Theor. Comput. Sci.941191-2012023Journal Articlesclosedjournals/tcs/LichenCLLPW2310.1016/J.TCS.2022.11.014https://doi.org/10.1016/j.tcs.2022.11.014https://dblp.org/rec/journals/tcs/LichenCLLPW23URL#252157Thomas LidbetterYifan XieThe search and rescue game on a cycle.Theor. Comput. Sci.966-9671140162023Journal Articlesclosedjournals/tcs/LidbetterX2310.1016/J.TCS.2023.114016https://doi.org/10.1016/j.tcs.2023.114016https://dblp.org/rec/journals/tcs/LidbetterX23URL#252158Carlos V. G. C. LimaThiago MarcilonNicolas Almeida MartinsRudini Menezes SampaioThe connected greedy coloring game.Theor. Comput. Sci.940Part1-132023Journal Articlesclosedjournals/tcs/LimaMMS2310.1016/J.TCS.2022.10.034https://doi.org/10.1016/j.tcs.2022.10.034https://dblp.org/rec/journals/tcs/LimaMMS23URL#252159Bi-Shiang LinKuo-Si HuangChang-Biau YangLinear-space S-table algorithms for the longest common subsequence problem.Theor. Comput. Sci.9641139442023Journal Articlesclosedjournals/tcs/LinHY2310.1016/J.TCS.2023.113944https://doi.org/10.1016/j.tcs.2023.113944https://dblp.org/rec/journals/tcs/LinHY23URL#252160Xujun LiuOlgica MilenkovicGeorge V. MoustakidesQuery-based selection of optimal candidates under the Mallows model.Theor. Comput. Sci.9791142062023Journal Articlesclosedjournals/tcs/LiuMM2310.1016/J.TCS.2023.114206https://doi.org/10.1016/j.tcs.2023.114206https://dblp.org/rec/journals/tcs/LiuMM23URL#252161Depeng LiuBow-Yaw WangChen FuLijun Zhang 0001Model checking differentially private properties.Theor. Comput. Sci.943153-1702023Journal Articlesclosedjournals/tcs/LiuWFZ2310.1016/J.TCS.2022.10.002https://doi.org/10.1016/j.tcs.2022.10.002https://dblp.org/rec/journals/tcs/LiuWFZ23URL#252162Xiang Liu 0014Weiwei Wu 0001Wanyuan WangYuhang XuXiumin WangHelei CuiBudget-feasible Sybil-proof mechanisms for crowdsensing.Theor. Comput. Sci.9701139782023Journal Articlesclosedjournals/tcs/LiuWWXWC2310.1016/J.TCS.2023.113978https://doi.org/10.1016/j.tcs.2023.113978https://dblp.org/rec/journals/tcs/LiuWWXWC23URL#252163Xiaoqing LiuShuming ZhouEddie Cheng 0001Hong ZhangReliability analysis of the generalized balanced hypercube.Theor. Comput. Sci.942297-3112023Journal Articlesclosedjournals/tcs/LiuZCZ2310.1016/J.TCS.2022.12.003https://doi.org/10.1016/j.tcs.2022.12.003https://dblp.org/rec/journals/tcs/LiuZCZ23URL#252164Xiyu Liu 0001Yuzhen ZhaoLiping WangNonlinear neural-like P model for time series classification.Theor. Comput. Sci.9701140552023Journal Articlesclosedjournals/tcs/LiuZW2310.1016/J.TCS.2023.114055https://doi.org/10.1016/j.tcs.2023.114055https://dblp.org/rec/journals/tcs/LiuZW23URL#252165Hongxi LiuMingzu ZhangXiaowei XuMany-to-many edge-disjoint paths in (n,k)-enhanced hypercube under three link-faulty hypotheses.Theor. Comput. Sci.9571138552023Journal Articlesclosedjournals/tcs/LiuZX2310.1016/J.TCS.2023.113855https://doi.org/10.1016/j.tcs.2023.113855https://dblp.org/rec/journals/tcs/LiuZX23URL#252166Szymon LopaciukDaniel ReidenbachOn Billaud words and their companions.Theor. Comput. Sci.940Part231-2532023Journal Articlesopenjournals/tcs/LopaciukR2310.1016/J.TCS.2022.11.004https://doi.org/10.1016/j.tcs.2022.11.004https://dblp.org/rec/journals/tcs/LopaciukR23URL#252167Chuanwen LuoNing LiuYunan HouYi Hong 0003Zhibo Chen 0004Deying Li 0001Trajectory optimization of laser-charged UAV to minimize the average age of information for wireless rechargeable sensor network.Theor. Comput. Sci.9451136802023Journal Articlesclosedjournals/tcs/LuoLHHCL2310.1016/J.TCS.2022.12.030https://doi.org/10.1016/j.tcs.2022.12.030https://dblp.org/rec/journals/tcs/LuoLHHCL23URL#252168Oliver A. S. LyonKai SalomaaThe nondeterministic state complexity of the site-directed deletion language operation.Theor. Comput. Sci.9681139992023Journal Articlesclosedjournals/tcs/LyonS2310.1016/J.TCS.2023.113999https://doi.org/10.1016/j.tcs.2023.113999https://dblp.org/rec/journals/tcs/LyonS23URL#252169Steven LyonsRaju RangaswamiNing XieFinding optimal non-datapath caching strategies via network flow.Theor. Comput. Sci.9451136862023Journal Articlesclosedjournals/tcs/LyonsRX2310.1016/J.TCS.2022.12.036https://doi.org/10.1016/j.tcs.2022.12.036https://dblp.org/rec/journals/tcs/LyonsRX23URL#252170Sophie MacDonaldThe road problem and homomorphisms of directed graphs.Theor. Comput. Sci.9681139812023Journal Articlesclosedjournals/tcs/MacDonald2310.1016/J.TCS.2023.113981https://doi.org/10.1016/j.tcs.2023.113981https://dblp.org/rec/journals/tcs/MacDonald23URL#252171Roey MagenMoni NaorMirror games against an open book player.Theor. Comput. Sci.9761141592023Journal Articlesclosedjournals/tcs/MagenN2310.1016/J.TCS.2023.114159https://doi.org/10.1016/j.tcs.2023.114159https://dblp.org/rec/journals/tcs/MagenN23URL#252172Subhrangsu MandalAnisur Rahaman MollaWilliam K. Moses Jr.Efficient live exploration of a dynamic ring with mobile robots.Theor. Comput. Sci.9801142012023Journal Articlesclosedjournals/tcs/MandalMM2310.1016/J.TCS.2023.114201https://doi.org/10.1016/j.tcs.2023.114201https://dblp.org/rec/journals/tcs/MandalMM23URL#252173Barnaby MartinDaniël PaulusmaSiani SmithErik Jan van LeeuwenFew induced disjoint paths for H-free graphs.Theor. Comput. Sci.939182-1932023Journal Articlesclosedjournals/tcs/MartinPSL2310.1016/J.TCS.2022.10.024https://doi.org/10.1016/j.tcs.2022.10.024https://dblp.org/rec/journals/tcs/MartinPSL23URL#252174Virginia Ardévol MartínezMarco CaoduroLaurent FeuilloleyJonathan NarboniPegah PournajafiJean-Florent RaymondA lower bound for constant-size local certification.Theor. Comput. Sci.9711140682023Journal Articlesclosedjournals/tcs/MartinezCFNPR2310.1016/J.TCS.2023.114068https://doi.org/10.1016/j.tcs.2023.114068https://dblp.org/rec/journals/tcs/MartinezCFNPR23URL#252175Olga Martynova 0001Alexander OkhotinHomomorphisms and inverse homomorphisms on graph-walking automata.Theor. Comput. Sci.9791141972023Journal Articlesclosedjournals/tcs/MartynovaO2310.1016/J.TCS.2023.114197https://doi.org/10.1016/j.tcs.2023.114197https://dblp.org/rec/journals/tcs/MartynovaO23URL#252176Matej MihelcicAdrian Satja KurdijaOn the complexity of redescription mining.Theor. Comput. Sci.9441136732023Journal Articlesclosedjournals/tcs/MihelcicK2310.1016/J.TCS.2022.12.023https://doi.org/10.1016/j.tcs.2022.12.023https://dblp.org/rec/journals/tcs/MihelcicK23URL#252177Ko MinamisawaRyuhei UeharaMasao HaraMathematical characterizations and computational complexity of anti-slide puzzles.Theor. Comput. Sci.939216-2262023Journal Articlesopenjournals/tcs/MinamisawaUH2310.1016/J.TCS.2022.10.026https://doi.org/10.1016/j.tcs.2022.10.026https://dblp.org/rec/journals/tcs/MinamisawaUH23URL#252178Daniel Misselbeck-WesselPeter Schuster 0001Radical theory of Scott-open filters.Theor. Comput. Sci.9451136772023Journal Articlesclosedjournals/tcs/MisselbeckWesselS2310.1016/J.TCS.2022.12.027https://doi.org/10.1016/j.tcs.2022.12.027https://dblp.org/rec/journals/tcs/MisselbeckWesselS23URL#252179Kazuki MitaniTakuya MienoKazuhisa SetoTakashi HoriyamaFinding top-k longest palindromes in substrings.Theor. Comput. Sci.9791141832023Journal Articlesclosedjournals/tcs/MitaniMSH2310.1016/J.TCS.2023.114183https://doi.org/10.1016/j.tcs.2023.114183https://dblp.org/rec/journals/tcs/MitaniMSH23URL#252180Dario Della MonicaAngelo MontanariPietro SalaAn interval temporal logic characterization of extended ω-regular languages.Theor. Comput. Sci.9621139292023Journal Articlesclosedjournals/tcs/MonicaMS2310.1016/J.TCS.2023.113929https://doi.org/10.1016/j.tcs.2023.113929https://dblp.org/rec/journals/tcs/MonicaMS23URL#252181Fabrizio MontecchianiGiacomo OrtaliTommaso PiselliAlessandra TappiniOn the parameterized complexity of s-club cluster deletion problems.Theor. Comput. Sci.9691140412023Journal Articlesopenjournals/tcs/MontecchianiOPT2310.1016/J.TCS.2023.114041https://doi.org/10.1016/j.tcs.2023.114041https://dblp.org/rec/journals/tcs/MontecchianiOPT23URL#252182Louis Penet de MonternoBernadette Charron-BostStephan MerzSynchronization modulo P in dynamic networks.Theor. Comput. Sci.942200-2122023Journal Articlesclosedjournals/tcs/MonternoCM2310.1016/J.TCS.2022.11.033https://doi.org/10.1016/j.tcs.2022.11.033https://dblp.org/rec/journals/tcs/MonternoCM23URL#252183Mikhail MrykhinAlexander OkhotinThe hardest language for grammars with context operators.Theor. Comput. Sci.9581138292023Journal Articlesclosedjournals/tcs/MrykhinO2310.1016/J.TCS.2023.113829https://doi.org/10.1016/j.tcs.2023.113829https://dblp.org/rec/journals/tcs/MrykhinO23URL#252184Andrea MunaroShizhou YangOn algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs.Theor. Comput. Sci.9551138252023Journal Articlesopenjournals/tcs/MunaroY2310.1016/J.TCS.2023.113825https://doi.org/10.1016/j.tcs.2023.113825https://dblp.org/rec/journals/tcs/MunaroY23URL#252185Takeshi NakaiKazumasa ShinagawaConstant-round linear-broadcast secure computation with penalties.Theor. Comput. Sci.9591138742023Journal Articlesopenjournals/tcs/NakaiS2310.1016/J.TCS.2023.113874https://doi.org/10.1016/j.tcs.2023.113874https://dblp.org/rec/journals/tcs/NakaiS23URL#252186Misa NakanishiA note on vertices contained in the minimum dominating set of a graph with minimum degree three.Theor. Comput. Sci.9561138312023Journal Articlesclosedjournals/tcs/Nakanishi2310.1016/J.TCS.2023.113831https://doi.org/10.1016/j.tcs.2023.113831https://dblp.org/rec/journals/tcs/Nakanishi23URL#252187Kittikorn NakprasitWatcharintorn RuksasakchaiPongpat SittitraiVertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles.Theor. Comput. Sci.941131-1392023Journal Articlesclosedjournals/tcs/NakprasitRS2310.1016/J.TCS.2022.11.007https://doi.org/10.1016/j.tcs.2022.11.007https://dblp.org/rec/journals/tcs/NakprasitRS23URL#252188Lizhen NanShiying WangLina ZhaoFault-tolerant strong Menger connectivity of modified bubble-sort graphs.Theor. Comput. Sci.9711140602023Journal Articlesclosedjournals/tcs/NanWZ2310.1016/J.TCS.2023.114060https://doi.org/10.1016/j.tcs.2023.114060https://dblp.org/rec/journals/tcs/NanWZ23URL#252189Jiehui NanHaiming ZhuShigang LiuHonggang HuAdaptively code-correlation robustness functions and its applications to private set intersection.Theor. Comput. Sci.9451136852023Journal Articlesclosedjournals/tcs/NanZLH2310.1016/J.TCS.2022.12.035https://doi.org/10.1016/j.tcs.2022.12.035https://dblp.org/rec/journals/tcs/NanZLH23URL#252190Kei NatsuiKenjiro TakazawaFinding popular branchings in vertex-weighted directed graphs.Theor. Comput. Sci.9531137992023Journal Articlesclosedjournals/tcs/NatsuiT2310.1016/J.TCS.2023.113799https://doi.org/10.1016/j.tcs.2023.113799https://dblp.org/rec/journals/tcs/NatsuiT23URL#252191Saadia NemmaouiMohamed BaslamBelaid BouikhaleneGame theory analysis of biometric systems market: Users choice VS service providers revenue.Theor. Comput. Sci.943142-1522023Journal Articlesclosedjournals/tcs/NemmaouiBB2310.1016/J.TCS.2022.12.004https://doi.org/10.1016/j.tcs.2022.12.004https://dblp.org/rec/journals/tcs/NemmaouiBB23URL#252192Jean NéraudLoopless algorithms to generate maximum length gray cycles wrt. k-character substitutions.Theor. Comput. Sci.9771141752023Journal Articlesclosedjournals/tcs/Neraud2310.1016/J.TCS.2023.114175https://doi.org/10.1016/j.tcs.2023.114175https://dblp.org/rec/journals/tcs/Neraud23URL#252193Gerard Ekembe NgondiSemantics of dynamic hiding in mobile UTP-CSP.Theor. Comput. Sci.9731140792023Journal Articlesopenjournals/tcs/Ngondi2310.1016/J.TCS.2023.114079https://doi.org/10.1016/j.tcs.2023.114079https://dblp.org/rec/journals/tcs/Ngondi23URL#252194Julian NickerlJacobo ToránPure Nash equilibria in a generalization of congestion games allowing resource failures.Theor. Comput. Sci.9631139332023Journal Articlesclosedjournals/tcs/NickerlT2310.1016/J.TCS.2023.113933https://doi.org/10.1016/j.tcs.2023.113933https://dblp.org/rec/journals/tcs/NickerlT23URL#252195Abderrahmane NitajWilly SusiloJoseph TonienA new attack on some RSA variants.Theor. Comput. Sci.9601138982023Journal Articlesclosedjournals/tcs/NitajST2310.1016/J.TCS.2023.113898https://doi.org/10.1016/j.tcs.2023.113898https://dblp.org/rec/journals/tcs/NitajST23URL#252196Ruichao NiuShujie ZhouMin Xu 0005Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks.Theor. Comput. Sci.9471137032023Journal Articlesclosedjournals/tcs/NiuZX2310.1016/J.TCS.2023.113703https://doi.org/10.1016/j.tcs.2023.113703https://dblp.org/rec/journals/tcs/NiuZX23URL#252197Baohua NiuShuming ZhouHong ZhangQifan ZhangFault tolerability analysis of folded crossed cubes based on g-component and g-good neighbor fault pattern.Theor. Comput. Sci.9591138582023Journal Articlesclosedjournals/tcs/NiuZZZ2310.1016/J.TCS.2023.113858https://doi.org/10.1016/j.tcs.2023.113858https://dblp.org/rec/journals/tcs/NiuZZZ23URL#252198Lhouari NourineSimon VilminHierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements.Theor. Comput. Sci.9691140302023Journal Articlesclosedjournals/tcs/NourineV2310.1016/J.TCS.2023.114030https://doi.org/10.1016/j.tcs.2023.114030https://dblp.org/rec/journals/tcs/NourineV23URL#252199Naoto OhsakaOn reconfigurability of target sets.Theor. Comput. Sci.942253-2752023Journal Articlesclosedjournals/tcs/Ohsaka2310.1016/J.TCS.2022.11.036https://doi.org/10.1016/j.tcs.2022.11.036https://dblp.org/rec/journals/tcs/Ohsaka23URL#252200Takashi OkumuraKoichi Wada 0001Xavier DéfagoOptimal L-algorithms for rendezvous of asynchronous mobile robots with external-lights.Theor. Comput. Sci.9791141982023Journal Articlesopenjournals/tcs/OkumuraWD2310.1016/J.TCS.2023.114198https://doi.org/10.1016/j.tcs.2023.114198https://dblp.org/rec/journals/tcs/OkumuraWD23URL#252201Amir OmeradzicHans-Georg BeyerProgress analysis of a multi-recombinative evolution strategy on the highly multimodal Rastrigin function.Theor. Comput. Sci.9781141792023Journal Articlesopenjournals/tcs/OmeradzicB2310.1016/J.TCS.2023.114179https://doi.org/10.1016/j.tcs.2023.114179https://dblp.org/rec/journals/tcs/OmeradzicB23URL#252202Jelle J. OostveenErik Jan van LeeuwenStreaming deletion problems parameterized by vertex cover.Theor. Comput. Sci.9791141782023Journal Articlesopenjournals/tcs/OostveenL2310.1016/J.TCS.2023.114178https://doi.org/10.1016/j.tcs.2023.114178https://dblp.org/rec/journals/tcs/OostveenL23URL#252203David Orellana-MartínLuis Valencia-CabreraMario J. Pérez-JiménezThe environment as a frontier of efficiency in tissue P systems with communication rules.Theor. Comput. Sci.9561138122023Journal Articlesopenjournals/tcs/OrellanaMartinVP2310.1016/J.TCS.2023.113812https://doi.org/10.1016/j.tcs.2023.113812https://dblp.org/rec/journals/tcs/OrellanaMartinVP23URL#252204Kaige PanStar fault tolerance of hypercube.Theor. Comput. Sci.9721140522023Journal Articlesclosedjournals/tcs/Pan2310.1016/J.TCS.2023.114052https://doi.org/10.1016/j.tcs.2023.114052https://dblp.org/rec/journals/tcs/Pan23URL#252205Zhiyong PanBaolei ChengJianxi FanYan Wang 0078Xiajing LiA parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks.Theor. Comput. Sci.94233-462023Journal Articlesclosedjournals/tcs/PanCFWL2310.1016/J.TCS.2022.11.023https://doi.org/10.1016/j.tcs.2022.11.023https://dblp.org/rec/journals/tcs/PanCFWL23URL#252206B. S. Panda 0001Juhi ChaudharyAcyclic matching in some subclasses of graphs.Theor. Comput. Sci.94336-492023Journal Articlesclosedjournals/tcs/PandaC2310.1016/J.TCS.2022.12.008https://doi.org/10.1016/j.tcs.2022.12.008https://dblp.org/rec/journals/tcs/PandaC23URL#252207Michele PasquaMarino MiculanAbU: A calculus for distributed event-driven programming with attribute-based interaction.Theor. Comput. Sci.9581138412023Journal Articlesopenjournals/tcs/PasquaM2310.1016/J.TCS.2023.113841https://doi.org/10.1016/j.tcs.2023.113841https://dblp.org/rec/journals/tcs/PasquaM23URL#252208Subhadra PerumallaSantanu ChatterjeeA. P. Siva KumarModelling of oppositional Aquila Optimizer with machine learning enabled secure access control in Internet of drones environment.Theor. Comput. Sci.94139-542023Journal Articlesclosedjournals/tcs/PerumallaCK2310.1016/J.TCS.2022.08.019https://doi.org/10.1016/j.tcs.2022.08.019https://dblp.org/rec/journals/tcs/PerumallaCK23URL#252209Jacques PeyriéreMoore machines duality.Theor. Comput. Sci.9511137742023Journal Articlesclosedjournals/tcs/Peyriere2310.1016/J.TCS.2023.113774https://doi.org/10.1016/j.tcs.2023.113774https://dblp.org/rec/journals/tcs/Peyriere23URL#252210Geevarghese PhilipM. R. RaniR. SubashiniOn computing the Hamiltonian index of graphs.Theor. Comput. Sci.940Part149-1792023Journal Articlesclosedjournals/tcs/PhilipRS2310.1016/J.TCS.2022.10.047https://doi.org/10.1016/j.tcs.2022.10.047https://dblp.org/rec/journals/tcs/PhilipRS23URL#252211Xuan Kien PhungOn invertible and stably reversible non-uniform cellular automata.Theor. Comput. Sci.940Part43-592023Journal Articlesclosedjournals/tcs/Phung2310.1016/J.TCS.2022.09.011https://doi.org/10.1016/j.tcs.2022.09.011https://dblp.org/rec/journals/tcs/Phung23URL#252212Lenny PittTuring Tumble is Turing-Complete.Theor. Comput. Sci.9481137342023Journal Articlesclosedjournals/tcs/Pitt2310.1016/J.TCS.2023.113734https://doi.org/10.1016/j.tcs.2023.113734https://dblp.org/rec/journals/tcs/Pitt23URL#252213Subhajit PramanickSai Vamshi SamalaDebasish PattanayakPartha Sarathi Mandal 0001Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots.Theor. Comput. Sci.9781141872023Journal Articlesclosedjournals/tcs/PramanickSPM2310.1016/J.TCS.2023.114187https://doi.org/10.1016/j.tcs.2023.114187https://dblp.org/rec/journals/tcs/PramanickSPM23URL#252214PriyamvadaB. S. Panda 0001Complexity and algorithms for injective edge coloring of graphs.Theor. Comput. Sci.9681140102023Journal Articlesclosedjournals/tcs/PriyamvadaP2310.1016/J.TCS.2023.114010https://doi.org/10.1016/j.tcs.2023.114010https://dblp.org/rec/journals/tcs/PriyamvadaP23URL#252215Chao Qian 0001Dan-Xuan LiuChao FengKe Tang 0001Multi-objective evolutionary algorithms are generally good: Maximizing monotone submodular functions over sequences.Theor. Comput. Sci.943241-2662023Journal Articlesclosedjournals/tcs/QianLFT2310.1016/J.TCS.2022.12.011https://doi.org/10.1016/j.tcs.2022.12.011https://dblp.org/rec/journals/tcs/QianLFT23URL#252216Hongwei QiaoJixiang MengTwo-disjoint-cycle-cover vertex pancyclicity of augmented cubes.Theor. Comput. Sci.9581138602023Journal Articlesclosedjournals/tcs/QiaoM2310.1016/J.TCS.2023.113860https://doi.org/10.1016/j.tcs.2023.113860https://dblp.org/rec/journals/tcs/QiaoM23URL#252217Arthur QueffelecOcan SankurFrançois SchwarzentruberComplexity of planning for connected agents in a partially known environment.Theor. Comput. Sci.941202-2202023Journal Articlesclosedjournals/tcs/QueffelecSS2310.1016/J.TCS.2022.11.015https://doi.org/10.1016/j.tcs.2022.11.015https://dblp.org/rec/journals/tcs/QueffelecSS23URL#252218Assaf RabinowitzDror RawitzOverflow management with self-eliminations.Theor. Comput. Sci.9481137322023Journal Articlesclosedjournals/tcs/RabinowitzR2310.1016/J.TCS.2023.113732https://doi.org/10.1016/j.tcs.2023.113732https://dblp.org/rec/journals/tcs/RabinowitzR23URL#252219Md. Saidur Rahman 0001Petra MutzelSlaminSpecial issue on selected papers from the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022).Theor. Comput. Sci.9731140952023Journal Articlesclosedjournals/tcs/RahmanMS2310.1016/J.TCS.2023.114095https://doi.org/10.1016/j.tcs.2023.114095https://dblp.org/rec/journals/tcs/RahmanMS23URL#252220Sergio RajsbaumA distributed computing perspective of unconditionally secure information transmission in Russian cards problems.Theor. Comput. Sci.9521137612023Journal Articlesclosedjournals/tcs/Rajsbaum2310.1016/J.TCS.2023.113761https://doi.org/10.1016/j.tcs.2023.113761https://dblp.org/rec/journals/tcs/Rajsbaum23URL#252221Antonio Ramírez-de-ArellanoDavid Orellana-MartínMario J. Pérez-JiménezGenerating, computing and recognizing with virus machines.Theor. Comput. Sci.9721140772023Journal Articlesopenjournals/tcs/RamirezdeArellanoOP2310.1016/J.TCS.2023.114077https://doi.org/10.1016/j.tcs.2023.114077https://dblp.org/rec/journals/tcs/RamirezdeArellanoOP23URL#252222Mikhail A. RaskinProtocols with constant local storage and unreliable communication.Theor. Comput. Sci.940Part269-2822023Journal Articlesclosedjournals/tcs/Raskin2310.1016/J.TCS.2022.11.006https://doi.org/10.1016/j.tcs.2022.11.006https://dblp.org/rec/journals/tcs/Raskin23URL#252223RaveenaKrishnendra ShekhawatA theory of L-shaped floor-plans.Theor. Comput. Sci.94257-922023Journal Articlesclosedjournals/tcs/RaveenaS2310.1016/J.TCS.2022.11.025https://doi.org/10.1016/j.tcs.2022.11.025https://dblp.org/rec/journals/tcs/RaveenaS23URL#252224Santiago Valdés RaveloCristina G. FernandesComplexity and approximability of Minimum Path-Collection Exact Covers.Theor. Comput. Sci.94221-322023Journal Articlesclosedjournals/tcs/RaveloF2310.1016/J.TCS.2022.11.022https://doi.org/10.1016/j.tcs.2022.11.022https://dblp.org/rec/journals/tcs/RaveloF23URL#252225Daniel ReemThe projector algorithm: A simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs.Theor. Comput. Sci.9701140542023Journal Articlesclosedjournals/tcs/Reem2310.1016/J.TCS.2023.114054https://doi.org/10.1016/j.tcs.2023.114054https://dblp.org/rec/journals/tcs/Reem23URL#252226Chunying RenZijun Wu 0001Dachuan XuWenqing XuA game-theoretic perspective of deep neural networks.Theor. Comput. Sci.93948-622023Journal Articlesclosedjournals/tcs/RenWXX2310.1016/J.TCS.2022.09.035https://doi.org/10.1016/j.tcs.2022.09.035https://dblp.org/rec/journals/tcs/RenWXX23URL#252227Adrien RichardElisa TonelloAttractor separation and signed cycles in asynchronous Boolean networks.Theor. Comput. Sci.9471137062023Journal Articlesclosedjournals/tcs/RichardT2310.1016/J.TCS.2023.113706https://doi.org/10.1016/j.tcs.2023.113706https://dblp.org/rec/journals/tcs/RichardT23URL#252228Romeo RizziStéphane VialetteOn recognising words that are squares for the shuffle product.Theor. Comput. Sci.9561111562023Journal Articlesclosedjournals/tcs/RizziV2310.1016/J.TCS.2017.04.003https://doi.org/10.1016/j.tcs.2017.04.003https://dblp.org/rec/journals/tcs/RizziV23URL#252229Léo RobertDaiki MiyaharaPascal Lafourcade 0001Takaaki MizukiPhysical ZKP protocols for Nurimisaki and Kurodoko.Theor. Comput. Sci.9721140712023Journal Articlesclosedjournals/tcs/RobertMLM2310.1016/J.TCS.2023.114071https://doi.org/10.1016/j.tcs.2023.114071https://dblp.org/rec/journals/tcs/RobertMLM23URL#252230Liam RodittyRoei TovApproximate distance oracles with improved stretch for sparse graphs.Theor. Comput. Sci.94389-1012023Journal Articlesclosedjournals/tcs/RodittyT2310.1016/J.TCS.2022.11.016https://doi.org/10.1016/j.tcs.2022.11.016https://dblp.org/rec/journals/tcs/RodittyT23URL#252231Irena RusuOn the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs.Theor. Comput. Sci.9521137732023Journal Articlesclosedjournals/tcs/Rusu2310.1016/J.TCS.2023.113773https://doi.org/10.1016/j.tcs.2023.113773https://dblp.org/rec/journals/tcs/Rusu23URL#252232M. SavithaM. SenthilkumarA unique secure multimodal biometrics-based user anonymous authenticated key management protocol (SMUAAKAP) based on block chain mechanism for generic HIoTNs.Theor. Comput. Sci.94177-902023Journal Articlesclosedjournals/tcs/SavithaS2310.1016/J.TCS.2022.09.020https://doi.org/10.1016/j.tcs.2022.09.020https://dblp.org/rec/journals/tcs/SavithaS23URL#252233Florian SeiffarthTamás Horváth 0001Stefan WrobelMaximal closed set and half-space separations in finite closure systems.Theor. Comput. Sci.9731141052023Journal Articlesclosedjournals/tcs/SeiffarthHW2310.1016/J.TCS.2023.114105https://doi.org/10.1016/j.tcs.2023.114105https://dblp.org/rec/journals/tcs/SeiffarthHW23URL#252234Victor L. SelivanovDescriptive complexity of qcb0-spaces.Theor. Comput. Sci.9451136662023Journal Articlesclosedjournals/tcs/Selivanov2310.1016/J.TCS.2022.12.016https://doi.org/10.1016/j.tcs.2022.12.016https://dblp.org/rec/journals/tcs/Selivanov23URL#252235Yilun ShangConcentration of rainbow k-connectivity of a multiplex random graph.Theor. Comput. Sci.9511137712023Journal Articlesopenjournals/tcs/Shang2310.1016/J.TCS.2023.113771https://doi.org/10.1016/j.tcs.2023.113771https://dblp.org/rec/journals/tcs/Shang23URL#252236Sima Hajiaghaei ShanjaniValerie KingCommunication costs in a geometric communication network.Theor. Comput. Sci.9771141612023Journal Articlesopenjournals/tcs/ShanjaniK2310.1016/J.TCS.2023.114161https://doi.org/10.1016/j.tcs.2023.114161https://dblp.org/rec/journals/tcs/ShanjaniK23URL#252237Bin Sheng 0002Gregory Z. GutinFixed parameterized algorithms for generalized feedback vertex set problems.Theor. Comput. Sci.9531137982023Journal Articlesclosedjournals/tcs/ShengG2310.1016/J.TCS.2023.113798https://doi.org/10.1016/j.tcs.2023.113798https://dblp.org/rec/journals/tcs/ShengG23URL#252238Alexandre M. SilvaCarlos Pereira dos SantosJoão Pedro NetoRichard J. NowakowskiDisjunctive sums of quasi-nimbers.Theor. Comput. Sci.9451136652023Journal Articlesopenjournals/tcs/SilvaSNN2310.1016/J.TCS.2022.12.015https://doi.org/10.1016/j.tcs.2022.12.015https://dblp.org/rec/journals/tcs/SilvaSNN23URL#252239Yongcheng SongJiang ZhangXinyi Huang 0001Wei Wu 0001Haining YangStatistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge.Theor. Comput. Sci.9521137312023Journal Articlesclosedjournals/tcs/SongZHWY2310.1016/J.TCS.2023.113731https://doi.org/10.1016/j.tcs.2023.113731https://dblp.org/rec/journals/tcs/SongZHWY23URL#252240Putty SrividyaLavadya Nirmala DeviA. Nageswar RaoA trusted effective approach for forecasting the failure of data link and intrusion in wireless sensor networks.Theor. Comput. Sci.9411-132023Journal Articlesclosedjournals/tcs/SrividyaDR2310.1016/J.TCS.2022.08.004https://doi.org/10.1016/j.tcs.2022.08.004https://dblp.org/rec/journals/tcs/SrividyaDR23URL#252241Xueli SunJianxi FanBaolei ChengYan Wang 0078The t/m-diagnosis strategy of augmented k-ary n-cubes.Theor. Comput. Sci.9451136712023Journal Articlesclosedjournals/tcs/SunFCW2310.1016/J.TCS.2022.12.021https://doi.org/10.1016/j.tcs.2022.12.021https://dblp.org/rec/journals/tcs/SunFCW23URL#252242Jian Sun 0022Gregory Z. GutinPing LiPeihao ShiXiaoyan Zhang 0001An LP-based approximation algorithm for the generalized traveling salesman path problem.Theor. Comput. Sci.941180-1902023Journal Articlesclosedjournals/tcs/SunGLSZ2310.1016/J.TCS.2022.11.013https://doi.org/10.1016/j.tcs.2022.11.013https://dblp.org/rec/journals/tcs/SunGLSZ23URL#252243Yuma SuzukiRyuhei MiyashiroCharacterization of canonical systems with six types of coins for the change-making problem.Theor. Comput. Sci.9551138222023Journal Articlesclosedjournals/tcs/SuzukiM2310.1016/J.TCS.2023.113822https://doi.org/10.1016/j.tcs.2023.113822https://dblp.org/rec/journals/tcs/SuzukiM23URL#252244Shaojie Tang 0001Jing Yuan 0002Streaming adaptive submodular maximization.Theor. Comput. Sci.9441136442023Journal Articlesclosedjournals/tcs/TangY2310.1016/J.TCS.2022.11.030https://doi.org/10.1016/j.tcs.2022.11.030https://dblp.org/rec/journals/tcs/TangY23URL#252245Satoshi TeraiKoichi Wada 0001Yoshiaki KatayamaGathering problems for autonomous mobile robots with lights.Theor. Comput. Sci.941241-2612023Journal Articlesclosedjournals/tcs/TeraiWK2310.1016/J.TCS.2022.11.018https://doi.org/10.1016/j.tcs.2022.11.018https://dblp.org/rec/journals/tcs/TeraiWK23URL#252246Declan ThompsonExecution trace sets for real computation.Theor. Comput. Sci.940Part2-172023Journal Articlesclosedjournals/tcs/Thompson2310.1016/J.TCS.2022.06.038https://doi.org/10.1016/j.tcs.2022.06.038https://dblp.org/rec/journals/tcs/Thompson23URL#252247Van-Giang TrinhBelaid BenhamouSylvain SolimanTrap spaces of Boolean networks are conflict-free siphons of their Petri net encoding.Theor. Comput. Sci.9711140732023Journal Articlesclosedjournals/tcs/TrinhBS2310.1016/J.TCS.2023.114073https://doi.org/10.1016/j.tcs.2023.114073https://dblp.org/rec/journals/tcs/TrinhBS23URL#252248Davide TrottaMatteo SpadettoValeria de PaivaDialectica principles via Gödel doctrines.Theor. Comput. Sci.9471136922023Journal Articlesclosedjournals/tcs/TrottaSP2310.1016/J.TCS.2023.113692https://doi.org/10.1016/j.tcs.2023.113692https://dblp.org/rec/journals/tcs/TrottaSP23URL#252249Yung H. TsinA simple certifying algorithm for 3-edge-connectivity.Theor. Comput. Sci.9511137602023Journal Articlesclosedjournals/tcs/Tsin2310.1016/J.TCS.2023.113760https://doi.org/10.1016/j.tcs.2023.113760https://dblp.org/rec/journals/tcs/Tsin23URL#252250Dekel TsurFaster parameterized algorithms for two vertex deletion problems.Theor. Comput. Sci.940Part112-1232023Journal Articlesclosedjournals/tcs/Tsur2310.1016/J.TCS.2022.10.044https://doi.org/10.1016/j.tcs.2022.10.044https://dblp.org/rec/journals/tcs/Tsur23URL#252251Dekel TsurFaster parameterized algorithms for Bicluster Editing and Flip Consensus Tree.Theor. Comput. Sci.9531137962023Journal Articlesclosedjournals/tcs/Tsur23a10.1016/J.TCS.2023.113796https://doi.org/10.1016/j.tcs.2023.113796https://dblp.org/rec/journals/tcs/Tsur23aURL#252252Nikolay K. VereshchaginInformation disclosure in the framework of Kolmogorov complexity.Theor. Comput. Sci.940Part108-1222023Journal Articlesclosedjournals/tcs/Vereshchagin2310.1016/J.TCS.2022.10.001https://doi.org/10.1016/j.tcs.2022.10.001https://dblp.org/rec/journals/tcs/Vereshchagin23URL#252253Biing-Feng WangA new dynamic programming algorithm for the simplified partial digest problem.Theor. Comput. Sci.9541138012023Journal Articlesclosedjournals/tcs/Wang2310.1016/J.TCS.2023.113801https://doi.org/10.1016/j.tcs.2023.113801https://dblp.org/rec/journals/tcs/Wang23URL#252254Zichen WangHongwei Du 0001Collaborative coalitions-based joint service caching and task offloading for edge networks.Theor. Comput. Sci.940Part52-652023Journal Articlesclosedjournals/tcs/WangD2310.1016/J.TCS.2022.10.037https://doi.org/10.1016/j.tcs.2022.10.037https://dblp.org/rec/journals/tcs/WangD23URL#252255Yihong WangJianxi FanYuejuan HanYan Wang 0078Baolei ChengReliability evaluation of complete graph-based recursive networks.Theor. Comput. Sci.966-9671140152023Journal Articlesclosedjournals/tcs/WangFH0C2310.1016/J.TCS.2023.114015https://doi.org/10.1016/j.tcs.2023.114015https://dblp.org/rec/journals/tcs/WangFH0C23URL#252256Yu WangJixiang MengStructure fault-tolerance of divide-and-swap k-ary n-cube.Theor. Comput. Sci.9471137042023Journal Articlesclosedjournals/tcs/WangM2310.1016/J.TCS.2023.113704https://doi.org/10.1016/j.tcs.2023.113704https://dblp.org/rec/journals/tcs/WangM23URL#252257Cai-Xia WangYu YangShou-Jun XuSecure connected domination and secure total domination in unit disk graphs and rectangle graphs.Theor. Comput. Sci.9571138242023Journal Articlesclosedjournals/tcs/WangYX2310.1016/J.TCS.2023.113824https://doi.org/10.1016/j.tcs.2023.113824https://dblp.org/rec/journals/tcs/WangYX23URL#252258Carsten WittHow majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys.Theor. Comput. Sci.940Part18-422023Journal Articlesopenjournals/tcs/Witt2310.1016/J.TCS.2022.08.014https://doi.org/10.1016/j.tcs.2022.08.014https://dblp.org/rec/journals/tcs/Witt23URL#252259Barbara WolnikAnna NencaBernard De BaetsA decomposition theorem for number-conserving multi-state cellular automata on triangular grids.Theor. Comput. Sci.9531137952023Journal Articlesclosedjournals/tcs/WolnikNB2310.1016/J.TCS.2023.113795https://doi.org/10.1016/j.tcs.2023.113795https://dblp.org/rec/journals/tcs/WolnikNB23URL#252260Mingyu Xiao 0001Upper and lower bounds on approximating weighted mixed domination.Theor. Comput. Sci.939292-3022023Journal Articlesclosedjournals/tcs/Xiao2310.1016/J.TCS.2022.10.033https://doi.org/10.1016/j.tcs.2022.10.033https://dblp.org/rec/journals/tcs/Xiao23URL#252261Mingyu Xiao 0001Shaowei KouA 5k-vertex kernel for 3-path vertex cover.Theor. Comput. Sci.9591138722023Journal Articlesclosedjournals/tcs/XiaoK2310.1016/J.TCS.2023.113872https://doi.org/10.1016/j.tcs.2023.113872https://dblp.org/rec/journals/tcs/XiaoK23URL#252262Ning Xie 0002Shuai XuYekun XuA generalization of a theorem of Rothschild and van Lint.Theor. Comput. Sci.9551138022023Journal Articlesclosedjournals/tcs/XieXX2310.1016/J.TCS.2023.113802https://doi.org/10.1016/j.tcs.2023.113802https://dblp.org/rec/journals/tcs/XieXX23URL#252263Honghui XuWei Li 0059Zhipeng Cai 0001Analysis on methods to effectively improve transfer learning performance.Theor. Comput. Sci.940Part90-1072023Journal Articlesclosedjournals/tcs/XuLC2310.1016/J.TCS.2022.09.023https://doi.org/10.1016/j.tcs.2022.09.023https://dblp.org/rec/journals/tcs/XuLC23URL#252264Kexin XuBenjamin Hong Meng TanLi-Ping WangKhin Mi Mi AungHuaxiong WangMulti-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping.Theor. Comput. Sci.9681140262023Journal Articlesclosedjournals/tcs/XuTWAW2310.1016/J.TCS.2023.114026https://doi.org/10.1016/j.tcs.2023.114026https://dblp.org/rec/journals/tcs/XuTWAW23URL#252265Xiaojia XuYongcai WangYu ZhangDeying Li 0001A fault diagnosis method to defend scapegoating attack in network tomography.Theor. Comput. Sci.939237-2492023Journal Articlesclosedjournals/tcs/XuWZL2310.1016/J.TCS.2022.10.029https://doi.org/10.1016/j.tcs.2022.10.029https://dblp.org/rec/journals/tcs/XuWZL23URL#252266Lulu YangXiaohui HuaYuxing YangHyper star fault tolerance of bubble sort networks.Theor. Comput. Sci.9511137702023Journal Articlesclosedjournals/tcs/YangHY2310.1016/J.TCS.2023.113770https://doi.org/10.1016/j.tcs.2023.113770https://dblp.org/rec/journals/tcs/YangHY23URL#252267Yuxing YangNingning SongFault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links.Theor. Comput. Sci.939161-1692023Journal Articlesclosedjournals/tcs/YangS2310.1016/J.TCS.2022.10.021https://doi.org/10.1016/j.tcs.2022.10.021https://dblp.org/rec/journals/tcs/YangS23URL#252268Qian YangXin XiongHong Peng 0001Jun Wang 0013Xiaoxiao SongNonlinear spiking neural P systems with multiple channels.Theor. Comput. Sci.9651139792023Journal Articlesclosedjournals/tcs/YangX00S2310.1016/J.TCS.2023.113979https://doi.org/10.1016/j.tcs.2023.113979https://dblp.org/rec/journals/tcs/YangX00S23URL#252269Damla YilmazA note on fuzzy derivations of some ideals on d-algebras.Theor. Comput. Sci.9601139242023Journal Articlesclosedjournals/tcs/Yilmaz2310.1016/J.TCS.2023.113924https://doi.org/10.1016/j.tcs.2023.113924https://dblp.org/rec/journals/tcs/Yilmaz23URL#252270Jun Yuan 0001Shuyuan GeAixia LiuThe partial diagnosability of interconnection networks under the Hybrid PMC model.Theor. Comput. Sci.9581138592023Journal Articlesclosedjournals/tcs/YuanGL2310.1016/J.TCS.2023.113859https://doi.org/10.1016/j.tcs.2023.113859https://dblp.org/rec/journals/tcs/YuanGL23URL#252271Zhen Zhang 0025Qilong FengJunyu HuangJianxin Wang 0001Improved approximation algorithms for solving the squared metric k-facility location problem.Theor. Comput. Sci.942107-1222023Journal Articlesclosedjournals/tcs/ZhangFHW2310.1016/J.TCS.2022.11.027https://doi.org/10.1016/j.tcs.2022.11.027https://dblp.org/rec/journals/tcs/ZhangFHW23URL#252272Feiteng ZhangBin Liu 0009Zhenming LiuQizhi FangOrder based algorithms for the core maintenance problem on edge-weighted graphs.Theor. Comput. Sci.941140-1552023Journal Articlesclosedjournals/tcs/ZhangLLF2310.1016/J.TCS.2022.11.008https://doi.org/10.1016/j.tcs.2022.11.008https://dblp.org/rec/journals/tcs/ZhangLLF23URL#252273Huanwen ZhangYan Wang 0078Jianxi FanChang ShuEdge-independent spanning trees in folded crossed cubes.Theor. Comput. Sci.9701140532023Journal Articlesclosedjournals/tcs/ZhangWFS2310.1016/J.TCS.2023.114053https://doi.org/10.1016/j.tcs.2023.114053https://dblp.org/rec/journals/tcs/ZhangWFS23URL#252274Nan Zhang 0001Chaofeng YuZhenhua DuanCong TianA proof system for unified temporal logic.Theor. Comput. Sci.9491137022023Journal Articlesclosedjournals/tcs/ZhangYDT2310.1016/J.TCS.2023.113702https://doi.org/10.1016/j.tcs.2023.113702https://dblp.org/rec/journals/tcs/ZhangYDT23URL#252275Long ZhangJiguo YuYuzhong ZhangDonglei DuMin GuoEfficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost.Theor. Comput. Sci.9491137302023Journal Articlesclosedjournals/tcs/ZhangYZDG2310.1016/J.TCS.2023.113730https://doi.org/10.1016/j.tcs.2023.113730https://dblp.org/rec/journals/tcs/ZhangYZDG23URL#252276Pingyuan ZhangHaining YangLiang ZhuYanhua ZhangHao Wang 0007Qiuliang XuA new lattice-based online/offline signatures framework for low-power devices.Theor. Comput. Sci.9621139422023Journal Articlesclosedjournals/tcs/ZhangYZZWX2310.1016/J.TCS.2023.113942https://doi.org/10.1016/j.tcs.2023.113942https://dblp.org/rec/journals/tcs/ZhangYZZWX23URL#252277Meng Zhang 0006Yi ZhangArbitrary-size permutation networks using arbitrary-radix switches.Theor. Comput. Sci.9621139392023Journal Articlesclosedjournals/tcs/ZhangZ2310.1016/J.TCS.2023.113939https://doi.org/10.1016/j.tcs.2023.113939https://dblp.org/rec/journals/tcs/ZhangZ23URL#252278Qifan ZhangShuming ZhouEddie Cheng 0001Component connectivity of augmented cubes.Theor. Comput. Sci.9521137842023Journal Articlesclosedjournals/tcs/ZhangZC2310.1016/J.TCS.2023.113784https://doi.org/10.1016/j.tcs.2023.113784https://dblp.org/rec/journals/tcs/ZhangZC23URL#252279An Zhang 0001Liang ZhangYong Chen 0002Guangting ChenXing WangComplexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints.Theor. Comput. Sci.941167-1792023Journal Articlesclosedjournals/tcs/ZhangZCCW2310.1016/J.TCS.2022.11.012https://doi.org/10.1016/j.tcs.2022.11.012https://dblp.org/rec/journals/tcs/ZhangZCCW23URL#252280Hong ZhangShuming ZhouXiaoqing LiuZhenqin YuExtra (component) connectivity and diagnosability of bubble sort networks.Theor. Comput. Sci.940Part180-1892023Journal Articlesclosedjournals/tcs/ZhangZLY2310.1016/J.TCS.2022.10.048https://doi.org/10.1016/j.tcs.2022.10.048https://dblp.org/rec/journals/tcs/ZhangZLY23URL#252281Hong ZhangShuming ZhouQifan ZhangTao TianFault tolerance of composite graph based on disc-ring and folded hypercube.Theor. Comput. Sci.9581138562023Journal Articlesclosedjournals/tcs/ZhangZZT2310.1016/J.TCS.2023.113856https://doi.org/10.1016/j.tcs.2023.113856https://dblp.org/rec/journals/tcs/ZhangZZT23URL#252282Shu-Li ZhaoJou-Ming ChangReliability assessment of the divide-and-swap cube in terms of generalized connectivity.Theor. Comput. Sci.9431-152023Journal Articlesclosedjournals/tcs/ZhaoC2310.1016/J.TCS.2022.12.005https://doi.org/10.1016/j.tcs.2022.12.005https://dblp.org/rec/journals/tcs/ZhaoC23URL#252283Jun ZhaoMinghao YangJunqing Gong 0001Kai Zhang 0016Haifeng QianBounded-collusion decentralized ABE with sublinear parameters.Theor. Comput. Sci.9601138972023Journal Articlesclosedjournals/tcs/ZhaoYGZQ2310.1016/J.TCS.2023.113897https://doi.org/10.1016/j.tcs.2023.113897https://dblp.org/rec/journals/tcs/ZhaoYGZQ23URL#252284Xueyang ZhaoBinghao YanPeng Zhang 0008New algorithms for a simple measure of network partitioning.Theor. Comput. Sci.9571138462023Journal Articlesclosedjournals/tcs/ZhaoYZ2310.1016/J.TCS.2023.113846https://doi.org/10.1016/j.tcs.2023.113846https://dblp.org/rec/journals/tcs/ZhaoYZ23URL#252285Hao Zhong 0007Yong Tang 0001Qi ZhangRonghua LinWeisheng LiA unified greedy approximation for several dominating set problems.Theor. Comput. Sci.9731140692023Journal Articlesclosedjournals/tcs/ZhongTZLL2310.1016/J.TCS.2023.114069https://doi.org/10.1016/j.tcs.2023.114069https://dblp.org/rec/journals/tcs/ZhongTZLL23URL#252286Yu ZhouShengli Liu 0001Nan CuiComputational fuzzy extractor from LWE.Theor. Comput. Sci.9451136812023Journal Articlesclosedjournals/tcs/ZhouLC2310.1016/J.TCS.2022.12.031https://doi.org/10.1016/j.tcs.2022.12.031https://dblp.org/rec/journals/tcs/ZhouLC23URL#252287Xiaotian ZhouHaoxin SunWei Li 0055Zhongzhi ZhangOptimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition.Theor. Comput. Sci.9801142202023Journal Articlesclosedjournals/tcs/ZhouSLZ2310.1016/J.TCS.2023.114220https://doi.org/10.1016/j.tcs.2023.114220https://dblp.org/rec/journals/tcs/ZhouSLZ23URL#252288Mingzhe ZhuHaoxin SunWei Li 0055Zhongzhi ZhangModeling spatial networks by contact graphs of disk packings.Theor. Comput. Sci.9731140662023Journal Articlesclosedjournals/tcs/ZhuSLZ2310.1016/J.TCS.2023.114066https://doi.org/10.1016/j.tcs.2023.114066https://dblp.org/rec/journals/tcs/ZhuSLZ23URL#252289Hongbin ZhuangWanling LinXiao-Yan LiJou-Ming ChangMatroidal connectivity and conditional matroidal connectivity of star graphs.Theor. Comput. Sci.9771141732023Journal Articlesclosedjournals/tcs/ZhuangLLC2310.1016/J.TCS.2023.114173https://doi.org/10.1016/j.tcs.2023.114173https://dblp.org/rec/journals/tcs/ZhuangLLC23URL#252290Wenjie ZouLongkun GuoChunlin HaoLei LiuApproximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane.Theor. Comput. Sci.941121-1302023Journal Articlesclosedjournals/tcs/ZouGHL2310.1016/J.TCS.2022.10.046https://doi.org/10.1016/j.tcs.2022.10.046https://dblp.org/rec/journals/tcs/ZouGHL23URL#252291Ugo de'LiguoroRiccardo TregliaFrom semantics to types: The case of the imperative λ-calculus.Theor. Comput. Sci.9731140822023Journal Articlesopenjournals/tcs/deLiguoroT2310.1016/J.TCS.2023.114082https://doi.org/10.1016/j.tcs.2023.114082https://dblp.org/rec/journals/tcs/deLiguoroT23URL#252292Haris Aziz 0001Péter Biró 0001Tamás FleinerSerge GaspersRonald de HaanNicholas MatteiBaharak RastegariStable matching with uncertain pairwise preferences.Theor. Comput. Sci.9091-112022Journal Articlesclosedjournals/tcs/0001BFGHMR2210.1016/J.TCS.2022.01.028https://doi.org/10.1016/j.tcs.2022.01.028https://dblp.org/rec/journals/tcs/0001BFGHMR22URL#747054Yan Zhang 0012Zhaohui ZhuJinjin ZhangEncoding safety in CLLR.Theor. Comput. Sci.89764-822022Journal Articlesclosedjournals/tcs/0012ZZ2210.1016/J.TCS.2021.09.036https://doi.org/10.1016/j.tcs.2021.09.036https://dblp.org/rec/journals/tcs/0012ZZ22URL#747055Mohamad AbdallahEddie Cheng 0001Fault-tolerant Hamiltonian connectivity of 2-tree-generated networks.Theor. Comput. Sci.90762-812022Journal Articlesclosedjournals/tcs/Abdallah02210.1016/J.TCS.2022.01.020https://doi.org/10.1016/j.tcs.2022.01.020https://dblp.org/rec/journals/tcs/Abdallah022URL#747056Hüseyin AcanSankardeep ChakrabortySeungbum JoKei NakashimaKunihiko SadakaneSrinivasa Rao SattiSuccinct navigational oracles for families of intersection graphs on a circle.Theor. Comput. Sci.928151-1662022Journal Articlesclosedjournals/tcs/AcanCJNSS2210.1016/J.TCS.2022.06.022https://doi.org/10.1016/j.tcs.2022.06.022https://dblp.org/rec/journals/tcs/AcanCJNSS22URL#747057Ankush AcharyyaRamesh K. JalluVahideh KeikhaMaarten LöfflerMaria SaumellMinimum color spanning circle of imprecise points.Theor. Comput. Sci.930116-1272022Journal Articlesclosedjournals/tcs/AcharyyaJKLS2210.1016/J.TCS.2022.07.016https://doi.org/10.1016/j.tcs.2022.07.016https://dblp.org/rec/journals/tcs/AcharyyaJKLS22URL#747058Ranendu AdhikaryKaustav BoseManash Kumar KunduBuddhadeb SauMutual visibility on grid by asynchronous luminous robots.Theor. Comput. Sci.922218-2472022Journal Articlesclosedjournals/tcs/AdhikaryBKS2210.1016/J.TCS.2022.04.026https://doi.org/10.1016/j.tcs.2022.04.026https://dblp.org/rec/journals/tcs/AdhikaryBKS22URL#747059Ibai AedoUwe GrimmYasushi NagaiPetra StaynovaMonochromatic arithmetic progressions in binary Thue-Morse-like words.Theor. Comput. Sci.93465-802022Journal Articlesopenjournals/tcs/AedoGNS2210.1016/J.TCS.2022.08.013https://doi.org/10.1016/j.tcs.2022.08.013https://dblp.org/rec/journals/tcs/AedoGNS22URL#747060Pallavi AhireJibi AbrahamSecure cloud model for intellectual privacy protection of arithmetic expressions in source codes using data obfuscation techniques.Theor. Comput. Sci.922131-1492022Journal Articlesclosedjournals/tcs/AhireA2210.1016/J.TCS.2022.04.018https://doi.org/10.1016/j.tcs.2022.04.018https://dblp.org/rec/journals/tcs/AhireA22URL#747061Aishah AhmedMaciej KoutnyMarta Pietkiewicz-KoutnySynthesising elementary net systems with localities.Theor. Comput. Sci.908123-1402022Journal Articlesopenjournals/tcs/AhmedKP2210.1016/J.TCS.2022.01.042https://doi.org/10.1016/j.tcs.2022.01.042https://dblp.org/rec/journals/tcs/AhmedKP22URL#747062Tooru AkagiYuki KuharaTakuya MienoYuto NakashimaShunsuke InenagaHideo BannaiMasayuki TakedaCombinatorics of minimal absent words for a sliding window.Theor. Comput. Sci.927109-1192022Journal Articlesclosedjournals/tcs/AkagiKMNIBT2210.1016/J.TCS.2022.06.002https://doi.org/10.1016/j.tcs.2022.06.002https://dblp.org/rec/journals/tcs/AkagiKMNIBT22URL#747063Hugo A. AkitayaMatias KormanOliver KortenDiane L. SouvaineCsaba D. TóthReconfiguration of connected graph partitions via recombination.Theor. Comput. Sci.92313-262022Journal Articlesopenjournals/tcs/AkitayaKKST2210.1016/J.TCS.2022.04.049https://doi.org/10.1016/j.tcs.2022.04.049https://dblp.org/rec/journals/tcs/AkitayaKKST22URL#747064Jawaherul Md. AlamMichael A. BekosMartin GronemannMichael Kaufmann 0001Sergey PupyrevThe mixed page number of graphs.Theor. Comput. Sci.931131-1412022Journal Articlesclosedjournals/tcs/AlamBGKP2210.1016/J.TCS.2022.07.036https://doi.org/10.1016/j.tcs.2022.07.036https://dblp.org/rec/journals/tcs/AlamBGKP22URL#747065Andrei AlexandruBogdan AmanRoss HorneTheories of life and computation: Special issue on the occasion of the 65th birthday of Professor Gabriel Ciobanu.Theor. Comput. Sci.9261-22022Journal Articlesclosedjournals/tcs/AlexandruAH2210.1016/J.TCS.2022.06.041https://doi.org/10.1016/j.tcs.2022.06.041https://dblp.org/rec/journals/tcs/AlexandruAH22URL#747066Artiom AlhazovRudolf FreundSergiu Ivanov 0001Marion OswaldVariants of derivation modes for which purely catalytic P systems are computationally complete.Theor. Comput. Sci.92095-1122022Journal Articlesopenjournals/tcs/AlhazovFIO2210.1016/J.TCS.2022.03.007https://doi.org/10.1016/j.tcs.2022.03.007https://dblp.org/rec/journals/tcs/AlhazovFIO22URL#747067Morteza AlimiAmir DaneshgarMohammad-Hadi Foroughmand-AraabiMean isoperimetry with control on outliers: Exact and approximation algorithms.Theor. Comput. Sci.923348-3652022Journal Articlesclosedjournals/tcs/AlimiDF2210.1016/J.TCS.2022.05.022https://doi.org/10.1016/j.tcs.2022.05.022https://dblp.org/rec/journals/tcs/AlimiDF22URL#747068Abdullah AlmethenOthon MichailIgor PotapovOn efficient connectivity-preserving transformations in a grid.Theor. Comput. Sci.898132-1482022Journal Articlesclosedjournals/tcs/AlmethenMP2210.1016/J.TCS.2021.11.004https://doi.org/10.1016/j.tcs.2021.11.004https://dblp.org/rec/journals/tcs/AlmethenMP22URL#747069Jalawi AlshudukhiKusum YadavSurvivability development of wireless sensor networks using neuro fuzzy-clonal selection optimization.Theor. Comput. Sci.92225-362022Journal Articlesclosedjournals/tcs/AlshudukhiY2210.1016/J.TCS.2022.04.008https://doi.org/10.1016/j.tcs.2022.04.008https://dblp.org/rec/journals/tcs/AlshudukhiY22URL#747070Stephen AlstrupSøren DahlgaardArnold FiltserMorten StöckelChristian Wulff-NilsenConstructing light spanners deterministically in near-linear time.Theor. Comput. Sci.90782-1122022Journal Articlesclosedjournals/tcs/AlstrupDFSW2210.1016/J.TCS.2022.01.021https://doi.org/10.1016/j.tcs.2022.01.021https://dblp.org/rec/journals/tcs/AlstrupDFSW22URL#747071Saeed Akhoondian AmiriBen WiederhakeDistributed distance-r covering problems on sparse high-girth graphs.Theor. Comput. Sci.90618-312022Journal Articlesopenjournals/tcs/AmiriW2210.1016/J.TCS.2022.01.001https://doi.org/10.1016/j.tcs.2022.01.001https://dblp.org/rec/journals/tcs/AmiriW22URL#747072Patrizio AngeliniMichael A. BekosPhilipp KindermannTamara MchedlidzeOn mixed linear layouts of series-parallel graphs.Theor. Comput. Sci.936129-1382022Journal Articlesclosedjournals/tcs/AngeliniBKM2210.1016/J.TCS.2022.09.019https://doi.org/10.1016/j.tcs.2022.09.019https://dblp.org/rec/journals/tcs/AngeliniBKM22URL#747073Marcella AnselmoManuela FloresMaria MadoniaOn k-ary n-cubes and isometric words.Theor. Comput. Sci.93850-642022Journal Articlesclosedjournals/tcs/AnselmoFM2210.1016/J.TCS.2022.10.007https://doi.org/10.1016/j.tcs.2022.10.007https://dblp.org/rec/journals/tcs/AnselmoFM22URL#747074Antonis AntonopoulosEleni BakaliAggeliki ChalkiAris PagourtzisPetros PantavosStathis ZachosCompleteness, approximability and exponential time results for counting problems with easy decision version.Theor. Comput. Sci.91555-732022Journal Articlesclosedjournals/tcs/AntonopoulosBCP2210.1016/J.TCS.2022.02.030https://doi.org/10.1016/j.tcs.2022.02.030https://dblp.org/rec/journals/tcs/AntonopoulosBCP22URL#747075Micheal ArockiarajArul Jeya ShaliniJ. Nancy DelailaEmbedding algorithm of spined cube into grid structure and its wirelength computation.Theor. Comput. Sci.90569-862022Journal Articlesclosedjournals/tcs/ArockiarajSD2210.1016/J.TCS.2021.12.016https://doi.org/10.1016/j.tcs.2021.12.016https://dblp.org/rec/journals/tcs/ArockiarajSD22URL#747076Yuichi AsahiroJesper Jansson 0001Eiji MiyanoHirotaka Ono 0001Upper and lower degree-constrained graph orientation with minimum penalty.Theor. Comput. Sci.90053-782022Journal Articlesclosedjournals/tcs/AsahiroJMO2210.1016/J.TCS.2021.11.019https://doi.org/10.1016/j.tcs.2021.11.019https://dblp.org/rec/journals/tcs/AsahiroJMO22URL#747077Yuichi AsahiroIchiro SuzukiMasafumi YamashitaMonotonic self-stabilization and its application to robust and adaptive pattern formation.Theor. Comput. Sci.93421-462022Journal Articlesopenjournals/tcs/AsahiroSY2210.1016/J.TCS.2022.08.011https://doi.org/10.1016/j.tcs.2022.08.011https://dblp.org/rec/journals/tcs/AsahiroSY22URL#747078Chen AvinAvi CohenZvi LotkerDavid PelegHotelling games in fault-prone settings.Theor. Comput. Sci.92296-1072022Journal Articlesclosedjournals/tcs/AvinCLP2210.1016/J.TCS.2022.04.013https://doi.org/10.1016/j.tcs.2022.04.013https://dblp.org/rec/journals/tcs/AvinCLP22URL#747079Lina BaHeping ZhangThe cycle-structure connectivity of crossed cubes.Theor. Comput. Sci.922335-3452022Journal Articlesclosedjournals/tcs/BaZ2210.1016/J.TCS.2022.04.034https://doi.org/10.1016/j.tcs.2022.04.034https://dblp.org/rec/journals/tcs/BaZ22URL#747080Golnaz BadkobehPanagiotis CharalampopoulosDmitry KosolobovSolon P. PissisInternal shortest absent word queries in constant time and linear space.Theor. Comput. Sci.922271-2822022Journal Articlesclosedjournals/tcs/BadkobehCKP2210.1016/J.TCS.2022.04.029https://doi.org/10.1016/j.tcs.2022.04.029https://dblp.org/rec/journals/tcs/BadkobehCKP22URL#747081Golnaz BadkobehTero HarjuPascal OchemMatthieu RosenfeldAvoiding square-free words on free groups.Theor. Comput. Sci.922206-2172022Journal Articlesclosedjournals/tcs/BadkobehHOR2210.1016/J.TCS.2022.04.025https://doi.org/10.1016/j.tcs.2022.04.025https://dblp.org/rec/journals/tcs/BadkobehHOR22URL#747082Karim BagheryAlonso GonzálezZaira PindadoCarla RàfolsSignatures of knowledge for Boolean circuits under standard assumptions.Theor. Comput. Sci.91686-1102022Journal Articlesopenjournals/tcs/BagheryGPR2210.1016/J.TCS.2022.03.006https://doi.org/10.1016/j.tcs.2022.03.006https://dblp.org/rec/journals/tcs/BagheryGPR22URL#747083Attila BagossyGyörgy VaszilControlled reversibility in communicating reaction systems.Theor. Comput. Sci.9263-202022Journal Articlesopenjournals/tcs/BagossyV2210.1016/J.TCS.2022.05.030https://doi.org/10.1016/j.tcs.2022.05.030https://dblp.org/rec/journals/tcs/BagossyV22URL#747084Zonglei BaiYongzhi CaoHanpin WangZero-freeness and approximation of real Boolean Holant problems.Theor. Comput. Sci.91712-302022Journal Articlesclosedjournals/tcs/BaiCW2210.1016/J.TCS.2022.03.009https://doi.org/10.1016/j.tcs.2022.03.009https://dblp.org/rec/journals/tcs/BaiCW22URL#747085Mourad BaïouRafael ColaresHervé KerivinThe complexity of the unit stop number problem and its implications to other related problems.Theor. Comput. Sci.91936-462022Journal Articlesclosedjournals/tcs/BaiouCK2210.1016/J.TCS.2022.03.027https://doi.org/10.1016/j.tcs.2022.03.027https://dblp.org/rec/journals/tcs/BaiouCK22URL#747086Paolo BaldanDaniele GorlaTommaso PadoanIvano SalvoBehavioural logics for configuration structures.Theor. Comput. Sci.91394-1122022Journal Articlesclosedjournals/tcs/BaldanGPS2210.1016/J.TCS.2022.02.018https://doi.org/10.1016/j.tcs.2022.02.018https://dblp.org/rec/journals/tcs/BaldanGPS22URL#747087Paolo BaldanAlessandra RaffaetàMinimisation of event structures.Theor. Comput. Sci.935174-1992022Journal Articlesclosedjournals/tcs/BaldanR2210.1016/J.TCS.2022.09.006https://doi.org/10.1016/j.tcs.2022.09.006https://dblp.org/rec/journals/tcs/BaldanR22URL#747088Evripidis BampisDimitris ChristouBruno EscoffierAlexander V. KononovKim Thang NguyenA simple rounding scheme for multistage optimization.Theor. Comput. Sci.9071-102022Journal Articlesclosedjournals/tcs/BampisCEKN2210.1016/J.TCS.2022.01.009https://doi.org/10.1016/j.tcs.2022.01.009https://dblp.org/rec/journals/tcs/BampisCEKN22URL#747089Evripidis BampisDimitris ChristouBruno EscoffierKim Thang NguyenOnline learning for min-max discrete problems.Theor. Comput. Sci.930209-2172022Journal Articlesclosedjournals/tcs/BampisCEN2210.1016/J.TCS.2022.07.024https://doi.org/10.1016/j.tcs.2022.07.024https://dblp.org/rec/journals/tcs/BampisCEN22URL#747090Jung-Chao BanChih-Hung ChangWen-Guei HuYu-Liang WuTopological entropy for shifts of finite type over Z and trees.Theor. Comput. Sci.93024-322022Journal Articlesclosedjournals/tcs/BanCHW2210.1016/J.TCS.2022.07.007https://doi.org/10.1016/j.tcs.2022.07.007https://dblp.org/rec/journals/tcs/BanCHW22URL#747091Sayan BandyapadhyayTanmay Inamdar 0002Shreyas PaiSriram V. PemmarajuNear-optimal clustering in the k-machine model.Theor. Comput. Sci.89980-972022Journal Articlesclosedjournals/tcs/BandyapadhyayIP2210.1016/J.TCS.2021.11.026https://doi.org/10.1016/j.tcs.2021.11.026https://dblp.org/rec/journals/tcs/BandyapadhyayIP22URL#747092Jørgen Bang-JensenStéphane BessyDaniel Gonçalves 0001Lucas Picasarri-ArrietaComplexity of some arc-partition problems for digraphs.Theor. Comput. Sci.928167-1822022Journal Articlesclosedjournals/tcs/Bang-JensenBGP2210.1016/J.TCS.2022.06.023https://doi.org/10.1016/j.tcs.2022.06.023https://dblp.org/rec/journals/tcs/Bang-JensenBGP22URL#747093Xiaoguang BaoLei XuWei YuWei SongApproximation algorithms for the min-max clustered k-traveling salesmen problems.Theor. Comput. Sci.93360-662022Journal Articlesclosedjournals/tcs/BaoXYS2210.1016/J.TCS.2022.08.030https://doi.org/10.1016/j.tcs.2022.08.030https://dblp.org/rec/journals/tcs/BaoXYS22URL#747094Aviv Bar-NatanPanagiotis CharalampopoulosPawel GawrychowskiShay MozesOren WeimannFault-tolerant distance labeling for planar graphs.Theor. Comput. Sci.91848-592022Journal Articlesclosedjournals/tcs/Bar-NatanCGMW2210.1016/J.TCS.2022.03.020https://doi.org/10.1016/j.tcs.2022.03.020https://dblp.org/rec/journals/tcs/Bar-NatanCGMW22URL#747095Amotz Bar-NoyToni BöhnleinDavid PelegDror RawitzOn vertex-weighted realizations of acyclic and general graphs.Theor. Comput. Sci.92281-952022Journal Articlesclosedjournals/tcs/Bar-NoyBPR2210.1016/J.TCS.2022.04.012https://doi.org/10.1016/j.tcs.2022.04.012https://dblp.org/rec/journals/tcs/Bar-NoyBPR22URL#747096Dina Barak-PellegDaniel BerendJohn C. SaundersA model of random industrial SAT.Theor. Comput. Sci.91091-1122022Journal Articlesclosedjournals/tcs/Barak-PellegBS2210.1016/J.TCS.2022.01.038https://doi.org/10.1016/j.tcs.2022.01.038https://dblp.org/rec/journals/tcs/Barak-PellegBS22URL#747097Pablo BarcelóNelson HigueraJorge Pérez 0001Bernardo SubercaseauxOn the expressiveness of Lara: A proposal for unifying linear and relational algebra.Theor. Comput. Sci.935105-1272022Journal Articlesclosedjournals/tcs/BarceloHPS2210.1016/J.TCS.2022.09.003https://doi.org/10.1016/j.tcs.2022.09.003https://dblp.org/rec/journals/tcs/BarceloHPS22URL#747098Elena BarcucciAntonio BerniniRenzo PinzaniStrings from linear recurrences and permutations: A Gray code.Theor. Comput. Sci.938112-1202022Journal Articlesclosedjournals/tcs/BarcucciBP2210.1016/J.TCS.2022.10.012https://doi.org/10.1016/j.tcs.2022.10.012https://dblp.org/rec/journals/tcs/BarcucciBP22URL#747099Henk BarendregtSebastiaan A. TerwijnPartial combinatory algebra and generalized numberings.Theor. Comput. Sci.92537-442022Journal Articlesopenjournals/tcs/BarendregtT2210.1016/J.TCS.2022.04.054https://doi.org/10.1016/j.tcs.2022.04.054https://dblp.org/rec/journals/tcs/BarendregtT22URL#747100Jean-Luc BarilSergey KirgizovVincent VajnovszkiGray codes for Fibonacci q-decreasing words.Theor. Comput. Sci.927120-1322022Journal Articlesclosedjournals/tcs/BarilKV2210.1016/J.TCS.2022.06.003https://doi.org/10.1016/j.tcs.2022.06.003https://dblp.org/rec/journals/tcs/BarilKV22URL#747101Carl BartonOn the average-case complexity of pattern matching with wildcards.Theor. Comput. Sci.92237-452022Journal Articlesopenjournals/tcs/Barton2210.1016/J.TCS.2022.04.009https://doi.org/10.1016/j.tcs.2022.04.009https://dblp.org/rec/journals/tcs/Barton22URL#747102Marie-Pierre BéalMaxime CrochemoreChecking whether a word is Hamming-isometric in linear time.Theor. Comput. Sci.93355-592022Journal Articlesclosedjournals/tcs/BealC2210.1016/J.TCS.2022.08.032https://doi.org/10.1016/j.tcs.2022.08.032https://dblp.org/rec/journals/tcs/BealC22URL#747103Natalie C. BehagueAnthony BonatoMelissa A. HugganTrent G. MarbachBrittany PittmanThe localization capture time of a graph.Theor. Comput. Sci.91180-912022Journal Articlesclosedjournals/tcs/BehagueBHMP2210.1016/J.TCS.2022.02.007https://doi.org/10.1016/j.tcs.2022.02.007https://dblp.org/rec/journals/tcs/BehagueBHMP22URL#747104Jason P. BellJeffrey O. ShallitLie complexity of words.Theor. Comput. Sci.92798-1082022Journal Articlesclosedjournals/tcs/BellS2210.1016/J.TCS.2022.06.001https://doi.org/10.1016/j.tcs.2022.06.001https://dblp.org/rec/journals/tcs/BellS22URL#747105Oliver BendeleDieter RautenbachAdditive tree O(ρlogn)-spanners from tree breadth ρ.Theor. Comput. Sci.91439-462022Journal Articlesclosedjournals/tcs/BendeleR2210.1016/J.TCS.2022.02.011https://doi.org/10.1016/j.tcs.2022.02.011https://dblp.org/rec/journals/tcs/BendeleR22URL#747106Julien BensmailOn the hardness of determining the irregularity strength of graphs.Theor. Comput. Sci.93796-1072022Journal Articlesclosedjournals/tcs/Bensmail2210.1016/J.TCS.2022.09.033https://doi.org/10.1016/j.tcs.2022.09.033https://dblp.org/rec/journals/tcs/Bensmail22URL#747107Julien BensmailFrançois DrossNacim OijidÉric SopenaGeneralising the achromatic number to Zaslavsky's colourings of signed graphs.Theor. Comput. Sci.923196-2212022Journal Articlesclosedjournals/tcs/BensmailDOS2210.1016/J.TCS.2022.05.009https://doi.org/10.1016/j.tcs.2022.05.009https://dblp.org/rec/journals/tcs/BensmailDOS22URL#747108Julien BensmailFionn Mc InerneyOn a vertex-capturing game.Theor. Comput. Sci.92327-462022Journal Articlesclosedjournals/tcs/BensmailI2210.1016/J.TCS.2022.04.050https://doi.org/10.1016/j.tcs.2022.04.050https://dblp.org/rec/journals/tcs/BensmailI22URL#747109Matthias BentertLeon KellerhalsRolf NiedermeierThe structural complexity landscape of finding balance-fair shortest paths.Theor. Comput. Sci.933149-1622022Journal Articlesclosedjournals/tcs/BentertKN2210.1016/J.TCS.2022.08.023https://doi.org/10.1016/j.tcs.2022.08.023https://dblp.org/rec/journals/tcs/BentertKN22URL#747110Kristóf BércziEndre BorosOndrej CepekPetr KuceraKazuhisa MakinoUnique key Horn functions.Theor. Comput. Sci.922170-1782022Journal Articlesopenjournals/tcs/BercziBCKM2210.1016/J.TCS.2022.04.022https://doi.org/10.1016/j.tcs.2022.04.022https://dblp.org/rec/journals/tcs/BercziBCKM22URL#747111Kristóf BércziTamás KirályYutaro Yamaguchi 0001Yu YokoiApproximation by lexicographically maximal solutions in matching and matroid intersection problems.Theor. Comput. Sci.91048-532022Journal Articlesclosedjournals/tcs/BercziKYY2210.1016/J.TCS.2022.01.035https://doi.org/10.1016/j.tcs.2022.01.035https://dblp.org/rec/journals/tcs/BercziKYY22URL#747112Sergey BeregJosé Miguel Díaz-BáñezMohammadreza HaghpanahPaul HornMario Alberto LópezNestaly MarínAdriana Ramírez-ViguerasFabio RodríguezOriol Andreu Solé-PiAlex StevensJorge UrrutiaOptimal placement of base stations in border surveillance using limited capacity drones.Theor. Comput. Sci.928183-1962022Journal Articlesclosedjournals/tcs/BeregDHHLMRRSSU2210.1016/J.TCS.2022.06.024https://doi.org/10.1016/j.tcs.2022.06.024https://dblp.org/rec/journals/tcs/BeregDHHLMRRSSU22URL#747113Marc BezemThierry CoquandLoop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism.Theor. Comput. Sci.9131-72022Journal Articlesopenjournals/tcs/BezemC2210.1016/J.TCS.2022.01.017https://doi.org/10.1016/j.tcs.2022.01.017https://dblp.org/rec/journals/tcs/BezemC22URL#747114Arghya BhattacharyaRathish DasMachine learning advised algorithms for the ski rental problem with a discount.Theor. Comput. Sci.93839-492022Journal Articlesclosedjournals/tcs/BhattacharyaD2210.1016/J.TCS.2022.10.006https://doi.org/10.1016/j.tcs.2022.10.006https://dblp.org/rec/journals/tcs/BhattacharyaD22URL#747115Binay BhattacharyaSandip Das 0001Subhadeep Ranjan DevThe weighted k-center problem in trees for fixed k.Theor. Comput. Sci.90664-752022Journal Articlesclosedjournals/tcs/BhattacharyaDD2210.1016/J.TCS.2022.01.005https://doi.org/10.1016/j.tcs.2022.01.005https://dblp.org/rec/journals/tcs/BhattacharyaDD22URL#747116Sujoy BhoreSatyabrata JanaSupantha PanditSasanka RoyThe balanced connected subgraph problem for geometric intersection graphs.Theor. Comput. Sci.92969-802022Journal Articlesclosedjournals/tcs/BhoreJPR2210.1016/J.TCS.2022.06.030https://doi.org/10.1016/j.tcs.2022.06.030https://dblp.org/rec/journals/tcs/BhoreJPR22URL#747117Mohammad Tawhidul Hasan BhuiyanMuhammad Rashed AlamM. Sohel RahmanComputing the longest common almost-increasing subsequence.Theor. Comput. Sci.930157-1782022Journal Articlesclosedjournals/tcs/BhuiyanAR2210.1016/J.TCS.2022.07.021https://doi.org/10.1016/j.tcs.2022.07.021https://dblp.org/rec/journals/tcs/BhuiyanAR22URL#747118Philip BilleInge Li GørtzMax Rishøj PedersenEva RotenbergTeresa Anna SteinerString indexing for top-k close consecutive occurrences.Theor. Comput. Sci.927133-1472022Journal Articlesclosedjournals/tcs/BilleGPRS2210.1016/J.TCS.2022.06.004https://doi.org/10.1016/j.tcs.2022.06.004https://dblp.org/rec/journals/tcs/BilleGPRS22URL#747119Philip BilleInge Li GørtzFrederik Rye SkjoldjensenPartial sums on the ultra-wide word RAM.Theor. Comput. Sci.90599-1052022Journal Articlesclosedjournals/tcs/BilleGS2210.1016/J.TCS.2022.01.002https://doi.org/10.1016/j.tcs.2022.01.002https://dblp.org/rec/journals/tcs/BilleGS22URL#747120Vittorio BilòOn the robustness of the approximate price of anarchy in generalized congestion games.Theor. Comput. Sci.90694-1132022Journal Articlesclosedjournals/tcs/Bilo2210.1016/J.TCS.2022.01.008https://doi.org/10.1016/j.tcs.2022.01.008https://dblp.org/rec/journals/tcs/Bilo22URL#747121Davide BilòAlmost optimal algorithms for diameter-optimally augmenting trees.Theor. Comput. Sci.93131-482022Journal Articlesclosedjournals/tcs/Bilo22a10.1016/J.TCS.2022.07.028https://doi.org/10.1016/j.tcs.2022.07.028https://dblp.org/rec/journals/tcs/Bilo22aURL#747122Davide BilòLuciano GualàStefano Leucci 0001Guido ProiettiGiacomo ScornavaccaCutting bamboo down to size.Theor. Comput. Sci.90954-672022Journal Articlesclosedjournals/tcs/BiloG0PS2210.1016/J.TCS.2022.01.027https://doi.org/10.1016/j.tcs.2022.01.027https://dblp.org/rec/journals/tcs/BiloG0PS22URL#747123Davide BilòLuciano GualàStefano Leucci 0001Guido ProiettiMirko RossiNew approximation algorithms for the heterogeneous weighted delivery problem.Theor. Comput. Sci.932102-1152022Journal Articlesclosedjournals/tcs/BiloGLPR2210.1016/J.TCS.2022.08.009https://doi.org/10.1016/j.tcs.2022.08.009https://dblp.org/rec/journals/tcs/BiloGLPR22URL#747124Sagar BisoyiKrishnamoorthy Dinesh 0001Jayalal SarmaOn pure space vs catalytic space.Theor. Comput. Sci.921112-1262022Journal Articlesclosedjournals/tcs/BisoyiDS2210.1016/J.TCS.2022.04.005https://doi.org/10.1016/j.tcs.2022.04.005https://dblp.org/rec/journals/tcs/BisoyiDS22URL#747125Thomas BläsiusTobias Friedrich 0001Martin SchirneckThe complexity of dependency detection and discovery in relational databases.Theor. Comput. Sci.90079-962022Journal Articlesclosedjournals/tcs/BlasiusFS2210.1016/J.TCS.2021.11.020https://doi.org/10.1016/j.tcs.2021.11.020https://dblp.org/rec/journals/tcs/BlasiusFS22URL#747126Hans-Joachim BöckenhauerNina Corvelo BenzDennis KommCall admission problems on trees.Theor. Comput. Sci.922410-4232022Journal Articlesopenjournals/tcs/BockenhauerBK2210.1016/J.TCS.2022.04.042https://doi.org/10.1016/j.tcs.2022.04.042https://dblp.org/rec/journals/tcs/BockenhauerBK22URL#747127Hans-Joachim BöckenhauerDennis KommRaphael WegnerCall admission problems on grids with advice.Theor. Comput. Sci.91877-932022Journal Articlesclosedjournals/tcs/BockenhauerKW2210.1016/J.TCS.2022.03.022https://doi.org/10.1016/j.tcs.2022.03.022https://dblp.org/rec/journals/tcs/BockenhauerKW22URL#747128Martin Böhm 0001Bertrand Simon 0001Discovering and certifying lower bounds for the online bin stretching problem.Theor. Comput. Sci.9381-152022Journal Articlesclosedjournals/tcs/BohmS2210.1016/J.TCS.2022.10.004https://doi.org/10.1016/j.tcs.2022.10.004https://dblp.org/rec/journals/tcs/BohmS22URL#747129Vincenzo BonifaciEnrico FaccaFrederic FolzAndreas KarrenbauerPavel KolevKurt MehlhornGiovanna MorigiGolnoosh ShahkaramiQuentin VermandePhysarum-inspired multi-commodity flow dynamics.Theor. Comput. Sci.9201-202022Journal Articlesclosedjournals/tcs/BonifaciFFKKMMS2210.1016/J.TCS.2022.02.001https://doi.org/10.1016/j.tcs.2022.02.001https://dblp.org/rec/journals/tcs/BonifaciFFKKMMS22URL#747130Magnus BordewichCharles SempleKristina WickeOn the complexity of optimising variants of phylogenetic diversity on phylogenetic networks.Theor. Comput. Sci.91766-802022Journal Articlesopenjournals/tcs/BordewichSW2210.1016/J.TCS.2022.03.012https://doi.org/10.1016/j.tcs.2022.03.012https://dblp.org/rec/journals/tcs/BordewichSW22URL#747131Prosenjit BosePilar CanoRolf FagerbergJohn IaconoRiko JacobStefan LangermanFragile complexity of adaptive algorithms.Theor. Comput. Sci.91992-1022022Journal Articlesclosedjournals/tcs/BoseCFIJL2210.1016/J.TCS.2022.03.034https://doi.org/10.1016/j.tcs.2022.03.034https://dblp.org/rec/journals/tcs/BoseCFIJL22URL#747132Prosenjit BoseSaeed Mehrabi 0001Debajyoti MondalParameterized complexity of two-interval pattern problem.Theor. Comput. Sci.90221-282022Journal Articlesclosedjournals/tcs/BoseMM2210.1016/J.TCS.2021.12.005https://doi.org/10.1016/j.tcs.2021.12.005https://dblp.org/rec/journals/tcs/BoseMM22URL#747133Bartlomiej BosekDariusz LeniowskiPiotr SankowskiAnna Zych-PawlewiczA tight bound for shortest augmenting paths on trees.Theor. Comput. Sci.90145-612022Journal Articlesclosedjournals/tcs/BosekLSZ2210.1016/J.TCS.2021.11.025https://doi.org/10.1016/j.tcs.2021.11.025https://dblp.org/rec/journals/tcs/BosekLSZ22URL#747134Zohir BouzidPierre SutraCorentin TraversAgreeing within a few writes.Theor. Comput. Sci.922283-2992022Journal Articlesclosedjournals/tcs/BouzidST2210.1016/J.TCS.2022.04.030https://doi.org/10.1016/j.tcs.2022.04.030https://dblp.org/rec/journals/tcs/BouzidST22URL#747135Arman BoyaciTínaz EkimMordechai ShalomOn the maximum cardinality cut problem in proper interval graphs and related graph classes.Theor. Comput. Sci.89820-292022Journal Articlesclosedjournals/tcs/BoyaciES2210.1016/J.TCS.2021.10.014https://doi.org/10.1016/j.tcs.2021.10.014https://dblp.org/rec/journals/tcs/BoyaciES22URL#747136Laura BozzelliAngelo MontanariAdriano PeronComplexity issues for timeline-based planning over dense time under future and minimal semantics.Theor. Comput. Sci.90187-1132022Journal Articlesclosedjournals/tcs/BozzelliMP2210.1016/J.TCS.2021.12.004https://doi.org/10.1016/j.tcs.2021.12.004https://dblp.org/rec/journals/tcs/BozzelliMP22URL#747137Christoph BrausePetr A. GolovachBarnaby MartinDaniël PaulusmaSiani SmithPartitioning H-free graphs of bounded diameter.Theor. Comput. Sci.93037-522022Journal Articlesclosedjournals/tcs/BrauseGMPS2210.1016/J.TCS.2022.07.009https://doi.org/10.1016/j.tcs.2022.07.009https://dblp.org/rec/journals/tcs/BrauseGMPS22URL#747138Nick BrettellMatthew Johnson 0002Giacomo PaesaniDaniël PaulusmaComputing subset transversals in H-free graphs.Theor. Comput. Sci.90276-922022Journal Articlesclosedjournals/tcs/BrettellJPP2210.1016/J.TCS.2021.12.010https://doi.org/10.1016/j.tcs.2021.12.010https://dblp.org/rec/journals/tcs/BrettellJPP22URL#747139Douglas S. BridgesMorse set theory as a foundation for constructive mathematics.Theor. Comput. Sci.928115-1352022Journal Articlesclosedjournals/tcs/Bridges2210.1016/J.TCS.2022.06.019https://doi.org/10.1016/j.tcs.2022.06.019https://dblp.org/rec/journals/tcs/Bridges22URL#747140Florian BridouxSequentialization and procedural complexity in automata networks.Theor. Comput. Sci.89892-1092022Journal Articlesclosedjournals/tcs/Bridoux2210.1016/J.TCS.2021.11.001https://doi.org/10.1016/j.tcs.2021.11.001https://dblp.org/rec/journals/tcs/Bridoux22URL#747141Justin CaiRafael M. FrongilloComputational complexity of problems for deterministic presentations of sofic shifts.Theor. Comput. Sci.93692-1152022Journal Articlesclosedjournals/tcs/CaiF2210.1016/J.TCS.2022.09.017https://doi.org/10.1016/j.tcs.2022.09.017https://dblp.org/rec/journals/tcs/CaiF22URL#747142Tiziana CalamoneriEditorial.Theor. Comput. Sci.931152-1532022Journal Articlesclosedjournals/tcs/Calamoneri2210.1016/J.TCS.2022.05.007https://doi.org/10.1016/j.tcs.2022.05.007https://dblp.org/rec/journals/tcs/Calamoneri22URL#747143Marco CalauttiSergio GrecoCristian MolinaroIrina TrubitsynaQuery answering over inconsistent knowledge bases: A probabilistic approach.Theor. Comput. Sci.935144-1732022Journal Articlesclosedjournals/tcs/CalauttiGMT2210.1016/J.TCS.2022.09.005https://doi.org/10.1016/j.tcs.2022.09.005https://dblp.org/rec/journals/tcs/CalauttiGMT22URL#747144Andrea CampagnerDavide CiucciValentina DorigattiUncertainty representation in dynamical systems using rough set theory.Theor. Comput. Sci.90828-422022Journal Articlesclosedjournals/tcs/CampagnerCD2210.1016/J.TCS.2021.11.009https://doi.org/10.1016/j.tcs.2021.11.009https://dblp.org/rec/journals/tcs/CampagnerCD22URL#747145Alan Diêgo Aurélio CarneiroFábio ProttiUéverton dos Santos SouzaOn knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem.Theor. Comput. Sci.90997-1092022Journal Articlesclosedjournals/tcs/CarneiroPS2210.1016/J.TCS.2022.01.031https://doi.org/10.1016/j.tcs.2022.01.031https://dblp.org/rec/journals/tcs/CarneiroPS22URL#747146Filipe CasalAndreia MordidoVasco T. VasconcelosMixed sessions.Theor. Comput. Sci.89723-482022Journal Articlesclosedjournals/tcs/CasalMV2210.1016/J.TCS.2021.08.005https://doi.org/10.1016/j.tcs.2021.08.005https://dblp.org/rec/journals/tcs/CasalMV22URL#747147Katrin CaselHenning FernauMehdi Khosravian GhadikolaeiJérôme MonnotFlorian SikoraOn the complexity of solution extension of optimization problems.Theor. Comput. Sci.90448-652022Journal Articlesclosedjournals/tcs/CaselFGMS2210.1016/J.TCS.2021.10.017https://doi.org/10.1016/j.tcs.2021.10.017https://dblp.org/rec/journals/tcs/CaselFGMS22URL#747148Guilhem CastagnosFabien LaguillaumieIda TuckerA tighter proof for CCA secure inner product functional encryption: Genericity meets efficiency.Theor. Comput. Sci.91484-1132022Journal Articlesclosedjournals/tcs/CastagnosLT2210.1016/J.TCS.2022.02.014https://doi.org/10.1016/j.tcs.2022.02.014https://dblp.org/rec/journals/tcs/CastagnosLT22URL#747149Giuseppa CastiglioneStepan HolubThe intersection of 3-maximal submonoids.Theor. Comput. Sci.90135-442022Journal Articlesclosedjournals/tcs/CastiglioneH2210.1016/J.TCS.2021.11.024https://doi.org/10.1016/j.tcs.2021.11.024https://dblp.org/rec/journals/tcs/CastiglioneH22URL#747150Maumita ChakrabortyRanjan MeheraRajat Kumar PalDivide-and-conquer based all spanning tree generation algorithm of a simple connected graph.Theor. Comput. Sci.90035-522022Journal Articlesclosedjournals/tcs/ChakrabortyMP2210.1016/J.TCS.2021.11.018https://doi.org/10.1016/j.tcs.2021.11.018https://dblp.org/rec/journals/tcs/ChakrabortyMP22URL#747151Neeraj ChandnaniChandrakant N. KhairnarAn analysis of architecture, framework, security and challenging aspects for data aggregation and routing techniques in IoT WSNs.Theor. Comput. Sci.92995-1132022Journal Articlesclosedjournals/tcs/ChandnaniK2210.1016/J.TCS.2022.06.032https://doi.org/10.1016/j.tcs.2022.06.032https://dblp.org/rec/journals/tcs/ChandnaniK22URL#747152Steven ChaplickStefan FelsnerPhilipp KindermannJonathan KlawitterIgnaz RutterAlexander Wolff 0001Simple algorithms for partial and simultaneous rectangular duals with given contact orientations.Theor. Comput. Sci.91966-742022Journal Articlesclosedjournals/tcs/ChaplickFKKRW2210.1016/J.TCS.2022.03.031https://doi.org/10.1016/j.tcs.2022.03.031https://dblp.org/rec/journals/tcs/ChaplickFKKRW22URL#747153Hong ChenMeirun ChenMichel HabibCheng-Kuan LinConnectivity for some families of composition networks.Theor. Comput. Sci.922361-3672022Journal Articlesclosedjournals/tcs/ChenCHL2210.1016/J.TCS.2022.04.036https://doi.org/10.1016/j.tcs.2022.04.036https://dblp.org/rec/journals/tcs/ChenCHL22URL#747154Sheng Chen 0007Yi DaiDelta invariant for Eulerian digraphs.Theor. Comput. Sci.92894-1032022Journal Articlesclosedjournals/tcs/ChenD2210.1016/J.TCS.2022.06.016https://doi.org/10.1016/j.tcs.2022.06.016https://dblp.org/rec/journals/tcs/ChenD22URL#747155Jianer ChenMinjie HuangYin GuoScheduling multiple two-stage flowshops with a deadline.Theor. Comput. Sci.921100-1112022Journal Articlesclosedjournals/tcs/ChenHG2210.1016/J.TCS.2022.04.004https://doi.org/10.1016/j.tcs.2022.04.004https://dblp.org/rec/journals/tcs/ChenHG22URL#747156Meirun ChenD. Frank HsuCheng-Kuan LinA new structure for a vertex to be locally t-diagnosable in large multiprocessor systems.Theor. Comput. Sci.93481-902022Journal Articlesclosedjournals/tcs/ChenHL2210.1016/J.TCS.2022.08.020https://doi.org/10.1016/j.tcs.2022.08.020https://dblp.org/rec/journals/tcs/ChenHL22URL#747157Xinjian Chen 0004Qiong Huang 0001Hongbo Li 0004Zhijian LiaoWilly SusiloA novel identity-based multi-signature scheme over NTRU lattices.Theor. Comput. Sci.933163-1762022Journal Articlesclosedjournals/tcs/ChenHLLS2210.1016/J.TCS.2022.08.022https://doi.org/10.1016/j.tcs.2022.08.022https://dblp.org/rec/journals/tcs/ChenHLLS22URL#747158Mengjing ChenHaoqiang HuangWeiran ShenPingzhong TangZihe Wang 0001Jie Zhang 0008Optimal pricing policy design for selling cost-reducing innovation in Cournot games.Theor. Comput. Sci.90162-862022Journal Articlesclosedjournals/tcs/ChenHSTWZ2210.1016/J.TCS.2021.12.001https://doi.org/10.1016/j.tcs.2021.12.001https://dblp.org/rec/journals/tcs/ChenHSTWZ22URL#747159You ChenXueliang Li 0001The proper vertex-disconnection of graphs.Theor. Comput. Sci.923167-1782022Journal Articlesclosedjournals/tcs/ChenL2210.1016/J.TCS.2022.05.004https://doi.org/10.1016/j.tcs.2022.05.004https://dblp.org/rec/journals/tcs/ChenL22URL#747160Xujin ChenMinming LiChangjun WangChenhao Wang 0001Mengqi ZhangYingchao Zhao 0001Mechanisms for dual-role-facility location games: Truthfulness and approximability.Theor. Comput. Sci.93269-832022Journal Articlesclosedjournals/tcs/ChenLWWZZ2210.1016/J.TCS.2022.08.007https://doi.org/10.1016/j.tcs.2022.08.007https://dblp.org/rec/journals/tcs/ChenLWWZZ22URL#747161Zuzhi ChenJialin Zhang 0001Online scheduling of time-critical tasks to minimize the number of calibrations.Theor. Comput. Sci.9141-132022Journal Articlesclosedjournals/tcs/ChenZ2210.1016/J.TCS.2022.01.040https://doi.org/10.1016/j.tcs.2022.01.040https://dblp.org/rec/journals/tcs/ChenZ22URL#747162Dongqin ChengEmbedding mutually edge-disjoint cycles into locally twisted cubes.Theor. Comput. Sci.92911-172022Journal Articlesclosedjournals/tcs/Cheng2210.1016/J.TCS.2022.06.027https://doi.org/10.1016/j.tcs.2022.06.027https://dblp.org/rec/journals/tcs/Cheng22URL#747163Siu-Wing ChengMultistage online maxmin allocation of indivisible entities.Theor. Comput. Sci.933104-1132022Journal Articlesclosedjournals/tcs/Cheng22a10.1016/J.TCS.2022.08.027https://doi.org/10.1016/j.tcs.2022.08.027https://dblp.org/rec/journals/tcs/Cheng22aURL#747164Eddie Cheng 0001Ke Qiu 0001Zhizhang ShenOn the g-extra diagnosability of enhanced hypercubes.Theor. Comput. Sci.9216-192022Journal Articlesclosedjournals/tcs/ChengQS2210.1016/J.TCS.2022.03.037https://doi.org/10.1016/j.tcs.2022.03.037https://dblp.org/rec/journals/tcs/ChengQS22URL#747165Flavio ChierichettiAnirban Dasgupta 0001Ravi Kumar 0001On additive approximate submodularity.Theor. Comput. Sci.922346-3602022Journal Articlesclosedjournals/tcs/ChierichettiDK2210.1016/J.TCS.2022.04.035https://doi.org/10.1016/j.tcs.2022.04.035https://dblp.org/rec/journals/tcs/ChierichettiDK22URL#747166Markus ChimaniPhilipp KindermannFabrizio MontecchianiPavel Valtr 0001Crossing numbers of beyond-planar graphs.Theor. Comput. Sci.89844-492022Journal Articlesclosedjournals/tcs/ChimaniKMV2210.1016/J.TCS.2021.10.016https://doi.org/10.1016/j.tcs.2021.10.016https://dblp.org/rec/journals/tcs/ChimaniKMV22URL#747167Vicent CholviPawel GarncarekTomasz JurdzinskiDariusz R. KowalskiStable routing scheduling algorithms in multi-hop wireless networks.Theor. Comput. Sci.92120-352022Journal Articlesopenjournals/tcs/CholviGJK2210.1016/J.TCS.2022.03.038https://doi.org/10.1016/j.tcs.2022.03.038https://dblp.org/rec/journals/tcs/CholviGJK22URL#747168Pratibha ChoudharyVenkatesh Raman 0001Structural parameterizations of Tracking Paths problem.Theor. Comput. Sci.93491-1022022Journal Articlesclosedjournals/tcs/ChoudharyR2210.1016/J.TCS.2022.09.009https://doi.org/10.1016/j.tcs.2022.09.009https://dblp.org/rec/journals/tcs/ChoudharyR22URL#747169Trevor ClokieThomas F. LidbetterAntonio Molina LovettJeffrey O. ShallitLeon WitzmanComputational aspects of sturdy and flimsy numbers.Theor. Comput. Sci.92765-862022Journal Articlesclosedjournals/tcs/ClokieLLSW2210.1016/J.TCS.2022.05.029https://doi.org/10.1016/j.tcs.2022.05.029https://dblp.org/rec/journals/tcs/ClokieLLSW22URL#747170Bob CoeckeDominic HorsmanAleks KissingerQuanlong WangKindergarden quantum mechanics graduates ...or how I learned to stop gluing LEGO together and love the ZX-calculus.Theor. Comput. Sci.8971-222022Journal Articlesclosedjournals/tcs/CoeckeHKW2210.1016/J.TCS.2021.07.024https://doi.org/10.1016/j.tcs.2021.07.024https://dblp.org/rec/journals/tcs/CoeckeHKW22URL#747171João Guilherme Fritsche ColomboJerusa MarchiA nondeterministic Turing machine variant to compute functions.Theor. Comput. Sci.90254-632022Journal Articlesclosedjournals/tcs/ColomboM2210.1016/J.TCS.2021.12.008https://doi.org/10.1016/j.tcs.2021.12.008https://dblp.org/rec/journals/tcs/ColomboM22URL#747172Noemie CombeYuri I. ManinMatilde MarcolliGeometry of information: Classical and quantum aspects.Theor. Comput. Sci.9082-272022Journal Articlesclosedjournals/tcs/CombeMM2210.1016/J.TCS.2021.10.020https://doi.org/10.1016/j.tcs.2021.10.020https://dblp.org/rec/journals/tcs/CombeMM22URL#747173Matthew ConnorOthon MichailIgor PotapovCentralised connectivity-preserving transformations for programmable matter: A minimal seed approach.Theor. Comput. Sci.93677-912022Journal Articlesclosedjournals/tcs/ConnorMP2210.1016/J.TCS.2022.09.016https://doi.org/10.1016/j.tcs.2022.09.016https://dblp.org/rec/journals/tcs/ConnorMP22URL#747174Alessio ConteEtsuji TomitaOn the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms.Theor. Comput. Sci.8991-242022Journal Articlesclosedjournals/tcs/ConteT2210.1016/J.TCS.2021.11.005https://doi.org/10.1016/j.tcs.2021.11.005https://dblp.org/rec/journals/tcs/ConteT22URL#747175Daniel CoronelAlexander FrankMathieu HoyrupCristobal RojasRealizing semicomputable simplices by computable dynamical systems.Theor. Comput. Sci.93343-542022Journal Articlesclosedjournals/tcs/CoronelFHR2210.1016/J.TCS.2022.09.001https://doi.org/10.1016/j.tcs.2022.09.001https://dblp.org/rec/journals/tcs/CoronelFHR22URL#747176Eurinardo Rodrigues CostaNicolas Almeida MartinsRudini M. SampaioSpy game: FPT-algorithm, hardness and graph products.Theor. Comput. Sci.923304-3172022Journal Articlesclosedjournals/tcs/CostaMS2210.1016/J.TCS.2022.05.015https://doi.org/10.1016/j.tcs.2022.05.015https://dblp.org/rec/journals/tcs/CostaMS22URL#747177Peter Crawford-KahrlBree CumminsTomás GedeonJoint realizability of monotone Boolean functions.Theor. Comput. Sci.922447-4742022Journal Articlesclosedjournals/tcs/Crawford-KahrlC2210.1016/J.TCS.2022.04.045https://doi.org/10.1016/j.tcs.2022.04.045https://dblp.org/rec/journals/tcs/Crawford-KahrlC22URL#747178Stefano Crespi-ReghizziAntonio RestivoPierluigi San PietroReducing the local alphabet size in tiling systems by means of 2D comma-free codes.Theor. Comput. Sci.9331-202022Journal Articlesclosedjournals/tcs/Crespi-Reghizzi2210.1016/J.TCS.2022.09.010https://doi.org/10.1016/j.tcs.2022.09.010https://dblp.org/rec/journals/tcs/Crespi-Reghizzi22URL#747179Gergely CsájiOn the complexity of stable hypergraph matching, stable multicommodity flow and related problems.Theor. Comput. Sci.9311-162022Journal Articlesclosedjournals/tcs/Csaji2210.1016/J.TCS.2022.07.025https://doi.org/10.1016/j.tcs.2022.07.025https://dblp.org/rec/journals/tcs/Csaji22URL#747180Andrzej CzygrinowMichal HanckowiakMarcin WitkowskiDistributed distance domination in graphs with no K2, t-minor.Theor. Comput. Sci.91622-302022Journal Articlesclosedjournals/tcs/CzygrinowHW2210.1016/J.TCS.2022.03.001https://doi.org/10.1016/j.tcs.2022.03.001https://dblp.org/rec/journals/tcs/CzygrinowHW22URL#747181Yingjun DaiAngèle M. FoleyChính T. HoàngVertex coloring (4K1, hole-twin, 5-wheel)-free graphs.Theor. Comput. Sci.91414-222022Journal Articlesclosedjournals/tcs/DaiFH2210.1016/J.TCS.2022.02.009https://doi.org/10.1016/j.tcs.2022.02.009https://dblp.org/rec/journals/tcs/DaiFH22URL#747182Ferruccio DamianiMichael LienhardtLuca PaoliniOn logical and extensional characterizations of attributed feature models.Theor. Comput. Sci.91256-802022Journal Articlesclosedjournals/tcs/DamianiLP2210.1016/J.TCS.2022.01.016https://doi.org/10.1016/j.tcs.2022.01.016https://dblp.org/rec/journals/tcs/DamianiLP22URL#747183Archak DasKaustav BoseBuddhadeb SauExploring a dynamic ring without landmark.Theor. Comput. Sci.929191-2052022Journal Articlesclosedjournals/tcs/DasBS2210.1016/J.TCS.2022.07.005https://doi.org/10.1016/j.tcs.2022.07.005https://dblp.org/rec/journals/tcs/DasBS22URL#747184Bibhuti Das 0001Abhinav ChakrabortySubhash BhagatKrishnendu Mukhopadhyayak-Circle formation by disoriented asynchronous robots.Theor. Comput. Sci.91640-612022Journal Articlesclosedjournals/tcs/DasCBM2210.1016/J.TCS.2022.03.003https://doi.org/10.1016/j.tcs.2022.03.003https://dblp.org/rec/journals/tcs/DasCBM22URL#747185Avinandan DasLawqueen KaneshJayakrishnan MadathilKomal MulukNidhi PurohitSaket Saurabh 0001On the complexity of singly connected vertex deletion.Theor. Comput. Sci.93447-642022Journal Articlesclosedjournals/tcs/DasKMMPS2210.1016/J.TCS.2022.08.012https://doi.org/10.1016/j.tcs.2022.08.012https://dblp.org/rec/journals/tcs/DasKMMPS22URL#747186Marc DemangeAlessia Di FonsoGabriele Di StefanoPierpaolo VittoriniA graph theoretical approach to the firebreak locating problem.Theor. Comput. Sci.91447-722022Journal Articlesclosedjournals/tcs/DemangeFSV2210.1016/J.TCS.2022.02.012https://doi.org/10.1016/j.tcs.2022.02.012https://dblp.org/rec/journals/tcs/DemangeFSV22URL#747187Yuxin DengYuan Feng 0001Formal semantics of a classical-quantum language.Theor. Comput. Sci.91373-932022Journal Articlesclosedjournals/tcs/DengF2210.1016/J.TCS.2022.02.017https://doi.org/10.1016/j.tcs.2022.02.017https://dblp.org/rec/journals/tcs/DengF22URL#747188Lu DongDariusz R. KowalskiHarshita KudaravalliMiguel A. MosteiroInformation dissemination in wireless ad-hoc networks under the weighted-TIM framework.Theor. Comput. Sci.90119-342022Journal Articlesclosedjournals/tcs/DongKKM2210.1016/J.TCS.2021.11.022https://doi.org/10.1016/j.tcs.2021.11.022https://dblp.org/rec/journals/tcs/DongKKM22URL#747189Luobing DongHaobin LuoShan ZhangYanan RenMingdong DuanYifan QinProgressive-encoding-based transmission for DNN-enabled edge intelligence in unreliable network.Theor. Comput. Sci.92871-812022Journal Articlesclosedjournals/tcs/DongLZRDQ2210.1016/J.TCS.2022.06.014https://doi.org/10.1016/j.tcs.2022.06.014https://dblp.org/rec/journals/tcs/DongLZRDQ22URL#747190Rongcheng DongYuichi SudoTaisuke IzumiToshimitsu MasuzawaLoosely-stabilizing maximal independent set algorithms with unreliable communications.Theor. Comput. Sci.93769-842022Journal Articlesclosedjournals/tcs/DongSIM2210.1016/J.TCS.2022.09.031https://doi.org/10.1016/j.tcs.2022.09.031https://dblp.org/rec/journals/tcs/DongSIM22URL#747191Mitre Costa DouradoLucia Draque PensoDieter RautenbachThe hull number in the convexity of induced paths of order 3.Theor. Comput. Sci.90652-632022Journal Articlesclosedjournals/tcs/DouradoPR2210.1016/J.TCS.2022.01.004https://doi.org/10.1016/j.tcs.2022.01.004https://dblp.org/rec/journals/tcs/DouradoPR22URL#747192Manfred DrosteZoltán Fülöp 0001Dávid KószóHeiko VoglerFinite-image property of weighted tree automata over past-finite monotonic strong bimonoids.Theor. Comput. Sci.919118-1432022Journal Articlesclosedjournals/tcs/DrosteFKV2210.1016/J.TCS.2022.03.036https://doi.org/10.1016/j.tcs.2022.03.036https://dblp.org/rec/journals/tcs/DrosteFKV22URL#747193Jiao DuZiyu ChenShaojing FuLongjiang QuChao Li 0002Constructions of 2-resilient rotation symmetric Boolean functions through symbol transformations of cyclic Hadamard matrix.Theor. Comput. Sci.91980-912022Journal Articlesclosedjournals/tcs/DuCFQL2210.1016/J.TCS.2022.03.033https://doi.org/10.1016/j.tcs.2022.03.033https://dblp.org/rec/journals/tcs/DuCFQL22URL#747194Louis DubloisMichael LampisVangelis Th. PaschosUpper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation.Theor. Comput. Sci.923271-2912022Journal Articlesclosedjournals/tcs/DubloisLP2210.1016/J.TCS.2022.05.013https://doi.org/10.1016/j.tcs.2022.05.013https://dblp.org/rec/journals/tcs/DubloisLP22URL#747195Guillaume DucoffeEccentricity queries and beyond using hub labels.Theor. Comput. Sci.930128-1412022Journal Articlesclosedjournals/tcs/Ducoffe2210.1016/J.TCS.2022.07.017https://doi.org/10.1016/j.tcs.2022.07.017https://dblp.org/rec/journals/tcs/Ducoffe22URL#747196Dung Hoang DuongPartha Sarathi Roy 0001Willy SusiloKazuhide FukushimaShinsaku KiyomotoArnaud SipasseuthChosen-ciphertext lattice-based public key encryption with equality test in standard model.Theor. Comput. Sci.90531-532022Journal Articlesclosedjournals/tcs/DuongRSFKS2210.1016/J.TCS.2021.12.013https://doi.org/10.1016/j.tcs.2021.12.013https://dblp.org/rec/journals/tcs/DuongRSFKS22URL#747197Anaïs DurandMichel RaynalGadi TaubenfeldContention-related crash failures: Definitions, agreement algorithms, and impossibility results.Theor. Comput. Sci.90976-862022Journal Articlesclosedjournals/tcs/DurandRT2210.1016/J.TCS.2022.01.029https://doi.org/10.1016/j.tcs.2022.01.029https://dblp.org/rec/journals/tcs/DurandRT22URL#747198Adrien DurierDaniel HirschkoffDavide SangiorgiEager functions as processes.Theor. Comput. Sci.9138-422022Journal Articlesclosedjournals/tcs/DurierHS2210.1016/J.TCS.2022.01.043https://doi.org/10.1016/j.tcs.2022.01.043https://dblp.org/rec/journals/tcs/DurierHS22URL#747199Priyanka Dutta 0001Willy SusiloDung Hoang DuongPartha Sarathi Roy 0001Puncturable identity-based and attribute-based encryption from lattices.Theor. Comput. Sci.92918-382022Journal Articlesclosedjournals/tcs/DuttaSDR2210.1016/J.TCS.2022.06.028https://doi.org/10.1016/j.tcs.2022.06.028https://dblp.org/rec/journals/tcs/DuttaSDR22URL#747200L'ubomíra DvorákováEdita PelantováDaniela OpocenskáArseny M. ShurOn minimal critical exponent of balanced sequences.Theor. Comput. Sci.922158-1692022Journal Articlesclosedjournals/tcs/DvorakovaPOS2210.1016/J.TCS.2022.04.021https://doi.org/10.1016/j.tcs.2022.04.021https://dblp.org/rec/journals/tcs/DvorakovaPOS22URL#747201El-Mahdi El-MhamdiRachid GuerraouiLê-Nguyên HoangAlexandre MaurerRemoving algorithmic discrimination (with minimal individual error).Theor. Comput. Sci.92347-552022Journal Articlesclosedjournals/tcs/El-MhamdiGHM2210.1016/J.TCS.2022.04.051https://doi.org/10.1016/j.tcs.2022.04.051https://dblp.org/rec/journals/tcs/El-MhamdiGHM22URL#747202Khaled M. ElbassioniQuasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs.Theor. Comput. Sci.90264-752022Journal Articlesclosedjournals/tcs/Elbassioni2210.1016/J.TCS.2021.12.009https://doi.org/10.1016/j.tcs.2021.12.009https://dblp.org/rec/journals/tcs/Elbassioni22URL#747203Murray ElderAdam PiggottRewriting systems, plain groups, and geodetic graphs.Theor. Comput. Sci.903134-1442022Journal Articlesclosedjournals/tcs/ElderP2210.1016/J.TCS.2021.12.022https://doi.org/10.1016/j.tcs.2021.12.022https://dblp.org/rec/journals/tcs/ElderP22URL#747204Michael ElkinOfer NeimanDistributed strong diameter network decomposition.Theor. Comput. Sci.922150-1572022Journal Articlesclosedjournals/tcs/ElkinN2210.1016/J.TCS.2022.04.019https://doi.org/10.1016/j.tcs.2022.04.019https://dblp.org/rec/journals/tcs/ElkinN22URL#747205Keita EmuraShuichi KatsumataYohei Watanabe 0001Identity-based encryption with security against the KGC: A formal model and its instantiations.Theor. Comput. Sci.90097-1192022Journal Articlesopenjournals/tcs/EmuraKW2210.1016/J.TCS.2021.11.021https://doi.org/10.1016/j.tcs.2021.11.021https://dblp.org/rec/journals/tcs/EmuraKW22URL#747206David EppsteinDaniel FrishbergWilliam MaxwellOn the treewidth of Hanoi graphs.Theor. Comput. Sci.9061-172022Journal Articlesopenjournals/tcs/EppsteinFM2210.1016/J.TCS.2021.12.014https://doi.org/10.1016/j.tcs.2021.12.014https://dblp.org/rec/journals/tcs/EppsteinFM22URL#747207Bruno EscoffierLaurent GourvèsVangelis Th. PaschosIn memory of Jérôme Monnot.Theor. Comput. Sci.9211-32022Journal Articlesclosedjournals/tcs/EscoffierGP2210.1016/J.TCS.2022.01.045https://doi.org/10.1016/j.tcs.2022.01.045https://dblp.org/rec/journals/tcs/EscoffierGP22URL#747208Solène J. EsnayEtienne MoutotAperiodic SFTs on Baumslag-Solitar groups.Theor. Comput. Sci.91731-502022Journal Articlesclosedjournals/tcs/EsnayM2210.1016/J.TCS.2022.03.010https://doi.org/10.1016/j.tcs.2022.03.010https://dblp.org/rec/journals/tcs/EsnayM22URL#747209Louis EsperetBenjamin LévêqueLocal certification of graphs on surfaces.Theor. Comput. Sci.90968-752022Journal Articlesclosedjournals/tcs/EsperetL2210.1016/J.TCS.2022.01.023https://doi.org/10.1016/j.tcs.2022.01.023https://dblp.org/rec/journals/tcs/EsperetL22URL#747210Luérbio FariaUéverton S. SouzaOn the probe problem for (r, ℓ)-well-coveredness: Algorithms and complexity.Theor. Comput. Sci.93256-682022Journal Articlesclosedjournals/tcs/FariaS2210.1016/J.TCS.2022.08.006https://doi.org/10.1016/j.tcs.2022.08.006https://dblp.org/rec/journals/tcs/FariaS22URL#747211Antonio FariñaTravis GagieSzymon GrabowskiGiovanni ManziniGonzalo Navarro 0001Alberto Ordóñez PereiraEfficient and compact representations of some non-canonical prefix-free codes.Theor. Comput. Sci.90711-252022Journal Articlesclosedjournals/tcs/FarinaGGMNP2210.1016/J.TCS.2022.01.010https://doi.org/10.1016/j.tcs.2022.01.010https://dblp.org/rec/journals/tcs/FarinaGGMNP22URL#747212Simone FaroStefano ScafitiA weak approach to suffix automata simulation for exact and approximate string matching.Theor. Comput. Sci.93388-1032022Journal Articlesclosedjournals/tcs/FaroS2210.1016/J.TCS.2022.08.028https://doi.org/10.1016/j.tcs.2022.08.028https://dblp.org/rec/journals/tcs/FaroS22URL#747213Björn FeldkordTill KnollmannFriedhelm Meyer auf der HeideOnline facility location with mobile facilities.Theor. Comput. Sci.90745-612022Journal Articlesclosedjournals/tcs/FeldkordKH2210.1016/J.TCS.2022.01.019https://doi.org/10.1016/j.tcs.2022.01.019https://dblp.org/rec/journals/tcs/FeldkordKH22URL#747214Wei FengShiying WangThe diagnosability of wheel networks with the condition: 2-extra.Theor. Comput. Sci.92848-602022Journal Articlesclosedjournals/tcs/FengW2210.1016/J.TCS.2022.06.012https://doi.org/10.1016/j.tcs.2022.06.012https://dblp.org/rec/journals/tcs/FengW22URL#747215Gabriele FiciJeffrey O. ShallitProperties of a class of Toeplitz words.Theor. Comput. Sci.9221-122022Journal Articlesclosedjournals/tcs/FiciS2210.1016/J.TCS.2022.04.006https://doi.org/10.1016/j.tcs.2022.04.006https://dblp.org/rec/journals/tcs/FiciS22URL#747216Aharon FruchtmanYoav GrossShmuel T. KleinDana ShapiraWeighted forward looking adaptive coding.Theor. Comput. Sci.93086-992022Journal Articlesclosedjournals/tcs/FruchtmanGKS2210.1016/J.TCS.2022.07.013https://doi.org/10.1016/j.tcs.2022.07.013https://dblp.org/rec/journals/tcs/FruchtmanGKS22URL#747217Yuxi FuA thesis for interaction.Theor. Comput. Sci.897114-1342022Journal Articlesclosedjournals/tcs/Fu2210.1016/J.TCS.2021.10.001https://doi.org/10.1016/j.tcs.2021.10.001https://dblp.org/rec/journals/tcs/Fu22URL#747218Fabio GadducciTimo KehrerSpecial issue on Theoretical Topics in Graph Transformation.Theor. Comput. Sci.931155-1562022Journal Articlesclosedjournals/tcs/GadducciK2210.1016/J.TCS.2022.08.015https://doi.org/10.1016/j.tcs.2022.08.015https://dblp.org/rec/journals/tcs/GadducciK22URL#747219Fabio GadducciHernán C. MelgrattiChristian RoldánMatteo SammartinoCategorical specification and implementation of Replicated Data Types.Theor. Comput. Sci.90384-1122022Journal Articlesclosedjournals/tcs/GadducciMRS2210.1016/J.TCS.2021.12.020https://doi.org/10.1016/j.tcs.2021.12.020https://dblp.org/rec/journals/tcs/GadducciMRS22URL#747220Ajinkya GaikwadSoumen MaityDefensive alliances in graphs.Theor. Comput. Sci.928136-1502022Journal Articlesclosedjournals/tcs/GaikwadM2210.1016/J.TCS.2022.06.021https://doi.org/10.1016/j.tcs.2022.06.021https://dblp.org/rec/journals/tcs/GaikwadM22URL#747221Ajinkya GaikwadSoumen MaityFurther parameterized algorithms for the F-free edge deletion problem.Theor. Comput. Sci.933125-1372022Journal Articlesclosedjournals/tcs/GaikwadM22a10.1016/J.TCS.2022.08.025https://doi.org/10.1016/j.tcs.2022.08.025https://dblp.org/rec/journals/tcs/GaikwadM22aURL#747222Ajinkya GaikwadSoumen MaityShuvam Kant TripathiParameterized complexity of satisfactory partition problem.Theor. Comput. Sci.907113-1272022Journal Articlesclosedjournals/tcs/GaikwadMT2210.1016/J.TCS.2022.01.022https://doi.org/10.1016/j.tcs.2022.01.022https://dblp.org/rec/journals/tcs/GaikwadMT22URL#747223Nicola GalesiFariba RanjbarTight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography.Theor. Comput. Sci.919103-1172022Journal Articlesclosedjournals/tcs/GalesiR2210.1016/J.TCS.2022.03.035https://doi.org/10.1016/j.tcs.2022.03.035https://dblp.org/rec/journals/tcs/GalesiR22URL#747224Ziyuan GaoSanjay Jain 0001Zeyong LiAmmar Fathin SabiliFrank Stephan 0001A computation model with automatic functions and relations as primitive operations.Theor. Comput. Sci.92494-1162022Journal Articlesclosedjournals/tcs/GaoJLSS2210.1016/J.TCS.2022.04.038https://doi.org/10.1016/j.tcs.2022.04.038https://dblp.org/rec/journals/tcs/GaoJLSS22URL#747225Xiangyu GaoJianzhong Li 0001Dongjing MiaoSublinear-time reductions for big data computing.Theor. Comput. Sci.9321-122022Journal Articlesclosedjournals/tcs/GaoLM2210.1016/J.TCS.2022.07.038https://doi.org/10.1016/j.tcs.2022.07.038https://dblp.org/rec/journals/tcs/GaoLM22URL#747226Mathieu GasconRiccardo DondiNadia El-MabroukMUL-tree pruning for consistency and optimal reconciliation - complexity and algorithms.Theor. Comput. Sci.93722-382022Journal Articlesclosedjournals/tcs/GasconDE2210.1016/J.TCS.2022.09.027https://doi.org/10.1016/j.tcs.2022.09.027https://dblp.org/rec/journals/tcs/GasconDE22URL#747227Aile Ge-ErnstChristoph Scholl 0001Juraj SícRalf Wimmer 0001Solving dependency quantified Boolean formulas using quantifier localization.Theor. Comput. Sci.9251-242022Journal Articlesclosedjournals/tcs/Ge-ErnstSSW2210.1016/J.TCS.2022.03.029https://doi.org/10.1016/j.tcs.2022.03.029https://dblp.org/rec/journals/tcs/Ge-ErnstSSW22URL#747228Viliam GeffertZuzana BednárováAlexander SzabariInput-driven pushdown automata for edit distance neighborhood.Theor. Comput. Sci.918105-1222022Journal Articlesclosedjournals/tcs/GeffertBS2210.1016/J.TCS.2022.03.024https://doi.org/10.1016/j.tcs.2022.03.024https://dblp.org/rec/journals/tcs/GeffertBS22URL#747229Antoine GenitriniMartin PépinFrédéric PeschanskiA quantitative study of fork-join processes with non-deterministic choice: Application to the statistical exploration of the state-space.Theor. Comput. Sci.9121-362022Journal Articlesclosedjournals/tcs/GenitriniPP2210.1016/J.TCS.2022.01.014https://doi.org/10.1016/j.tcs.2022.01.014https://dblp.org/rec/journals/tcs/GenitriniPP22URL#747230Mehdi Khosravian GhadikolaeiNikolaos MelissinosJérôme MonnotAris PagourtzisExtension and its price for the connected vertex cover problem.Theor. Comput. Sci.90466-802022Journal Articlesclosedjournals/tcs/GhadikolaeiMMP2210.1016/J.TCS.2021.11.028https://doi.org/10.1016/j.tcs.2021.11.028https://dblp.org/rec/journals/tcs/GhadikolaeiMMP22URL#747231Hugo GilbertTom PortoleauOlivier SpanjaardBeyond pairwise comparisons in social choice: A setwise Kemeny aggregation problem.Theor. Comput. Sci.90427-472022Journal Articlesclosedjournals/tcs/GilbertPS2210.1016/J.TCS.2021.07.004https://doi.org/10.1016/j.tcs.2021.07.004https://dblp.org/rec/journals/tcs/GilbertPS22URL#747232Tatsuya GimaTesshu HanakaMasashi KiyomiYasuaki KobayashiYota OtachiExploring the gap between treedepth and vertex cover through vertex integrity.Theor. Comput. Sci.91860-762022Journal Articlesclosedjournals/tcs/GimaHKKO2210.1016/J.TCS.2022.03.021https://doi.org/10.1016/j.tcs.2022.03.021https://dblp.org/rec/journals/tcs/GimaHKKO22URL#747233Robert GlückRobin KaarsgaardTetsuo YokoyamaFrom reversible programming languages to reversible metalanguages.Theor. Comput. Sci.92046-632022Journal Articlesclosedjournals/tcs/GluckKY2210.1016/J.TCS.2022.02.024https://doi.org/10.1016/j.tcs.2022.02.024https://dblp.org/rec/journals/tcs/GluckKY22URL#747234Ye GongQian-Ping GuAn efficient oracle for counting shortest paths in planar graphs.Theor. Comput. Sci.92175-852022Journal Articlesclosedjournals/tcs/GongG2210.1016/J.TCS.2022.04.002https://doi.org/10.1016/j.tcs.2022.04.002https://dblp.org/rec/journals/tcs/GongG22URL#747235Barun GorainKaushik Mondal 0001Himadri NayakSupantha PanditPebble guided optimal treasure hunt in anonymous graphs.Theor. Comput. Sci.92261-802022Journal Articlesclosedjournals/tcs/GorainMNP2210.1016/J.TCS.2022.04.011https://doi.org/10.1016/j.tcs.2022.04.011https://dblp.org/rec/journals/tcs/GorainMNP22URL#747236Roberto GorrieriA study on team bisimulation and H-team bisimulation for BPP nets.Theor. Comput. Sci.89783-1132022Journal Articlesclosedjournals/tcs/Gorrieri2210.1016/J.TCS.2021.09.037https://doi.org/10.1016/j.tcs.2021.09.037https://dblp.org/rec/journals/tcs/Gorrieri22URL#747237Lee-Ad GottliebRobert KrauthgamerHavana RikaFaster algorithms for orienteering and k-TSP.Theor. Comput. Sci.91473-832022Journal Articlesclosedjournals/tcs/GottliebKR2210.1016/J.TCS.2022.02.013https://doi.org/10.1016/j.tcs.2022.02.013https://dblp.org/rec/journals/tcs/GottliebKR22URL#747238Herman Goulet-OuelletSuffix-connected languages.Theor. Comput. Sci.923126-1432022Journal Articlesopenjournals/tcs/Goulet-Ouellet2210.1016/J.TCS.2022.05.001https://doi.org/10.1016/j.tcs.2022.05.001https://dblp.org/rec/journals/tcs/Goulet-Ouellet22URL#747239Ran GuGregory Z. GutinShasha LiYongtang ShiZhenyu TaoqiuSmallest number of vertices in a 2-arc-strong digraph without good pairs.Theor. Comput. Sci.936148-1712022Journal Articlesclosedjournals/tcs/GuGLST2210.1016/J.TCS.2022.09.024https://doi.org/10.1016/j.tcs.2022.09.024https://dblp.org/rec/journals/tcs/GuGLST22URL#747240Joachim GudmundssonMees van de KerkhofAndré van RenssenFrank StaalsLionov WiratmaSampson WongCovering a set of line segments with a few squares.Theor. Comput. Sci.92374-982022Journal Articlesclosedjournals/tcs/GudmundssonKRSW2210.1016/J.TCS.2022.04.053https://doi.org/10.1016/j.tcs.2022.04.053https://dblp.org/rec/journals/tcs/GudmundssonKRSW22URL#747241Shai GulEitan TiktinskySlava ShamshanovReuven CohenOnline exploration outside a convex obstacle.Theor. Comput. Sci.929157-1632022Journal Articlesclosedjournals/tcs/GulTSC2210.1016/J.TCS.2022.06.037https://doi.org/10.1016/j.tcs.2022.06.037https://dblp.org/rec/journals/tcs/GulTSC22URL#747242Xiangyu GuoKelin LuoZhihao Gavin TangYuhao Zhang 0001The online food delivery problem on stars.Theor. Comput. Sci.92813-262022Journal Articlesclosedjournals/tcs/GuoLTZ2210.1016/J.TCS.2022.06.007https://doi.org/10.1016/j.tcs.2022.06.007https://dblp.org/rec/journals/tcs/GuoLTZ22URL#747243Sushmita GuptaSanjukta RoySaket Saurabh 0001Meirav ZehaviResolute control: Forbidding candidates from winning an election is hard.Theor. Comput. Sci.91574-892022Journal Articlesopenjournals/tcs/GuptaRSZ2210.1016/J.TCS.2022.02.031https://doi.org/10.1016/j.tcs.2022.02.031https://dblp.org/rec/journals/tcs/GuptaRSZ22URL#747244Yuri GurevichAndreas BlassQuantum circuits with classical channels and the principle of deferred measurements.Theor. Comput. Sci.92021-322022Journal Articlesclosedjournals/tcs/GurevichB2210.1016/J.TCS.2022.02.002https://doi.org/10.1016/j.tcs.2022.02.002https://dblp.org/rec/journals/tcs/GurevichB22URL#747245Girija Vani GurramC. Noorullah ShariffRajkumar L. BiradarA Secure Energy Aware Meta-Heuristic Routing Protocol (SEAMHR) for sustainable IoT-Wireless Sensor Network (WSN).Theor. Comput. Sci.93063-762022Journal Articlesclosedjournals/tcs/GurramSB2210.1016/J.TCS.2022.07.011https://doi.org/10.1016/j.tcs.2022.07.011https://dblp.org/rec/journals/tcs/GurramSB22URL#747246Michel HabibFabien de MontgolfierLalla MouatadidMengchuan ZouA general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs.Theor. Comput. Sci.92356-732022Journal Articlesclosedjournals/tcs/HabibMMZ2210.1016/J.TCS.2022.04.052https://doi.org/10.1016/j.tcs.2022.04.052https://dblp.org/rec/journals/tcs/HabibMMZ22URL#747247Iftach HaitnerNikolaos MakriyannisEran OmriOn the complexity of fair coin flipping.Theor. Comput. Sci.91423-382022Journal Articlesclosedjournals/tcs/HaitnerMO2210.1016/J.TCS.2022.02.010https://doi.org/10.1016/j.tcs.2022.02.010https://dblp.org/rec/journals/tcs/HaitnerMO22URL#747248Erika HanaokaTaizo SadahiroGeneralized bitstring rotation and its applications to toggle dynamical systems.Theor. Comput. Sci.91014-332022Journal Articlesclosedjournals/tcs/HanaokaS2210.1016/J.TCS.2022.01.033https://doi.org/10.1016/j.tcs.2022.01.033https://dblp.org/rec/journals/tcs/HanaokaS22URL#747249James HarlandGenerating candidate busy beaver machines (or how to build the zany zoo).Theor. Comput. Sci.922368-3942022Journal Articlesclosedjournals/tcs/Harland2210.1016/J.TCS.2022.04.040https://doi.org/10.1016/j.tcs.2022.04.040https://dblp.org/rec/journals/tcs/Harland22URL#747250Md. Manzurul HasanDebajyoti MondalMd. Saidur Rahman 0001Positive planar satisfiability problems under 3-connectivity constraints.Theor. Comput. Sci.91781-932022Journal Articlesclosedjournals/tcs/HasanMR2210.1016/J.TCS.2022.03.013https://doi.org/10.1016/j.tcs.2022.03.013https://dblp.org/rec/journals/tcs/HasanMR22URL#747251Meng He 0001Serikzhan KaziData structures for categorical path counting queries.Theor. Comput. Sci.93897-1112022Journal Articlesclosedjournals/tcs/HeK2210.1016/J.TCS.2022.10.011https://doi.org/10.1016/j.tcs.2022.10.011https://dblp.org/rec/journals/tcs/HeK22URL#747252Stefan HetzlJannik VierlingUnprovability results for clause set cycles.Theor. Comput. Sci.93521-462022Journal Articlesclosedjournals/tcs/HetzlV2210.1016/J.TCS.2022.07.003https://doi.org/10.1016/j.tcs.2022.07.003https://dblp.org/rec/journals/tcs/HetzlV22URL#747253Reuven HodgesGidon OrelowitzApproximate counting of standard set-valued tableaux.Theor. Comput. Sci.9347-202022Journal Articlesclosedjournals/tcs/HodgesO2210.1016/J.TCS.2022.08.010https://doi.org/10.1016/j.tcs.2022.08.010https://dblp.org/rec/journals/tcs/HodgesO22URL#747254Yi Hong 0003Chuanwen LuoDeying Li 0001Zhibo Chen 0004Xiyun WangXiao Li 0027Energy efficiency optimization for multiple chargers in Wireless Rechargeable Sensor Networks.Theor. Comput. Sci.922193-2052022Journal Articlesclosedjournals/tcs/HongLLCWL2210.1016/J.TCS.2022.04.024https://doi.org/10.1016/j.tcs.2022.04.024https://dblp.org/rec/journals/tcs/HongLLCWL22URL#747255Weizhi HongYingli RanZhao Zhang 0002Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph.Theor. Comput. Sci.93213-202022Journal Articlesclosedjournals/tcs/HongRZ2210.1016/J.TCS.2022.07.039https://doi.org/10.1016/j.tcs.2022.07.039https://dblp.org/rec/journals/tcs/HongRZ22URL#747256Seyed Naser HosseiniLeila YeganehPartial pullback complement rewriting along admissible matches.Theor. Comput. Sci.898149-1792022Journal Articlesclosedjournals/tcs/HosseiniY2210.1016/J.TCS.2021.11.007https://doi.org/10.1016/j.tcs.2021.11.007https://dblp.org/rec/journals/tcs/HosseiniY22URL#747257Pierre HosteinsRosario ScatamacchiaAndrea GrossoRoberto AringhieriThe Connected Critical Node Problem.Theor. Comput. Sci.923235-2552022Journal Articlesclosedjournals/tcs/HosteinsSGA2210.1016/J.TCS.2022.05.011https://doi.org/10.1016/j.tcs.2022.05.011https://dblp.org/rec/journals/tcs/HosteinsSGA22URL#747258Masahiro IkedaAtsushi Miyauchi 0001Yuuki TakaiYuichi YoshidaFinding Cheeger cuts in hypergraphs via heat equation.Theor. Comput. Sci.9301-232022Journal Articlesclosedjournals/tcs/IkedaMTY2210.1016/J.TCS.2022.07.006https://doi.org/10.1016/j.tcs.2022.07.006https://dblp.org/rec/journals/tcs/IkedaMTY22URL#747259Florian IngelsRomain AzaïsEnumeration of irredundant forests.Theor. Comput. Sci.922312-3342022Journal Articlesclosedjournals/tcs/IngelsA2210.1016/J.TCS.2022.04.033https://doi.org/10.1016/j.tcs.2022.04.033https://dblp.org/rec/journals/tcs/IngelsA22URL#747260Florentin IpateMarian Gheorghe 0001A model learning based testing approach for spiking neural P systems.Theor. Comput. Sci.9241-162022Journal Articlesclosedjournals/tcs/IpateG2210.1016/J.TCS.2022.03.018https://doi.org/10.1016/j.tcs.2022.03.018https://dblp.org/rec/journals/tcs/IpateG22URL#747261Maria-Romina IvanImre LeaderMark WaltersConstructible graphs and pursuit.Theor. Comput. Sci.930196-2082022Journal Articlesopenjournals/tcs/IvanLW2210.1016/J.TCS.2022.07.023https://doi.org/10.1016/j.tcs.2022.07.023https://dblp.org/rec/journals/tcs/IvanLW22URL#747262Marieh JahanniaMorteza Mohammad NooriNarad RampersadManon StipulantiClosed Ziv-Lempel factorization of the m-bonacci words.Theor. Comput. Sci.91832-472022Journal Articlesclosedjournals/tcs/JahanniaNRS2210.1016/J.TCS.2022.03.019https://doi.org/10.1016/j.tcs.2022.03.019https://dblp.org/rec/journals/tcs/JahanniaNRS22URL#747263Petr JancarBisimilarity on Basic Parallel Processes.Theor. Comput. Sci.90326-382022Journal Articlesclosedjournals/tcs/Jancar2210.1016/J.TCS.2021.11.027https://doi.org/10.1016/j.tcs.2021.11.027https://dblp.org/rec/journals/tcs/Jancar22URL#747264Robert JanczewskiPawel ObszarskiKrzysztof TurowskiWeighted 2-sections and hypergraph reconstruction.Theor. Comput. Sci.91511-252022Journal Articlesclosedjournals/tcs/JanczewskiOT2210.1016/J.TCS.2022.02.016https://doi.org/10.1016/j.tcs.2022.02.016https://dblp.org/rec/journals/tcs/JanczewskiOT22URL#747265Devin C. JeanSuk Jai SeoExtremal cubic graphs for fault-tolerant locating domination.Theor. Comput. Sci.91794-1062022Journal Articlesclosedjournals/tcs/JeanS2210.1016/J.TCS.2022.03.014https://doi.org/10.1016/j.tcs.2022.03.014https://dblp.org/rec/journals/tcs/JeanS22URL#747266Zhao JinBowen ZhangTianyue CaoYongzhi CaoHanpin WangReasoning about block-based cloud storage systems via separation logic.Theor. Comput. Sci.93643-762022Journal Articlesclosedjournals/tcs/JinZCCW2210.1016/J.TCS.2022.09.015https://doi.org/10.1016/j.tcs.2022.09.015https://dblp.org/rec/journals/tcs/JinZCCW22URL#747267Zhao JinBowen ZhangLei ZhangYongzhi CaoHanpin WangAn adaptation-complete proof system for local reasoning about cloud storage systems.Theor. Comput. Sci.90339-732022Journal Articlesclosedjournals/tcs/JinZZCW2210.1016/J.TCS.2021.12.018https://doi.org/10.1016/j.tcs.2021.12.018https://dblp.org/rec/journals/tcs/JinZZCW22URL#747268Thomas KahlOn symmetric higher-dimensional automata and bisimilarity.Theor. Comput. Sci.93547-602022Journal Articlesclosedjournals/tcs/Kahl2210.1016/J.TCS.2022.07.004https://doi.org/10.1016/j.tcs.2022.07.004https://dblp.org/rec/journals/tcs/Kahl22URL#747269Yuichi KamiyaOn dragon curves which have two corners just meeting.Theor. Comput. Sci.93865-802022Journal Articlesclosedjournals/tcs/Kamiya2210.1016/J.TCS.2022.10.008https://doi.org/10.1016/j.tcs.2022.10.008https://dblp.org/rec/journals/tcs/Kamiya22URL#747270Phanindra Reddy KannariNoorullah Shariff ChowdaryRajkumar Laxmikanth BiradarAn anomaly-based intrusion detection system using recursive feature elimination technique for improved attack detection.Theor. Comput. Sci.93156-642022Journal Articlesclosedjournals/tcs/KannariCB2210.1016/J.TCS.2022.07.030https://doi.org/10.1016/j.tcs.2022.07.030https://dblp.org/rec/journals/tcs/KannariCB22URL#747271Lila KariEditorial.Theor. Comput. Sci.90812022Journal Articlesclosedjournals/tcs/Kari2210.1016/S0304-3975(22)00119-0https://doi.org/10.1016/S0304-3975(22)00119-0https://dblp.org/rec/journals/tcs/Kari22URL#747272Lila KariEditorial.Theor. Comput. Sci.920iii2022Journal Articlesclosedjournals/tcs/Kari22a10.1016/S0304-3975(22)00321-8https://doi.org/10.1016/S0304-3975(22)00321-8https://dblp.org/rec/journals/tcs/Kari22aURL#747273Lila KariEditorial.Theor. Comput. Sci.924iii2022Journal Articlesclosedjournals/tcs/Kari22b10.1016/S0304-3975(22)00370-Xhttps://doi.org/10.1016/S0304-3975(22)00370-Xhttps://dblp.org/rec/journals/tcs/Kari22bURL#747274Lila KariEditorial.Theor. Comput. Sci.926iii2022Journal Articlesclosedjournals/tcs/Kari22c10.1016/S0304-3975(22)00423-6https://doi.org/10.1016/S0304-3975(22)00423-6https://dblp.org/rec/journals/tcs/Kari22cURL#747275Takashi KatohKeisuke Goto 0001In-place initializable arrays.Theor. Comput. Sci.91662-692022Journal Articlesclosedjournals/tcs/KatohG2210.1016/J.TCS.2022.03.004https://doi.org/10.1016/j.tcs.2022.03.004https://dblp.org/rec/journals/tcs/KatohG22URL#747276Walter KernBarnaby MartinDaniël PaulusmaSiani SmithErik Jan van LeeuwenDisjoint paths and connected subgraphs for H-free graphs.Theor. Comput. Sci.89859-682022Journal Articlesclosedjournals/tcs/KernMPSL2210.1016/J.TCS.2021.10.019https://doi.org/10.1016/j.tcs.2021.10.019https://dblp.org/rec/journals/tcs/KernMPSL22URL#747277Kamil KhadievAliya KhadievaMansur ZiatdinovIlnaz MannapovDmitry KravchenkoAlexander RivoshRamis YamilovTwo-way and one-way quantum and classical automata with advice for online minimization problems.Theor. Comput. Sci.92076-942022Journal Articlesclosedjournals/tcs/KhadievKZMKRY2210.1016/J.TCS.2022.02.026https://doi.org/10.1016/j.tcs.2022.02.026https://dblp.org/rec/journals/tcs/KhadievKZMKRY22URL#747278Mohd Abdul Rahim KhanShavkatov Navruzbek ShavkatovichBharti NagpalAnil Kumar 0009Mohd Anul HaqV. Jeevika ThariniSathishkumar KarupusamyMalik Bader AlazzamOptimizing hybrid metaheuristic algorithm with cluster head to improve performance metrics on the IoT.Theor. Comput. Sci.92787-972022Journal Articlesclosedjournals/tcs/KhanSNKHTKA2210.1016/J.TCS.2022.05.031https://doi.org/10.1016/j.tcs.2022.05.031https://dblp.org/rec/journals/tcs/KhanSNKHTKA22URL#747279Eun Jung Kim 0002Martin MilanicJérôme MonnotChristophe PicouleauComplexity and algorithms for constant diameter augmentation problems.Theor. Comput. Sci.90415-262022Journal Articlesclosedjournals/tcs/KimMMP2210.1016/J.TCS.2021.05.020https://doi.org/10.1016/j.tcs.2021.05.020https://dblp.org/rec/journals/tcs/KimMMP22URL#747280Marek KlonowskiDariusz R. KowalskiDominik PajakGeneralized framework for Group Testing: Queries, feedbacks and adversaries.Theor. Comput. Sci.91918-352022Journal Articlesclosedjournals/tcs/KlonowskiKP2210.1016/J.TCS.2022.03.026https://doi.org/10.1016/j.tcs.2022.03.026https://dblp.org/rec/journals/tcs/KlonowskiKP22URL#747281Gábor KondorNP-hardness of m-dimensional weighted matching problems.Theor. Comput. Sci.93033-362022Journal Articlesclosedjournals/tcs/Kondor2210.1016/J.TCS.2022.07.008https://doi.org/10.1016/j.tcs.2022.07.008https://dblp.org/rec/journals/tcs/Kondor22URL#747282Christian Konrad 0001Viktor ZamaraevDistributed minimum vertex coloring and maximum independent set in chordal graphs.Theor. Comput. Sci.922486-5022022Journal Articlesopenjournals/tcs/KonradZ2210.1016/J.TCS.2022.04.047https://doi.org/10.1016/j.tcs.2022.04.047https://dblp.org/rec/journals/tcs/KonradZ22URL#747283Guy KortsarzZeev NutovEli ShalomApproximating activation edge-cover and facility location problems.Theor. Comput. Sci.930218-2282022Journal Articlesclosedjournals/tcs/KortsarzNS2210.1016/J.TCS.2022.07.026https://doi.org/10.1016/j.tcs.2022.07.026https://dblp.org/rec/journals/tcs/KortsarzNS22URL#747284Peter KostolányiDeterminisability of unary weighted automata over the rational numbers.Theor. Comput. Sci.898110-1312022Journal Articlesclosedjournals/tcs/Kostolanyi2210.1016/J.TCS.2021.11.002https://doi.org/10.1016/j.tcs.2021.11.002https://dblp.org/rec/journals/tcs/Kostolanyi22URL#747285Daniel KrennJeffrey O. ShallitDecidability and k-regular sequences.Theor. Comput. Sci.90734-442022Journal Articlesopenjournals/tcs/KrennS2210.1016/J.TCS.2022.01.018https://doi.org/10.1016/j.tcs.2022.01.018https://dblp.org/rec/journals/tcs/KrennS22URL#747286Stefan Kuhn 0001Irek UlidowskiModelling of DNA mismatch repair with a reversible process calculus.Theor. Comput. Sci.92568-862022Journal Articlesopenjournals/tcs/KuhnU2210.1016/J.TCS.2022.06.009https://doi.org/10.1016/j.tcs.2022.06.009https://dblp.org/rec/journals/tcs/KuhnU22URL#747287A. Satish KumarS. RevathyA hybrid soft computing with big data analytics based protection and recovery strategy for security enhancement in large scale real world online social networks.Theor. Comput. Sci.92715-302022Journal Articlesclosedjournals/tcs/KumarR2210.1016/J.TCS.2022.05.018https://doi.org/10.1016/j.tcs.2022.05.018https://dblp.org/rec/journals/tcs/KumarR22URL#747288Kazuhiro KuritaKunihiro WasaConstant amortized time enumeration of Eulerian trails.Theor. Comput. Sci.9231-122022Journal Articlesopenjournals/tcs/KuritaW2210.1016/J.TCS.2022.04.048https://doi.org/10.1016/j.tcs.2022.04.048https://dblp.org/rec/journals/tcs/KuritaW22URL#747289William KuszmaulTrain tracks with gaps: Applying the probabilistic method to trains.Theor. Comput. Sci.89939-472022Journal Articlesclosedjournals/tcs/Kuszmaul2210.1016/J.TCS.2021.11.017https://doi.org/10.1016/j.tcs.2021.11.017https://dblp.org/rec/journals/tcs/Kuszmaul22URL#747290Christian LaforestTimothée MartinodOn the complexity of independent dominating set with obligations in graphs.Theor. Comput. Sci.9041-142022Journal Articlesclosedjournals/tcs/LaforestM2210.1016/J.TCS.2021.05.018https://doi.org/10.1016/j.tcs.2021.05.018https://dblp.org/rec/journals/tcs/LaforestM22URL#747291Van Bang LeJan Arne TelleThe perfect matching cut problem revisited.Theor. Comput. Sci.931117-1302022Journal Articlesclosedjournals/tcs/LeT2210.1016/J.TCS.2022.07.035https://doi.org/10.1016/j.tcs.2022.07.035https://dblp.org/rec/journals/tcs/LeT22URL#747292Victor LecomteGergely ÓdorPatrick ThiranThe power of adaptivity in source identification with time queries on the path.Theor. Comput. Sci.91192-1232022Journal Articlesopenjournals/tcs/LecomteOT2210.1016/J.TCS.2022.02.008https://doi.org/10.1016/j.tcs.2022.02.008https://dblp.org/rec/journals/tcs/LecomteOT22URL#747293Vladimir LemusEduardo Acuña-YeomansVíctor ZamoraFrancisco Hernández QuirozHector ZenilComputable model discovery and high-level-programming approximations to algorithmic complexity.Theor. Comput. Sci.92731-412022Journal Articlesclosedjournals/tcs/LemusAZQZ2210.1016/J.TCS.2022.05.026https://doi.org/10.1016/j.tcs.2022.05.026https://dblp.org/rec/journals/tcs/LemusAZQZ22URL#747294Alberto LeporatiLuca ManzoniGiancarlo MauriClaudio ZandronDepth-two P systems can simulate Turing machines with NP oracles.Theor. Comput. Sci.90843-552022Journal Articlesclosedjournals/tcs/LeporatiMMZ2210.1016/J.TCS.2021.11.010https://doi.org/10.1016/j.tcs.2021.11.010https://dblp.org/rec/journals/tcs/LeporatiMMZ22URL#747295Leonid A. LevinGacs - Kucera theorem.Theor. Comput. Sci.929172-1732022Journal Articlesclosedjournals/tcs/Levin2210.1016/J.TCS.2022.06.040https://doi.org/10.1016/j.tcs.2022.06.040https://dblp.org/rec/journals/tcs/Levin22URL#747296Luyi LiXueliang Li 0001Rainbow edge-pancyclicity of strongly edge-colored graphs.Theor. Comput. Sci.90726-332022Journal Articlesclosedjournals/tcs/Li02210.1016/J.TCS.2022.01.012https://doi.org/10.1016/j.tcs.2022.01.012https://dblp.org/rec/journals/tcs/Li022URL#747297Minming LiSpecial Issue on the 14th International Frontiers of Algorithmics Workshop.Theor. Comput. Sci.92142022Journal Articlesclosedjournals/tcs/Li2210.1016/J.TCS.2021.11.011https://doi.org/10.1016/j.tcs.2021.11.011https://dblp.org/rec/journals/tcs/Li22URL#747298Xinghua LiSuixiang GaoWenguo YangYu SiZhen LiuPurchase preferences-based air passenger choice behavior analysis from sales transaction data.Theor. Comput. Sci.92861-702022Journal Articlesclosedjournals/tcs/LiGYSL2210.1016/J.TCS.2022.06.013https://doi.org/10.1016/j.tcs.2022.06.013https://dblp.org/rec/journals/tcs/LiGYSL22URL#747299Songhua LiMinming LiLingjie DuanVictor C. S. LeeEfficient algorithms for ride-hitching in UAV travelling.Theor. Comput. Sci.929140-1562022Journal Articlesclosedjournals/tcs/LiLDL2210.1016/J.TCS.2022.06.035https://doi.org/10.1016/j.tcs.2022.06.035https://dblp.org/rec/journals/tcs/LiLDL22URL#747300Yi LiXie LiYong Li 0031Xuechao SunAndrea TurriniLijun Zhang 0001Synthesizing ranking functions for loop programs via SVM.Theor. Comput. Sci.9351-202022Journal Articlesclosedjournals/tcs/LiLLSTZ2210.1016/J.TCS.2022.07.002https://doi.org/10.1016/j.tcs.2022.07.002https://dblp.org/rec/journals/tcs/LiLLSTZ22URL#747301Wenjun Li 0001Huan PengYongjie Yang 0001Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations.Theor. Comput. Sci.90683-932022Journal Articlesclosedjournals/tcs/LiPY2210.1016/J.TCS.2022.01.007https://doi.org/10.1016/j.tcs.2022.01.007https://dblp.org/rec/journals/tcs/LiPY22URL#747302Peng LiJianhui ShangYi ShiA simple linear time algorithm to solve the MIST problem on interval graphs.Theor. Comput. Sci.93077-852022Journal Articlesclosedjournals/tcs/LiSS2210.1016/J.TCS.2022.07.012https://doi.org/10.1016/j.tcs.2022.07.012https://dblp.org/rec/journals/tcs/LiSS22URL#747303Yalan LiJichang WuShumin ZhangChengfu YeReliability of the round matching composition networks based on g-extra conditional fault.Theor. Comput. Sci.9051-92022Journal Articlesclosedjournals/tcs/LiWZY2210.1016/J.TCS.2021.12.003https://doi.org/10.1016/j.tcs.2021.12.003https://dblp.org/rec/journals/tcs/LiWZY22URL#747304Min Li 0028Hao XiaoQian LiuYang Zhou 0018The submodularity of two-stage stochastic maximum-weight independent set problems.Theor. Comput. Sci.93750-622022Journal Articlesclosedjournals/tcs/LiXLZ2210.1016/J.TCS.2022.09.029https://doi.org/10.1016/j.tcs.2022.09.029https://dblp.org/rec/journals/tcs/LiXLZ22URL#747305Wenjun Li 0001Junjie YeYixin Cao 0001A 5k-vertex kernel for P2-packing.Theor. Comput. Sci.9101-132022Journal Articlesclosedjournals/tcs/LiYC2210.1016/J.TCS.2022.01.032https://doi.org/10.1016/j.tcs.2022.01.032https://dblp.org/rec/journals/tcs/LiYC22URL#747306Tingyu LiJing YuHaiping ZhangWeb of things based social media fake news classification with feature extraction using pre-trained convoluted recurrent network with deep fuzzy learning.Theor. Comput. Sci.93165-772022Journal Articlesclosedjournals/tcs/LiYZ2210.1016/J.TCS.2022.07.031https://doi.org/10.1016/j.tcs.2022.07.031https://dblp.org/rec/journals/tcs/LiYZ22URL#747307Ya-Chun LiangKuan-Yun LaiHo-Lin ChenKazuo IwamaChung-Shou LiaoTight competitive analyses of online car-sharing problems.Theor. Comput. Sci.93886-962022Journal Articlesclosedjournals/tcs/LiangLCIL2210.1016/J.TCS.2022.10.010https://doi.org/10.1016/j.tcs.2022.10.010https://dblp.org/rec/journals/tcs/LiangLCIL22URL#747308Zuosong LiangJuan WangJunqing CaiXinxin YangOn the complexity of local-equitable coloring of graphs.Theor. Comput. Sci.90676-822022Journal Articlesclosedjournals/tcs/LiangWCY2210.1016/J.TCS.2022.01.006https://doi.org/10.1016/j.tcs.2022.01.006https://dblp.org/rec/journals/tcs/LiangWCY22URL#747309Ting-Wei LiangChang-Biau YangKuo-Si HuangAn efficient algorithm for the longest common palindromic subsequence problem.Theor. Comput. Sci.922475-4852022Journal Articlesclosedjournals/tcs/LiangYH2210.1016/J.TCS.2022.04.046https://doi.org/10.1016/j.tcs.2022.04.046https://dblp.org/rec/journals/tcs/LiangYH22URL#747310Wei LiangZhao Zhang 0002Approximation algorithm for prize-collecting sweep cover with base stations.Theor. Comput. Sci.9291-102022Journal Articlesclosedjournals/tcs/LiangZ2210.1016/J.TCS.2022.06.026https://doi.org/10.1016/j.tcs.2022.06.026https://dblp.org/rec/journals/tcs/LiangZ22URL#747311Jing LiangHaixing ZhaoJun YinA method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks.Theor. Comput. Sci.923144-1592022Journal Articlesclosedjournals/tcs/LiangZY2210.1016/J.TCS.2022.05.002https://doi.org/10.1016/j.tcs.2022.05.002https://dblp.org/rec/journals/tcs/LiangZY22URL#747312Chao LiaoJiabao LinPinyan LuZhenyu MaoAn FPTAS for the hardcore model on random regular bipartite graphs.Theor. Comput. Sci.929174-1902022Journal Articlesclosedjournals/tcs/LiaoLLM2210.1016/J.TCS.2022.07.001https://doi.org/10.1016/j.tcs.2022.07.001https://dblp.org/rec/journals/tcs/LiaoLLM22URL#747313Carlos V. G. C. LimaThiago MarcilonNicolas Almeida MartinsRudini M. SampaioPSPACE-hardness of variants of the graph coloring game.Theor. Comput. Sci.90987-962022Journal Articlesclosedjournals/tcs/LimaMMS2210.1016/J.TCS.2022.01.030https://doi.org/10.1016/j.tcs.2022.01.030https://dblp.org/rec/journals/tcs/LimaMMS22URL#747314Min-Sheng LinCounting dominating sets in some subclasses of bipartite graphs.Theor. Comput. Sci.923337-3472022Journal Articlesclosedjournals/tcs/Lin2210.1016/J.TCS.2022.05.021https://doi.org/10.1016/j.tcs.2022.05.021https://dblp.org/rec/journals/tcs/Lin22URL#747315Zhicheng LiuJing JinHong ChangDonglei DuXiaoyan Zhang 0001Improved algorithms for non-submodular function maximization problem.Theor. Comput. Sci.93149-552022Journal Articlesclosedjournals/tcs/LiuJCDZ2210.1016/J.TCS.2022.07.029https://doi.org/10.1016/j.tcs.2022.07.029https://dblp.org/rec/journals/tcs/LiuJCDZ22URL#747316Xiaofei LiuWeidong Li 0002Han DaiApproximation algorithms for the minimum power cover problem with submodular/linear penalties.Theor. Comput. Sci.923256-2702022Journal Articlesclosedjournals/tcs/LiuLD2210.1016/J.TCS.2022.05.012https://doi.org/10.1016/j.tcs.2022.05.012https://dblp.org/rec/journals/tcs/LiuLD22URL#747317Xiangyu LiuShengli Liu 0001Shuai Han 0001Dawu GuTightly CCA-secure inner product functional encryption scheme.Theor. Comput. Sci.8981-192022Journal Articlesclosedjournals/tcs/LiuLHG2210.1016/J.TCS.2021.10.008https://doi.org/10.1016/j.tcs.2021.10.008https://dblp.org/rec/journals/tcs/LiuLHG22URL#747318Dong LiuPingshan LiBicheng ZhangComponent edge connectivity of hypercube-like networks.Theor. Comput. Sci.91119-252022Journal Articlesclosedjournals/tcs/LiuLZ2210.1016/J.TCS.2022.01.047https://doi.org/10.1016/j.tcs.2022.01.047https://dblp.org/rec/journals/tcs/LiuLZ22URL#747319Xuemei LiuJixiang MengStrongly Menger-edge-connectedness of DCell networks.Theor. Comput. Sci.922308-3112022Journal Articlesclosedjournals/tcs/LiuM2210.1016/J.TCS.2022.04.032https://doi.org/10.1016/j.tcs.2022.04.032https://dblp.org/rec/journals/tcs/LiuM22URL#747320Xujun LiuOlgica MilenkovicFinding the second-best candidate under the Mallows model.Theor. Comput. Sci.92939-682022Journal Articlesclosedjournals/tcs/LiuM22a10.1016/J.TCS.2022.06.029https://doi.org/10.1016/j.tcs.2022.06.029https://dblp.org/rec/journals/tcs/LiuM22aURL#747321Bo Liu 0011Mengya ShenSome geometrical and topological properties of DNNs' decision boundaries.Theor. Comput. Sci.90864-752022Journal Articlesclosedjournals/tcs/LiuS2210.1016/J.TCS.2021.11.013https://doi.org/10.1016/j.tcs.2021.11.013https://dblp.org/rec/journals/tcs/LiuS22URL#747322Xiang LiuJinyu ZouPengpeng ChenPeng-Jun WanGaussian downlink user selection subject to access limit, power budget, and rate demands.Theor. Comput. Sci.93178-922022Journal Articlesclosedjournals/tcs/LiuZCW2210.1016/J.TCS.2022.07.032https://doi.org/10.1016/j.tcs.2022.07.032https://dblp.org/rec/journals/tcs/LiuZCW22URL#747323András LondonRyan R. MartinAndrás PluhárGraph clustering via generalized colorings.Theor. Comput. Sci.91894-1042022Journal Articlesclosedjournals/tcs/LondonMP2210.1016/J.TCS.2022.03.023https://doi.org/10.1016/j.tcs.2022.03.023https://dblp.org/rec/journals/tcs/LondonMP22URL#747324Raul Lopes 0001Ignasi SauA relaxation of the Directed Disjoint Paths problem: A global congestion metric helps.Theor. Comput. Sci.89875-912022Journal Articlesclosedjournals/tcs/LopesS2210.1016/J.TCS.2021.10.023https://doi.org/10.1016/j.tcs.2021.10.023https://dblp.org/rec/journals/tcs/LopesS22URL#747325Jing LuThe monad on strong quasi-metric spaces.Theor. Comput. Sci.91299-1082022Journal Articlesclosedjournals/tcs/Lu2210.1016/J.TCS.2022.02.022https://doi.org/10.1016/j.tcs.2022.02.022https://dblp.org/rec/journals/tcs/Lu22URL#747326Xiao-Tao LüJin ChenZhi-Xiong WenOn the 2-abelian complexity of generalized Cantor sequences.Theor. Comput. Sci.936172-1832022Journal Articlesclosedjournals/tcs/LuCW2210.1016/J.TCS.2022.09.025https://doi.org/10.1016/j.tcs.2022.09.025https://dblp.org/rec/journals/tcs/LuCW22URL#747327Alessandro De Luca 0002Gabriele FiciOn the Lie complexity of Sturmian words.Theor. Comput. Sci.93881-852022Journal Articlesclosedjournals/tcs/LucaF2210.1016/J.TCS.2022.10.009https://doi.org/10.1016/j.tcs.2022.10.009https://dblp.org/rec/journals/tcs/LucaF22URL#747328Felicia LuckeDaniël PaulusmaBernard RiesOn the complexity of matching cut for graphs of bounded radius and H-free graphs.Theor. Comput. Sci.93633-422022Journal Articlesclosedjournals/tcs/LuckePR2210.1016/J.TCS.2022.09.014https://doi.org/10.1016/j.tcs.2022.09.014https://dblp.org/rec/journals/tcs/LuckePR22URL#747329Weidong LuoOn some FPT problems without polynomial Turing compressions.Theor. Comput. Sci.90587-982022Journal Articlesclosedjournals/tcs/Luo2210.1016/J.TCS.2021.12.017https://doi.org/10.1016/j.tcs.2021.12.017https://dblp.org/rec/journals/tcs/Luo22URL#747330Ran MaSainan GuoXiaoyan Zhang 0001An optimal online algorithm for single-processor scheduling problem with learning effect.Theor. Comput. Sci.9281-122022Journal Articlesclosedjournals/tcs/MaGZ2210.1016/J.TCS.2022.06.006https://doi.org/10.1016/j.tcs.2022.06.006https://dblp.org/rec/journals/tcs/MaGZ22URL#747331Pasin ManurangsiWarut SuksompongAlmost envy-freeness for groups: Improved bounds via discrepancy theory.Theor. Comput. Sci.930179-1952022Journal Articlesopenjournals/tcs/ManurangsiS2210.1016/J.TCS.2022.07.022https://doi.org/10.1016/j.tcs.2022.07.022https://dblp.org/rec/journals/tcs/ManurangsiS22URL#747332Barnaby MartinDaniël PaulusmaSiani SmithColouring generalized claw-free graphs and graphs of large girth: Bounding the diameter.Theor. Comput. Sci.931104-1162022Journal Articlesclosedjournals/tcs/MartinPS2210.1016/J.TCS.2022.07.034https://doi.org/10.1016/j.tcs.2022.07.034https://dblp.org/rec/journals/tcs/MartinPS22URL#747333Yuniel Matos-RodríguezEvaristo José Madarro-CapóCarlos Miguel Legón-PérezOmar RojasGuillermo Sosa GómezImprovements in the computing efficiency of the probabilities of the LIL test for the PRNG evaluation.Theor. Comput. Sci.90229-402022Journal Articlesclosedjournals/tcs/Matos-Rodriguez2210.1016/J.TCS.2021.12.006https://doi.org/10.1016/j.tcs.2021.12.006https://dblp.org/rec/journals/tcs/Matos-Rodriguez22URL#747334Hernán C. MelgrattiClaudio Antares MezzinaG. Michele PinnaA Petri net view of covalent bonds.Theor. Comput. Sci.90889-1192022Journal Articlesclosedjournals/tcs/MelgrattiMP2210.1016/J.TCS.2022.01.013https://doi.org/10.1016/j.tcs.2022.01.013https://dblp.org/rec/journals/tcs/MelgrattiMP22URL#747335Nikolaos MelissinosAris PagourtzisTheofilos TriommatisApproximation schemes for subset-sums ratio problems.Theor. Comput. Sci.93117-302022Journal Articlesclosedjournals/tcs/MelissinosPT2210.1016/J.TCS.2022.07.027https://doi.org/10.1016/j.tcs.2022.07.027https://dblp.org/rec/journals/tcs/MelissinosPT22URL#747336Xiangguang MengJianxiong GuoXingjian DingXiujuan ZhangEfficient scheduling strategy for mobile chargers in task-based wireless sensor networks.Theor. Comput. Sci.92882-932022Journal Articlesclosedjournals/tcs/MengGDZ2210.1016/J.TCS.2022.06.015https://doi.org/10.1016/j.tcs.2022.06.015https://dblp.org/rec/journals/tcs/MengGDZ22URL#747337M. I. Mary MetildaD. LalithaS. VaithyasubramanianPassword generation using array generating interval timed colored Petri net (AGITCPN) for effective security.Theor. Comput. Sci.929114-1232022Journal Articlesclosedjournals/tcs/MetildaLV2210.1016/J.TCS.2022.06.033https://doi.org/10.1016/j.tcs.2022.06.033https://dblp.org/rec/journals/tcs/MetildaLV22URL#747338Runjie MiaoJinjiang YuanA note on LP-based approximation algorithms for capacitated facility location problem.Theor. Comput. Sci.93231-402022Journal Articlesclosedjournals/tcs/MiaoY2210.1016/J.TCS.2022.08.002https://doi.org/10.1016/j.tcs.2022.08.002https://dblp.org/rec/journals/tcs/MiaoY22URL#747339Frank Angel Hernández MiraErnesto Parra InzaJosé M. Sigarreta AlmiraNodari VakhaniaA polynomial-time approximation to a minimum dominating set in a graph.Theor. Comput. Sci.930142-1562022Journal Articlesclosedjournals/tcs/MiraIAV2210.1016/J.TCS.2022.07.020https://doi.org/10.1016/j.tcs.2022.07.020https://dblp.org/rec/journals/tcs/MiraIAV22URL#747340Doost Ali MojdehOn the conjectures of neighbor locating coloring of graphs.Theor. Comput. Sci.922300-3072022Journal Articlesclosedjournals/tcs/Mojdeh2210.1016/J.TCS.2022.04.031https://doi.org/10.1016/j.tcs.2022.04.031https://dblp.org/rec/journals/tcs/Mojdeh22URL#747341Debajyoti MondalAngelin Jemima RajasinghN. ParthibanIndra RajasinghAPX-hardness and approximation for the k-burning number problem.Theor. Comput. Sci.93221-302022Journal Articlesclosedjournals/tcs/MondalRPR2210.1016/J.TCS.2022.08.001https://doi.org/10.1016/j.tcs.2022.08.001https://dblp.org/rec/journals/tcs/MondalRPR22URL#747342Angelo MontanariPietro SalaReactive synthesis from interval temporal logic specifications.Theor. Comput. Sci.89948-792022Journal Articlesclosedjournals/tcs/MontanariS2210.1016/J.TCS.2021.11.023https://doi.org/10.1016/j.tcs.2021.11.023https://dblp.org/rec/journals/tcs/MontanariS22URL#747343Oscar Morales-PonceOptimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots.Theor. Comput. Sci.9111-182022Journal Articlesopenjournals/tcs/Morales-Ponce2210.1016/J.TCS.2022.01.046https://doi.org/10.1016/j.tcs.2022.01.046https://dblp.org/rec/journals/tcs/Morales-Ponce22URL#747344Nils MorawietzNiels GrüttemeierChristian KomusiewiczFrank SommerColored cut games.Theor. Comput. Sci.93613-322022Journal Articlesclosedjournals/tcs/MorawietzGKS2210.1016/J.TCS.2022.09.013https://doi.org/10.1016/j.tcs.2022.09.013https://dblp.org/rec/journals/tcs/MorawietzGKS22URL#747345Marina MoscariniComputing a metric basis of a bipartite distance-hereditary graph.Theor. Comput. Sci.90020-242022Journal Articlesclosedjournals/tcs/Moscarini2210.1016/J.TCS.2021.11.015https://doi.org/10.1016/j.tcs.2021.11.015https://dblp.org/rec/journals/tcs/Moscarini22URL#747346Benjamin MoseleyRuilong Zhang 0001Shanjiawen ZhaoOnline scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models.Theor. Comput. Sci.93824-382022Journal Articlesclosedjournals/tcs/MoselelyZZ2210.1016/J.TCS.2022.10.005https://doi.org/10.1016/j.tcs.2022.10.005https://dblp.org/rec/journals/tcs/MoselelyZZ22URL#747347Abbas MubarakSajid Iqbal 0001Tariq NaeemShafiq Hussain2 mm: A new technique for sorting data.Theor. Comput. Sci.91068-902022Journal Articlesclosedjournals/tcs/MubarakINH2210.1016/J.TCS.2022.01.037https://doi.org/10.1016/j.tcs.2022.01.037https://dblp.org/rec/journals/tcs/MubarakINH22URL#747348Katsuhito NakashimaNoriki FujisatoDiptarama HendrianYuto NakashimaRyo YoshinakaShunsuke InenagaHideo BannaiAyumi ShinoharaMasayuki TakedaParameterized DAWGs: Efficient constructions and bidirectional pattern searches.Theor. Comput. Sci.93321-422022Journal Articlesclosedjournals/tcs/NakashimaFHNYIB2210.1016/J.TCS.2022.09.008https://doi.org/10.1016/j.tcs.2022.09.008https://dblp.org/rec/journals/tcs/NakashimaFHNYIB22URL#747349S. Krishna NarayananS. DhanasekaranV. VasudevanAn effective parameter tuned deep belief network for detecting anomalous behavior in sensor-based cyber-physical systems.Theor. Comput. Sci.931142-1512022Journal Articlesclosedjournals/tcs/NarayananDV2210.1016/J.TCS.2022.07.037https://doi.org/10.1016/j.tcs.2022.07.037https://dblp.org/rec/journals/tcs/NarayananDV22URL#747350Dieaa I. NassrM. AnwarHatem M. BahigImproving small private exponent attack on the Murru-Saettone cryptosystem.Theor. Comput. Sci.923222-2342022Journal Articlesclosedjournals/tcs/NassrAB2210.1016/J.TCS.2022.05.010https://doi.org/10.1016/j.tcs.2022.05.010https://dblp.org/rec/journals/tcs/NassrAB22URL#747351Eike NeumannOn the computability of the set of automorphisms of the unit square.Theor. Comput. Sci.90374-832022Journal Articlesclosedjournals/tcs/Neumann2210.1016/J.TCS.2021.12.019https://doi.org/10.1016/j.tcs.2021.12.019https://dblp.org/rec/journals/tcs/Neumann22URL#747352Minh Hieu Nguyen 0001Canh Hoang NgocAlexander A. MoldovyanNikolay A. MoldovyanHuy Quang VuDanh Kim Le TranA novel version of the hidden logarithm problem for post-quantum signature algorithms.Theor. Comput. Sci.92136-492022Journal Articlesclosedjournals/tcs/NguyenNMMVT2210.1016/J.TCS.2022.03.040https://doi.org/10.1016/j.tcs.2022.03.040https://dblp.org/rec/journals/tcs/NguyenNMMVT22URL#747353Viet-Ha Nguyen 0004Kévin PerrotRikudo is NP-complete.Theor. Comput. Sci.91034-472022Journal Articlesclosedjournals/tcs/NguyenP2210.1016/J.TCS.2022.01.034https://doi.org/10.1016/j.tcs.2022.01.034https://dblp.org/rec/journals/tcs/NguyenP22URL#747354Kien Trung NguyenWen Chean TehNguyen Thanh HungHuong Nguyen-ThuA linear time algorithm for connected p-centdian problem on block graphs.Theor. Comput. Sci.923318-3262022Journal Articlesclosedjournals/tcs/NguyenTHN2210.1016/J.TCS.2022.05.019https://doi.org/10.1016/j.tcs.2022.05.019https://dblp.org/rec/journals/tcs/NguyenTHN22URL#747355Qiufen NiJianxiong GuoHongmin W. DuHuan Wang 0005Multi-attribute based influence maximization in social networks: Algorithms and analysis.Theor. Comput. Sci.92150-622022Journal Articlesclosedjournals/tcs/NiGDW2210.1016/J.TCS.2022.03.041https://doi.org/10.1016/j.tcs.2022.03.041https://dblp.org/rec/journals/tcs/NiGDW22URL#747356André NiesFrank Stephan 0001Randomness and initial segment complexity for measures.Theor. Comput. Sci.9001-192022Journal Articlesclosedjournals/tcs/NiesS2210.1016/J.TCS.2021.11.003https://doi.org/10.1016/j.tcs.2021.11.003https://dblp.org/rec/journals/tcs/NiesS22URL#747357Wantao NingLitao GuoConnectivity and super connectivity of the exchanged 3-ary n-cube.Theor. Comput. Sci.923160-1662022Journal Articlesclosedjournals/tcs/NingG2210.1016/J.TCS.2022.05.003https://doi.org/10.1016/j.tcs.2022.05.003https://dblp.org/rec/journals/tcs/NingG22URL#747358Xinya NingNan Zhang 0001Zhenhua DuanCong TianPPTL specification mining based on LNFG.Theor. Comput. Sci.93785-952022Journal Articlesclosedjournals/tcs/NingZDT2210.1016/J.TCS.2022.09.032https://doi.org/10.1016/j.tcs.2022.09.032https://dblp.org/rec/journals/tcs/NingZDT22URL#747359Ruichao NiuMin Xu 0005The unpaired many-to-many k-disjoint paths in bipartite hypercube-like networks.Theor. Comput. Sci.91126-402022Journal Articlesclosedjournals/tcs/NiuX2210.1016/J.TCS.2022.02.003https://doi.org/10.1016/j.tcs.2022.02.003https://dblp.org/rec/journals/tcs/NiuX22URL#747360Isabel OitavemThe polynomial hierarchy of functions and its levels.Theor. Comput. Sci.90025-342022Journal Articlesclosedjournals/tcs/Oitavem2210.1016/J.TCS.2021.11.016https://doi.org/10.1016/j.tcs.2021.11.016https://dblp.org/rec/journals/tcs/Oitavem22URL#747361Fumiya OkuboTakashi YokomoriCorrigendum to "On the computing powers of L-reductions of insertion languages" [Theor. Comput. Sci. 862 (2021) 224-235].Theor. Comput. Sci.9201132022Journal Articlesclosedjournals/tcs/OkuboY2210.1016/J.TCS.2021.06.028https://doi.org/10.1016/j.tcs.2021.06.028https://dblp.org/rec/journals/tcs/OkuboY22URL#747362Pedro Paulo Balbi de OliveiraEnrico FormentiKévin PerrotSara RivaEurico L. P. RuivoNon-maximal sensitivity to synchronism in elementary cellular automata: Exact asymptotic measures.Theor. Comput. Sci.92621-502022Journal Articlesclosedjournals/tcs/OliveiraFPRR2210.1016/J.TCS.2022.05.024https://doi.org/10.1016/j.tcs.2022.05.024https://dblp.org/rec/journals/tcs/OliveiraFPRR22URL#747363David Orellana-MartínLuis Valencia-CabreraMario J. Pérez-JiménezP systems with evolutional symport and membrane creation rules solving QSAT.Theor. Comput. Sci.90856-632022Journal Articlesclosedjournals/tcs/Orellana-Martin2210.1016/J.TCS.2021.11.012https://doi.org/10.1016/j.tcs.2021.11.012https://dblp.org/rec/journals/tcs/Orellana-Martin22URL#747364B. S. Panda 0001PriyamvadaComplexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs.Theor. Comput. Sci.90632-512022Journal Articlesclosedjournals/tcs/PandaP2210.1016/J.TCS.2022.01.003https://doi.org/10.1016/j.tcs.2022.01.003https://dblp.org/rec/journals/tcs/PandaP22URL#747365Boaz Patt-ShamirMor PerryProof-labeling schemes: Broadcast, unicast and in between.Theor. Comput. Sci.923179-1952022Journal Articlesclosedjournals/tcs/Patt-ShamirP2210.1016/J.TCS.2022.05.006https://doi.org/10.1016/j.tcs.2022.05.006https://dblp.org/rec/journals/tcs/Patt-ShamirP22URL#747366Kirstin PetersUwe NestmannAnna Schmitt 0002On distributability.Theor. Comput. Sci.913151-1732022Journal Articlesclosedjournals/tcs/PetersNS2210.1016/J.TCS.2022.03.028https://doi.org/10.1016/j.tcs.2022.03.028https://dblp.org/rec/journals/tcs/PetersNS22URL#747367Iosif PetrakisClosed subsets in Bishop topological groups.Theor. Comput. Sci.935128-1432022Journal Articlesclosedjournals/tcs/Petrakis2210.1016/J.TCS.2022.09.004https://doi.org/10.1016/j.tcs.2022.09.004https://dblp.org/rec/journals/tcs/Petrakis22URL#747368Minh Thuy Truc PhamNgoc Ai Van NguyenMei JiangDung Hoang DuongWilly SusiloWildcarded identity-based encryption from lattices.Theor. Comput. Sci.90241-532022Journal Articlesclosedjournals/tcs/PhamNJDS2210.1016/J.TCS.2021.12.007https://doi.org/10.1016/j.tcs.2021.12.007https://dblp.org/rec/journals/tcs/PhamNJDS22URL#747369Anna PhilippouKyriaki PsaraA collective interpretation semantics for reversing Petri nets.Theor. Comput. Sci.924148-1702022Journal Articlesclosedjournals/tcs/PhilippouP2210.1016/J.TCS.2022.05.016https://doi.org/10.1016/j.tcs.2022.05.016https://dblp.org/rec/journals/tcs/PhilippouP22URL#747370Paul PoncetTransporting continuity properties from a poset to its subposets.Theor. Comput. Sci.912109-1322022Journal Articlesclosedjournals/tcs/Poncet2210.1016/J.TCS.2022.02.021https://doi.org/10.1016/j.tcs.2022.02.021https://dblp.org/rec/journals/tcs/Poncet22URL#747371Abolfazl PoureidiAlgorithm and hardness results in double Roman domination of graphs.Theor. Comput. Sci.91170-792022Journal Articlesclosedjournals/tcs/Poureidi2210.1016/J.TCS.2022.02.006https://doi.org/10.1016/j.tcs.2022.02.006https://dblp.org/rec/journals/tcs/Poureidi22URL#747372Abolfazl PoureidiAlgorithmic results in secure total dominating sets on graphs.Theor. Comput. Sci.9181-172022Journal Articlesclosedjournals/tcs/Poureidi22a10.1016/J.TCS.2022.03.016https://doi.org/10.1016/j.tcs.2022.03.016https://dblp.org/rec/journals/tcs/Poureidi22aURL#747373PriyamvadaB. S. Panda 0001Exact square coloring of certain classes of graphs: Complexity and algorithms.Theor. Comput. Sci.93284-1012022Journal Articlesclosedjournals/tcs/PriyamvadaP2210.1016/J.TCS.2022.08.008https://doi.org/10.1016/j.tcs.2022.08.008https://dblp.org/rec/journals/tcs/PriyamvadaP22URL#747374Guoyao RaoYongcai WangWenping ChenDeying Li 0001Weili Wu 0001Union acceptable profit maximization in social networks.Theor. Comput. Sci.917107-1212022Journal Articlesclosedjournals/tcs/RaoWCLW2210.1016/J.TCS.2022.03.015https://doi.org/10.1016/j.tcs.2022.03.015https://dblp.org/rec/journals/tcs/RaoWCLW22URL#747375Michel RaynalGadi TaubenfeldA visit to mutual exclusion in seven dates.Theor. Comput. Sci.91947-652022Journal Articlesclosedjournals/tcs/RaynalT2210.1016/J.TCS.2022.03.030https://doi.org/10.1016/j.tcs.2022.03.030https://dblp.org/rec/journals/tcs/RaynalT22URL#747376Rüdiger ReischukThe kangaroo problem.Theor. Comput. Sci.89850-582022Journal Articlesclosedjournals/tcs/Reischuk2210.1016/J.TCS.2021.10.018https://doi.org/10.1016/j.tcs.2021.10.018https://dblp.org/rec/journals/tcs/Reischuk22URL#747377G. RevathyK. Bhavana RajAnil Kumar 0009Spurthi AdibattiPriyanka DahiyaT. M. LathaInvestigation of E-voting system using face recognition using convolutional neural network (CNN).Theor. Comput. Sci.92561-672022Journal Articlesclosedjournals/tcs/RevathyRKADL2210.1016/J.TCS.2022.05.005https://doi.org/10.1016/j.tcs.2022.05.005https://dblp.org/rec/journals/tcs/RevathyRKADL22URL#747378Andrei E. RomashchenkoClustering with respect to the information distance.Theor. Comput. Sci.929164-1712022Journal Articlesclosedjournals/tcs/Romashchenko2210.1016/J.TCS.2022.06.039https://doi.org/10.1016/j.tcs.2022.06.039https://dblp.org/rec/journals/tcs/Romashchenko22URL#747379Guozhen RongYongjie Yang 0001Wenjun Li 0001Jianxin Wang 0001A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queries.Theor. Comput. Sci.9171-112022Journal Articlesclosedjournals/tcs/RongYLW2210.1016/J.TCS.2022.03.008https://doi.org/10.1016/j.tcs.2022.03.008https://dblp.org/rec/journals/tcs/RongYLW22URL#747380Vahid RoostapourAneta NeumannFrank Neumann 0001Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints.Theor. Comput. Sci.924129-1472022Journal Articlesclosedjournals/tcs/RoostapourNN2210.1016/J.TCS.2022.05.008https://doi.org/10.1016/j.tcs.2022.05.008https://dblp.org/rec/journals/tcs/RoostapourNN22URL#747381Partha Sarathi Roy 0001Dung Hoang DuongWilly SusiloArnaud SipasseuthKazuhide FukushimaShinsaku KiyomotoLattice-based public-key encryption with equality test supporting flexible authorization in standard model.Theor. Comput. Sci.929124-1392022Journal Articlesclosedjournals/tcs/RoyDSSFK2210.1016/J.TCS.2022.06.034https://doi.org/10.1016/j.tcs.2022.06.034https://dblp.org/rec/journals/tcs/RoyDSSFK22URL#747382Josef RukavickaPalindromic length and reduction of powers.Theor. Comput. Sci.930106-1152022Journal Articlesclosedjournals/tcs/Rukavicka2210.1016/J.TCS.2022.07.015https://doi.org/10.1016/j.tcs.2022.07.015https://dblp.org/rec/journals/tcs/Rukavicka22URL#747383Luís M. S. RussoRange minimum queries in minimal space.Theor. Comput. Sci.90919-382022Journal Articlesclosedjournals/tcs/Russo2210.1016/J.TCS.2022.01.025https://doi.org/10.1016/j.tcs.2022.01.025https://dblp.org/rec/journals/tcs/Russo22URL#747384Irena RusuHamiltonian problems in directed graphs with simple row patterns.Theor. Comput. Sci.91670-852022Journal Articlesclosedjournals/tcs/Rusu2210.1016/J.TCS.2022.03.005https://doi.org/10.1016/j.tcs.2022.03.005https://dblp.org/rec/journals/tcs/Rusu22URL#747385Mikhail N. RybakovDmitry ShkatovComplexity of finite-variable fragments of propositional temporal and modal logics of computation.Theor. Comput. Sci.92545-602022Journal Articlesclosedjournals/tcs/RybakovS2210.1016/J.TCS.2022.04.056https://doi.org/10.1016/j.tcs.2022.04.056https://dblp.org/rec/journals/tcs/RybakovS22URL#747386Mohsen SafariMarieke HuismanFormal verification of parallel prefix sum and stream compaction algorithms in CUDA.Theor. Comput. Sci.91281-982022Journal Articlesopenjournals/tcs/SafariH2210.1016/J.TCS.2022.02.027https://doi.org/10.1016/j.tcs.2022.02.027https://dblp.org/rec/journals/tcs/SafariH22URL#747387Yoshifumi SakaiA data structure for substring-substring LCS length queries.Theor. Comput. Sci.91141-542022Journal Articlesclosedjournals/tcs/Sakai2210.1016/J.TCS.2022.02.004https://doi.org/10.1016/j.tcs.2022.02.004https://dblp.org/rec/journals/tcs/Sakai22URL#747388Ville SaloGuillaume TheyssierIlkka TörmäCellular automata and bootstrap percolation.Theor. Comput. Sci.92434-452022Journal Articlesopenjournals/tcs/SaloTT2210.1016/J.TCS.2022.04.015https://doi.org/10.1016/j.tcs.2022.04.015https://dblp.org/rec/journals/tcs/SaloTT22URL#747389Madhumita SardarDeepanwita DasSrabani MukhopadhyayaGrid exploration by a swarm of autonomous robots with minimum repetitions.Theor. Comput. Sci.93367-872022Journal Articlesclosedjournals/tcs/SardarDM2210.1016/J.TCS.2022.08.029https://doi.org/10.1016/j.tcs.2022.08.029https://dblp.org/rec/journals/tcs/SardarDM22URL#747390Joe SawadaAaron WilliamsDennis WongFlip-swap languages in binary reflected Gray code order.Theor. Comput. Sci.933138-1482022Journal Articlesclosedjournals/tcs/SawadaWW2210.1016/J.TCS.2022.08.024https://doi.org/10.1016/j.tcs.2022.08.024https://dblp.org/rec/journals/tcs/SawadaWW22URL#747391Robert Scheffler 0001On the recognition of search trees generated by BFS and DFS.Theor. Comput. Sci.936116-1282022Journal Articlesclosedjournals/tcs/Scheffler2210.1016/J.TCS.2022.09.018https://doi.org/10.1016/j.tcs.2022.09.018https://dblp.org/rec/journals/tcs/Scheffler22URL#747392K. R. SekarNaga Raju MMohd Anul HaqAnil Kumar 0009R. ShaliniS. PoojalaxmiAn improved ranking methodology for malignant carcinoma in multicriterian decision making using hesitant VIKOR fuzzy.Theor. Comput. Sci.92981-942022Journal Articlesclosedjournals/tcs/SekarMHKSP2210.1016/J.TCS.2022.06.031https://doi.org/10.1016/j.tcs.2022.06.031https://dblp.org/rec/journals/tcs/SekarMHKSP22URL#747393Daniel SelvaratnamMichael CantoniJ. M. DavorenIman ShamesSampling polynomial trajectories for LTL verification.Theor. Comput. Sci.897135-1632022Journal Articlesclosedjournals/tcs/SelvaratnamCDS2210.1016/J.TCS.2021.10.024https://doi.org/10.1016/j.tcs.2021.10.024https://dblp.org/rec/journals/tcs/SelvaratnamCDS22URL#747394Ryoma SendaYoshiaki TakataHiroyuki SekiComplexity results on register context-free grammars and related formalisms.Theor. Comput. Sci.92399-1252022Journal Articlesopenjournals/tcs/SendaTS2210.1016/J.TCS.2022.04.055https://doi.org/10.1016/j.tcs.2022.04.055https://dblp.org/rec/journals/tcs/SendaTS22URL#747395Rajendra Kumar SharmaPrasanna Raghaw MishraYogesh KumarNupur GuptaDifferential δ-uniformity and non-linearity of permutations over Zn.Theor. Comput. Sci.9361-122022Journal Articlesclosedjournals/tcs/SharmaMKG2210.1016/J.TCS.2022.08.031https://doi.org/10.1016/j.tcs.2022.08.031https://dblp.org/rec/journals/tcs/SharmaMKG22URL#747396Alexander ShenIndividual codewords.Theor. Comput. Sci.908120-1222022Journal Articlesclosedjournals/tcs/Shen2210.1016/J.TCS.2022.01.041https://doi.org/10.1016/j.tcs.2022.01.041https://dblp.org/rec/journals/tcs/Shen22URL#747397Zhao ShenPrime automata do not exist.Theor. Comput. Sci.922248-2562022Journal Articlesclosedjournals/tcs/Shen22a10.1016/J.TCS.2022.04.027https://doi.org/10.1016/j.tcs.2022.04.027https://dblp.org/rec/journals/tcs/Shen22aURL#747398Shiyu ShenHongbing WangYunlei ZhaoIdentity-based authenticated encryption with identity confidentiality.Theor. Comput. Sci.9011-182022Journal Articlesclosedjournals/tcs/ShenWZ2210.1016/J.TCS.2021.11.014https://doi.org/10.1016/j.tcs.2021.11.014https://dblp.org/rec/journals/tcs/ShenWZ22URL#747399Zimo ShengMingyu Xiao 0001An improved kernel for planar vertex-disjoint triangle packing.Theor. Comput. Sci.922122-1302022Journal Articlesclosedjournals/tcs/ShengX2210.1016/J.TCS.2022.04.017https://doi.org/10.1016/j.tcs.2022.04.017https://dblp.org/rec/journals/tcs/ShengX22URL#747400Chai ShuXiang-Jun LiMeijie MaNote on reliability of star graphs.Theor. Comput. Sci.923366-3752022Journal Articlesclosedjournals/tcs/ShuLM2210.1016/J.TCS.2022.05.028https://doi.org/10.1016/j.tcs.2022.05.028https://dblp.org/rec/journals/tcs/ShuLM22URL#747401Janio Carlos Nascimento SilvaUéverton S. SouzaComputing the best-case energy complexity of satisfying assignments in monotone circuits.Theor. Comput. Sci.93241-552022Journal Articlesclosedjournals/tcs/SilvaS2210.1016/J.TCS.2022.08.005https://doi.org/10.1016/j.tcs.2022.08.005https://dblp.org/rec/journals/tcs/SilvaS22URL#747402Eduardo SkapinakisJosé Félix CostaMachines that perform measurements.Theor. Comput. Sci.92468-932022Journal Articlesclosedjournals/tcs/SkapinakisC2210.1016/J.TCS.2022.04.037https://doi.org/10.1016/j.tcs.2022.04.037https://dblp.org/rec/journals/tcs/SkapinakisC22URL#747403Miroslav StankovicEzio BartocciLaura KovácsMoment-based analysis of Bayesian network properties.Theor. Comput. Sci.903113-1332022Journal Articlesclosedjournals/tcs/StankovicBK2210.1016/J.TCS.2021.12.021https://doi.org/10.1016/j.tcs.2021.12.021https://dblp.org/rec/journals/tcs/StankovicBK22URL#747404C. SudhaD. SureshA. NageshAccurate data aggregation created by neural network and data classification processed through machine learning in wireless sensor networks.Theor. Comput. Sci.92525-362022Journal Articlesclosedjournals/tcs/SudhaSN2210.1016/J.TCS.2022.04.020https://doi.org/10.1016/j.tcs.2022.04.020https://dblp.org/rec/journals/tcs/SudhaSN22URL#747405T. Lakshmi SurekhaN. Chandra Sekhara RaoC. K. ShahnazeerSyed Mufassir YaseenSurendra Kumar ShuklaSingh BharatMahendran ArumugamDigital misinformation and fake news detection using WoT integration with Asian social networks fusion based feature extraction with text and image classification by machine learning architectures.Theor. Comput. Sci.9271-142022Journal Articlesclosedjournals/tcs/SurekhaRSYSBA2210.1016/J.TCS.2022.05.017https://doi.org/10.1016/j.tcs.2022.05.017https://dblp.org/rec/journals/tcs/SurekhaRSYSBA22URL#747406Karl SvozilVarieties of contextuality based on probability and structural nonembeddability.Theor. Comput. Sci.924117-1282022Journal Articlesopenjournals/tcs/Svozil2210.1016/J.TCS.2022.04.039https://doi.org/10.1016/j.tcs.2022.04.039https://dblp.org/rec/journals/tcs/Svozil22URL#747407Yuki TakeuchiTomoyuki MorimaeSeiichiro TaniSumcheck-based delegation of quantum computing to rational server.Theor. Comput. Sci.92446-672022Journal Articlesopenjournals/tcs/TakeuchiMT2210.1016/J.TCS.2022.04.016https://doi.org/10.1016/j.tcs.2022.04.016https://dblp.org/rec/journals/tcs/TakeuchiMT22URL#747408Prafullkumar TaleSparsification lower bound for linear spanners in directed graphs.Theor. Comput. Sci.89869-742022Journal Articlesclosedjournals/tcs/Tale2210.1016/J.TCS.2021.10.022https://doi.org/10.1016/j.tcs.2021.10.022https://dblp.org/rec/journals/tcs/Tale22URL#747409Hellis TammQuotients and atoms of reversible languages.Theor. Comput. Sci.92033-452022Journal Articlesclosedjournals/tcs/Tamm2210.1016/J.TCS.2022.02.023https://doi.org/10.1016/j.tcs.2022.02.023https://dblp.org/rec/journals/tcs/Tamm22URL#747410Xuehou TanQi Wei 0005Improved exploration of unknown polygons.Theor. Comput. Sci.922424-4372022Journal Articlesclosedjournals/tcs/TanW2210.1016/J.TCS.2022.04.043https://doi.org/10.1016/j.tcs.2022.04.043https://dblp.org/rec/journals/tcs/TanW22URL#747411Jingjing TanFengmin WangWeina YeXiaoqing ZhangYang Zhou 0018Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice.Theor. Comput. Sci.93739-492022Journal Articlesclosedjournals/tcs/TanWYZZ2210.1016/J.TCS.2022.09.028https://doi.org/10.1016/j.tcs.2022.09.028https://dblp.org/rec/journals/tcs/TanWYZZ22URL#747412Zhiyi TangOptimal embedding of hypercube into cylinder.Theor. Comput. Sci.923327-3362022Journal Articlesclosedjournals/tcs/Tang2210.1016/J.TCS.2022.05.020https://doi.org/10.1016/j.tcs.2022.05.020https://dblp.org/rec/journals/tcs/Tang22URL#747413Shaojie Tang 0001Beyond pointwise submodularity: Non-monotone adaptive submodular maximization subject to knapsack and k-system constraints.Theor. Comput. Sci.936139-1472022Journal Articlesclosedjournals/tcs/Tang22a10.1016/J.TCS.2022.09.022https://doi.org/10.1016/j.tcs.2022.09.022https://dblp.org/rec/journals/tcs/Tang22aURL#747414Shaojie Tang 0001Stochastic submodular probing with state-dependent costs.Theor. Comput. Sci.93763-682022Journal Articlesclosedjournals/tcs/Tang22b10.1016/J.TCS.2022.09.030https://doi.org/10.1016/j.tcs.2022.09.030https://dblp.org/rec/journals/tcs/Tang22bURL#747415Zhongzheng TangChenhao Wang 0001Hau ChanMonotone k-submodular secretary problems: Cardinality and knapsack constraints.Theor. Comput. Sci.92186-992022Journal Articlesclosedjournals/tcs/TangWC2210.1016/J.TCS.2022.04.003https://doi.org/10.1016/j.tcs.2022.04.003https://dblp.org/rec/journals/tcs/TangWC22URL#747416Wen Chean TehJohnny LimEvolvability of reaction systems and the invisibility theorem.Theor. Comput. Sci.92417-332022Journal Articlesclosedjournals/tcs/TehL2210.1016/J.TCS.2022.03.039https://doi.org/10.1016/j.tcs.2022.03.039https://dblp.org/rec/journals/tcs/TehL22URL#747417Pairat ThorncharoensriWilly SusiloYang-Wai ChowPrivacy-preserving file sharing on cloud storage with certificateless signcryption.Theor. Comput. Sci.9161-212022Journal Articlesclosedjournals/tcs/Thorncharoensri2210.1016/J.TCS.2022.02.033https://doi.org/10.1016/j.tcs.2022.02.033https://dblp.org/rec/journals/tcs/Thorncharoensri22URL#747418Yongcui TianQiang Zhu 0003r-component diagnosability of hypercubes under the PMC model.Theor. Comput. Sci.933114-1242022Journal Articlesclosedjournals/tcs/TianZ2210.1016/J.TCS.2022.08.026https://doi.org/10.1016/j.tcs.2022.08.026https://dblp.org/rec/journals/tcs/TianZ22URL#747419Zhaoxia TianMingzu ZhangXing FengReliability measure of the n-th cartesian product of complete graph K4 on h-extra edge-connectivity.Theor. Comput. Sci.92246-602022Journal Articlesclosedjournals/tcs/TianZF2210.1016/J.TCS.2022.04.010https://doi.org/10.1016/j.tcs.2022.04.010https://dblp.org/rec/journals/tcs/TianZF22URL#747420Weitian TongYao XuHuili ZhangA polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint.Theor. Comput. Sci.922438-4462022Journal Articlesclosedjournals/tcs/TongXZ2210.1016/J.TCS.2022.04.044https://doi.org/10.1016/j.tcs.2022.04.044https://dblp.org/rec/journals/tcs/TongXZ22URL#747421Vikash TripathiTon KloksArti PandeyKaustav PaulHung-Lung WangComplexity of paired domination in AT-free and planar graphs.Theor. Comput. Sci.93053-622022Journal Articlesclosedjournals/tcs/TripathiKPPW2210.1016/J.TCS.2022.07.010https://doi.org/10.1016/j.tcs.2022.07.010https://dblp.org/rec/journals/tcs/TripathiKPPW22URL#747422Dekel TsurFaster algorithm for pathwidth one vertex deletion.Theor. Comput. Sci.92163-742022Journal Articlesclosedjournals/tcs/Tsur2210.1016/J.TCS.2022.04.001https://doi.org/10.1016/j.tcs.2022.04.001https://dblp.org/rec/journals/tcs/Tsur22URL#747423Marcel TurkensteenGerold JägerEfficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems.Theor. Comput. Sci.9371-212022Journal Articlesclosedjournals/tcs/TurkensteenJ2210.1016/J.TCS.2022.09.026https://doi.org/10.1016/j.tcs.2022.09.026https://dblp.org/rec/journals/tcs/TurkensteenJ22URL#747424Frits W. VaandragerAbhisek MidyaA Myhill-Nerode theorem for register automata and symbolic trace languages.Theor. Comput. Sci.91237-552022Journal Articlesopenjournals/tcs/VaandragerM2210.1016/J.TCS.2022.01.015https://doi.org/10.1016/j.tcs.2022.01.015https://dblp.org/rec/journals/tcs/VaandragerM22URL#747425Sándor VágvölgyiDeterministic top-down tree automata with Boolean deterministic look-ahead.Theor. Comput. Sci.92742-642022Journal Articlesclosedjournals/tcs/Vagvolgyi2210.1016/J.TCS.2022.05.027https://doi.org/10.1016/j.tcs.2022.05.027https://dblp.org/rec/journals/tcs/Vagvolgyi22URL#747426Alvaro VelasquezK. Subramani 0001Piotr Wojciechowski 0002On the complexity of and solutions to the minimum stopping and trapping set problems.Theor. Comput. Sci.91526-442022Journal Articlesclosedjournals/tcs/VelasquezSW2210.1016/J.TCS.2022.02.028https://doi.org/10.1016/j.tcs.2022.02.028https://dblp.org/rec/journals/tcs/VelasquezSW22URL#747427David VenhoekJoshua MoermanJurriaan RotFast computations on ordered nominal sets.Theor. Comput. Sci.93582-1042022Journal Articlesclosedjournals/tcs/VenhoekMR2210.1016/J.TCS.2022.09.002https://doi.org/10.1016/j.tcs.2022.09.002https://dblp.org/rec/journals/tcs/VenhoekMR22URL#747428Juan José Besa VialTimothy JohnsonNil MamanoMartha C. OseguedaParker WilliamsTaming the knight's tour: Minimizing turns and crossings.Theor. Comput. Sci.9021-202022Journal Articlesopenjournals/tcs/VialJMOW2210.1016/J.TCS.2021.12.002https://doi.org/10.1016/j.tcs.2021.12.002https://dblp.org/rec/journals/tcs/VialJMOW22URL#747429Shiying WangThe diagnosability of Möbius cubes for the g-extra condition.Theor. Comput. Sci.90876-882022Journal Articlesclosedjournals/tcs/Wang2210.1016/J.TCS.2022.01.011https://doi.org/10.1016/j.tcs.2022.01.011https://dblp.org/rec/journals/tcs/Wang22URL#747430Biing-Feng WangEfficient algorithms for the minmax regret path center problem with length constraint on trees.Theor. Comput. Sci.91818-312022Journal Articlesclosedjournals/tcs/Wang22a10.1016/J.TCS.2022.03.017https://doi.org/10.1016/j.tcs.2022.03.017https://dblp.org/rec/journals/tcs/Wang22aURL#747431Jiabing WangJiaye ChenMaximizing the ratio of cluster split to cluster diameter without and with cardinality constraints.Theor. Comput. Sci.90554-682022Journal Articlesclosedjournals/tcs/WangC2210.1016/J.TCS.2021.12.015https://doi.org/10.1016/j.tcs.2021.12.015https://dblp.org/rec/journals/tcs/WangC22URL#747432Huizhen WangHongwei Du 0001Time sensitive sweep coverage with minimum UAVs.Theor. Comput. Sci.928197-2092022Journal Articlesclosedjournals/tcs/WangD2210.1016/J.TCS.2022.06.025https://doi.org/10.1016/j.tcs.2022.06.025https://dblp.org/rec/journals/tcs/WangD22URL#747433Na WangJixiang MengYingzhi TianNeighbor-connectivity of pancake networks and burnt pancake networks.Theor. Comput. Sci.91631-392022Journal Articlesclosedjournals/tcs/WangMT2210.1016/J.TCS.2022.03.002https://doi.org/10.1016/j.tcs.2022.03.002https://dblp.org/rec/journals/tcs/WangMT22URL#747434Longchun WangXiangnan ZhouQingguo LiInformation systems for continuous semi-lattices.Theor. Comput. Sci.913138-1502022Journal Articlesclosedjournals/tcs/WangZL2210.1016/J.TCS.2022.02.020https://doi.org/10.1016/j.tcs.2022.02.020https://dblp.org/rec/journals/tcs/WangZL22URL#747435Devasirvatham WeslinThiyagarajan Joshva DevadasExtricating web pages from deep web using deaima architecture.Theor. Comput. Sci.93193-1032022Journal Articlesclosedjournals/tcs/WeslinD2210.1016/J.TCS.2022.07.033https://doi.org/10.1016/j.tcs.2022.07.033https://dblp.org/rec/journals/tcs/WeslinD22URL#747436Petra Wolf 0002From decidability to undecidability by considering regular sets of instances.Theor. Comput. Sci.89925-382022Journal Articlesclosedjournals/tcs/Wolf2210.1016/J.TCS.2021.11.006https://doi.org/10.1016/j.tcs.2021.11.006https://dblp.org/rec/journals/tcs/Wolf22URL#747437Suying WuJianxi FanBaolei ChengJia Yu 0005Yan Wang 0078Connectivity and constructive algorithms of disjoint paths in dragonfly networks.Theor. Comput. Sci.922257-2702022Journal Articlesclosedjournals/tcs/WuFCYW2210.1016/J.TCS.2022.04.028https://doi.org/10.1016/j.tcs.2022.04.028https://dblp.org/rec/journals/tcs/WuFCYW22URL#747438Zhenggang WuDaowen QiuJiawei TanHao LiGuangya CaiQuantum and classical query complexities for generalized Simon's problem.Theor. Comput. Sci.924171-1862022Journal Articlesclosedjournals/tcs/WuQTLC2210.1016/J.TCS.2022.05.025https://doi.org/10.1016/j.tcs.2022.05.025https://dblp.org/rec/journals/tcs/WuQTLC22URL#747439Shengjun XieHaodi FengHaitao JiangDaming ZhuApproximation algorithms for sorting by bounded singleton moves.Theor. Comput. Sci.91751-652022Journal Articlesclosedjournals/tcs/XieFJZ2210.1016/J.TCS.2022.03.011https://doi.org/10.1016/j.tcs.2022.03.011https://dblp.org/rec/journals/tcs/XieFJZ22URL#747440Ruifeng XieZhenjiang HuGeneric recursive lens combinators and their calculation laws.Theor. Comput. Sci.913113-1372022Journal Articlesclosedjournals/tcs/XieH2210.1016/J.TCS.2022.02.019https://doi.org/10.1016/j.tcs.2022.02.019https://dblp.org/rec/journals/tcs/XieH22URL#747441Ming Xu 0010Jianling FuJingyi MeiYuxin DengModel checking QCTL plus on quantum Markov chains.Theor. Comput. Sci.91343-722022Journal Articlesclosedjournals/tcs/XuFMD2210.1016/J.TCS.2022.01.044https://doi.org/10.1016/j.tcs.2022.01.044https://dblp.org/rec/journals/tcs/XuFMD22URL#747442Ming Xu 0010Jianling FuJingyi MeiYuxin DengAn algebraic method to fidelity-based model checking over quantum Markov chains.Theor. Comput. Sci.93561-812022Journal Articlesclosedjournals/tcs/XuFMD22a10.1016/J.TCS.2022.08.016https://doi.org/10.1016/j.tcs.2022.08.016https://dblp.org/rec/journals/tcs/XuFMD22aURL#747443Jun Xu 0022Santanu Sarkar 0001Lei HuRevisiting orthogonal lattice attacks on approximate common divisor problems.Theor. Comput. Sci.91155-692022Journal Articlesclosedjournals/tcs/XuSH2210.1016/J.TCS.2022.02.005https://doi.org/10.1016/j.tcs.2022.02.005https://dblp.org/rec/journals/tcs/XuSH22URL#747444Xiong XuShuling WangBohua ZhanXiangyu JinJean-Pierre TalpinNaijun ZhanUnified graphical co-modeling, analysis and verification of cyber-physical systems by combining AADL and Simulink/Stateflow.Theor. Comput. Sci.9031-252022Journal Articlesclosedjournals/tcs/XuWZJTZ2210.1016/J.TCS.2021.11.008https://doi.org/10.1016/j.tcs.2021.11.008https://dblp.org/rec/journals/tcs/XuWZJTZ22URL#747445Liqiong XuShanshan YinLiyang ZhaiDiagnosability and hybrid diagnosability of some classes of graphs under the BPMC model.Theor. Comput. Sci.91545-542022Journal Articlesclosedjournals/tcs/XuYZ2210.1016/J.TCS.2022.02.029https://doi.org/10.1016/j.tcs.2022.02.029https://dblp.org/rec/journals/tcs/XuYZ22URL#747446Boting YangOne-visibility cops and robber on trees: Optimal cop-win strategies.Theor. Comput. Sci.92827-472022Journal Articlesclosedjournals/tcs/Yang2210.1016/J.TCS.2022.06.011https://doi.org/10.1016/j.tcs.2022.06.011https://dblp.org/rec/journals/tcs/Yang22URL#747447Qizhe YangYuxi FuCounting nondeterministic computations.Theor. Comput. Sci.89749-632022Journal Articlesclosedjournals/tcs/YangF2210.1016/J.TCS.2021.08.022https://doi.org/10.1016/j.tcs.2021.08.022https://dblp.org/rec/journals/tcs/YangF22URL#747448Jing Yang 0035Fang-Wei Fu 0001New (k, l, m)-verifiable multi-secret sharing schemes based on XTR public key system.Theor. Comput. Sci.91054-672022Journal Articlesclosedjournals/tcs/YangF22a10.1016/J.TCS.2022.01.036https://doi.org/10.1016/j.tcs.2022.01.036https://dblp.org/rec/journals/tcs/YangF22aURL#747449Shaojun Yang 0001Xinyi Huang 0001Universal product learning with errors: A new variant of LWE for lattice-based cryptography.Theor. Comput. Sci.91590-1002022Journal Articlesclosedjournals/tcs/YangH2210.1016/J.TCS.2022.02.032https://doi.org/10.1016/j.tcs.2022.02.032https://dblp.org/rec/journals/tcs/YangH22URL#747450Silu YangDong LiHong Peng 0001Wenjie ZhouXiaohui LuoQian YangJun Wang 0013Xiaoxiao SongDynamic threshold P systems with delay on synapses for shortest path problems.Theor. Comput. Sci.92662-702022Journal Articlesclosedjournals/tcs/YangLPZLYWS2210.1016/J.TCS.2022.06.008https://doi.org/10.1016/j.tcs.2022.06.008https://dblp.org/rec/journals/tcs/YangLPZLYWS22URL#747451Zekun YeLvzhou LiSample complexity of hidden subgroup problem.Theor. Comput. Sci.922108-1212022Journal Articlesclosedjournals/tcs/YeL2210.1016/J.TCS.2022.04.014https://doi.org/10.1016/j.tcs.2022.04.014https://dblp.org/rec/journals/tcs/YeL22URL#747452Hao-Ping YehWei LuLi-Hsuan ChenLing-Ju HungRalf KlasingSun-Yuan HsiehHardness and approximation for the star p-Hub Routing Cost Problem in metric graphs.Theor. Comput. Sci.92213-242022Journal Articlesclosedjournals/tcs/YehLCHKH2210.1016/J.TCS.2022.04.007https://doi.org/10.1016/j.tcs.2022.04.007https://dblp.org/rec/journals/tcs/YehLCHKH22URL#747453Mingsheng YingLi ZhouYangjia LiYuan Feng 0001A proof system for disjoint parallel quantum programs.Theor. Comput. Sci.897164-1842022Journal Articlesclosedjournals/tcs/YingZL02210.1016/J.TCS.2021.10.025https://doi.org/10.1016/j.tcs.2021.10.025https://dblp.org/rec/journals/tcs/YingZL022URL#747454Lantao YouYuejuan HanJianxi FanDong YeStructure fault tolerance of WK-recursive networks.Theor. Comput. Sci.910113-1202022Journal Articlesclosedjournals/tcs/YouHFY2210.1016/J.TCS.2022.01.039https://doi.org/10.1016/j.tcs.2022.01.039https://dblp.org/rec/journals/tcs/YouHFY22URL#747455Jun Yuan 0001Ying LiAixia LiuHuijuan QiaoThe non-inclusive g-good-neighbor diagnosability of interconnection networks.Theor. Comput. Sci.922179-1922022Journal Articlesclosedjournals/tcs/YuanLLQ2210.1016/J.TCS.2022.04.023https://doi.org/10.1016/j.tcs.2022.04.023https://dblp.org/rec/journals/tcs/YuanLLQ22URL#747456Jun Yuan 0001Huijuan QiaoAixia LiuThe Rg-conditional diagnosability of international networks.Theor. Comput. Sci.89830-432022Journal Articlesclosedjournals/tcs/YuanQL2210.1016/J.TCS.2021.10.015https://doi.org/10.1016/j.tcs.2021.10.015https://dblp.org/rec/journals/tcs/YuanQL22URL#747457Radoslaw ZakFinding binary words with a given number of subsequences.Theor. Comput. Sci.91975-792022Journal Articlesclosedjournals/tcs/Zak2210.1016/J.TCS.2022.03.032https://doi.org/10.1016/j.tcs.2022.03.032https://dblp.org/rec/journals/tcs/Zak22URL#747458Elena ZamaraevaJovisa D. ZunicA characterization of 2-threshold functions via pairs of prime segments.Theor. Comput. Sci.9191-172022Journal Articlesclosedjournals/tcs/ZamaraevaZ2210.1016/J.TCS.2022.03.025https://doi.org/10.1016/j.tcs.2022.03.025https://dblp.org/rec/journals/tcs/ZamaraevaZ22URL#747459Konrad ZdanowskiOn efficiency of notations for natural numbers.Theor. Comput. Sci.9151-102022Journal Articlesclosedjournals/tcs/Zdanowski2210.1016/J.TCS.2022.02.015https://doi.org/10.1016/j.tcs.2022.02.015https://dblp.org/rec/journals/tcs/Zdanowski22URL#747460Jinshan Zhang 0001Tight social welfare approximation of probabilistic serial.Theor. Comput. Sci.9341-62022Journal Articlesclosedjournals/tcs/Zhang2210.1016/J.TCS.2022.08.003https://doi.org/10.1016/j.tcs.2022.08.003https://dblp.org/rec/journals/tcs/Zhang22URL#747461Yapu ZhangShengminjie ChenWenqing XuZhenning ZhangAdaptive influence maximization under fixed observation time-step.Theor. Comput. Sci.928104-1142022Journal Articlesclosedjournals/tcs/ZhangCXZ2210.1016/J.TCS.2022.06.018https://doi.org/10.1016/j.tcs.2022.06.018https://dblp.org/rec/journals/tcs/ZhangCXZ22URL#747462Wenming ZhangHuan HuYongxi ChengHongmei LiHaizhen WangThe work function algorithm for the paging problem.Theor. Comput. Sci.930100-1052022Journal Articlesclosedjournals/tcs/ZhangHCLW2210.1016/J.TCS.2022.07.014https://doi.org/10.1016/j.tcs.2022.07.014https://dblp.org/rec/journals/tcs/ZhangHCLW22URL#747463Shuangjun ZhangHaibin KanLiguan WangPreprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs.Theor. Comput. Sci.927148-1612022Journal Articlesclosedjournals/tcs/ZhangKW2210.1016/J.TCS.2022.06.005https://doi.org/10.1016/j.tcs.2022.06.005https://dblp.org/rec/journals/tcs/ZhangKW22URL#747464Jing ZhangYuan LiCertificate complexity of elementary symmetric Boolean functions.Theor. Comput. Sci.93816-232022Journal Articlesclosedjournals/tcs/ZhangL2210.1016/J.TCS.2022.09.034https://doi.org/10.1016/j.tcs.2022.09.034https://dblp.org/rec/journals/tcs/ZhangL22URL#747465Xiujuan ZhangYongcai WangDeying Li 0001Wenping ChenXingjian DingSelf-stabilizing spanner topology control solutions in wireless ad hoc networks.Theor. Comput. Sci.922395-4092022Journal Articlesclosedjournals/tcs/ZhangWLCD2210.1016/J.TCS.2022.04.041https://doi.org/10.1016/j.tcs.2022.04.041https://dblp.org/rec/journals/tcs/ZhangWLCD22URL#747466Luping ZhangFei XuAsynchronous homogenous spiking neural P systems with local rule synchronization.Theor. Comput. Sci.92651-612022Journal Articlesclosedjournals/tcs/ZhangX2210.1016/J.TCS.2022.05.023https://doi.org/10.1016/j.tcs.2022.05.023https://dblp.org/rec/journals/tcs/ZhangX22URL#747467Nianpeng ZhangQiang Zhu 0003Two important parameters of HPMC model.Theor. Comput. Sci.90510-172022Journal Articlesclosedjournals/tcs/ZhangZ2210.1016/J.TCS.2021.12.011https://doi.org/10.1016/j.tcs.2021.12.011https://dblp.org/rec/journals/tcs/ZhangZ22URL#747468Xin Zhang 0017Huaqiang ZhangBei NiuBi Li 0004Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy.Theor. Comput. Sci.90518-302022Journal Articlesclosedjournals/tcs/ZhangZNL2210.1016/J.TCS.2021.12.012https://doi.org/10.1016/j.tcs.2021.12.012https://dblp.org/rec/journals/tcs/ZhangZNL22URL#747469Zhen Zhang 0025Yipeng ZhouShaoqian YuBetter guarantees for k-median with service installation costs.Theor. Comput. Sci.923292-3032022Journal Articlesclosedjournals/tcs/ZhangZY2210.1016/J.TCS.2022.05.014https://doi.org/10.1016/j.tcs.2022.05.014https://dblp.org/rec/journals/tcs/ZhangZY22URL#747470Qian M. ZhouAlice CalvertMaxwell YoungSingletons for simpletons revisiting windowed backoff with Chernoff bounds.Theor. Comput. Sci.90939-532022Journal Articlesclosedjournals/tcs/ZhouCY2210.1016/J.TCS.2022.01.026https://doi.org/10.1016/j.tcs.2022.01.026https://dblp.org/rec/journals/tcs/ZhouCY22URL#747471Nan ZhouHong Peng 0001Jun Wang 0013Qian YangXiaohui LuoComputational completeness of spiking neural P systems with inhibitory rules for generating string languages.Theor. Comput. Sci.92064-752022Journal Articlesclosedjournals/tcs/ZhouPWYL2210.1016/J.TCS.2022.02.025https://doi.org/10.1016/j.tcs.2022.02.025https://dblp.org/rec/journals/tcs/ZhouPWYL22URL#747472Yangyang ZhouDongyang ZhaoMingyuan MaJin XuTotal coloring of recursive maximal planar graphs.Theor. Comput. Sci.90912-182022Journal Articlesclosedjournals/tcs/ZhouZMX2210.1016/J.TCS.2022.01.024https://doi.org/10.1016/j.tcs.2022.01.024https://dblp.org/rec/journals/tcs/ZhouZMX22URL#747473Junlei ZhuYuehua BuHongguo ZhuWegner's Conjecture on 2-distance coloring for planar graphs.Theor. Comput. Sci.92671-742022Journal Articlesclosedjournals/tcs/ZhuBZ2210.1016/J.TCS.2022.06.017https://doi.org/10.1016/j.tcs.2022.06.017https://dblp.org/rec/journals/tcs/ZhuBZ22URL#747474Sebastian Brandt 0002Manuela FischerJara UittoBreaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory.Theor. Comput. Sci.84922-342021Journal Articlesclosedjournals/tcs/0002FU2110.1016/J.TCS.2020.10.007https://doi.org/10.1016/j.tcs.2020.10.007https://dblp.org/rec/journals/tcs/0002FU21URL#1216391Peng Zhang 0008Zhendong LiuApproximating Max k-Uncut via LP-rounding plus greed, with applications to Densest k-Subgraph.Theor. Comput. Sci.849173-1832021Journal Articlesclosedjournals/tcs/0008L2110.1016/J.TCS.2020.10.018https://doi.org/10.1016/j.tcs.2020.10.018https://dblp.org/rec/journals/tcs/0008L21URL#1216392Aida AbiadBoris BrimkovAlexander GrigorievOn the status sequences of trees.Theor. Comput. Sci.856110-1202021Journal Articlesopenjournals/tcs/AbiadBG2110.1016/J.TCS.2020.12.030https://doi.org/10.1016/j.tcs.2020.12.030https://dblp.org/rec/journals/tcs/AbiadBG21URL#1216393Alexandre Santiago de AbreuLuís Felipe I. CunhaCelina M. H. de FigueiredoLuis Antonio Brasil KowadaFranklin L. MarquezinoRenato PortugalDaniel PosnerA computational complexity comparative study of graph tessellation problems.Theor. Comput. Sci.85881-892021Journal Articlesclosedjournals/tcs/AbreuCFKMPP2110.1016/J.TCS.2020.11.045https://doi.org/10.1016/j.tcs.2020.11.045https://dblp.org/rec/journals/tcs/AbreuCFKMPP21URL#1216394A. Karim Abu-AffashPaz CarmiMatthew J. KatzMinimizing total interference in asymmetric sensor networks.Theor. Comput. Sci.889171-1812021Journal Articlesclosedjournals/tcs/Abu-AffashCK2110.1016/J.TCS.2021.08.003https://doi.org/10.1016/j.tcs.2021.08.003https://dblp.org/rec/journals/tcs/Abu-AffashCK21URL#1216395Ankush AcharyyaAnil MaheshwariSubhas C. NandyColor-spanning localized query.Theor. Comput. Sci.86185-1012021Journal Articlesclosedjournals/tcs/AcharyyaMN2110.1016/J.TCS.2021.02.013https://doi.org/10.1016/j.tcs.2021.02.013https://dblp.org/rec/journals/tcs/AcharyyaMN21URL#1216396Sumit AdakSukanta Das(Imperfect) strategies to generate primitive polynomials over GF(2).Theor. Comput. Sci.87279-962021Journal Articlesclosedjournals/tcs/AdakD2110.1016/J.TCS.2021.03.007https://doi.org/10.1016/j.tcs.2021.03.007https://dblp.org/rec/journals/tcs/AdakD21URL#1216397Kristina AgoBojan BasicStefan HackoDanijela MitrovicOn generalized highly potential words.Theor. Comput. Sci.849184-1962021Journal Articlesclosedjournals/tcs/AgoBHM2110.1016/J.TCS.2020.10.022https://doi.org/10.1016/j.tcs.2020.10.022https://dblp.org/rec/journals/tcs/AgoBHM21URL#1216398Akanksha Agrawal 0001Lawqueen KaneshSaket Saurabh 0001Prafullkumar TalePaths to trees and cacti.Theor. Comput. Sci.86098-1162021Journal Articlesclosedjournals/tcs/AgrawalKST2110.1016/J.TCS.2021.01.033https://doi.org/10.1016/j.tcs.2021.01.033https://dblp.org/rec/journals/tcs/AgrawalKST21URL#1216399Garima AgrawalSoumen MaityThe Small Set Vertex Expansion Problem.Theor. Comput. Sci.88684-932021Journal Articlesclosedjournals/tcs/AgrawalM2110.1016/J.TCS.2021.07.017https://doi.org/10.1016/j.tcs.2021.07.017https://dblp.org/rec/journals/tcs/AgrawalM21URL#1216400Tatsuya AkutsuJesper Jansson 0001Ruiming LiAtsuhiro TakasuTakeyuki TamuraNew and improved algorithms for unordered tree inclusion.Theor. Comput. Sci.88383-982021Journal Articlesclosedjournals/tcs/AkutsuJLTT2110.1016/J.TCS.2021.06.013https://doi.org/10.1016/j.tcs.2021.06.013https://dblp.org/rec/journals/tcs/AkutsuJLTT21URL#1216401Yacine Al-NajjarWalid Ben-AmeurJérémie LeguayOn the approximability of robust network design.Theor. Comput. Sci.86041-502021Journal Articlesclosedjournals/tcs/Al-NajjarBL2110.1016/J.TCS.2021.01.026https://doi.org/10.1016/j.tcs.2021.01.026https://dblp.org/rec/journals/tcs/Al-NajjarBL21URL#1216402Muhammad Jawaherul AlamMichael A. BekosVida DujmovicMartin GronemannMichael Kaufmann 0001Sergey PupyrevOn dispersable book embeddings.Theor. Comput. Sci.8611-222021Journal Articlesclosedjournals/tcs/AlamBDGKP2110.1016/J.TCS.2021.01.035https://doi.org/10.1016/j.tcs.2021.01.035https://dblp.org/rec/journals/tcs/AlamBDGKP21URL#1216403Susanne AlbersLeon LadewigNew results for the k-secretary problem.Theor. Comput. Sci.863102-1192021Journal Articlesopenjournals/tcs/AlbersL2110.1016/J.TCS.2021.02.022https://doi.org/10.1016/j.tcs.2021.02.022https://dblp.org/rec/journals/tcs/AlbersL21URL#1216404Susanne AlbersJens QuedenfeldAlgorithms for energy conservation in heterogeneous data centers.Theor. Comput. Sci.896111-1312021Journal Articlesclosedjournals/tcs/AlbersQ2110.1016/J.TCS.2021.10.009https://doi.org/10.1016/j.tcs.2021.10.009https://dblp.org/rec/journals/tcs/AlbersQ21URL#1216405Laurent AlfandariSophie ToulouseApproximation of the Double Traveling Salesman Problem with Multiple Stacks.Theor. Comput. Sci.87774-892021Journal Articlesclosedjournals/tcs/AlfandariT2110.1016/J.TCS.2021.05.016https://doi.org/10.1016/j.tcs.2021.05.016https://dblp.org/rec/journals/tcs/AlfandariT21URL#1216406Abbas AlhakimEvan SalaJoe SawadaRevisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions.Theor. Comput. Sci.85273-772021Journal Articlesclosedjournals/tcs/AlhakimSS2110.1016/J.TCS.2020.11.018https://doi.org/10.1016/j.tcs.2020.11.018https://dblp.org/rec/journals/tcs/AlhakimSS21URL#1216407Emilie AllartJoachim NiehrenCristian VersariComputing difference abstractions of linear equation systems.Theor. Comput. Sci.89372-1042021Journal Articlesclosedjournals/tcs/AllartNV2110.1016/J.TCS.2021.06.030https://doi.org/10.1016/j.tcs.2021.06.030https://dblp.org/rec/journals/tcs/AllartNV21URL#1216408Bar AlonAnat Paskin-CherniavskyOn perfectly secure 2PC in the OT-hybrid model.Theor. Comput. Sci.891166-1882021Journal Articlesclosedjournals/tcs/AlonP2110.1016/J.TCS.2021.08.035https://doi.org/10.1016/j.tcs.2021.08.035https://dblp.org/rec/journals/tcs/AlonP21URL#1216409Mateus Rodrigues AlvesMateus de Oliveira OliveiraJanio Carlos Nascimento SilvaUéverton dos Santos SouzaSuccinct certification of monotone circuits.Theor. Comput. Sci.8891-132021Journal Articlesclosedjournals/tcs/AlvesOSS2110.1016/J.TCS.2021.07.032https://doi.org/10.1016/j.tcs.2021.07.032https://dblp.org/rec/journals/tcs/AlvesOSS21URL#1216410Georgios AmanatidisGeorgios BirmpasAris Filos-RatsikasAlexandros HollenderAlexandros A. VoudourisMaximum Nash welfare and other stories about EFX.Theor. Comput. Sci.86369-852021Journal Articlesclosedjournals/tcs/AmanatidisBFHV2110.1016/J.TCS.2021.02.020https://doi.org/10.1016/j.tcs.2021.02.020https://dblp.org/rec/journals/tcs/AmanatidisBFHV21URL#1216411Georgios AmanatidisPeter FullaEvangelos MarkakisKrzysztof SornatInequity aversion pricing over social networks: Approximation algorithms and hardness results.Theor. Comput. Sci.87162-782021Journal Articlesclosedjournals/tcs/AmanatidisFMS2110.1016/J.TCS.2021.04.012https://doi.org/10.1016/j.tcs.2021.04.012https://dblp.org/rec/journals/tcs/AmanatidisFMS21URL#1216412Amihood AmirEitan KondratovskyTowards a real time algorithm for parameterized longest common prefix computation.Theor. Comput. Sci.852132-1372021Journal Articlesclosedjournals/tcs/AmirK2110.1016/J.TCS.2020.11.023https://doi.org/10.1016/j.tcs.2020.11.023https://dblp.org/rec/journals/tcs/AmirK21URL#1216413Aditya Anand 0001Palash DeyDistance restricted manipulation in voting.Theor. Comput. Sci.891149-1652021Journal Articlesclosedjournals/tcs/AnandD2110.1016/J.TCS.2021.08.034https://doi.org/10.1016/j.tcs.2021.08.034https://dblp.org/rec/journals/tcs/AnandD21URL#1216414Angela AngeleskaSara OmranianZoran NikoloskiCoherent network partitions: Characterizations with cographs and prime graphs.Theor. Comput. Sci.8943-112021Journal Articlesclosedjournals/tcs/AngeleskaON2110.1016/J.TCS.2021.10.002https://doi.org/10.1016/j.tcs.2021.10.002https://dblp.org/rec/journals/tcs/AngeleskaON21URL#1216415Spyros Angelopoulos 0001Nancy E. ClarkeFedor V. FominArchontia C. GiannopoulouRoman Rabinovich 0001Preface to the special issue on Graph Searching: Theory and Applications.Theor. Comput. Sci.858145-1462021Journal Articlesclosedjournals/tcs/AngelopoulosCFG2110.1016/J.TCS.2021.01.036https://doi.org/10.1016/j.tcs.2021.01.036https://dblp.org/rec/journals/tcs/AngelopoulosCFG21URL#1216416Júlio Araújo 0001Alexandre A. CezarCarlos V. G. C. LimaVinícius Fernandes dos SantosAna Silva 0001On the proper orientation number of chordal graphs.Theor. Comput. Sci.888117-1322021Journal Articlesclosedjournals/tcs/AraujoCLSS2110.1016/J.TCS.2021.07.031https://doi.org/10.1016/j.tcs.2021.07.031https://dblp.org/rec/journals/tcs/AraujoCLSS21URL#1216417Francesco ArenaMiriam Di IanniComplexity of Scorpion Solitaire and applications to Klondike.Theor. Comput. Sci.890105-1242021Journal Articlesclosedjournals/tcs/ArenaI2110.1016/J.TCS.2021.08.019https://doi.org/10.1016/j.tcs.2021.08.019https://dblp.org/rec/journals/tcs/ArenaI21URL#1216418Yuichi AsahiroHiroshi EtoTesshu HanakaGuohui LinEiji MiyanoIppei TerabaruComplexity and approximability of the happy set problem.Theor. Comput. Sci.866123-1442021Journal Articlesclosedjournals/tcs/AsahiroEHLMT2110.1016/J.TCS.2021.03.023https://doi.org/10.1016/j.tcs.2021.03.023https://dblp.org/rec/journals/tcs/AsahiroEHLMT21URL#1216419George AssafMonika HeinerFei Liu 0006Colouring fuzziness for systems biology.Theor. Comput. Sci.87552-642021Journal Articlesclosedjournals/tcs/AssafHL2110.1016/J.TCS.2021.04.011https://doi.org/10.1016/j.tcs.2021.04.011https://dblp.org/rec/journals/tcs/AssafHL21URL#1216420Giuseppe AtenieseDanilo FrancatiBernardo MagriDaniele Venturi 0001Immunization against complete subversion without random oracles.Theor. Comput. Sci.8591-362021Journal Articlesclosedjournals/tcs/AtenieseFMV2110.1016/J.TCS.2021.01.002https://doi.org/10.1016/j.tcs.2021.01.002https://dblp.org/rec/journals/tcs/AtenieseFMV21URL#1216421Hagit AttiyaSebastian BurckhardtAlexey GotsmanAdam Morrison 0001Hongseok YangMarek ZawirskiSpecification and space complexity of collaborative text editing.Theor. Comput. Sci.855141-1602021Journal Articlesclosedjournals/tcs/AttiyaBGMYZ2110.1016/J.TCS.2020.11.046https://doi.org/10.1016/j.tcs.2020.11.046https://dblp.org/rec/journals/tcs/AttiyaBGMYZ21URL#1216422Nathalie AubrunJarkko KariOn the domino problem of the Baumslag-Solitar groups.Theor. Comput. Sci.89412-222021Journal Articlesclosedjournals/tcs/AubrunK2110.1016/J.TCS.2021.09.002https://doi.org/10.1016/j.tcs.2021.09.002https://dblp.org/rec/journals/tcs/AubrunK21URL#1216423Vincenzo AulettaDiodato FerraioliGianluigi GrecoOptimal majority dynamics for the diffusion of an opinion when multiple alternatives are available.Theor. Comput. Sci.869156-1802021Journal Articlesclosedjournals/tcs/AulettaFG2110.1016/J.TCS.2021.03.017https://doi.org/10.1016/j.tcs.2021.03.017https://dblp.org/rec/journals/tcs/AulettaFG21URL#1216424Vincenzo AulettaDiodato FerraioliAshutosh Rai 0002Giannicola ScarpaAndreas J. Winter 0002Belief-invariant and quantum equilibria in games of incomplete information.Theor. Comput. Sci.895151-1772021Journal Articlesclosedjournals/tcs/AulettaFRSW2110.1016/J.TCS.2021.09.041https://doi.org/10.1016/j.tcs.2021.09.041https://dblp.org/rec/journals/tcs/AulettaFRSW21URL#1216425Alex AuvolatDavide FreyMichel RaynalFrançois TaïaniByzantine-tolerant causal broadcast.Theor. Comput. Sci.88555-682021Journal Articlesclosedjournals/tcs/AuvolatFRT2110.1016/J.TCS.2021.06.021https://doi.org/10.1016/j.tcs.2021.06.021https://dblp.org/rec/journals/tcs/AuvolatFRT21URL#1216426Nadia BabouDjamal RebaineMourad BoudharTwo-machine open shop problem with a single server and set-up time considerations.Theor. Comput. Sci.86713-292021Journal Articlesclosedjournals/tcs/BabouRB2110.1016/J.TCS.2021.03.009https://doi.org/10.1016/j.tcs.2021.03.009https://dblp.org/rec/journals/tcs/BabouRB21URL#1216427Jasine BabuVeena PrabhakaranArko SharmaA substructure based lower bound for eternal vertex cover number.Theor. Comput. Sci.89087-1042021Journal Articlesclosedjournals/tcs/BabuPS2110.1016/J.TCS.2021.08.018https://doi.org/10.1016/j.tcs.2021.08.018https://dblp.org/rec/journals/tcs/BabuPS21URL#1216428Golnaz BadkobehPawel GawrychowskiJuha KärkkäinenSimon J. PuglisiBella ZhukovaTight upper and lower bounds on suffix tree breadth.Theor. Comput. Sci.85463-672021Journal Articlesclosedjournals/tcs/BadkobehGKPZ2110.1016/J.TCS.2020.11.037https://doi.org/10.1016/j.tcs.2020.11.037https://dblp.org/rec/journals/tcs/BadkobehGKPZ21URL#1216429Sayan BandyapadhyayAritra BanikSujoy BhoreMartin NöllenburgGeometric planar networks on bichromatic collinear points.Theor. Comput. Sci.895124-1362021Journal Articlesclosedjournals/tcs/BandyapadhyayBB2110.1016/J.TCS.2021.09.035https://doi.org/10.1016/j.tcs.2021.09.035https://dblp.org/rec/journals/tcs/BandyapadhyayBB21URL#1216430Aritra BanikArun Kumar Das 0001Sandip Das 0001Anil MaheshwariSwami SarvattomanandaVoronoi game on polygons.Theor. Comput. Sci.882125-1422021Journal Articlesclosedjournals/tcs/BanikDDMS2110.1016/J.TCS.2021.06.023https://doi.org/10.1016/j.tcs.2021.06.023https://dblp.org/rec/journals/tcs/BanikDDMS21URL#1216431Devsi BantvaDaphne Der-Fen LiuOptimal radio labellings of block graphs and line graphs of trees.Theor. Comput. Sci.89190-1042021Journal Articlesclosedjournals/tcs/BantvaL2110.1016/J.TCS.2021.08.029https://doi.org/10.1016/j.tcs.2021.08.029https://dblp.org/rec/journals/tcs/BantvaL21URL#1216432Tingting BaoQian YangHong Peng 0001Xiaohui LuoJun Wang 0013Xiaoxiao SongComputational power of sequential dendrite P systems.Theor. Comput. Sci.893133-1452021Journal Articlesclosedjournals/tcs/BaoYPLWS2110.1016/J.TCS.2021.08.008https://doi.org/10.1016/j.tcs.2021.08.008https://dblp.org/rec/journals/tcs/BaoYPLWS21URL#1216433Amotz Bar-NoyThomas ErlebachDror RawitzPeter Terlecky"Green" barrier coverage with mobile sensors.Theor. Comput. Sci.860117-1342021Journal Articlesclosedjournals/tcs/Bar-NoyERT2110.1016/J.TCS.2021.01.034https://doi.org/10.1016/j.tcs.2021.01.034https://dblp.org/rec/journals/tcs/Bar-NoyERT21URL#1216434Aseem R. BaranwalLuke SchaefferJeffrey O. ShallitOstrowski-automatic sequences: Theory and applications.Theor. Comput. Sci.858122-1422021Journal Articlesclosedjournals/tcs/BaranwalSS2110.1016/J.TCS.2021.01.018https://doi.org/10.1016/j.tcs.2021.01.018https://dblp.org/rec/journals/tcs/BaranwalSS21URL#1216435Jérémy BarbayPablo Pérez-LanteroJaviel Rojas-LedesmaComputing the depth distribution of a set of boxes.Theor. Comput. Sci.88369-822021Journal Articlesclosedjournals/tcs/BarbayPR2110.1016/J.TCS.2021.06.007https://doi.org/10.1016/j.tcs.2021.06.007https://dblp.org/rec/journals/tcs/BarbayPR21URL#1216436Roberto BarbutiRoberta GoriPaolo MilazzoEncoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation.Theor. Comput. Sci.8813-242021Journal Articlesclosedjournals/tcs/BarbutiGM2110.1016/J.TCS.2020.07.031https://doi.org/10.1016/j.tcs.2020.07.031https://dblp.org/rec/journals/tcs/BarbutiGM21URL#1216437Elena BarcucciAntonio BerniniRenzo PinzaniExhaustive generation of some lattice paths and their prefixes.Theor. Comput. Sci.878-87947-522021Journal Articlesclosedjournals/tcs/BarcucciBP2110.1016/J.TCS.2020.12.013https://doi.org/10.1016/j.tcs.2020.12.013https://dblp.org/rec/journals/tcs/BarcucciBP21URL#1216438Dominique BarthThierry MautorArnaud De MoissacDimitri WatelMarc-Antoine WeisserOptimisation of electrical network configuration: Complexity and algorithms for ring topologies.Theor. Comput. Sci.859162-1732021Journal Articlesclosedjournals/tcs/BarthMMWW2110.1016/J.TCS.2021.01.023https://doi.org/10.1016/j.tcs.2021.01.023https://dblp.org/rec/journals/tcs/BarthMMWW21URL#1216439Andreas BärtschiEvangelos BampasJérémie ChalopinShantanu Das 0001Christina KarousatouMatús MihalákNear-gathering of energy-constrained mobile agents.Theor. Comput. Sci.84935-462021Journal Articlesclosedjournals/tcs/BartschiBC0KM2110.1016/J.TCS.2020.10.008https://doi.org/10.1016/j.tcs.2020.10.008https://dblp.org/rec/journals/tcs/BartschiBC0KM21URL#1216440Ran Ben BasatSeungbum JoSrinivasa Rao SattiShubham UgareApproximate query processing over static sets and sliding windows.Theor. Comput. Sci.8851-142021Journal Articlesclosedjournals/tcs/BasatJSU2110.1016/J.TCS.2021.06.015https://doi.org/10.1016/j.tcs.2021.06.015https://dblp.org/rec/journals/tcs/BasatJSU21URL#1216441Edy Tri BaskoroDevi Imulia Dian PrimaskunImproved algorithm for the locating-chromatic number of trees.Theor. Comput. Sci.856165-1682021Journal Articlesclosedjournals/tcs/BaskoroP2110.1016/J.TCS.2020.12.037https://doi.org/10.1016/j.tcs.2020.12.037https://dblp.org/rec/journals/tcs/BaskoroP21URL#1216442Alamgir Rahaman BasuniaSatyabrata Das 0002Laxman SahaKalishankar TiwaryAntipodal number of full m-ary trees.Theor. Comput. Sci.885131-1452021Journal Articlesclosedjournals/tcs/BasuniaDST2110.1016/J.TCS.2021.06.034https://doi.org/10.1016/j.tcs.2021.06.034https://dblp.org/rec/journals/tcs/BasuniaDST21URL#1216443Cristina BazganPierre CazalsJanka ChlebíkováDegree-anonymization using edge rotations.Theor. Comput. Sci.8731-152021Journal Articlesclosedjournals/tcs/BazganCC2110.1016/J.TCS.2021.04.020https://doi.org/10.1016/j.tcs.2021.04.020https://dblp.org/rec/journals/tcs/BazganCC21URL#1216444Nicolas BehrJean KrivineJakob L. AndersenDaniel MerkleRewriting theory for the life sciences: A unifying theory of CTMC semantics.Theor. Comput. Sci.88468-1152021Journal Articlesclosedjournals/tcs/BehrKAM2110.1016/J.TCS.2021.07.026https://doi.org/10.1016/j.tcs.2021.07.026https://dblp.org/rec/journals/tcs/BehrKAM21URL#1216445Julien BensmailFoivos FioravantesFionn Mc InerneyOn the role of 3s for the 1-2-3 Conjecture.Theor. Comput. Sci.892238-2572021Journal Articlesclosedjournals/tcs/BensmailFI2110.1016/J.TCS.2021.09.023https://doi.org/10.1016/j.tcs.2021.09.023https://dblp.org/rec/journals/tcs/BensmailFI21URL#1216446Mahmoud BentriouPaolo BallariniPaul-Henry CournèdeAutomaton-ABC: A statistical method to estimate the probability of spatio-temporal properties for parametric Markov population models.Theor. Comput. Sci.893191-2192021Journal Articlesclosedjournals/tcs/BentriouBC2110.1016/J.TCS.2021.09.039https://doi.org/10.1016/j.tcs.2021.09.039https://dblp.org/rec/journals/tcs/BentriouBC21URL#1216447Ioana O. BerceaGuy EvenUpper tail analysis of bucket sort and random tries.Theor. Comput. Sci.89555-672021Journal Articlesclosedjournals/tcs/BerceaE2110.1016/J.TCS.2021.09.029https://doi.org/10.1016/j.tcs.2021.09.029https://dblp.org/rec/journals/tcs/BerceaE21URL#1216448Kristóf BércziEndre BorosOndrej CepekKhaled M. ElbassioniPetr KuceraKazuhisa MakinoGenerating clause sequences of a CNF formula.Theor. Comput. Sci.85668-742021Journal Articlesopenjournals/tcs/BercziBCEKM2110.1016/J.TCS.2020.12.021https://doi.org/10.1016/j.tcs.2020.12.021https://dblp.org/rec/journals/tcs/BercziBCEKM21URL#1216449Martin BerglundWillem BesterBrink van der MerweFormalising and implementing Boost POSIX regular expression matching.Theor. Comput. Sci.857147-1652021Journal Articlesclosedjournals/tcs/BerglundBM2110.1016/J.TCS.2021.01.010https://doi.org/10.1016/j.tcs.2021.01.010https://dblp.org/rec/journals/tcs/BerglundBM21URL#1216450Tejas BhojrajPrefix-free quantum Kolmogorov complexity.Theor. Comput. Sci.87565-802021Journal Articlesclosedjournals/tcs/Bhojraj2110.1016/J.TCS.2021.05.017https://doi.org/10.1016/j.tcs.2021.05.017https://dblp.org/rec/journals/tcs/Bhojraj21URL#1216451Huimin BiXin Zhang 0017Incidence coloring of Mycielskians with fast algorithm.Theor. Comput. Sci.878-8791-102021Journal Articlesclosedjournals/tcs/BiZ2110.1016/J.TCS.2021.05.026https://doi.org/10.1016/j.tcs.2021.05.026https://dblp.org/rec/journals/tcs/BiZ21URL#1216452Tristan BiceDistance domains: Continuity.Theor. Comput. Sci.86985-1072021Journal Articlesclosedjournals/tcs/Bice2110.1016/J.TCS.2021.01.038https://doi.org/10.1016/j.tcs.2021.01.038https://dblp.org/rec/journals/tcs/Bice21URL#1216453Marcin BienkowskiMartin Böhm 0001Jaroslaw ByrkaMarek ChrobakChristoph DürrLukás FolwarcznýLukasz JezJirí SgallKim Thang NguyenPavel Veselý 0001New results on multi-level aggregation.Theor. Comput. Sci.861133-1432021Journal Articlesclosedjournals/tcs/BienkowskiBBCDF2110.1016/J.TCS.2021.02.016https://doi.org/10.1016/j.tcs.2021.02.016https://dblp.org/rec/journals/tcs/BienkowskiBBCDF21URL#1216454Florin-Daniel BîlbîeAndrei PaunSmall SNQ P Systems with multiple types of spikes.Theor. Comput. Sci.86214-232021Journal Articlesclosedjournals/tcs/BilbieP2110.1016/J.TCS.2020.10.014https://doi.org/10.1016/j.tcs.2020.10.014https://dblp.org/rec/journals/tcs/BilbieP21URL#1216455Alexander BirxYann DisserAlexander V. HoppChristina KarousatouAn improved lower bound for competitive graph exploration.Theor. Comput. Sci.86865-862021Journal Articlesclosedjournals/tcs/BirxDHK2110.1016/J.TCS.2021.04.003https://doi.org/10.1016/j.tcs.2021.04.003https://dblp.org/rec/journals/tcs/BirxDHK21URL#1216456Johanna BjörklundShay B. CohenFrank DrewesGiorgio SattaBottom-up unranked tree-to-graph transducers for translation into semantic graphs.Theor. Comput. Sci.8703-282021Journal Articlesclosedjournals/tcs/BjorklundCDS2110.1016/J.TCS.2020.12.012https://doi.org/10.1016/j.tcs.2020.12.012https://dblp.org/rec/journals/tcs/BjorklundCDS21URL#1216457Jean R. S. BlairChristophe CrespelleOn the effectiveness of the incremental approach to minimal chordal edge modification.Theor. Comput. Sci.8881-122021Journal Articlesclosedjournals/tcs/BlairC2110.1016/J.TCS.2021.07.013https://doi.org/10.1016/j.tcs.2021.07.013https://dblp.org/rec/journals/tcs/BlairC21URL#1216458Olivier BlazyLaura BrouilhetCéline ChevalierPatrick TowaIda TuckerDamien VergnaudHardware security without secure hardware: How to decrypt with a password and a server.Theor. Comput. Sci.895178-2112021Journal Articlesclosedjournals/tcs/BlazyBCTTV2110.1016/J.TCS.2021.09.042https://doi.org/10.1016/j.tcs.2021.09.042https://dblp.org/rec/journals/tcs/BlazyBCTTV21URL#1216459Till BlumeDavid RicherbyAnsgar ScherpFLUID: A common model for semantic structural graph summaries based on equivalence relations.Theor. Comput. Sci.854136-1582021Journal Articlesclosedjournals/tcs/BlumeRS2110.1016/J.TCS.2020.12.019https://doi.org/10.1016/j.tcs.2020.12.019https://dblp.org/rec/journals/tcs/BlumeRS21URL#1216460Hans-Joachim BöckenhauerJuraj HromkovicSacha KrugWalter UngerOn the advice complexity of the online dominating set problem.Theor. Comput. Sci.86281-962021Journal Articlesopenjournals/tcs/BockenhauerHKU2110.1016/J.TCS.2021.01.022https://doi.org/10.1016/j.tcs.2021.01.022https://dblp.org/rec/journals/tcs/BockenhauerHKU21URL#1216461Hans L. BodlaenderNick BrettellMatthew Johnson 0002Giacomo PaesaniDaniël PaulusmaErik Jan van LeeuwenSteiner trees for hereditary graph classes: A treewidth perspective.Theor. Comput. Sci.86730-392021Journal Articlesclosedjournals/tcs/BodlaenderBJPPL2110.1016/J.TCS.2021.03.012https://doi.org/10.1016/j.tcs.2021.03.012https://dblp.org/rec/journals/tcs/BodlaenderBJPPL21URL#1216462Anthony BonatoMelissa A. HugganTrent G. MarbachFionn Mc InerneyThe game of Cops and Eternal Robbers.Theor. Comput. Sci.87480-932021Journal Articlesclosedjournals/tcs/BonatoHMI2110.1016/J.TCS.2021.05.014https://doi.org/10.1016/j.tcs.2021.05.014https://dblp.org/rec/journals/tcs/BonatoHMI21URL#1216463Paola BonizzoniClelia De FeliceRocco ZaccagninoRosalba ZizzaOn the longest common prefix of suffixes in an inverse Lyndon factorization and other properties.Theor. Comput. Sci.86224-412021Journal Articlesclosedjournals/tcs/BonizzoniFZZ2110.1016/J.TCS.2020.10.034https://doi.org/10.1016/j.tcs.2020.10.034https://dblp.org/rec/journals/tcs/BonizzoniFZZ21URL#1216464Paola BonizzoniLila KariIon PetreGrzegorz RozenbergBuilding bridges - Honoring Nataša Jonoska on the occasion of her 60th birthday.Theor. Comput. Sci.8941-22021Journal Articlesclosedjournals/tcs/BonizzoniKPR2110.1016/J.TCS.2021.10.021https://doi.org/10.1016/j.tcs.2021.10.021https://dblp.org/rec/journals/tcs/BonizzoniKPR21URL#1216465Paola BonizzoniGianluca Della VedovaYuri PirolaMarco PrevitaliRaffaella RizziComputing the multi-string BWT and LCP array in external memory.Theor. Comput. Sci.86242-582021Journal Articlesclosedjournals/tcs/BonizzoniVPPR2110.1016/J.TCS.2020.11.041https://doi.org/10.1016/j.tcs.2020.11.041https://dblp.org/rec/journals/tcs/BonizzoniVPPR21URL#1216466Vincenzo BonniciGiuditta FrancoVincenzo MancaSpectral concepts in genome informational analysis.Theor. Comput. Sci.89423-302021Journal Articlesclosedjournals/tcs/BonniciFM2110.1016/J.TCS.2021.06.039https://doi.org/10.1016/j.tcs.2021.06.039https://dblp.org/rec/journals/tcs/BonniciFM21URL#1216467Flavia Bonomo-BrabermanMaria ChudnovskyJan GoedgebeurPeter MaceliOliver SchaudtMaya SteinMingxian ZhongBetter 3-coloring algorithms: Excluding a triangle and a seven vertex path.Theor. Comput. Sci.85098-1152021Journal Articlesclosedjournals/tcs/Bonomo-Braberman2110.1016/J.TCS.2020.10.032https://doi.org/10.1016/j.tcs.2020.10.032https://dblp.org/rec/journals/tcs/Bonomo-Braberman21URL#1216468Kaustav BoseManash Kumar KunduRanendu AdhikaryBuddhadeb SauArbitrary pattern formation by asynchronous opaque robots with lights.Theor. Comput. Sci.849138-1582021Journal Articlesclosedjournals/tcs/BoseKAS2110.1016/J.TCS.2020.10.015https://doi.org/10.1016/j.tcs.2020.10.015https://dblp.org/rec/journals/tcs/BoseKAS21URL#1216469Prosenjit BoseMatias KormanAndré van RenssenSander VerdonschotConstrained routing between non-visible vertices.Theor. Comput. Sci.861144-1542021Journal Articlesclosedjournals/tcs/BoseKRV2110.1016/J.TCS.2021.02.017https://doi.org/10.1016/j.tcs.2021.02.017https://dblp.org/rec/journals/tcs/BoseKRV21URL#1216470Paolo BottoniAnna LabellaA compositional view of derivations as interactive processes with applications to regulated and distributed rewriting.Theor. Comput. Sci.86259-802021Journal Articlesclosedjournals/tcs/BottoniL2110.1016/J.TCS.2020.10.035https://doi.org/10.1016/j.tcs.2020.10.035https://dblp.org/rec/journals/tcs/BottoniL21URL#1216471Paolo BottoniAnna LabellaTransactions and contracts based on reaction systems.Theor. Comput. Sci.88125-612021Journal Articlesclosedjournals/tcs/BottoniL21a10.1016/J.TCS.2021.07.012https://doi.org/10.1016/j.tcs.2021.07.012https://dblp.org/rec/journals/tcs/BottoniL21aURL#1216472Franz J. BrandenburgFan-crossing free graphs and their relationship to other beyond-planar graphs.Theor. Comput. Sci.86785-1002021Journal Articlesclosedjournals/tcs/Brandenburg2110.1016/J.TCS.2021.03.031https://doi.org/10.1016/j.tcs.2021.03.031https://dblp.org/rec/journals/tcs/Brandenburg21URL#1216473Andreas BrandstädtRaffaele MoscaMaximum weight independent sets for (S1, 2, 4, triangle)-free graphs in polynomial time.Theor. Comput. Sci.878-87911-252021Journal Articlesclosedjournals/tcs/BrandstadtM2110.1016/J.TCS.2021.05.027https://doi.org/10.1016/j.tcs.2021.05.027https://dblp.org/rec/journals/tcs/BrandstadtM21URL#1216474Linda BrodoRoberto BruniMoreno FalaschiA logical and graphical framework for reaction systems.Theor. Comput. Sci.8751-272021Journal Articlesclosedjournals/tcs/BrodoBF2110.1016/J.TCS.2021.03.024https://doi.org/10.1016/j.tcs.2021.03.024https://dblp.org/rec/journals/tcs/BrodoBF21URL#1216475Linda BrodoRoberto BruniMoreno FalaschiA process algebraic approach to reaction systems.Theor. Comput. Sci.88162-822021Journal Articlesclosedjournals/tcs/BrodoBF21a10.1016/J.TCS.2020.09.001https://doi.org/10.1016/j.tcs.2020.09.001https://dblp.org/rec/journals/tcs/BrodoBF21aURL#1216476Nader H. BshoutyCatherine A. Haddad-ZaknoonOptimal deterministic group testing algorithms to estimate the number of defectives.Theor. Comput. Sci.87446-582021Journal Articlesclosedjournals/tcs/BshoutyH2110.1016/J.TCS.2021.05.011https://doi.org/10.1016/j.tcs.2021.05.011https://dblp.org/rec/journals/tcs/BshoutyH21URL#1216477Yuehua BuChentao QiJunlei ZhuTing XuInjective coloring of planar graphs.Theor. Comput. Sci.857114-1222021Journal Articlesclosedjournals/tcs/BuQZX2110.1016/J.TCS.2021.01.007https://doi.org/10.1016/j.tcs.2021.01.007https://dblp.org/rec/journals/tcs/BuQZX21URL#1216478Vedran CacicMarko HorvatZvonko IljazovicComputable subcontinua of semicomputable chainable Hausdorff continua.Theor. Comput. Sci.892155-1692021Journal Articlesclosedjournals/tcs/CacicHI2110.1016/J.TCS.2021.09.018https://doi.org/10.1016/j.tcs.2021.09.018https://dblp.org/rec/journals/tcs/CacicHI21URL#1216479Jin-Yi CaiArtem GovorovThe complexity of counting edge colorings for simple graphs.Theor. Comput. Sci.88914-242021Journal Articlesclosedjournals/tcs/CaiG2110.1016/J.TCS.2021.07.033https://doi.org/10.1016/j.tcs.2021.07.033https://dblp.org/rec/journals/tcs/CaiG21URL#1216480Luca CalderoniLuciano MargaraMoreno MarzollaDirect product primality testing of graphs is GI-hard.Theor. Comput. Sci.86072-832021Journal Articlesclosedjournals/tcs/CalderoniMM2110.1016/J.TCS.2021.01.029https://doi.org/10.1016/j.tcs.2021.01.029https://dblp.org/rec/journals/tcs/CalderoniMM21URL#1216481Cristian S. CaludeKaren Frilya CelineZiyuan GaoSanjay Jain 0001Ludwig StaigerFrank Stephan 0001Bi-immunity over different size alphabets.Theor. Comput. Sci.89431-492021Journal Articlesclosedjournals/tcs/CaludeCGJSS2110.1016/J.TCS.2021.09.005https://doi.org/10.1016/j.tcs.2021.09.005https://dblp.org/rec/journals/tcs/CaludeCGJSS21URL#1216482Kathie CameronJan GoedgebeurShenwei HuangYongtang Shik-Critical graphs in P5-free graphs.Theor. Comput. Sci.86480-912021Journal Articlesclosedjournals/tcs/CameronGHS2110.1016/J.TCS.2021.02.029https://doi.org/10.1016/j.tcs.2021.02.029https://dblp.org/rec/journals/tcs/CameronGHS21URL#1216483Graham Campbell 0001Detlef PlumpConfluence up to garbage in graph transformation.Theor. Comput. Sci.8841-222021Journal Articlesclosedjournals/tcs/CampbellP2110.1016/J.TCS.2021.06.010https://doi.org/10.1016/j.tcs.2021.06.010https://dblp.org/rec/journals/tcs/CampbellP21URL#1216484Sarah CannonErik D. DemaineMartin L. DemaineSarah EisenstatDavid FurcyMatthew J. PatitzRobert T. SchwellerScott M. SummersAndrew WinslowOn the effects of hierarchical self-assembly for reducing program-size complexity.Theor. Comput. Sci.89450-782021Journal Articlesclosedjournals/tcs/CannonDDEFPSSW2110.1016/J.TCS.2021.09.011https://doi.org/10.1016/j.tcs.2021.09.011https://dblp.org/rec/journals/tcs/CannonDDEFPSSW21URL#1216485Shujiao CaoRui Xue 0001Being a permutation is also orthogonal to one-wayness in quantum world: Impossibilities of quantum one-way permutations from one-wayness primitives.Theor. Comput. Sci.85516-422021Journal Articlesclosedjournals/tcs/CaoX2110.1016/J.TCS.2020.11.013https://doi.org/10.1016/j.tcs.2020.11.013https://dblp.org/rec/journals/tcs/CaoX21URL#1216486Arturo CarpiFlavio D'AlessandroOn bounded linear codes and the commutative equivalence.Theor. Comput. Sci.852185-1962021Journal Articlesclosedjournals/tcs/CarpiD2110.1016/J.TCS.2020.11.031https://doi.org/10.1016/j.tcs.2020.11.031https://dblp.org/rec/journals/tcs/CarpiD21URL#1216487Arturo CarpiFlavio D'AlessandroOscar H. IbarraIan McQuillanRelationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity.Theor. Comput. Sci.86297-1182021Journal Articlesclosedjournals/tcs/CarpiDIM2110.1016/J.TCS.2020.10.006https://doi.org/10.1016/j.tcs.2020.10.006https://dblp.org/rec/journals/tcs/CarpiDIM21URL#1216488Armando CastañedaPierre FraigniaudAmi PazSergio RajsbaumMatthieu RoyCorentin TraversA topological perspective on distributed network algorithms.Theor. Comput. Sci.849121-1372021Journal Articlesopenjournals/tcs/CastanedaFPRRT2110.1016/J.TCS.2020.10.012https://doi.org/10.1016/j.tcs.2020.10.012https://dblp.org/rec/journals/tcs/CastanedaFPRRT21URL#1216489Giuseppa CastiglioneGabriele FiciAntonio RestivoPrimitive sets of words.Theor. Comput. Sci.86625-362021Journal Articlesclosedjournals/tcs/CastiglioneFR2110.1016/J.TCS.2021.03.003https://doi.org/10.1016/j.tcs.2021.03.003https://dblp.org/rec/journals/tcs/CastiglioneFR21URL#1216490Jérémie ChalopinShantanu Das 0001Yann DisserArnaud LabourelMatús MihalákCollaborative delivery on a fixed path with homogeneous energy-constrained agents.Theor. Comput. Sci.86887-962021Journal Articlesclosedjournals/tcs/ChalopinDDLM2110.1016/J.TCS.2021.04.004https://doi.org/10.1016/j.tcs.2021.04.004https://dblp.org/rec/journals/tcs/ChalopinDDLM21URL#1216491Yu-Huei ChangKung-Jui PaiChiun-Chieh HsuJinn-Shyong YangJou-Ming ChangConstructing dual-CISTs of folded divide-and-swap cubes.Theor. Comput. Sci.85675-872021Journal Articlesclosedjournals/tcs/ChangPHYC2110.1016/J.TCS.2020.12.023https://doi.org/10.1016/j.tcs.2020.12.023https://dblp.org/rec/journals/tcs/ChangPHYC21URL#1216492Steven ChaplickMagnús M. HalldórssonMurilo S. de LimaTigran TonoyanQuery minimization under stochastic uncertainty.Theor. Comput. Sci.89575-952021Journal Articlesclosedjournals/tcs/ChaplickHLT2110.1016/J.TCS.2021.09.032https://doi.org/10.1016/j.tcs.2021.09.032https://dblp.org/rec/journals/tcs/ChaplickHLT21URL#1216493Bapi ChatterjeeIvan WalulyaPhilippas TsigasConcurrent linearizable nearest neighbour search in LockFree-kD-tree.Theor. Comput. Sci.88627-482021Journal Articlesclosedjournals/tcs/ChatterjeeWT2110.1016/J.TCS.2021.06.041https://doi.org/10.1016/j.tcs.2021.06.041https://dblp.org/rec/journals/tcs/ChatterjeeWT21URL#1216494Vincent ChauChi Kit Ken FongShengxin LiuElaine Yinling WangYong Zhang 0001Minimizing energy on homogeneous processors with shared memory.Theor. Comput. Sci.866160-1702021Journal Articlesclosedjournals/tcs/ChauFLWZ2110.1016/J.TCS.2021.03.030https://doi.org/10.1016/j.tcs.2021.03.030https://dblp.org/rec/journals/tcs/ChauFLWZ21URL#1216495Juhi ChaudharyBhawani Sankar PandaOn the complexity of minimum maximal uniquely restricted matching.Theor. Comput. Sci.88215-282021Journal Articlesclosedjournals/tcs/ChaudharyP2110.1016/J.TCS.2021.05.036https://doi.org/10.1016/j.tcs.2021.05.036https://dblp.org/rec/journals/tcs/ChaudharyP21URL#1216496Hua ChenLin Chen 0009Guochuan ZhangVincent ChauScheduling with variable-length calibrations: Two agreeable variants.Theor. Comput. Sci.88694-1052021Journal Articlesclosedjournals/tcs/ChenCZC2110.1016/J.TCS.2021.07.021https://doi.org/10.1016/j.tcs.2021.07.021https://dblp.org/rec/journals/tcs/ChenCZC21URL#1216497Zheng ChenZhaoquan GuYuexuan WangWhich is the fairest allocation in the max-min fairness-based coalitional game?Theor. Comput. Sci.88856-692021Journal Articlesclosedjournals/tcs/ChenGW2110.1016/J.TCS.2021.07.020https://doi.org/10.1016/j.tcs.2021.07.020https://dblp.org/rec/journals/tcs/ChenGW21URL#1216498Huiping ChenGrigorios LoukidesSolon P. PissisHau ChanInfluence maximization in the presence of vulnerable nodes: A ratio perspective.Theor. Comput. Sci.85284-1032021Journal Articlesclosedjournals/tcs/ChenLPC2110.1016/J.TCS.2020.11.020https://doi.org/10.1016/j.tcs.2020.11.020https://dblp.org/rec/journals/tcs/ChenLPC21URL#1216499Lin Chen 0009Ahmed Imtiaz SunnyLei Xu 0012Shouhuai XuZhimin GaoYang Lu 0010Weidong ShiNolan ShahComputational complexity characterization of protecting elections from bribery.Theor. Comput. Sci.891189-2092021Journal Articlesclosedjournals/tcs/ChenSXXGLSS2110.1016/J.TCS.2021.08.036https://doi.org/10.1016/j.tcs.2021.08.036https://dblp.org/rec/journals/tcs/ChenSXXGLSS21URL#1216500Yu-Han ChenShyue-Ming TangKung-Jui PaiJou-Ming ChangConstructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes.Theor. Comput. Sci.878-879102-1122021Journal Articlesclosedjournals/tcs/ChenTPC2110.1016/J.TCS.2021.05.031https://doi.org/10.1016/j.tcs.2021.05.031https://dblp.org/rec/journals/tcs/ChenTPC21URL#1216501Shengminjie ChenWenguo YangSuixiang GaoRong Jin 0003Novel algorithms for maximum DS decomposition.Theor. Comput. Sci.85787-962021Journal Articlesclosedjournals/tcs/ChenYGJ2110.1016/J.TCS.2020.12.041https://doi.org/10.1016/j.tcs.2020.12.041https://dblp.org/rec/journals/tcs/ChenYGJ21URL#1216502Siu-Wing ChengOtfried CheongTaegyoung LeeZhengtong RenFitting a graph to one-dimensional data.Theor. Comput. Sci.86740-492021Journal Articlesclosedjournals/tcs/ChengCLR2110.1016/J.TCS.2021.03.020https://doi.org/10.1016/j.tcs.2021.03.020https://dblp.org/rec/journals/tcs/ChengCLR21URL#1216503Alessandra CherubiniNicoletta SabadiniSimone TiniTheoretical Computer Science in Italy.Theor. Comput. Sci.8641382021Journal Articlesclosedjournals/tcs/CherubiniST2110.1016/J.TCS.2021.03.018https://doi.org/10.1016/j.tcs.2021.03.018https://dblp.org/rec/journals/tcs/CherubiniST21URL#1216504Nina ChiarelliBerenice Martínez-BaronaMartin MilanicJérôme MonnotPeter MursicStrong cliques in diamond-free graphs.Theor. Comput. Sci.85849-632021Journal Articlesclosedjournals/tcs/ChiarelliMMMM2110.1016/J.TCS.2020.12.001https://doi.org/10.1016/j.tcs.2020.12.001https://dblp.org/rec/journals/tcs/ChiarelliMMMM21URL#1216505