573 results on '"Sau, Ignasi"'
Search Results
152. On approximating the [formula omitted]-girth of a graph
153. Asymptotic enumeration of non-crossing partitions on surfaces
154. Uniquely Restricted Matchings and Edge Colorings
155. On the Number of Labeled Graphs of Bounded Treewidth
156. On the approximability of some degree-constrained subgraph problems
157. GMPLS label space minimization through hypergraph layouts
158. Simpler multicoloring of triangle-free hexagonal graphs
159. Parameterized complexity of finding small degree-constrained subgraphs
160. k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
161. Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
162. Reducing the Vertex Cover Number via Edge Contractions
163. Faster parameterized algorithms for minor containment
164. On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs
165. Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability
166. On the Complexity of Computing the k-restricted Edge-connectivity of a Graph
167. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
168. Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
169. A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps
170. Hamiltonicity below Dirac’s condition
171. Parameterized Domination in Circle Graphs
172. Hardness and approximation of traffic grooming
173. FPT algorithms for packing $k$-safe spanning rooted sub(di)graphs
174. An FPT 2-Approximation for Tree-cut Decomposition
175. An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r
176. Maximum cuts in edge-colored graphs
177. A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover
178. An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes
179. A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover
180. Improved FPT Algorithms for Weighted Independent Set in Bull-Free Graphs
181. The Role of Planarity in Connectivity Problems Parameterized by Treewidth
182. Coloring Problems on Bipartite Graphs of Small Diameter
183. A unifying model for locally constrained spanning tree problems
184. Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions
185. Parameterized Domination in Circle Graphs
186. On Approximating the d-Girth of a Graph
187. Hitting and Harvesting Pumpkins
188. Traffic Grooming in Star Networks via Matching Techniques
189. Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph
190. Designing Hypergraph Layouts to GMPLS Routing Strategies
191. Dynamic Programming for Graphs on Surfaces
192. A New Intersection Model and Improved Algorithms for Tolerance Graphs
193. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
194. Fast Minor Testing in Planar Graphs
195. Permutation Routing and (ℓ, k)-Routing on Plane Grids
196. Traffic Grooming: Combinatorial Results and Practical Resolutions
197. MPLS Label Stacking on the Line Network
198. Degree-Constrained Subgraph Problems: Hardness and Approximation Results
199. Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
200. On the complexity of finding large odd induced subgraphs and odd colorings
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.