Finding Tiny Clusters in Bipartite Graphs

Stefan Neumann 0003. Finding Tiny Clusters in Bipartite Graphs. In Klaus David, Kurt Geihs, Martin Lange, Gerd Stumme, editors, INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik - Informatik für Gesellschaft, 23.-26.9.2019, Kassel, Deutschland. Volume P-294 of LNI, pages 253-254, GI, 2019. [doi]

@inproceedings{Neumann19-3,
  title = {Finding Tiny Clusters in Bipartite Graphs},
  author = {Stefan Neumann 0003},
  year = {2019},
  doi = {10.18420/inf2019_30},
  url = {https://doi.org/10.18420/inf2019_30},
  researchr = {https://researchr.org/publication/Neumann19-3},
  cites = {0},
  citedby = {0},
  pages = {253-254},
  booktitle = {INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik - Informatik für Gesellschaft, 23.-26.9.2019, Kassel, Deutschland},
  editor = {Klaus David and Kurt Geihs and Martin Lange and Gerd Stumme},
  volume = {P-294},
  series = {LNI},
  publisher = {GI},
  isbn = {978-3-88579-688-6},
}