Pandey, Sukanya
- Complexity Framework For Forbidden Subgraphs I: The Framework
2022/11/23 by Johnson, Matthew, Martin, Barnaby, Oostveen, Jelle J. +4 · 3 citations
#Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
2022/11/25 by Lozin, Vadim, Martin, Barnaby, Pandey, Sukanya +4 · 1 citation
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs
2023/05/01 by Johnson, Matthew, Martin, Barnaby, Pandey, Sukanya +3 · 1 citation
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
- Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
2023/05/02 by Hans L. Bodlaender, Bodlaender, Hans L., Matthew Johnson +13 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory