Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/tcs/tcs923.bht:"
download as .bib file
@article{DBLP:journals/tcs/AkitayaKKST22,
author = {Hugo A. Akitaya and
Matias Korman and
Oliver Korten and
Diane L. Souvaine and
Csaba D. T{\'{o}}th},
title = {Reconfiguration of connected graph partitions via recombination},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {13--26},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.049},
doi = {10.1016/J.TCS.2022.04.049},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AkitayaKKST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlimiDF22,
author = {Morteza Alimi and
Amir Daneshgar and
Mohammad{-}Hadi Foroughmand{-}Araabi},
title = {Mean isoperimetry with control on outliers: Exact and approximation
algorithms},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {348--365},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.022},
doi = {10.1016/J.TCS.2022.05.022},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AlimiDF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BensmailDOS22,
author = {Julien Bensmail and
Fran{\c{c}}ois Dross and
Nacim Oijid and
{\'{E}}ric Sopena},
title = {Generalising the achromatic number to Zaslavsky's colourings of signed
graphs},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {196--221},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.009},
doi = {10.1016/J.TCS.2022.05.009},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BensmailDOS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BensmailI22,
author = {Julien Bensmail and
Fionn Mc Inerney},
title = {On a vertex-capturing game},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {27--46},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.050},
doi = {10.1016/J.TCS.2022.04.050},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BensmailI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenL22,
author = {You Chen and
Xueliang Li},
title = {The proper vertex-disconnection of graphs},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {167--178},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.004},
doi = {10.1016/J.TCS.2022.05.004},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChenL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CostaMS22,
author = {Eurinardo Rodrigues Costa and
Nicolas Almeida Martins and
Rudini M. Sampaio},
title = {Spy game: FPT-algorithm, hardness and graph products},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {304--317},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.015},
doi = {10.1016/J.TCS.2022.05.015},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CostaMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DubloisLP22,
author = {Louis Dublois and
Michael Lampis and
Vangelis Th. Paschos},
title = {Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential
approximation},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {271--291},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.013},
doi = {10.1016/J.TCS.2022.05.013},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DubloisLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/El-MhamdiGHM22,
author = {El{-}Mahdi El{-}Mhamdi and
Rachid Guerraoui and
L{\^{e}}{-}Nguy{\^{e}}n Hoang and
Alexandre Maurer},
title = {Removing algorithmic discrimination (with minimal individual error)},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {47--55},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.051},
doi = {10.1016/J.TCS.2022.04.051},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/El-MhamdiGHM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Goulet-Ouellet22,
author = {Herman Goulet{-}Ouellet},
title = {Suffix-connected languages},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {126--143},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.001},
doi = {10.1016/J.TCS.2022.05.001},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Goulet-Ouellet22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GudmundssonKRSW22,
author = {Joachim Gudmundsson and
Mees van de Kerkhof and
Andr{\'{e}} van Renssen and
Frank Staals and
Lionov Wiratma and
Sampson Wong},
title = {Covering a set of line segments with a few squares},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {74--98},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.053},
doi = {10.1016/J.TCS.2022.04.053},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GudmundssonKRSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HabibMMZ22,
author = {Michel Habib and
Fabien de Montgolfier and
Lalla Mouatadid and
Mengchuan Zou},
title = {A general algorithmic scheme for combinatorial decompositions with
application to modular decompositions of hypergraphs},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {56--73},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.052},
doi = {10.1016/J.TCS.2022.04.052},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HabibMMZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HosteinsSGA22,
author = {Pierre Hosteins and
Rosario Scatamacchia and
Andrea Grosso and
Roberto Aringhieri},
title = {The Connected Critical Node Problem},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {235--255},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.011},
doi = {10.1016/J.TCS.2022.05.011},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HosteinsSGA22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KuritaW22,
author = {Kazuhiro Kurita and
Kunihiro Wasa},
title = {Constant amortized time enumeration of Eulerian trails},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {1--12},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.048},
doi = {10.1016/J.TCS.2022.04.048},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KuritaW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiangZY22,
author = {Jing Liang and
Haixing Zhao and
Jun Yin},
title = {A method to calculate the number of spanning connected unicyclic(bicyclic)
subgraphs in 2-separable networks},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {144--159},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.002},
doi = {10.1016/J.TCS.2022.05.002},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiangZY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Lin22,
author = {Min{-}Sheng Lin},
title = {Counting dominating sets in some subclasses of bipartite graphs},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {337--347},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.021},
doi = {10.1016/J.TCS.2022.05.021},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Lin22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuLD22,
author = {Xiaofei Liu and
Weidong Li and
Han Dai},
title = {Approximation algorithms for the minimum power cover problem with
submodular/linear penalties},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {256--270},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.012},
doi = {10.1016/J.TCS.2022.05.012},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiuLD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NassrAB22,
author = {Dieaa I. Nassr and
M. Anwar and
Hatem M. Bahig},
title = {Improving small private exponent attack on the Murru-Saettone cryptosystem},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {222--234},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.010},
doi = {10.1016/J.TCS.2022.05.010},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/NassrAB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NguyenTHN22,
author = {Kien Trung Nguyen and
Wen Chean Teh and
Nguyen Thanh Hung and
Huong Nguyen{-}Thu},
title = {A linear time algorithm for connected \emph{p}-centdian problem on
block graphs},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {318--326},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.019},
doi = {10.1016/J.TCS.2022.05.019},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/NguyenTHN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NingG22,
author = {Wantao Ning and
Litao Guo},
title = {Connectivity and super connectivity of the exchanged 3-ary \emph{n}-cube},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {160--166},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.003},
doi = {10.1016/J.TCS.2022.05.003},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/NingG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Patt-ShamirP22,
author = {Boaz Patt{-}Shamir and
Mor Perry},
title = {Proof-labeling schemes: Broadcast, unicast and in between},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {179--195},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.006},
doi = {10.1016/J.TCS.2022.05.006},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Patt-ShamirP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SendaTS22,
author = {Ryoma Senda and
Yoshiaki Takata and
Hiroyuki Seki},
title = {Complexity results on register context-free grammars and related formalisms},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {99--125},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.055},
doi = {10.1016/J.TCS.2022.04.055},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/SendaTS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShuLM22,
author = {Chai Shu and
Xiang{-}Jun Li and
Meijie Ma},
title = {Note on reliability of star graphs},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {366--375},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.028},
doi = {10.1016/J.TCS.2022.05.028},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ShuLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tang22,
author = {Zhiyi Tang},
title = {Optimal embedding of hypercube into cylinder},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {327--336},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.020},
doi = {10.1016/J.TCS.2022.05.020},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Tang22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangZY22,
author = {Zhen Zhang and
Yipeng Zhou and
Shaoqian Yu},
title = {Better guarantees for \emph{k}-median with service installation costs},
journal = {Theor. Comput. Sci.},
volume = {923},
pages = {292--303},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.05.014},
doi = {10.1016/J.TCS.2022.05.014},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ZhangZY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-07-28 06:25 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
