Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/AbedCDGMMRR19,
  author       = {Fidaa Abed and
                  Lin Chen and
                  Yann Disser and
                  Martin Gro{\ss} and
                  Nicole Megow and
                  Julie Mei{\ss}ner and
                  Alexander T. Richter and
                  Roman Rischke},
  title        = {Scheduling maintenance jobs in networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {754},
  pages        = {107--121},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.02.020},
  doi          = {10.1016/J.TCS.2018.02.020},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AbedCDGMMRR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Brauer19,
  author       = {Sascha Brauer},
  title        = {Complexity of single-swap heuristics for metric facility location
                  and related problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {754},
  pages        = {88--106},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.048},
  doi          = {10.1016/J.TCS.2018.04.048},
  timestamp    = {Wed, 19 Dec 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Brauer19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EmekSW19,
  author       = {Yuval Emek and
                  Yaacov Shapiro and
                  Yuyi Wang},
  title        = {Minimum cost perfect matching with delays for two sources},
  journal      = {Theor. Comput. Sci.},
  volume       = {754},
  pages        = {122--129},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.07.004},
  doi          = {10.1016/J.TCS.2018.07.004},
  timestamp    = {Fri, 07 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/EmekSW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FotakisPP19,
  author       = {Dimitris Fotakis and
                  Aris Pagourtzis and
                  Vangelis Th. Paschos},
  title        = {Preface to Special Issue on Algorithms and Complexity},
  journal      = {Theor. Comput. Sci.},
  volume       = {754},
  pages        = {1--2},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.11.011},
  doi          = {10.1016/J.TCS.2018.11.011},
  timestamp    = {Thu, 24 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FotakisPP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachKS19,
  author       = {Petr A. Golovach and
                  Dieter Kratsch and
                  Mohamed Yosri Sayadi},
  title        = {Enumeration of maximal irredundant sets for claw-free graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {754},
  pages        = {3--15},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.02.014},
  doi          = {10.1016/J.TCS.2018.02.014},
  timestamp    = {Wed, 19 Dec 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GolovachKS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GourvesM19,
  author       = {Laurent Gourv{\`{e}}s and
                  J{\'{e}}r{\^{o}}me Monnot},
  title        = {On maximin share allocations in matroids},
  journal      = {Theor. Comput. Sci.},
  volume       = {754},
  pages        = {50--64},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.05.018},
  doi          = {10.1016/J.TCS.2018.05.018},
  timestamp    = {Tue, 16 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GourvesM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HagerupKL19,
  author       = {Torben Hagerup and
                  Frank Kammer and
                  Moritz Laudahn},
  title        = {Space-efficient Euler partition and bipartite edge coloring},
  journal      = {Theor. Comput. Sci.},
  volume       = {754},
  pages        = {16--34},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.01.008},
  doi          = {10.1016/J.TCS.2018.01.008},
  timestamp    = {Wed, 19 Dec 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HagerupKL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KleerS19,
  author       = {Pieter Kleer and
                  Guido Sch{\"{a}}fer},
  title        = {Tight inefficiency bounds for perception-parameterized affine congestion
                  games},
  journal      = {Theor. Comput. Sci.},
  volume       = {754},
  pages        = {65--87},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.04.025},
  doi          = {10.1016/J.TCS.2018.04.025},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/KleerS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LunaFIISV19,
  author       = {Giuseppe Antonio Di Luna and
                  Paola Flocchini and
                  Taisuke Izumi and
                  Tomoko Izumi and
                  Nicola Santoro and
                  Giovanni Viglietta},
  title        = {Population protocols with faulty interactions: The impact of a leader},
  journal      = {Theor. Comput. Sci.},
  volume       = {754},
  pages        = {35--49},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.09.005},
  doi          = {10.1016/J.TCS.2018.09.005},
  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/LunaFIISV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics