default search action
Discrete Applied Mathematics, Volume 228
Volume 228, September 2017
- Sumit Ganguly, Ramesh Krishnamurti:
Preface: CALDAM 2015. 1-2 - Hilal A. Ganie, Shariefuddin Pirzada:
On the bounds for signless Laplacian energy of a graph. 3-13 - Rohan Sharma, Bibhas Adhikari, Abhishek Mishra:
Structural and spectral properties of corona graphs. 14-31 - Sandip Das, Sasthi C. Ghosh, Soumen Nandi:
Optimal L(3, 2, 1)-labeling of triangular lattice. 32-40 - Ashok Kumar Das, Ritapa Chakraborty:
Graphs and digraphs represented by intervals and circular arcs. 41-49 - Manoj Changat, Divya Sindhu Lekha, Shilpa Mohandas, Henry Martyn Mulder, Ajitha R. Subhamathi:
Axiomatic characterization of the median and antimedian function on a complete graph minus a matching. 50-59 - Mark Korenblit:
Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs. 60-72 - Ajit A. Diwan:
P3-decomposition of directed graphs. 73-79 - Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear path problems in restricted memory setup. 80-87 - Sigve Hortemo Sæther:
Solving Hamiltonian Cycle by an EPT algorithm for a non-sparse parameter. 88-97 - Adrian Dumitrescu, Anirban Ghosh, Masud Hasan:
Cutting out polygon collections with a saw. 98-108 - Pritam Bhattacharya, Subir Kumar Ghosh, Bodhayan Roy:
Approximability of guarding weak visibility polygons. 109-129 - Barun Gorain, Partha Sarathi Mandal:
Solving energy issues for sweep coverage in wireless sensor networks. 130-139 - Daya Ram Gaur, Rishi Ranjan Singh:
A heuristic for cumulative vehicle routing using column generation. 140-157 - Santiago Valdés Ravelo, Carlos Eduardo Ferreira:
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. 158-175
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.