


default search action
12th CALDAM 2026: Dharwad, India
- Neeldhara Misra

, Arti Pandey
:
Algorithms and Discrete Applied Mathematics - 12th International Conference, CALDAM 2026, Dharwad, India, February 12-14, 2026, Proceedings. Lecture Notes in Computer Science 16445, Springer 2026, ISBN 978-3-032-17155-9 - Rajat Adak, L. Sunil Chandran

:
Localization: A Framework to Generalize Extremal Graph Problems. 1-15 - Deepak M. Bakal, Y. M. Borse

:
Complexity Results on Paired Domination in Cubic Graphs. 16-28 - Rajashree Bar, Daibik Barik

, Adri Bhattacharya
, Partha Sarathi Mandal
:
Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents. 29-42 - Sergey Bereg, Md Sanaullah Miah, Md Saiful Islam:

New Lower Bounds for Permutation Codes in the Ulam Metric. 43-56 - Sergey Bereg, Jack N. Truong:

Constructing Permutation Codes Under the Generalized Kendall-τ Metric. 57-70 - Srimanta Bhattacharya, Pawan Kumar, Deepak Rajendraprasad

, Jishnu Sen
:
On Optimal Achromatic Coloring of 3-Uniform Tight Cycles. 71-83 - Andrew Bloch-Hansen, Cody Rossiter, Roberto Solis-Oba:

A Resonance Neural Network for the K-Median Problem. 84-95 - Clemens Brand, Wilfried Imrich

:
Prime Factorization of Hierarchical Products of Infinite Graphs. 96-105 - Manoj Changat, Lekshmi Kamal K. Sheela, Athulyakrishna Kuruppankandy, T. V. Ramakrishnan:

Cycle Transit Function, Interval Function and Betweenness. 106-119 - Prasad Chaugule:

A New Characterization of sf VNP via Colored Determinant. 120-134 - Rahul Das, Soumen Nandi, Ushnish Sarkar:

Lower Bounds of Location Numbers. 135-146 - Tapas Das, Pavan P. D, Sagnik Sen, S. Taruni:

An Update on Pushable Homomorphisms. 147-164 - Debasis Dwibedy, Rakesh Mohanty:

Semi-online Scheduling with Look-Ahead. 165-178 - Florent Foucaud

, Narges Ghareghani, Lucas Lorieau
, Morteza Mohammad Noori, Rasa Parvini Oskuei, Prafullkumar Tale
:
Algorithms and Hardness for Geodetic Set on Tree-Like Digraphs. 179-193 - Suchanda Roy, Ramesh Hariharasubramanian:

On the Word-Representability of 5-Regular Circulant Graphs. 194-208 - Lakshya Joshi, Arya Deshmukh

, Atharv Chhabra
, Chetan Gupta
:
Matrix Multiplication in the MPC Model. 209-220 - Subhasmita Joshi, Bhawani Sankar Panda:

Complexity and Approximation Algorithm of 3-Component Domination in Graphs. 221-235 - Lekshmi Kamal K. Sheela, Manoj Changat, M. R. Chithra, Peter F. Stadler:

Directed Weakly Modular Graphs and Their Directed Interval Functions. 236-249 - Benny George Kenkireth, Gopalan Sajith, Sreyas Sasidharan:

On Word-Representability of Minimal Non-comparability Graphs. 250-263 - Yash Khanna:

Exact Recovery of Planted Cliques in Semi-random Graphs. 264-277 - Mark Korenblit:

Algebraic Expressions of Grid Graphs with Diagonal Edges. 278-292 - S. Anil Kumar, N. S. Narayanaswamy:

Parameterized Hardness Results for the Restricted Santa Claus Problem. 293-306 - Bubai Manna:

Minimum Selective Subset on Unit Disk Graphs and Circle Graphs. 307-320 - Khyodeno Mozhui

, Tithi Dwary
:
Boxicity of a Class of Split Graphs Using Words. 321-335 - Joydeep Mukherjee, Tamojit Saha:

Subset Feedback Vertex Set and Subset Vertex Cover on AT-Free Graphs. 336-350 - Joydeep Mukherjee, Tamojit Saha:

Outer-Planar Vertex Deletion on AT-Free Graphs. 351-364 - Krishna Narayanan

, Tamon Stephen
:
The Hardness of Monotone Eccentricity on Polytopes. 365-377 - Joydeep Patar, I. Vinod Reddy:

On Odd Coloring of Graphs. 378-391 - Alessandra A. Pereira

, C. N. Campos
:
Matching Extendability in Cartesian Product of Hypercubes and Paths. 392-403 - Alessandra A. Pereira

, C. N. Campos
:
Extending Unlocked Matchings in Graphs. 404-415 - Nhat-Quan Lam, Huu-An Phan, Duc A. Hoang:

A Note on Reconfiguration Graphs of Cliques. 416-427 - Kumud Singh Porte, R. B. Sandeep

, Kamal Santra:
Improved Upper Bounds on Color Reversal by Local Inversions. 428-441 - Sangam Balchandar Reddy

:
Hardness and Algorithmic Results for Roman {3}-Domination. 442-456 - Sasmita Rout, Gautam Kumar Das:

Hardness and Approximation Results on the Total Dominating Set Problem. 457-470 - Ravi Suthar, Raveena Chahar, Krishnendra Shekhawat:

Area-Universality in Outerplanar Graphs. 471-484

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














