default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th CALDAM 2023: Gandhinagar, India
- Amitabha Bagchi
, Rahul Muthu:
Algorithms and Discrete Applied Mathematics - 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, Proceedings. Lecture Notes in Computer Science 13947, Springer 2023, ISBN 978-3-031-25210-5
Algorithms and Optimization
- Pranjal Dutta, Mahesh Sreekumar Rajasree:
Efficient Reductions and Algorithms for Subset Product. 3-14 - K. Subramani, Piotr Wojciechowski:
Optimal Length Cutting Plane Refutations of Integer Programs. 15-27 - Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam:
Fault-Tolerant Dispersion of Mobile Robots. 28-40 - Leila Karimi, Vijay Adoni, Daya Ram Gaur:
Resource Management in Device-to-Device Communications. 41-55
Computational Geometry
- Vishwanath R. Singireddy, Manjanna Basappa, Joseph S. B. Mitchell:
Algorithms for k-Dispersion for Points in Convex Position in the Plane. 59-70 - Sukanya Maji, Sanjib Sadhu:
Arbitrary-Oriented Color Spanning Region for Line Segments. 71-86
Game Theory
- Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda:
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane. 89-100 - Harshil Mittal, Saraswati Nanoti, Aditi Sethia:
Diverse Fair Allocations: Complexity and Algorithms. 101-117
Graph Coloring
- Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. 121-133 - Niranjan Balachandran, Brahadeesh Sankarnarayanan:
5-List Coloring Toroidal 6-Regular Triangulations in Linear Time. 134-146 - Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
On Locally Identifying Coloring of Graphs. 147-158 - Sriram Bhyravarapu, I. Vinod Reddy:
On Structural Parameterizations of Star Coloring. 159-171 - T. Kavaskar:
Perfectness of G-generalized Join of Graphs. 172-183 - Reji Thankachan, Pavithra Rajamani:
On Coupon Coloring of Cayley Graphs. 184-191 - Athmakoori Prashant, S. Francis Raj:
Coloring of a Superclass of 2K2-free graphs. 192-203 - Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille:
The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures. 204-215
Graph Connectivity
- A. Mohanapriya, P. Renjith, N. Sadagopan:
Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs. 219-230 - Vineet Malik, Sushanta Karmakar:
Some Insights on Dynamic Maintenance of Gomory-Hu Tree in Cactus Graphs and General Graphs. 231-244 - Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana:
Monitoring Edge-Geodetic Sets in Graphs. 245-256 - Niranjan Balachandran, Anish Hebbar:
Cyclability, Connectivity and Circumference. 257-268
Graph Domination
- Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Katrin Wagler:
On Three Domination-Based Identification Problems in Block Graphs. 271-283 - Gopika Sharma, Arti Pandey:
Computational Aspects of Double Dominating Sequences in Graphs. 284-296 - Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee:
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs. 297-308 - Sandip Das, Harmender Gahlawat, Ashwin Ramgopal, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on Oriented Graphs with Respect to Push Operation. 309-320 - Moritz Beck, Joachim Spoerhase, Sabine Storandt:
Mind the Gap: Edge Facility Location Problems in Theory and Practice. 321-334 - Kusum, Arti Pandey:
Complexity Results on Cosecure Domination in Graphs. 335-347
Graph Matching
- Akihiro Yamamura:
Latin Hexahedra and Related Combinatorial Structures. 351-362 - B. S. Panda, Sachin:
Algorithms and Complexity of Strongly Stable Non-crossing Matchings. 363-376 - Juhi Chaudhary, Sounaka Mishra, B. S. Panda:
Minimum Maximal Acyclic Matching in Proper Interval Graphs. 377-388
Graph Partition and Graph Covering
- Subhabrata Paul, Kamal Santra:
Transitivity on Subclasses of Chordal Graphs. 391-402 - R. Sundara Rajan, Remi Mariam Reji, T. M. Rajalaxmi:
Maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength. 403-414 - Barun Gorain, Shaswati Patra, Rishi Ranjan Singh:
Graph Covering Using Bounded Size Subgraphs. 415-426 - Lekshmi Kamal K. Sheela, Manoj Changat, Iztok Peterin:
Axiomatic Characterization of the Toll Walk Function of Some Graph Classes. 427-446 - Sangam Balchandar Reddy, Anjeneya Swami Kare:
Structural Parameterization of Alliance Problems. 447-459
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 2025-02-26 00:00 CET 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:
