Roohani Sharma @IMScChennai is defending her thesis titled 'Advancing the Algorithmic Tool-kit for Parameterized Cut Problems' on her new results in the field of #GraphAlgorithms and #ParameterizedComplexity. Join on Aug13 @ 12:00 : https://t.co/8c3uoAkRaX

[Article] Incremental FPT Delay https://t.co/GtfRfuQHpT #parameterizedcomplexity #functioncomplexity #enumeration #algorithms #journal #openaccess

[Article] A Brief Survey of Fixed-Parameter Parallelism Full #openaccess https://t.co/ezbVbcfSZ0 #fixedparameterparallelism #parameterizedcomplexity #parallelcomputing #algorithms

📢New Special Issue "New Frontiers in #ParameterizedComplexity and #Algorithms" edited by Prof. Dr. Frances Rosamond, Dr. Neeldhara Misra and Dr. Meirav Zehari opens now! The deadline is 15 July 2019. Welcome your submissions! https://t.co/OWHQGwe6mh

[Survey] A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms Full #openaccess at https://t.co/SgkknJ4Tak #parameterizedcomplexity #approximationalgorithms #hardnessofapproximation #algorithms

[Call for Papers] Special Issue "Parameterized Complexity and Algorithms" https://t.co/sIyIzL4X0z #callforpapers #algorithms #specialissue #ParameterizedComplexity

Parameterized complexity of Exact Cover http://t.co/3925LhY3g1 #parameterizedcomplexity

A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy https://t.co/3iW19qE9yy #parameterizedcomplexity #polynomialhierarchy #fptreductions #algorithms #journal #openaccess

[Article] Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey https://t.co/3Yq1HiGY1I #integerlinearprogramming #parameterizedcomplexity #treewidth #treedepth #algorithms #journal #openaccess

📅 Next 2 of June, LAMSADE organizes a small workshop about history and future of #ParameterizedComplexity, in honour of the Doctor Honoris Causa of @Paris_Dauphine given to Mike Fellows, with great scientific talks 🔗 Registration : https://t.co/9dQOkUAM1j

Can you answer this? FPT algorithm for mixed integer program http://t.co/ZxCAwESkEZ #parameterizedcomplexity

What is the parameterized complexity of following model checking problem? http://ur.ly/Br95 #parameterizedcomplexity

Multidimensional Knapsack W[1]-hard when parameterized by dimension http://t.co/Z9Lu39cqqs #parameterizedcomplexity

Can you answer this? Algorithmic advantages of pathwidth over treewidth http://t.co/1pe6nGJYPj #parameterizedcomplexity

Any results on binary boolean CSP beyond the fixed-parameter tractability of almost 2SAT pr... http://bit.ly/qsFoDO #parameterizedcomplexity

The Discipline of Computer Science and Engineering held a workshop on 'Parameterized Complexity 301' during Dec 21-31, 2020. The full video playlist of the workshop can be accessed here. #WednesdayVideo #ParameterizedComplexity @cse_iitgn @neeldhara

#Daily_Share Welcome to read and share the newly published paper "Perfect Roman Domination: Aspects of Enumeration and Parameterization †". Read via: https://t.co/b9DNlgSwjU #enumeration; #parameterizedcomplexity #dominationingraphs #graphclasses #perfectRomandomination

The reprint of the #specialissue "New Frontiers in Parameterized Complexity and Algorithms", is now online. Edited by Prof. Dr. Frances Rosamond, Dr. Neeldhara Misra, and Dr. Meirav Zehavi. 🔗Welcome to read and share: https://t.co/TwunJmLUiK #FPT #Parameterizedcomplexity

Problem with a group as complexity parameter? http://t.co/cuYCs8pmEH #parameterizedcomplexity

Can you answer this? Polynomial kernel for $k$-FLIP SAT on $3$-CNF formulas https://t.co/OHeW5Akd9n #parameterizedcomplexity