Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings > Rectilinear Path Problems in Restricted Memory Setup
Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings |
Sumit Ganguly; Ramesh Krishnamurti
Springer International Publishing
Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings
Rectilinear Path Problems in Restricted Memory Setup
Authors

Binay K. Bhattacharya; Minati De; Anil Maheswari; Subhas C. Nandy; Sasanka Roy

ARI Id

1664853177713_3786832

Access

Not Available Free

Pages

69-80

DOI

10.1007/978-3-319-14974-5_7

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-319-14974-5_7

Table of Contents of Book
Showing 1 to 20 of 29 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Probabilistic Arguments in Graph Coloring (Invited Talk)
C. R. Subramanian
1-8
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
Santiago V. Ravelo; Carlos E. Ferreira
9-20
Constant Approximation for Broadcasting in k-cycle Graph
Puspal Bhabak; Hovhannes A. Harutyunyan
21-32
Three Paths to Point Placement
Md. Shafiul Alam; Asish Mukhopadhyay
33-44
Vertex Guarding in Weak Visibility Polygons
Pritam Bhattacharya; Subir Kumar Ghosh; Bodhayan Roy
45-57
On Collections of Polygons Cuttable with a Segment Saw
Adrian Dumitrescu; Anirban Ghosh; Masud Hasan
58-68
Rectilinear Path Problems in Restricted Memory Setup
Binay K. Bhattacharya; Minati De; Anil Maheswari; Subhas C. Nandy; Sasanka Roy
69-80
New Polynomial Case for Efficient Domination in P 6-free Graphs
T. Karthick
81-88
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
Ahmad Biniaz; Anil Maheshwari; Michiel Smid
89-100
Separator Theorems for Interval Graphs and Proper Interval Graphs
B. S. Panda
101-110
Bounds for the b-chromatic Number of Induced Subgraphs and G − e
P. Francis; S. Francis Raj
111-116
New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs
Ashok Kumar Das; Ritapa Chakraborty
117-125
On Spectra of Corona Graphs
Rohan Sharma; Bibhas Adhikari; Abhishek Mishra
126-137
Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs
Manoj Changat; Divya Sindhu Lekha; Henry Martyn Mulder; Ajitha R. Subhamathi
138-149
Tree Path Labeling of Hypergraphs – A Generalization of the Consecutive Ones Property
N. S. Narayanaswamy; Anju Srinivasan
150-156
On a Special Class of Boxicity 2 Graphs
Sujoy Kumar Bhore; Dibyayan Chakraborty; Sandip Das; Sagnik Sen
157-168
Domination in Some Subclasses of Bipartite Graphs
Arti Pandey; B. S. Panda
169-180
Parameterized Analogues of Probabilistic Computation
Ankit Chauhan; B. V. Raghavendra Rao
181-192
Algebraic Expressions of Rhomboidal Graphs
Mark Korenblit
193-204
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 29 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings