default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 280
Volume 280, June 2020
- Sathish Govindarajan, Anil Maheshwari:
Preface: CALDAM 2016. 1 - Niranjan Balachandran, Rogers Mathew
, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Bisecting and D-secting families for set systems. 2-13 - Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy:
Color spanning objects: Algorithms and hardness results. 14-22 - Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau:
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. 23-42 - Binay Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-time fitting of a k-step function. 43-52 - Manoj Changat, Ferdoos Hossein Nezhad, N. Narayanan:
Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations. 53-62 - Gautam K. Das, Guilherme Dias da Fonseca, Ramesh K. Jallu:
Efficient independent set approximation in unit disk graphs. 63-70 - Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Linear time algorithms for Euclidean 1-center in ℜd with non-linear convex constraints. 71-85 - Sandip Das, Prantar Ghosh, Swathy Prabhu, Sagnik Sen:
Relative clique number of planar signed graphs. 86-92 - S. Dhanalakshmi, N. Sadagopan:
On strictly chordality-k graphs. 93-112 - Pavel G. Emelyanov, Denis K. Ponomaryov:
The complexity of AND - decomposition of Boolean functions. 113-132 - Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh:
Improved approximation algorithms for cumulative VRP with stochastic demands. 133-143 - Hovhannes A. Harutyunyan, Zhiyuan Li:
A new construction of broadcast graphs. 144-155 - Jasbir Kaur, Sucheta Dutt, Ranjeet Sehmi:
On cyclic codes over Galois rings. 156-161 - Jasbir Kaur, Ranjeet Sehmi, Sucheta Dutt:
Reversible complement cyclic codes over Galois rings with application to DNA codes. 162-170 - M. A. Shalu, S. Vijayakumar, Sandhya T. P.:
On the complexity of cd-coloring of graphs. 171-185 - Nibedita Mandal, Pratima Panigrahi:
L(2, 1)-colorings and irreducible no-hole colorings of the direct product of graphs. 186-200 - Robin Milosz, Sylvie Hamel:
Space reduction constraints for the median of permutations problem. 201-213 - Jessica Pereira, Tarkeshwar Singh, S. Arumugam:
Edge consecutive gracefulness of a graph. 214-220 - R. Sundara Rajan, T. M. Rajalaxmi, Jia-Bao Liu, G. Sethuraman:
Wirelength of embedding complete multipartite graphs into certain graphs. 221-236 - Indra Rajasingh, R. Jayagopal, R. Sundara Rajan:
Domination parameters in hypertrees and sibling trees. 237-245 - P. Renjith, N. Sadagopan:
The Steiner tree in K1, r-free split graphs - A Dichotomy. 246-255
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-01-03 23:18 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:
