Algorithms and Discrete Applied Mathematics: 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings von Kalyanasundaram, Subrahmanyam, Maheshwari, Anil

Volltext

Conflict-Free Coloring Bounds on Open Neighborhoods von Bhyravarapu, Sriram, Kalyanasundaram, Subrahmanyam, Mathew, Rogers

Volltext

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs von Bhyravarapu, Sriram, Hartmann, Tim A., Hoang, Hung P., Kalyanasundaram, Subrahmanyam, Vinod Reddy, I.

Volltext

A Note on Even Cycles and Quasirandom Tournaments von Kalyanasundaram, Subrahmanyam, Shapira, Asaf

Volltext

A tight bound for conflict-free coloring in terms of distance to cluster von Bhyravarapu, Sriram, Kalyanasundaram, Subrahmanyam

Volltext

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs von Krishnan, Prasad, Mathew, Rogers, Kalyanasundaram, Subrahmanyam

Volltext

Algorithms and Discrete Applied Mathematics: 10th International Conference, CALDAM 2024, Bhilai, India, February 15–17, 2024, Proceedings

Volltext

The complexity of optimizing atomic congestion von Brand, Cornelius, Ganian, Robert, Kalyanasundaram, Subrahmanyam, Mc Inerney, Fionn

Volltext

Vertex partitioning problems on graphs with bounded tree width von Aravind, N.R., Kalyanasundaram, Subrahmanyam, Kare, Anjeneya Swami

Volltext

On the tractability of (k,i)-coloring von Bhyravarapu, Sriram, Joshi, Saurabh, Kalyanasundaram, Subrahmanyam, Kare, Anjeneya Swami

Volltext

A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs von Bhyravarapu, Sriram, Kalyanasundaram, Subrahmanyam, Mathew, Rogers

Volltext

A Wowzer‐type lower bound for the strong regularity lemma von Kalyanasundaram, Subrahmanyam, Shapira, Asaf

Volltext

Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity von Foucaud, Florent, Marcille, Pierre-Marie, Myint, Zin Mar, Sandeep, R. B., Sen, Sagnik, Taruni, S.

Volltext

Parameterized complexity of happy coloring problems von Agrawal, Akanksha, Aravind, N.R., Kalyanasundaram, Subrahmanyam, Kare, Anjeneya Swami, Lauri, Juho, Misra, Neeldhara, Reddy, I. Vinod

Volltext

Star Covers and Star Partitions of Cographs and Butterfly-free Graphs von Mondal, Joyashree, Vijayakumar, S.

Volltext

Improved Algorithms for Minimum-Membership Geometric Set Cover von Govindarajan, Sathish, Sarkar, Siddhartha

Volltext

On Star Partition of Split Graphs von Divya, D., Vijayakumar, S.

Volltext

Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods von Bhyravarapu, Sriram, Kalyanasundaram, Subrahmanyam

Volltext

The Frobenius Problem for the Proth Numbers von Srivastava, Pranjal, Thakkar, Dhara

Volltext

Geometric Covering Number: Covering Points with Curves von Bishnu, Arijit, Francis, Mathew, Majumder, Pritam

Volltext