%0 Conference Paper %1 conf/approx/Schiermeyer98 %A Schiermeyer, Ingo %B APPROX %D 1998 %E Jansen, Klaus %E Hochbaum, Dorit S. %I Springer %K dblp %P 159-168 %T Approximating Maximum Independent Set in k-Clique-Free Graphs. %U http://dblp.uni-trier.de/db/conf/approx/approx1998.html#Schiermeyer98 %V 1444 %@ 3-540-64736-8

@inproceedings{conf/approx/Schiermeyer98, added-at = {2017-05-23T00:00:00.000+0200}, author = {Schiermeyer, Ingo}, biburl = {https://www.bibsonomy.org/bibtex/24586f6642317681822d8f0fce2c696cb/dblp}, booktitle = {APPROX}, crossref = {conf/approx/1998}, editor = {Jansen, Klaus and Hochbaum, Dorit S.}, ee = {https://doi.org/10.1007/BFb0053972}, interhash = {f3ab991a877ddb8b071a430335b7a770}, intrahash = {4586f6642317681822d8f0fce2c696cb}, isbn = {3-540-64736-8}, keywords = {dblp}, pages = {159-168}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T20:02:55.000+0200}, title = {Approximating Maximum Independent Set in k-Clique-Free Graphs.}, url = {http://dblp.uni-trier.de/db/conf/approx/approx1998.html#Schiermeyer98}, volume = 1444, year = 1998 }