


default search action
1st CALDAM 2015: Kanpur, India
- Sumit Ganguly, Ramesh Krishnamurti:

Algorithms and Discrete Applied Mathematics - First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. Lecture Notes in Computer Science 8959, Springer 2015, ISBN 978-3-319-14973-8 - C. R. Subramanian:

Probabilistic Arguments in Graph Coloring (Invited Talk). 1-8
Approximation Algorithms
- Santiago Valdés Ravelo

, Carlos E. Ferreira:
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem. 9-20 - Puspal Bhabak, Hovhannes A. Harutyunyan:

Constant Approximation for Broadcasting in k-cycle Graph. 21-32
Computational Geometry
- Md. Shafiul Alam, Asish Mukhopadhyay:

Three Paths to Point Placement. 33-44 - Pritam Bhattacharya

, Subir Kumar Ghosh, Bodhayan Roy:
Vertex Guarding in Weak Visibility Polygons. 45-57 - Adrian Dumitrescu, Anirban Ghosh, Masud Hasan:

On Collections of Polygons Cuttable with a Segment Saw. 58-68 - Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:

Rectilinear Path Problems in Restricted Memory Setup. 69-80
Graph Theory
- T. Karthick:

New Polynomial Case for Efficient Domination in P 6-free Graphs. 81-88 - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:

Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties. 89-100 - Bhawani Sankar Panda:

Separator Theorems for Interval Graphs and Proper Interval Graphs. 101-110 - P. Francis, S. Francis Raj:

Bounds for the b-chromatic Number of Induced Subgraphs and G - e. 111-116 - Ashok Kumar Das, Ritapa Chakraborty:

New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs. 117-125 - Rohan Sharma, Bibhas Adhikari

, Abhishek Mishra
:
On Spectra of Corona Graphs. 126-137 - Manoj Changat, Divya Sindhu Lekha

, Henry Martyn Mulder
, Ajitha R. Subhamathi:
Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs. 138-149 - N. S. Narayanaswamy, Anju Srinivasan:

Tree Path Labeling of Hypergraphs - A Generalization of the Consecutive Ones Property. 150-156 - Sujoy Kumar Bhore, Dibyayan Chakraborty

, Sandip Das, Sagnik Sen:
On a Special Class of Boxicity 2 Graphs. 157-168 - Arti Pandey, Bhawani Sankar Panda:

Domination in Some Subclasses of Bipartite Graphs. 169-180
Computational Complexity
- Ankit Chauhan, B. V. Raghavendra Rao

:
Parameterized Analogues of Probabilistic Computation. 181-192 - Mark Korenblit:

Algebraic Expressions of Rhomboidal Graphs. 193-204 - Sigve Hortemo Sæther:

Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter. 205-216
Algorithms
- Olivier Bodini, Antoine Genitrini, Frédéric Peschanski, Nicolas Rolin:

Associativity for Binary Parallel Processes: A Quantitative Study. 217-228 - Paul D. Manuel

, Indra Rajasingh
, R. Sundara Rajan, N. Parthiban
, T. M. Rajalaxmi
:
A Tight Bound for Congestion of an Embedding. 229-237 - Mindi Yuan, Wei Shen, Jun Li, Yannis Pavlidis, Shen Li:

Auction/Belief Propagation Algorithms for Constrained Assignment Problem. 238-249 - Arun K. Pujari, Venkateswara Rao Kagita

, Anubhuti Garg, Vineet Padmanabhan:
Bi-directional Search for Skyline Probability. 250-261 - Daya Ram Gaur, Rishi Ranjan Singh:

Cumulative Vehicle Routing Problem: A Column Generation Approach. 262-274 - Barun Gorain, Partha Sarathi Mandal:

Energy Efficient Sweep Coverage with Mobile and Static Sensors. 275-285 - Apurba Sarkar, Arindam Biswas, Mousumi Dutt, Arnab Bhattacharya:

Generation of Random Digital Curves Using Combinatorial Techniques. 286-297

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














