BibTeX record journals/dam/KratschM17

download as .bib file

@article{DBLP:journals/dam/KratschM17,
  author       = {Stefan Kratsch and
                  Martin Milanic},
  title        = {On the complexity of the identifiable subgraph problem, revisited},
  journal      = {Discret. Appl. Math.},
  volume       = {226},
  pages        = {78--86},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2017.04.028},
  doi          = {10.1016/J.DAM.2017.04.028},
  timestamp    = {Thu, 20 Feb 2020 15:47:38 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KratschM17.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.