Mehlhorn, Kurt; Neumann, Adrian; Schmidt, Jens M. Certifying 3-edge-connectivity. (English) Zbl 1356.05150 Algorithmica 77, No. 2, 309-335 (2017). MSC: 05C85 05C40 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Algorithmica 77, No. 2, 309--335 (2017; Zbl 1356.05150) Full Text: DOI arXiv
Bhattacharya, Sayan; Chalermsook, Parinya; Mehlhorn, Kurt; Neumann, Adrian New approximability results for the robust \(k\)-median problem. (English) Zbl 1417.68049 Ravi, R. (ed.) et al., Algorithm theory – SWAT 2014. 14th Scandinavian symposium and workshops, Copenhagen, Denmark, July 2–4, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8503, 50-61 (2014). MSC: 68Q17 90B80 PDFBibTeX XMLCite \textit{S. Bhattacharya} et al., Lect. Notes Comput. Sci. 8503, 50--61 (2014; Zbl 1417.68049) Full Text: DOI arXiv
Mehlhorn, Kurt; Neumann, Adrian; Schmidt, Jens M. Certifying 3-edge-connectivity. (English) Zbl 1417.05226 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 39th international workshop, WG 2013, Lübeck, Germany, June 19–21, 2013. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 8165, 358-369 (2013). MSC: 05C85 05C40 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Lect. Notes Comput. Sci. 8165, 358--369 (2013; Zbl 1417.05226) Full Text: DOI arXiv