Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/BachtlerBK24,
  author       = {Oliver Bachtler and
                  Tim Bergner and
                  Sven O. Krumke},
  title        = {Almost disjoint paths and separating by forbidden pairs},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114272},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114272},
  doi          = {10.1016/J.TCS.2023.114272},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BachtlerBK24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BekosGMS24,
  author       = {Michael A. Bekos and
                  Martin Gronemann and
                  Fabrizio Montecchiani and
                  Antonios Symvonis},
  title        = {Convex grid drawings of planar graphs with constant edge-vertex resolution},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114290},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114290},
  doi          = {10.1016/J.TCS.2023.114290},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BekosGMS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CastelnovoGM24,
  author       = {Davide Castelnovo and
                  Fabio Gadducci and
                  Marino Miculan},
  title        = {A simple criterion for M,N-adhesivity},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114280},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114280},
  doi          = {10.1016/J.TCS.2023.114280},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CastelnovoGM24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Chang24,
  author       = {Yi{-}Jun Chang},
  title        = {The energy complexity of diameter and minimum cut computation in bounded-genus
                  networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114279},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114279},
  doi          = {10.1016/J.TCS.2023.114279},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Chang24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DahalS24,
  author       = {Sameep Dahal and
                  Jukka Suomela},
  title        = {Distributed half-integral matching and beyond},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114278},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114278},
  doi          = {10.1016/J.TCS.2023.114278},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DahalS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DucheneOP24,
  author       = {{\'{E}}ric Duch{\^{e}}ne and
                  Nacim Oijid and
                  Aline Parreau},
  title        = {Bipartite instances of {INFLUENCE}},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114274},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114274},
  doi          = {10.1016/J.TCS.2023.114274},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DucheneOP24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GaiZZ24,
  author       = {Ling Gai and
                  Weiwei Zhang and
                  Zhao Zhang},
  title        = {Selfish bin packing with punishment},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114276},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114276},
  doi          = {10.1016/J.TCS.2023.114276},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GaiZZ24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GourvesHLM24,
  author       = {Laurent Gourv{\`{e}}s and
                  Ararat Harutyunyan and
                  Michael Lampis and
                  Nikolaos Melissinos},
  title        = {Filling crosswords is very hard},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114275},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114275},
  doi          = {10.1016/J.TCS.2023.114275},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GourvesHLM24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HenningPST24,
  author       = {Michael A. Henning and
                  Arti Pandey and
                  Gopika Sharma and
                  Vikash Tripathi},
  title        = {Algorithms and hardness results for edge total domination problem
                  in graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114270},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114270},
  doi          = {10.1016/J.TCS.2023.114270},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HenningPST24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HuangK24,
  author       = {Sumin Huang and
                  Sergey Kitaev},
  title        = {On ordering of \emph{{\(\beta\)}}-description trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114273},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114273},
  doi          = {10.1016/J.TCS.2023.114273},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/HuangK24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/JainT24,
  author       = {Rahul Jain and
                  Raghunath Tewari},
  title        = {Space efficient algorithm for solving reachability using tree decomposition
                  and separators},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114251},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114251},
  doi          = {10.1016/J.TCS.2023.114251},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/JainT24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KiyakS24,
  author       = {Firat Kiyak and
                  A. C. Cem Say},
  title        = {Energy complexity of regular languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114291},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114291},
  doi          = {10.1016/J.TCS.2023.114291},
  timestamp    = {Fri, 08 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KiyakS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NasreNRS24,
  author       = {Meghana Nasre and
                  Prajakta Nimbhorkar and
                  Keshav Ranjan and
                  Ankita Sarkar},
  title        = {Popular critical matchings in the many-to-many setting},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114281},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114281},
  doi          = {10.1016/J.TCS.2023.114281},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NasreNRS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/RemyR24,
  author       = {Elisabeth Remy and
                  Paul Ruet},
  title        = {From multivalued to Boolean functions: Preservation of soft nested
                  canalization},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114277},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114277},
  doi          = {10.1016/J.TCS.2023.114277},
  timestamp    = {Fri, 08 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RemyR24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/RizzoENM24,
  author       = {Nicola Rizzo and
                  Massimo Equi and
                  Tuukka Norri and
                  Veli M{\"{a}}kinen},
  title        = {Elastic founder graphs improved and enhanced},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114269},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114269},
  doi          = {10.1016/J.TCS.2023.114269},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RizzoENM24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Tanaka24,
  author       = {Yuzuru Tanaka},
  title        = {Designing aperture 22k hexagonal grids and their indexing as factor
                  rings of Eisenstein integers},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114257},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114257},
  doi          = {10.1016/J.TCS.2023.114257},
  timestamp    = {Fri, 08 Mar 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Tanaka24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Vu24,
  author       = {Hoa T. Vu},
  title        = {Revisiting maximum satisfiability and related problems in data streams},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114271},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114271},
  doi          = {10.1016/J.TCS.2023.114271},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Vu24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/WangX24,
  author       = {Di Wang and
                  Jinhui Xu},
  title        = {Gradient complexity and non-stationary views of differentially private
                  empirical risk minimization},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114259},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114259},
  doi          = {10.1016/J.TCS.2023.114259},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WangX24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/YangHF24,
  author       = {Peng Yang and
                  Yuan Huang and
                  Zhiguo Fu},
  title        = {The computational complexity of Holant problems on 3-regular graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114256},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114256},
  doi          = {10.1016/J.TCS.2023.114256},
  timestamp    = {Fri, 08 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/YangHF24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ZhaoDL24,
  author       = {Xiaojun Zhao and
                  Qingying Deng and
                  Xiaowang Li},
  title        = {Relating g-good-neighbor connectivity and g-good-neighbor diagnosability
                  of strong digraph network},
  journal      = {Theor. Comput. Sci.},
  volume       = {982},
  pages        = {114258},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114258},
  doi          = {10.1016/J.TCS.2023.114258},
  timestamp    = {Sun, 10 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ZhaoDL24.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.