On the Complexity of Reconstructing H -free Graphs from Their Star Systems. Fomin, F. V., Kratochvíl, J., Lokshtanov, D., Mancini, F., & Arne Telle, J. In Proceedings of Latin American Symposium on Theoretical Informatics (LATIN), pages 194-205, 2008.
On the Complexity of Reconstructing H -free Graphs from Their Star Systems [link]Paper  bibtex   
@inproceedings{ dblp3423847,
  title = {On the Complexity of Reconstructing H -free Graphs from Their Star Systems},
  author = {Fedor V. Fomin and Jan Kratochvíl and Daniel Lokshtanov and Federico Mancini and Jan Arne Telle},
  author_short = {Fomin, F. V. and Kratochvíl, J. and Lokshtanov, D. and Mancini, F. and Arne Telle, J.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2008},
  key = {dblp3423847},
  id = {dblp3423847},
  biburl = {http://www.dblp.org/rec/bibtex/conf/latin/FominKLMT08},
  url = {http://dx.doi.org/10.1007/978-3-540-78773-0_17},
  conference = {LATIN},
  pages = {194-205},
  text = {LATIN 2008:194-205},
  booktitle = {Proceedings of Latin American Symposium on Theoretical Informatics (LATIN)}
}
Downloads: 0