Skip to content
Log in
Sponsored AI Networking Cookbook: Practical recipes for AI-assisted network automation and development AI Networking Cookbook: Practical recipes for AI-assisted network automation and development

Author

Ajinkya Gaikwad

View on Semantic Scholar

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Parameterized Complexity of Edge-Constrained Graph Partitioning

We study the Edge-Constrained Graph Partitioning Problem (ECGP), which asks whether the vertices of a graph can be partitioned into r parts, each inducing at least gamma edges. We also consider a balanced variant (BECGP), requiring equal-sized parts, and signed variants, where the utility of a part is the difference be...

Ajinkya Gaikwad, Jan Pokorný, T. Valla · 0 citations
Preprint Sep 2026

Kernelization of 2-Club Cluster Edge Deletion on Interval Graphs

The \emph{$s$-Club Cluster Edge Deletion} problem asks whether, given a graph $G$ and an integer $k$, one can delete at most $k$ edges so that every remaining connected component has diameter at most~$s$. This generalizes the classical \emph{Cluster Edge Deletion} problem by permitting components of bounded diameter in...

Ajinkya Gaikwad · 0 citations
Preprint Aug 2026

Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size

This work studies the parameterized complexity of the unweighted Connected Network Microaggregation problem, focusing on structural parameters and natural clustering parameters such as the distance bound and cluster size gap, and proves that the problem is NP-hard on graphs of bounded clique-width.

Ajinkya Gaikwad, Dusan Knop, T. Valla · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.