pdfformat: 

@InProceedings{chakaravarthy_et_al:LIPIcs:2010:2868, author = {Venkatesan T. Chakaravarthy and Vinayaka Pandit and Sambuddha Roy and Yogish Sabharwal}, title = {{Finding Independent Sets in Unions of Perfect Graphs}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)}, pages = {251259}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897231}, ISSN = {18688969}, year = {2010}, volume = {8}, editor = {Kamal Lodaya and Meena Mahajan}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2868}, URN = {urn:nbn:de:0030drops28683}, doi = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.251}, annote = {Keywords: Approximation Algorithms; Comparability Graphs; Hardness of approximation} }
Keywords:  Approximation Algorithms; Comparability Graphs; Hardness of approximation  
Seminar:  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)  
Issue date:  2010  
Date of publication:  14.12.2010 