Ayan Nandy

According to our database, Ayan Nandy authored at least 8 papers between 2014 and 2024.

Collaborative distances:

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

2024

Oriented total-coloring of oriented graphs.

Julien Bensmail, Sandip Das, Soumen Nandi, Ayan Nandy, Théo Pierron, Swathy Prabhu, Sagnik Sen

Discret. Math., 2024

2020

Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Discret. Appl. Math., 2020

2018

Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Outerplanar and Planar Oriented Cliques.

Ayan Nandy, Sagnik Sen, Éric Sopena

J. Graph Theory, 2016

Linear Time Algorithm for 1-Center in R^d Under Convex Polyhedral Distance Function.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Linear Time Algorithms for Euclidean 1-Center in \mathfrak R^d with Non-linear Convex Constraints.

Sandip Das, Ayan Nandy, Swami Sarvottamananda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2014

A Facility Coloring Problem in 1-D.

Sandip Das, Anil Maheshwari, Ayan Nandy, Michiel H. M. Smid

Proceedings of the Algorithmic Aspects in Information and Management, 2014