548 results on '"Sau, Ignasi"'
Search Results
152. Parameterized Domination in Circle Graphs
153. An FPT 2-Approximation for Tree-cut Decomposition
154. An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r
155. FPT algorithms for packing $k$-safe spanning rooted sub(di)graphs
156. Reducing graph transversals via edge contractions
157. Hamiltonicity below Dirac’s condition
158. Hardness and approximation of traffic grooming
159. Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs
160. The Role of Planarity in Connectivity Problems Parameterized by Treewidth
161. A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover
162. A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover
163. A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover
164. Maximum cuts in edge-colored graphs
165. Coloring Problems on Bipartite Graphs of Small Diameter
166. A unifying model for locally constrained spanning tree problems
167. An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes
168. On the complexity of finding large odd induced subgraphs and odd colorings
169. A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps
170. Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
171. Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions
172. Parameterized Domination in Circle Graphs
173. On Approximating the d-Girth of a Graph
174. Hitting and Harvesting Pumpkins
175. Traffic Grooming in Star Networks via Matching Techniques
176. Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph
177. Designing Hypergraph Layouts to GMPLS Routing Strategies
178. Dynamic Programming for Graphs on Surfaces
179. A New Intersection Model and Improved Algorithms for Tolerance Graphs
180. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
181. Fast Minor Testing in Planar Graphs
182. Permutation Routing and (ℓ, k)-Routing on Plane Grids
183. Traffic Grooming: Combinatorial Results and Practical Resolutions
184. MPLS Label Stacking on the Line Network
185. Degree-Constrained Subgraph Problems: Hardness and Approximation Results
186. Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
187. Hitting minors on bounded treewidth graphs. III. Lower bounds
188. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
189. Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds
190. On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
191. Parameterized complexity of finding a spanning tree with minimum reload cost diameter
192. A Turing kernelization dichotomy for structural parameterizations of ℱ -minor-free deletion
193. Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
194. Dual Parameterization of Weighted Coloring
195. A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth
196. Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
197. A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth
198. Dual Parameterization of Weighted Coloring
199. Maximum Cuts in Edge-colored Graphs
200. A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.