default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th CALDAM 2018: Guwahati, India
- B. S. Panda, Partha P. Goswami:
Algorithms and Discrete Applied Mathematics - 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings. Lecture Notes in Computer Science 10743, Springer 2018, ISBN 978-3-319-74179-6 - Andreas Brandstädt:
Efficient Domination and Efficient Edge Domination: A Brief Survey. 1-14 - Ashok Kumar Das, Rajkamal Sahu:
Mixed Unit Interval Bigraphs. 15-29 - Pazhaniappan Renjith
, Narasimhan Sadagopan:
Hamiltonian Path in K_1, t -free Split Graphs- A Dichotomy. 30-44 - Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr Wojciechowski:
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. 45-58 - Bodo Manthey, Victor M. J. J. Reijnders:
Probabilistic Properties of Highly Connected Random Geometric Graphs. 59-72 - P. Francis, S. Francis Raj, M. Gokulnath:
On Indicated Coloring of Some Classes of Graphs. 73-80 - Manjanna Basappa:
Line Segment Disk Cover. 81-92 - Aritra Banik, Pratibha Choudhary:
Fixed-Parameter Tractable Algorithms for Tracking Set Problems. 93-104 - Subrahmanyam Kalyanasundaram, Kenneth W. Regan:
Exact Computation of the Number of Accepting Paths of an NTM. 105-117 - Arpana Garg, Sucheta Dutt:
Determining Minimal Degree Polynomials of a Cyclic Code of Length 2^k over \mathbb Z_8. 118-130 - Kamyar Khodamoradi, Ramesh Krishnamurti, Bodhayan Roy:
Consistent Subset Problem with Two Labels. 131-142 - Bijo S. Anand, Manoj Changat, S. V. Ullas Chandran:
The Edge Geodetic Number of Product Graphs. 143-154 - Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen:
Burning Spiders. 155-163 - Myroslav Kryven, Alexander Ravsky, Alexander Wolff:
Drawing Graphs on Few Circles and Few Spheres. 164-178 - Devsi Bantva:
On a Lower Bound for the Eccentric Connectivity Index of Graphs. 179-187 - Saurabh Joshi, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Sriram Bhyravarapu:
On the Tractability of (k, i)-Coloring. 188-198 - Farah Chanchary, Anil Maheshwari, Michiel H. M. Smid:
Window Queries for Problems on Intersecting Objects and Maximal Points. 199-213 - Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr:
Bounded Stub Resolution for Some Maximal 1-Planar Graphs. 214-220 - Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy:
On Structural Parameterizations of Firefighting. 221-234 - Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer:
On the Simultaneous Minimum Spanning Trees Problem. 235-248 - Sandip Das, Harmender Gahlawat:
Variations of Cops and Robbers Game on Grids. 249-259 - Krishnamoorthy Dinesh, Jayalal Sarma:
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps. 260-273 - Sandip Das, Soumen Nandi, Sagnik Sen:
On Oriented L(p, 1)-labeling. 274-282 - Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions. 283-300
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 2026-04-26 00:08 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:
