Piotr Borowiecki, Frank Göring. GreedyMAX-type Algorithms for the Maximum Independent Set Problem. In Ivana Cerná, Tibor Gyimóthy, Juraj Hromkovic, Keith G. Jeffery, Rastislav Královic, Marko Vukolic, Stefan Wolf, editors, SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings. Volume 6543 of Lecture Notes in Computer Science, pages 146-156, Springer, 2011. [doi]
@inproceedings{BorowieckiG11, title = {GreedyMAX-type Algorithms for the Maximum Independent Set Problem}, author = {Piotr Borowiecki and Frank Göring}, year = {2011}, doi = {10.1007/978-3-642-18381-2_12}, url = {http://dx.doi.org/10.1007/978-3-642-18381-2_12}, researchr = {https://researchr.org/publication/BorowieckiG11}, cites = {0}, citedby = {0}, pages = {146-156}, booktitle = {SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings}, editor = {Ivana Cerná and Tibor Gyimóthy and Juraj Hromkovic and Keith G. Jeffery and Rastislav Královic and Marko Vukolic and Stefan Wolf}, volume = {6543}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-18380-5}, }