neeldhara-misra documents

Wg qcolorable
Technology Wg qcolorable
Kernelization Complexity of Colorful Motifs
Education Kernelization Complexity of Colorful Motifs
Connected Dominating Set and Short Cycles
Education Connected Dominating Set and Short Cycles
Expansions for Reductions
Sports Expansions for Reductions
An FPT Algorithm for Maximum Edge Coloring
Education An FPT Algorithm for Maximum Edge Coloring
Research in CS
Education Research in CS
Cheat Sheets for Hard Problems
Education Cheat Sheets for Hard Problems
A Kernel for Planar F-deletion: The Connected Case
Education A Kernel for Planar F-deletion: The Connected Case
From FVS to F-Deletion
Education From FVS to F-Deletion
Efficient Simplification: The (im)possibilities
Documents Efficient Simplification: The (im)possibilities
Kernels for Planar F-Deletion (Restricted Variants)
Technology Kernels for Planar F-Deletion (Restricted Variants)
Separators with Non-Hereditary Properties
Education Separators with Non-Hereditary Properties
Lower bounds on kernelization
Documents Lower bounds on kernelization
01 - 01 January - Sorting
Education 01 - 01 January - Sorting
08 - 25 Jan - Divide and Conquer
Education 08 - 25 Jan - Divide and Conquer
04 - 15 Jan - Heap Sort
Education 04 - 15 Jan - Heap Sort
13 - 06 Feb - Dynamic Programming
Education 13 - 06 Feb - Dynamic Programming
04 - 15 Jan - Heap Sort
Education 04 - 15 Jan - Heap Sort
05 - 18 Jan - The Sorting Wrap-Up
Education 05 - 18 Jan - The Sorting Wrap-Up
10 - 29 Jan - Recursion Part 2
Education 10 - 29 Jan - Recursion Part 2
02 - 04 Jan - Sorting (Continued)
Education 02 - 04 Jan - Sorting (Continued)