CITATION

*********
Citations
*********

Software Citation
=================

If you use the MI-bicliques software, you must cite:

E. Horton, K. Kloster, B.D. Sullivan, A. van der Poel, and T. Woodlief, MI-bicliques (2019).
MI-bicliques: Version 2.0. Zenodo. 10.5281/zenodo.3381532

..code-block::tex

                  @misc{MI_bicliques_v2.0,
                    author       = {Eric Horton and
                                    Kyle Kloster and
                                    Blair D.~Sullivan and
                                    Andrew van der Poel and
                                    Trey Woodlief},
                    title        = {MI-bicliques: Version 2.0},
                    month        = aug,
                    year         = 2019,
                    doi          = {10.5281/zenodo.3381532},
                    url          = {https://doi.org/10.5281/zenodo.3381532}
                  }
                  
                  

If using Version 1.0, you must cite the following:

E. Horton, K. Kloster, B.D. Sullivan, and A. van der Poel, MI-bicliques (2018).
MI-bicliques: Version 1.0. Zenodo. 10.5281/zenodo.1238879

..code-block::tex

                  @misc{MI_bicliques_v1.0,
                    author       = {Eric Horton and
                                    Kyle Kloster and
                                    Blair D.~Sullivan and
                                    Andrew van der Poel},
                    title        = {MI-bicliques: Version 1.0},
                    month        = oct,
                    year         = 2018,
                    doi          = {10.5281/zenodo.1238879},
                    url          = {https://doi.org/10.5281/zenodo.1238879}
                  }

If you use any of our published algorithms you should *also*
cite the relevant paper(s) as directed below.

===========================================================

The methods in lib:MI-bicliques (which are used in the main pipeline :program:`biclique_algorithms.cpp`) implement the maximal (induced) biclique enumeration algorithms described in:

   K. Kloster, B.D. Sullivan, and A. van der Poel. (2018)
   Mining Maximal Induced Bicliques using Odd Cycle Transversals.
   Proceedings of the 2019 SIAM International Conference on Data Mining.
   https://epubs.siam.org/doi/pdf/10.1137/1.9781611975673.37
   
   
   B.D. Sullivan, A. van der Poel, and T. Woodlief. (2019)
   Faster Biclique Mining in Near-Bipartite Graphs.
   Special Event on Analysis of Experimental Algorithms.
   https://arxiv.org/pdf/1903.01538.pdf

.. code-block:: tex

@inproceedings{kloster2019mining,
  title={Mining Maximal Induced Bicliques using Odd Cycle Transversals},
  author={Kloster, Kyle and van der Poel, Andrew and Sullivan, Blair D},
  booktitle={Proceedings of the 2019 SIAM International Conference on Data Mining},
  pages={324--332},
  year={2019},
  organization={SIAM}
}

@inproceedings{sullivan2019faster,
  title={Faster Biclique Mining in Near-Bipartite Graphs},
  author={Sullivan, Blair D and van der Poel, Andrew and Woodlief, Trey},
  booktitle={Special Event on Analysis of Experimental Algorithms},
  year={2019},
  organization={Springer}
}