Comparing Universal Covers in Polynomial Time

Jirí Fiala, Daniël Paulusma. Comparing Universal Covers in Polynomial Time. In Edward A. Hirsch, Alexander A. Razborov, Alexei L. Semenov, Anatol Slissenko, editors, Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings. Volume 5010 of Lecture Notes in Computer Science, pages 158-167, Springer, 2008. [doi]

@inproceedings{FialaP08,
  title = {Comparing Universal Covers in Polynomial Time},
  author = {Jirí Fiala and Daniël Paulusma},
  year = {2008},
  doi = {10.1007/978-3-540-79709-8_18},
  url = {http://dx.doi.org/10.1007/978-3-540-79709-8_18},
  researchr = {https://researchr.org/publication/FialaP08},
  cites = {0},
  citedby = {0},
  pages = {158-167},
  booktitle = {Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings},
  editor = {Edward A. Hirsch and Alexander A. Razborov and Alexei L. Semenov and Anatol Slissenko},
  volume = {5010},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-79708-1},
}