![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
2nd CALDAM 2016: Thiruvananthapuram, India
- Sathish Govindarajan, Anil Maheshwari:
Algorithms and Discrete Applied Mathematics - Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings. Lecture Notes in Computer Science 9602, Springer 2016, ISBN 978-3-319-29220-5 - Surender Baswana:
Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk). 1-13 - Md. Shafiul Alam, Asish Mukhopadhyay:
Algorithms for Problems on Maximum Density Segment. 14-25 - Fouzul Atik, Pratima Panigrahi:
Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs. 26-36 - Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy:
Color Spanning Objects: Algorithms and Hardness Results. 37-48 - Devsi Bantva
:
On Hamiltonian Colorings of Trees. 49-60 - Cristina Bazgan, Ljiljana Brankovic
, Katrin Casel, Henning Fernau
:
On the Complexity Landscape of the Domination Chain. 61-72 - Mikhail V. Berlinkov
:
On the Probability of Being Synchronizable. 73-84 - Binay Bhattacharya, Sandip Das, Tsunehiko Kameda:
Linear-Time Fitting of a k-Step Function. 85-96 - Olivier Bodini, Julien David, Philippe Marchal:
Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications. 97-114 - Manoj Changat
, Ferdoos Hossein Nezhad
, Narayanan Narayanan
:
Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions. 115-125 - Sandip Das, Ayan Nandy, Swami Sarvottamananda:
Linear Time Algorithms for Euclidean 1-Center in \mathfrak R^d with Non-linear Convex Constraints. 126-138 - Adrian Dumitrescu, Anirban Ghosh:
Lower Bounds on the Dilation of Plane Spanners. 139-151 - Adrian Dumitrescu, Anirban Ghosh:
Lattice Spanners of Low Degree. 152-163 - Pavel G. Emelyanov:
AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables. 164-175 - Daya Ram Gaur
, Apurva Mudgal, Rishi Ranjan Singh:
Approximation Algorithms for Cumulative VRP with Stochastic Demands. 176-189 - Adarsh K. Handa, Aloysius Godinho, Tarkeshwar Singh:
Some Distance Antimagic Labeled Graphs. 190-200 - Hovhannes A. Harutyunyan, Zhiyuan Li:
A New Construction of Broadcast Graphs. 201-211 - Ramesh K. Jallu
, Gautam K. Das:
Improved Algorithm for Maximum Independent Set on Unit Disk Graph. 212-223 - T. Karthick:
Independent Sets in Classes Related to Chair-Free Graphs. 224-232 - Jasbir Kaur, Sucheta Dutt, Ranjeet Sehmi:
Cyclic Codes over Galois Rings. 233-239 - Manoj Changat
, Kannan Balakrishnan, R. Ram Kumar, G. N. Prasanth, A. Sreekumar:
On the Center Sets of Some Graph Classes. 240-253 - Nibedita Mandal
, Pratima Panigrahi:
On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices. 254-263 - Robin Milosz, Sylvie Hamel
:
Medians of Permutations: Building Constraints. 264-276 - Arti Pandey, B. S. Panda:
b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results. 277-288 - Jessica Pereira, Tarkeshwar Singh, S. Arumugam
:
m-Gracefulness of Graphs. 289-298 - R. Jayagopal
, Indra Rajasingh, R. Sundara Rajan
:
Domination Parameters in Hypertrees. 299-307 - Madhu Illuri, P. Renjith
, N. Sadagopan:
Complexity of Steiner Tree in Split Graphs - Dichotomy Results. 308-325 - Sandip Das, Prantar Ghosh, Swathyprabhu Mj, Sagnik Sen:
Relative Clique Number of Planar Signed Graphs. 326-336 - M. A. Shalu, T. P. Sandhya
:
The cd-Coloring of Graphs. 337-348 - H. P. Patil, V. Raja:
Characterizations of H-graphs. 349-356 - Seethu Varghese, Ambat Vijayakumar:
On the Power Domination Number of Graph Products. 357-367
![](https://dblp.org/img/cog.dark.24x24.png)
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.