Liar’s dominating set problem on unit disk graphs von Jallu, Ramesh K., Das, Gautam K.

Volltext

Efficient independent set approximation in unit disk graphs von Das, Gautam K., da Fonseca, Guilherme D., Jallu, Ramesh K.

Volltext

Capacitated discrete unit disk cover von Mishra, Pawan K., Jena, Sangram K., Das, Gautam K., Rao, S.V.

Volltext

WALCOM: Algorithms and Computation : 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings von Das, Gautam K, Mandal, Partha S, Mukhopadhyaya, Krishnendu, Nakano, Shin-ichi

Volltext

Approximation algorithms for maximum independent set of a unit disk graph von Das, Gautam K., De, Minati, Kolay, Sudeshna, Nandy, Subhas C., Sur-Kolay, Susmita

Volltext

r-Gatherings on a Star von Ahmed, Shareef, Nakano, Shin-ichi, Rahman, Md. Saidur

Volltext

Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem von Kumabe, Soh, Maehara, Takanori, Sin’ya, Ryoma

Volltext

WALCOM: Algorithms and Computation: 13th International Conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, Proceedings

Volltext

Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems von Borle, Ajinkya, Lomonaco, Samuel J.

Volltext

Vertex-edge domination in unit disk graphs von Jena, Sangram K., Das, Gautam K.

Volltext

Intelligence Enabled Research: DoSIER 2021 von Bhattacharyya, Siddhartha, Das, Gautam, De, Sourav

Volltext

Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots von Bose, Kaustav, Adhikary, Ranendu, Kundu, Manash Kumar, Sau, Buddhadeb

Volltext

Efficient algorithm for placing a given number of base stations to cover a convex region von Das, Gautam K., Das, Sandip, Nandy, Subhas C., Sinha, Bhabani P.

Volltext

(k,p)-Planarity: A Relaxation of Hybrid Planarity von Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Randolph, Timothy W., Tappini, Alessandra

Volltext

Flat-Foldability for 1 × n Maps with Square/Diagonal Grid Patterns von Jia, Yiyang, Kanamori, Yoshihiro, Mitani, Jun

Volltext

A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract) von Sarker, Anik, Sung, Wing-kin, Rahman, M. Sohel

Volltext

Graph Profile Realizations and Applications to Social Networks von Bar-Noy, Amotz, Choudhary, Keerti, Peleg, David, Rawitz, Dror

Volltext

Weighted Upper Edge Cover: Complexity and Approximability von Khoshkhah, Kaveh, Ghadikolaei, Mehdi Khosravian, Monnot, Jérôme, Sikora, Florian

Volltext

On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs von Venkatakrishnan, Y. B., Naresh Kumar, H.

Volltext

A Two Query Adaptive Bitprobe Scheme Storing Five Elements von Baig, Mirza Galib Anwarul Husain, Kesh, Deepanjan, Sodani, Chirag

Volltext