Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th CALDAM 2024: Bhilai, India
- Subrahmanyam Kalyanasundaram
, Anil Maheshwari:
Algorithms and Discrete Applied Mathematics - 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings. Lecture Notes in Computer Science 14508, Springer 2024, ISBN 978-3-031-52212-3
Algorithms and Complexity
- Waseem Akram, Sanjeev Saxena:
Consecutive Occurrences with Distance Constraints. 3-13 - Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra:
Parameterized Aspects of Distinct Kemeny Rank Aggregation. 14-28 - Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni:
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. 29-43 - Barun Gorain, Tanvir Kaur, Kaushik Mondal:
Distance-2-Dispersion with Termination by a Strong Team. 44-58 - Rajat Mittal, Sanjay S. Nair, Sunayana Patro:
On Query Complexity Measures and Their Relations for Symmetric Functions. 59-73
Computational Geometry
- Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam, Saumya Sen:
Growth Rate of the Number of Empty Triangles in the Plane. 77-87 - Arijit Bishnu, Mathew C. Francis, Pritam Majumder:
Geometric Covering Number: Covering Points with Curves. 88-102 - Sathish Govindarajan, Siddhartha Sarkar:
Improved Algorithms for Minimum-Membership Geometric Set Cover. 103-116 - Sasmita Rout, Gautam Kumar Das:
Semi-total Domination in Unit Disk Graphs. 117-129
Discrete Applied Mathematics
- Sajad Fathi Hafshejani, Daya Ram Gaur, Robert Benkoczi:
An Efficient Interior Point Method for Linear Optimization Using Modified Newton Method. 133-147 - Ameera Vaheeda Shanavas, Manoj Changat, Marc Hellmuth, Peter F. Stadler:
Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs. 148-161 - Pranjal Srivastava, Dhara Thakkar:
The Frobenius Problem for the Proth Numbers. 162-175
Graph Algorithms
- Kaustav Paul, Arti Pandey:
Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms. 179-193 - R. Mahendra Kumar, N. Sadagopan:
Impact of Diameter and Convex Ordering for Hamiltonicity and Domination. 194-208 - D. Divya, S. Vijayakumar:
On Star Partition of Split Graphs. 209-223 - Joyashree Mondal, S. Vijayakumar:
Star Covers and Star Partitions of Cographs and Butterfly-free Graphs. 224-238 - M. A. Shalu, V. K. Kirubakaran:
Open Packing in H-free Graphs and Subclasses of Split Graphs. 239-251
Graph Theory
- Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret Katrin Wagler:
Location-Domination Type Problems Under the Mycielski Construction. 255-269 - Aseem Dalal, B. S. Panda:
On Total Chromatic Number of Complete Multipartite Graphs. 270-285 - Lekshmi Kamal K. Sheela, Manoj Changat, Jeny Jacob:
The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability. 286-301 - T. Kavaskar, Sreelakshmi Sukumaran:
Total Coloring of Some Graph Operations. 302-312 - M. A. Shalu, Cyriac Antony:
Star Colouring of Regular Graphs Meets Weaving and Line Graphs. 313-327
a service of 
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.
last updated on 2024-04-26 18:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
