Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/Buss15,
  author       = {Sam Buss},
  title        = {Quasipolynomial size proofs of the propositional pigeonhole principle},
  journal      = {Theor. Comput. Sci.},
  volume       = {576},
  pages        = {77--84},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.02.005},
  doi          = {10.1016/J.TCS.2015.02.005},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Buss15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChengCM15,
  author       = {Eddie Cheng and
                  Robert Connolly and
                  Christopher Melekian},
  title        = {Matching preclusion and conditional matching preclusion problems for
                  the folded Petersen cube},
  journal      = {Theor. Comput. Sci.},
  volume       = {576},
  pages        = {30--44},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.01.046},
  doi          = {10.1016/J.TCS.2015.01.046},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChengCM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FellowsSPS15,
  author       = {Michael R. Fellows and
                  U{\'{e}}verton dos Santos Souza and
                  F{\'{a}}bio Protti and
                  Maise Dantas da Silva},
  title        = {Tractability and hardness of flood-filling games on trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {576},
  pages        = {102--116},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.02.008},
  doi          = {10.1016/J.TCS.2015.02.008},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FellowsSPS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FountoulakisFH15,
  author       = {Nikolaos Fountoulakis and
                  Tobias Friedrich and
                  Danny Hermelin},
  title        = {On the average-case complexity of parameterized clique},
  journal      = {Theor. Comput. Sci.},
  volume       = {576},
  pages        = {18--29},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.01.042},
  doi          = {10.1016/J.TCS.2015.01.042},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/FountoulakisFH15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KakimuraK15,
  author       = {Naonori Kakimura and
                  Ken{-}ichi Kawarabayashi},
  title        = {Fixed-parameter tractability for subset feedback set problems with
                  parity constraints},
  journal      = {Theor. Comput. Sci.},
  volume       = {576},
  pages        = {61--76},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.02.004},
  doi          = {10.1016/J.TCS.2015.02.004},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KakimuraK15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KlavikKOS15,
  author       = {Pavel Klav{\'{\i}}k and
                  Jan Kratochv{\'{\i}}l and
                  Yota Otachi and
                  Toshiki Saitoh},
  title        = {Extending partial representations of subclasses of chordal graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {576},
  pages        = {85--101},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.02.007},
  doi          = {10.1016/J.TCS.2015.02.007},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KlavikKOS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/SubramaniW15,
  author       = {K. Subramani and
                  James Worthington},
  title        = {Feasibility checking in Horn constraint systems through a reduction
                  based approach},
  journal      = {Theor. Comput. Sci.},
  volume       = {576},
  pages        = {1--17},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2014.12.016},
  doi          = {10.1016/J.TCS.2014.12.016},
  timestamp    = {Fri, 09 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/SubramaniW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangSW15,
  author       = {Farn Wang and
                  Sven Schewe and
                  Jung{-}Hsuan Wu},
  title        = {Complexity of node coverage games},
  journal      = {Theor. Comput. Sci.},
  volume       = {576},
  pages        = {45--60},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.02.002},
  doi          = {10.1016/J.TCS.2015.02.002},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/WangSW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics