%0 Journal Article %1 journals/dam/AmilhastreVJ98 %A Amilhastre, Jérôme %A Vilarem, Marie-Catherine %A Janssen, Philippe %D 1998 %J Discret. Appl. Math. %K dblp %N 2-3 %P 125-144 %T Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition for Bipartite Domino-free Graphs. %U http://dblp.uni-trier.de/db/journals/dam/dam86.html#AmilhastreVJ98 %V 86

@article{journals/dam/AmilhastreVJ98, added-at = {2021-02-11T00:00:00.000+0100}, author = {Amilhastre, Jérôme and Vilarem, Marie-Catherine and Janssen, Philippe}, biburl = {https://www.bibsonomy.org/bibtex/2246236ebcce1a2240129ceae7c762d32/dblp}, ee = {https://doi.org/10.1016/S0166-218X(98)00039-0}, interhash = {71a6cb854a42c942cf5f5214c60eb3e3}, intrahash = {246236ebcce1a2240129ceae7c762d32}, journal = {Discret. Appl. Math.}, keywords = {dblp}, number = {2-3}, pages = {125-144}, timestamp = {2024-04-09T01:21:56.000+0200}, title = {Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition for Bipartite Domino-free Graphs.}, url = {http://dblp.uni-trier.de/db/journals/dam/dam86.html#AmilhastreVJ98}, volume = 86, year = 1998 }