Ajaykrishnan E. S.

According to our database, Ajaykrishnan E. S. authored at least 6 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Parameterized Approximation of Rectangle Stabbing.

Huairui Chu, Ajaykrishnan E. S., Daniel Lokshtanov, Anikait Mundhra, Thomas Schibler, Xiaoyang Xu, Jie Xue

CoRR, April, 2026

Induced Minors and Coarse Tree Decompositions.

Maria Chudnovsky, Julien Codsi, Ajaykrishnan E. S., Daniel Lokshtanov

CoRR, March, 2026

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs.

Ajaykrishnan E. S., Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan

Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

2025

Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized.

Vaishali Surianarayanan, Anikait Mundhra, Ajaykrishnan E. S., Daniel Lokshtanov

Proc. ACM Manag. Data, June, 2025

Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division.

Ajaykrishnan E. S., Daniel Lokshtanov

Proceedings of the 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2025

2023

An Improved Exact Algorithm for Knot-Free Vertex Deletion.

Ajaykrishnan E. S., Soumen Maity, Abhishek Sahu, Saket Saurabh

CoRR, 2023