2 citations · 8 across the 13 of their papers we have counts for
23 papers
Packing Diverse Shortest Cycles
Akanksha Agrawal, Fedor V. Fomin, Petr A. Golovach +3
Bentert, Fomin, Golovach, Korhonen, Lochet, Panolan, Ramanujan, Saurabh, and Simonov (SODA 2025) initiated the parameterized study of Edge-Disjoint Shortest Cycle Packing: given a…
Path Contraction Faster than
Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov +2
A graph is contractible to a graph if there is a set , such that is isomorphic to . Here, is the graph obtained from by contracting all…
Parameterized Saga of First-Fit and Last-Fit Coloring
Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan +2
The classic greedy coloring (first-fit) algorithm considers the vertices of an input graph in a given order and assigns the first available color to each vertex in . In…
Eliminating Crossings in Ordered Graphs
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann +4
Drawing a graph in the plane with as few crossings as possible is one of the central problems in graph drawing and computational geometry. Another option is to remove the smallest…
Odd Cycle Transversal on -free Graphs in Polynomial Time
Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov +3
An independent set in a graph G is a set of pairwise non-adjacent vertices. A graph is bipartite if its vertex set can be partitioned into two independent sets. In the Odd Cycl…
Recurrent Problems in the LOCAL model
Akanksha Agrawal, John Augustine, David Peleg +1
The paper considers the SUPPORTED model of distributed computing introduced by Schmid and Suomela [HotSDN'13], generalizing the LOCAL and CONGEST models. In this framework, multipl…