Search dblp for Publications

export results for "Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity."

 download as .bib file

@article{DBLP:journals/tcs/ChiarelliHJMP18,
  author       = {Nina Chiarelli and
                  Tatiana Romina Hartinger and
                  Matthew Johnson and
                  Martin Milanic and
                  Dani{\"{e}}l Paulusma},
  title        = {Minimum connected transversals in graphs: New hardness results and
                  tractable cases using the price of connectivity},
  journal      = {Theor. Comput. Sci.},
  volume       = {705},
  pages        = {75--83},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.09.033},
  doi          = {10.1016/J.TCS.2017.09.033},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ChiarelliHJMP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChiarelliH0MP17,
  author       = {Nina Chiarelli and
                  Tatiana Romina Hartinger and
                  Matthew Johnson and
                  Martin Milanic and
                  Dani{\"{e}}l Paulusma},
  title        = {Minimum Connected Transversals in Graphs: New Hardness Results and
                  Tractable Cases Using the Price of Connectivity},
  journal      = {CoRR},
  volume       = {abs/1706.08050},
  year         = {2017},
  url          = {http://arxiv.org/abs/1706.08050},
  eprinttype    = {arXiv},
  eprint       = {1706.08050},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ChiarelliH0MP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics