Pallavi Jain

From MaRDI portal
Person:784490

Available identifiers

zbMath Open jain.pallaviMaRDI QIDQ784490

List of research outcomes





PublicationDate of PublicationType
Sparsity in covering solutions2024-05-31Paper
Max-SAT with cardinality constraint parameterized by the number of clauses2024-05-31Paper
Parameterized approximation scheme for biclique-free max \(k\)-weight SAT and max coverage2024-05-14Paper
Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules2023-12-13Paper
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs2023-10-31Paper
More effort towards multiagent knapsack2023-08-14Paper
Gehrlein stable committee with multi-modal preferences2023-07-28Paper
Circumventing connectivity for kernelization2023-03-22Paper
Exact and Approximate Digraph Bandwidth2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50923962022-07-21Paper
Scatter search for the minimum leaf spanning tree problem2022-06-22Paper
Gerrymandering on graphs: computational complexity and parameterized algorithms2022-06-01Paper
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs2022-03-29Paper
Parameterized complexity of \(d\)-hitting set with quotas2022-03-24Paper
https://portal.mardi4nfdi.de/entity/Q50051552021-08-04Paper
Exploring the Kernelization Borders for Hitting Cycles2021-08-04Paper
Committee selection with multimodal preferences2021-07-06Paper
Vertex deletion on split graphs: beyond 4-hitting set2020-10-22Paper
Conflict free version of covering problems on graphs: classical and parameterized2020-08-26Paper
Quadratic vertex kernel for split vertex deletion2020-08-03Paper
Parameterized complexity of conflict-free matchings and paths2020-05-21Paper
Vertex deletion on split graphs: beyond 4-hitting set2020-02-06Paper
Quadratic vertex kernel for split vertex deletion2020-02-06Paper
Conflict free version of covering problems on graphs: classical and parameterized2018-11-28Paper
Hitting and covering partially2018-10-04Paper
Polynomial time efficient construction heuristics for vertex separation minimization problem2018-04-10Paper
Mixed Dominating Set: a parameterized perspective2018-01-04Paper

Research outcomes over time

This page was built for person: Pallavi Jain