Academic lecture

• Bhyravarapu, Sriram; Dhayanchand, Karthika; Rajamanickam, Muthucumaraswamy et al. (2025). On the Complexity of Minimum Membership Dominating Set. (external link)
• Bentert, Matthias; Fomin, Fedor; Golovach, Petr (2025). Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. (external link)
• Bentert, Matthias; Fomin, Fedor; Golovach, Petr et al. (2025). Packing Short Cycles. (external link)
• Bentert, Matthias; Golovach, Petr; Inamdar, Tanmay et al. (2025). Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems. (external link)
• Bentert, Matthias; Fomin, Fedor; Hauser, Fanny et al. (2024). The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. (external link)
• Bentert, Matthias; Sommer, Frank; Schestag, Jannik (2023). On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. (external link)
• Bentert, Matthias; Koana, Tomohiro; Heeger, Klaus (2023). Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. (external link)

Academic article

• Bentert, Matthias; Crane, Alex; Drange, Pål Grønås et al. (2024). Correlation Clustering with Vertex Splitting. (external link)
• Mizutani, Yosuke; Salomao, Daniel Coimbra; Crane, Alex et al. (2024). Leveraging Fixed-Parameter Tractability for Robot Inspection Planning. (external link)
• Bentert, Matthias; Drange, Pål Grønås; Fomin, Fedor et al. (2024). Two-Sets Cut-Uncut on Planar Graphs. (external link)
• Bentert, Matthias; Crane, Alex; Drange, Pål Grønås et al. (2024). Correlation Clustering with Vertex Splitting. (external link)
• Langedal, Kenneth; Bentert, Matthias; Blanco, Thorgal et al. (2024). PACE Solver Description: LUNCH - Linear Uncrossing Heuristics. (external link)
• Bentert, Matthias; Fellows, Michael Ralph; Golovach, Petr et al. (2024). Breaking a Graph into Connected Components with Small Dominating Sets. (external link)
• Arrighi, Emmanuel Jean Paul Pierre; Bentert, Matthias; Drange, Pål Grønås et al. (2023). Cluster Editing with Overlapping Communities. (external link)
• Bentert, Matthias; Drange, Pål Grønås; Fomin, Fedor et al. (2023). Two-sets cut-uncut on planar graphs. (external link)

Article in business/trade/industry journal

• Abu-Khzam, Faisal N.; Arrighi, Emmanuel Jean Paul Pierre; Bentert, Matthias et al. (2023). Cluster Editing with Vertex Splitting. (external link)

See a complete overview of publications in Cristin.