Search dblp for Publications

export results for "toc:db/journals/tcs/tcs845.bht:"

 download as .bib file

@article{DBLP:journals/tcs/Behera20,
  author       = {Balaram D. Behera},
  title        = {Sorting an array using the topological sort of a corresponding comparison
                  graph},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {76--97},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.09.004},
  doi          = {10.1016/J.TCS.2020.09.004},
  timestamp    = {Thu, 16 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Behera20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Belot20,
  author       = {Gordon Belot},
  title        = {Absolutely no free lunches!},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {159--180},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.09.013},
  doi          = {10.1016/J.TCS.2020.09.013},
  timestamp    = {Wed, 04 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Belot20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChoudharyJKS20,
  author       = {Pratibha Choudhary and
                  Pallavi Jain and
                  R. Krithika and
                  Vibha Sahlot},
  title        = {Vertex deletion on split graphs: Beyond 4-hitting set},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {21--37},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.08.028},
  doi          = {10.1016/J.TCS.2020.08.028},
  timestamp    = {Sat, 07 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChoudharyJKS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DemkoBFVK20,
  author       = {Christophe Demko and
                  Karell Bertet and
                  Cyril Faucher and
                  Jean{-}Fran{\c{c}}ois Viaud and
                  Sergei O. Kuznetsov},
  title        = {NextPriorityConcept: {A} new and generic algorithm computing concepts
                  from complex and heterogeneous data},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {1--20},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.08.026},
  doi          = {10.1016/J.TCS.2020.08.026},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/DemkoBFVK20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DineshOS20,
  author       = {Krishnamoorthy Dinesh and
                  Samir Otiv and
                  Jayalal Sarma},
  title        = {New bounds for energy complexity of Boolean functions},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {59--75},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.09.003},
  doi          = {10.1016/J.TCS.2020.09.003},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DineshOS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GonzalezC20,
  author       = {Miguel Coviello Gonzalez and
                  Marek Chrobak},
  title        = {Towards a theory of mixing graphs: {A} characterization of perfect
                  mixability},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {98--121},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.09.007},
  doi          = {10.1016/J.TCS.2020.09.007},
  timestamp    = {Wed, 04 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GonzalezC20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GorgiOSH20,
  author       = {Abbass Gorgi and
                  Mourad El Ouali and
                  Anand Srivastav and
                  Mohamed Hachimi},
  title        = {Approximation of set multi-cover via hypergraph matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {136--143},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.09.009},
  doi          = {10.1016/J.TCS.2020.09.009},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GorgiOSH20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/JalluJD20,
  author       = {Ramesh K. Jallu and
                  Sangram Kishor Jena and
                  Gautam K. Das},
  title        = {Liar's domination in unit disk graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {38--49},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.08.029},
  doi          = {10.1016/J.TCS.2020.08.029},
  timestamp    = {Thu, 21 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/JalluJD20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KonstantinidisK20,
  author       = {Georgios Konstantinidis and
                  Athanasios Kehagias},
  title        = {On positionality of trigger strategies Nash equilibria in {SCAR}},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {144--158},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.09.011},
  doi          = {10.1016/J.TCS.2020.09.011},
  timestamp    = {Wed, 04 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KonstantinidisK20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LevyS20,
  author       = {Avivit Levy and
                  B. Riva Shalom},
  title        = {Online parameterized dictionary matching with one gap},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {208--229},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.09.016},
  doi          = {10.1016/J.TCS.2020.09.016},
  timestamp    = {Wed, 04 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LevyS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LiuC20,
  author       = {Heqin Liu and
                  Dongqin Cheng},
  title        = {Structure fault tolerance of balanced hypercubes},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {198--207},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.09.015},
  doi          = {10.1016/J.TCS.2020.09.015},
  timestamp    = {Wed, 04 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LiuC20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MienoKNIBT20,
  author       = {Takuya Mieno and
                  Dominik K{\"{o}}ppl and
                  Yuto Nakashima and
                  Shunsuke Inenaga and
                  Hideo Bannai and
                  Masayuki Takeda},
  title        = {Space-efficient algorithms for computing minimal/shortest unique substrings},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {230--242},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.09.017},
  doi          = {10.1016/J.TCS.2020.09.017},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MienoKNIBT20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ParkBALP20,
  author       = {Sung Gwan Park and
                  Magsarjav Bataa and
                  Amihood Amir and
                  Gad M. Landau and
                  Kunsoo Park},
  title        = {Finding patterns and periods in Cartesian tree matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {181--197},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.09.014},
  doi          = {10.1016/J.TCS.2020.09.014},
  timestamp    = {Wed, 04 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ParkBALP20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Singh20,
  author       = {Ranveer Singh},
  title        = {Parameterized complexity of determinant and permanent},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {50--58},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.08.031},
  doi          = {10.1016/J.TCS.2020.08.031},
  timestamp    = {Wed, 04 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Singh20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/TakashimaASMSMS20,
  author       = {Ken Takashima and
                  Yuta Abe and
                  Tatsuya Sasaki and
                  Daiki Miyahara and
                  Kazumasa Shinagawa and
                  Takaaki Mizuki and
                  Hideaki Sone},
  title        = {Card-based protocols for secure ranking computations},
  journal      = {Theor. Comput. Sci.},
  volume       = {845},
  pages        = {122--135},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.09.008},
  doi          = {10.1016/J.TCS.2020.09.008},
  timestamp    = {Thu, 16 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/TakashimaASMSMS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.