Pål Grønås Drange

1. On the Computational Complexity of Vertex Integrity and Component Order\n Connectivity
   2014/03/25 by Pål Grønås Drange, Markus Sortland Dregi, Drange, Pål Grønås +3 · 7 citations
   Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Optimization and Search Problems
2. A Polynomial Kernel for Trivially Perfect Editing
   2014/12/23 by Pål Grønås Drange, Drange, Pål Grønås, Michał Pilipczuk +1 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.2.2 #Optimization and Search Problems