


default search action
11th CALDAM 2025: Coimbatore, India
- Daya Ram Gaur
, Rogers Mathew
:
Algorithms and Discrete Applied Mathematics - 11th International Conference, CALDAM 2025, Coimbatore, India, February 13-15, 2025, Proceedings. Lecture Notes in Computer Science 15536, Springer 2025, ISBN 978-3-031-83437-0 - Sheikh Shakil Akhtar, Jayakrishnan Madathil, Pranabendu Misra, Geevarghese Philip:
Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set. 1-12 - Cyriac Antony, Jacob Antony, Laavanya D., Devi Yamini S:
Graceful Coloring is Computationally Hard. 13-24 - Pradeesha Ashok, Pradyun Devarakonda, Shiven Phogat, Swaroop A. Ram Rayala, J. A. Sherin:
Parameterized Complexity of Coupon Coloring of Graphs. 25-37 - S. Balamoorthy, T. Kavaskar:
Spectra of Eccentricity Matrices of Product of Graphs. 38-49 - Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen:
Almost Empty Monochromatic Polygons in Planar Point Sets. 50-59 - Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
On the Parameterized Complexity of Odd Coloring. 60-72 - Dipayan Chakraborty, Annegret Katrin Wagler:
On Full-Separating Sets in Graphs. 73-84 - D. Karthika, R. Muthucumaraswamy, Sriram Bhyravarapu, Pritesh Kumar:
Polynomial Time Algorithms for Hop Domination. 85-96 - Arun Kumar Das:
Charging Station Placement for Limited Energy Robots. 97-108 - Arun Kumar Das, Sandip Das, Sk Samim Islam, Ritam M. Mitra, Bodhayan Roy:
Multipacking in the Euclidean Metric Space. 109-120 - Madhura Dutta, Anil Maheshwari, Subhas C. Nandy:
Partial Domination in Some Geometric Intersection Graphs. 121-133 - Zhidan Feng, Henning Fernau, Kevin Mann, Indhumathi Raman, Silas Cato Sacher:
Generalized Lettericity of Graphs. 134-146 - Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi:
Polynomial-Time Algorithms for Path Cover on Trees and Graphs of Bounded Treewidth. 147-159 - Sina Ghasemi Nezhad, Maryam Moghaddas, Fahad Panolan:
Fast FPT Algorithms for Grundy Number on Dense Graphs. 160-172 - Anni Hakanen, Ville Junnila, Tero Laihonen, Havu Miikonen, Ismael G. Yero:
On a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis. 173-184 - Amirali Madani, Anil Maheshwari, Babak Miraftab, Bodhayan Roy:
Algorithms and Hardness Results for the (3, 1)-Cover Problem. 185-196 - Kevin Mann, Henning Fernau:
Extension Perfect Roman Domination. 197-209 - Jannatul Maowa, Robert Benkoczi:
A Sub-quadratic Algorithm for the Minsum One Sink Location Problem on Balanced Binary Tree Networks. 210-221 - Aakash Ghosh, Saraswati Girish Nanoti:
Two Step Graph Protection Game. 222-233 - Bhawani Sankar Panda, Subhasmita Joshi, Dalu Jacob:
Bipartite Domination in Graphs: Complexity and Algorithms. 234-246 - Santiago Valdés Ravelo, Flávio Keidi Miyazawa:
Packing Sets of Paths, Stars and Triangles: Tractability and Approximability. 247-257 - Sangam Balchandar Reddy, Anjeneya Swami Kare:
Structural Parameterization of Minus Domination. 258-269 - Pablo Romero:
An Algebraic Characterization of Strong Graphs. 270-279 - Pablo Romero:
There are Finitely Many Uniformly Most Reliable Graphs of Corank 5. 280-291 - Bijo S. Anand, Arun Anil, Manoj Changat, Revathy S. Nair, Prasanth G. Narasimha-Shenoi:
Helly Number, Radon Number and Rank in $\varDelta $-Convexity on Graphs. 292-306 - Aryan Sanghi, Devsi Bantva, Sudebkumar Prasant Pal:
Forbidden Induced Subgraphs in Iterative Higher Order Line Graphs. 307-318 - M. A. Shalu, V. K. Kirubakaran:
Total Domination and Open Packing in Two Subclasses of Triangle-Free Graphs. 319-330 - A. Subramani, K. Subramani, Piotr Wojciechowski, Sangram K. Jena:
The MASEMPR Problem and Its Applications in Logistics. 331-342 - Jinghan Xu, Zhiyuan Li:
Broadcast Graph is NP-Complete. 343-357 - Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev, Karamjeet Singh, Ji Zeng:
Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs. 358-367

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.