377 results on '"Chandran, L. Sunil"'
Search Results
102. On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
103. Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
104. Separation Dimension of Graphs and Hypergraphs
105. Refined Memorisation for Vertex Cover
106. On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts
107. Approximations for ATSP with Parametrized Triangle Inequality
108. On the Number of Minimum Cuts in a Graph
109. A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph
110. Edge Connectivity vs Vertex Connectivity in Chordal Graphs
111. Perfect Matchings and Quantum Physics: Progress on Krenn's Conjecture
112. Upper bounding rainbow connection number by forest number.
113. A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles
114. Lower bounds for boxicity
115. Rainbow Connection Number of Graph Power and Graph Products
116. Boxicity of line graphs
117. Rainbow Connection Number and Radius
118. Boxicity and cubicity of asteroidal triple free graphs
119. Hadwiger’s conjecture for proper circular arc graphs
120. On the SIG-Dimension of Trees Under the L ∞-Metric
121. Cubicity and Bandwidth
122. Boxicity and Separation Dimension
123. Boxicity of Circular Arc Graphs
124. Chordal Bipartite Graphs with High Boxicity
125. Boxicity of Leaf Powers
126. Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes
127. On the Structure of Contractible Edges in k-connected Partial k-trees
128. On the Cubicity of Interval Graphs
129. Combinatorial Lower Bounds for 3-Query LDCs
130. List Distinguishing Number of pth Power of Hypercube and Cartesian Powers of a Graph
131. Boxicity and cubicity of product graphs
132. Boxicity and treewidth
133. Polynomial Time and Parameterized Approximation Algorithms for Boxicity
134. Rainbow Colouring of Split and Threshold Graphs
135. A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs
136. Boxicity and Poset Dimension
137. A linear time algorithm to list the minimal separators of chordal graphs
138. On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
139. Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
140. Geometric Representation of Graphs in Low Dimension
141. Refined Memorisation for Vertex Cover
142. Approximations for ATSP with Parametrized Triangle Inequality
143. Algorithms and Bounds for Very Strong Rainbow Coloring
144. Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition
145. On Eulerian orientations of even-degree hypercubes
146. Separation dimension and sparsity
147. On additive combinatorics of permutations of ℤn
148. Upper bound on cubicity in terms of boxicity for graphs of low chromatic number
149. Inapproximability of Rainbow Colouring
150. Acyclic edge-colouring of planar graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.