NASİBOĞLU, E. Et Al. 2013. An Efficient Algorithm for Exact Solution of Maximum Independent Set Problem in Dense Graphs. 3rd International Symposium on Computing in Science & Engineering , (Aydın, Turkey), 69-72.

NASİBOĞLU, E., BERBERLER, M. E., & ATILGAN, C., (2013). An Efficient Algorithm for Exact Solution of Maximum Independent Set Problem in Dense Graphs . 3rd International Symposium on Computing in Science & Engineering (pp.69-72). Aydın, Turkey

NASİBOĞLU, EFENDİ, MURAT ERŞEN BERBERLER, And CAN ATILGAN. "An Efficient Algorithm for Exact Solution of Maximum Independent Set Problem in Dense Graphs," 3rd International Symposium on Computing in Science & Engineering, Aydın, Turkey, 2013

NASİBOĞLU, EFENDİ Et Al. "An Efficient Algorithm for Exact Solution of Maximum Independent Set Problem in Dense Graphs." 3rd International Symposium on Computing in Science & Engineering , Aydın, Turkey, pp.69-72, 2013

NASİBOĞLU, E. BERBERLER, M. E. And ATILGAN, C. (2013) . "An Efficient Algorithm for Exact Solution of Maximum Independent Set Problem in Dense Graphs." 3rd International Symposium on Computing in Science & Engineering , Aydın, Turkey, pp.69-72.

@conferencepaper{conferencepaper, author={EFENDİ NASİBOĞLU Et Al. }, title={An Efficient Algorithm for Exact Solution of Maximum Independent Set Problem in Dense Graphs}, congress name={3rd International Symposium on Computing in Science & Engineering}, city={Aydın}, country={Turkey}, year={2013}, pages={69-72} }