scientific article; zbMATH DE number 7378611

DOI10.4230/LIPIcs.IPEC.2018.25MaRDI QIDQ5009489

Saket Saurabh, Daniel Lokshtanov, Oliveira Mateus de Oliveira

Publication date: 4 August 2021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

constructive algorithmsembedded planar diameter improvementnooses

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Related Items (2)

A survey of parameterized algorithms and the complexity of edge modification ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Graph minors. XI: Circuits on a surface
• On search, decision, and the efficiency of polynomial-time algorithms
• Chordal embeddings of planar graphs
• Graph minors. XIII: The disjoint paths problem
• Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
• A polynomial-time algorithm for outerplanar diameter improvement
• Treewidth and Minimum Fill-in: Grouping the Minimal Separators
• Large Induced Subgraphs via Triangulations and CMSO
• STACS 2004
• Parameterized Algorithms

This page was built for publication: