Kristine Vitting Knudsen

Mathematics

1. Branching 100%
2. Digraph 99%
3. Strong Connectivity 93%
4. Parameterized Algorithms 81%
5. Parameterized Complexity 78%
6. Network Design 78%
7. Directed Graph 73%
8. Augmentation 73%
9. Partition 46%
10. Distinct 43%
11. kernel 42%
12. Structural Properties 42%
13. Subset 40%
14. Polynomial 35%
15. Vertex of a graph 29%
16. Disjoint 28%
17. Arc of a curve 26%
18. Connectivity 25%
19. Integer 22%
20. Combinatorial Problems 22%
21. Dichotomy 22%
22. Minimum Degree 21%
23. Combinatorial Optimization 20%
24. Non-negative 17%
25. Graph theory 17%
26. Optimization Theory 15%
27. Graph in graph theory 14%
28. Undirected Graph 14%
29. Cardinality 14%
30. Design 13%
31. Vertex Connectivity 13%
32. Fixed-parameter Algorithms 12%
33. Subgraph 12%
34. Edge-connectivity 12%
35. Resolve 12%
36. Weight Function 11%
37. Target 10%
38. Open Problems 9%
39. Polynomial time 7%
40. Restriction 7%
41. Graph Algorithms 6%
42. Path 6%
43. Spanning Subgraph 6%
44. Exact Algorithms 5%
45. Compression 5%