%0 Conference Paper %1 conf/soda/AmilhastreJV97 %A Amilhastre, Jérôme %A Janssen, Philippe %A Vilarem, Marie-Catherine %B SODA %D 1997 %E Saks, Michael E. %I ACM/SIAM %K dblp %P 36-42 %T Computing a Minimum Biclique Cover is Polynomial for Bipartite Domino-Free Graphs. %U http://dblp.uni-trier.de/db/conf/soda/soda97.html#AmilhastreJV97 %@ 0-89871-390-0

@inproceedings{conf/soda/AmilhastreJV97, added-at = {2012-12-07T00:00:00.000+0100}, author = {Amilhastre, Jérôme and Janssen, Philippe and Vilarem, Marie-Catherine}, biburl = {https://www.bibsonomy.org/bibtex/21a515743dc046ce8116958276d1ded44/dblp}, booktitle = {SODA}, crossref = {conf/soda/1997}, editor = {Saks, Michael E.}, ee = {http://dl.acm.org/citation.cfm?id=314161.314175}, interhash = {30a128c808d92659aa766185c45f85fd}, intrahash = {1a515743dc046ce8116958276d1ded44}, isbn = {0-89871-390-0}, keywords = {dblp}, pages = {36-42}, publisher = {ACM/SIAM}, timestamp = {2018-07-06T11:40:28.000+0200}, title = {Computing a Minimum Biclique Cover is Polynomial for Bipartite Domino-Free Graphs.}, url = {http://dblp.uni-trier.de/db/conf/soda/soda97.html#AmilhastreJV97}, year = 1997 }