Andreas Emil Feldmann
- A Survey on Approximation in Parameterized Complexity: Hardness and\n Algorithms
2020/06/08 by Andreas Emil Feldmann, C. S. Karthik, Feldmann, Andreas Emil +5 · 4 citations
Computer Science · #Advanced Graph Theory Research #Constraint Satisfaction and Optimization #Metaheuristic Optimization Algorithms Research
- Parameterized Inapproximability of Independent Set in H-Free Graphs
2020/06/18 by Pavel Dvořák, Dvořák, Pavel, Andreas Emil Feldmann +5 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #F.2 #FOS: Computer and information sciences #Limits and Structures in Graph Theory