default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th CALDAM 2019: Kharagpur, India
- Sudebkumar Prasant Pal, Ambat Vijayakumar:
Algorithms and Discrete Applied Mathematics - 5th International Conference, CALDAM 2019, Kharagpur, India, February 14-16, 2019, Proceedings. Lecture Notes in Computer Science 11394, Springer 2019, ISBN 978-3-030-11508-1 - David M. Mount
:
New Directions in Approximate Nearest-Neighbor Searching. 1-15 - M. A. Shalu, S. Vijayakumar, T. P. Sandhya:
The Induced Star Partition of Graphs. 16-28 - Sukanya Bhattacharjee, R. Inkulu:
Fault-Tolerant Additive Weighted Geometric Spanners. 29-41 - Tameem Choudhury, R. Inkulu:
Maintaining the Visibility Graph of a Dynamic Simple Polygon. 42-52 - Deepanjan Kesh, Vidya Sagar Sharma:
On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements. 53-64 - Kalpana Mahalingam, Helda Princy Rajendran:
On m-Bonacci-Sum Graphs. 65-76 - Ranveer Singh, Naomi Shaked-Monderer, Avi Berman:
Linear Time Algorithm to Check the Singularity of Block Graphs. 77-90 - S. Francis Raj, M. Gokulnath:
b-Coloring of the Mycielskian of Regular Graphs. 91-96 - Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh:
Drawing Bipartite Graphs in Two Layers with Specified Crossings. 97-108 - Gill Barequet, Gil Ben-Shachar:
Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms. 109-123 - Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen:
On Rectangle Intersection Graphs with Stab Number at Most Two. 124-137 - B. S. Panda, Juhi Chaudhary:
Dominating Induced Matching in Some Subclasses of Bipartite Graphs. 138-149 - Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Localized Query: Color Spanning Variations. 150-160 - Devsi Bantva:
A Lower Bound for the Radio Number of Graphs. 161-173 - Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman:
Improved Descriptional Complexity Results on Generalized Forbidding Grammars. 174-188 - Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou:
On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees. 189-200 - Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. 201-215 - Supantha Pandit:
Covering and Packing of Triangles Intersecting a Straight Line. 216-230 - N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare:
H-Free Coloring on Graphs with Bounded Tree-Width. 231-244 - Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth:
The Relative Signed Clique Number of Planar Graphs is 8. 245-253 - Sandip Das, Harmender Gahlawat:
Bumblebee Visitation Problem. 254-262 - Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier:
On Graphs with Minimal Eternal Vertex Cover Number. 263-273 - Sameera Muhamed Salam, Daphna Chacko, J. Nandini Warrier, K. Murali Krishnan, K. S. Sudeep:
On Chordal and Perfect Plane Triangulations. 274-285
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-11-20 00:13 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:
