Marek Karpinski, Andrzej Rucinski, Edyta Szymanska. The Complexity of Perfect Matching Problems on Dense Hypergraphs. In Yingfei Dong, Ding-Zhu Du, Oscar H. Ibarra, editors, Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Volume 5878 of Lecture Notes in Computer Science, pages 626-636, Springer, 2009. [doi]
@inproceedings{KarpinskiRS09,
title = {The Complexity of Perfect Matching Problems on Dense Hypergraphs},
author = {Marek Karpinski and Andrzej Rucinski and Edyta Szymanska},
year = {2009},
doi = {10.1007/978-3-642-10631-6_64},
url = {http://dx.doi.org/10.1007/978-3-642-10631-6_64},
researchr = {https://researchr.org/publication/KarpinskiRS09},
cites = {0},
citedby = {0},
pages = {626-636},
booktitle = {Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
editor = {Yingfei Dong and Ding-Zhu Du and Oscar H. Ibarra},
volume = {5878},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-10630-9},
}