Eelko Penninkx
- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions
2005/01/01 by Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender +1 · 32 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Algorithms and Data Compression #Combinatorics #Computer science #Cycle basis #Discrete mathematics #Divide and conquer algorithms #Graph #Hamiltonian path #Mathematics #Maximum cut #Optimization and Search Problems #Parameterized complexity #Planar #Planar graph