Finding Highly Connected Subgraphs

Falk Hüffner, Christian Komusiewicz, Manuel Sorge. Finding Highly Connected Subgraphs. In Giuseppe F. Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer, editors, SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings. Volume 8939 of Lecture Notes in Computer Science, pages 254-265, Springer, 2015. [doi]

@inproceedings{HuffnerKS15,
  title = {Finding Highly Connected Subgraphs},
  author = {Falk Hüffner and Christian Komusiewicz and Manuel Sorge},
  year = {2015},
  doi = {10.1007/978-3-662-46078-8_21},
  url = {http://dx.doi.org/10.1007/978-3-662-46078-8_21},
  researchr = {https://researchr.org/publication/HuffnerKS15},
  cites = {0},
  citedby = {0},
  pages = {254-265},
  booktitle = {SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings},
  editor = {Giuseppe F. Italiano and Tiziana Margaria-Steffen and Jaroslav Pokorný and Jean-Jacques Quisquater and Roger Wattenhofer},
  volume = {8939},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-662-46077-1},
}