Search

Your search keyword '"Solis-Oba, Roberto"' showing total 358 results

Search Constraints

Start Over You searched for: Author "Solis-Oba, Roberto" Remove constraint Author: "Solis-Oba, Roberto"
358 results on '"Solis-Oba, Roberto"'

Search Results

151. On (Dynamic) Range Minimum Queries in External Memory

152. Universal Point Sets for Planar Three-Trees

153. Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems

154. Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles

155. Socially Stable Matchings in the Hospitals/Residents Problem

156. Parameterized Complexity of 1-Planarity

157. Smart-Grid Electricity Allocation via Strip Packing with Slicing

158. Distance-Sensitive Planar Point Location

159. The Greedy Gray Code Algorithm

160. Parameterized Enumeration of (Locally-) Optimal Aggregations

161. Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition

162. Optimal Batch Schedules for Parallel Machines

163. Dynamic Planar Point Location with Sub-logarithmic Local Updates

164. Two-Sided Boundary Labeling with Adjacent Sides

165. Neighborhood-Preserving Mapping between Trees

166. When Is Weighted Satisfiability FPT?

167. Tight Bounds for Low Dimensional Star Stencils in the External Memory Model

168. Bounding the Running Time of Algorithms for Scheduling and Packing Problems

169. Blame Trees

170. Compressed Persistent Index for Efficient Rank/Select Queries

171. Approximation Algorithms for B 1-EPG Graphs

172. Hierarchies of Predominantly Connected Communities

173. Finding the Minimum-Weight k-Path

174. Combinatorial Pair Testing: Distinguishing Workers from Slackers

175. Planar Packing of Binary Trees

176. Joint Cache Partition and Job Assignment on Multi-core Processors

177. A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs

178. Bundling Three Convex Polygons to Minimize Area or Perimeter

179. Optimal Time-Convex Hull under the L p Metrics

180. Lift-and-Project Methods for Set Cover and Knapsack

181. Plane 3-trees: Embeddability and Approximation : (Extended Abstract)

182. Trajectory Grouping Structure

183. Treewidth and Pathwidth Parameterized by the Vertex Cover Number

184. On Explaining Integer Vectors by Few Homogenous Segments

185. Visibility and Ray Shooting Queries in Polygonal Domains

186. Relative Interval Analysis of Paging Algorithms on Access Graphs

187. Beacon-Based Algorithms for Geometric Routing

188. On Maximum Weight Objects Decomposable into Based Rectilinear Convex Objects

189. Interval Selection with Machine-Dependent Intervals

190. On the Spanning Ratio of Theta-Graphs

191. Fingerprints in Compressed Strings

192. Online Control Message Aggregation in Chain Networks

193. Better Space Bounds for Parameterized Range Majority and Minority

194. On the Stretch Factor of the Theta-4 Graph

195. Learning in Stochastic Machine Scheduling

196. Optimization over Integers with Robustness in Cost and Few Constraints

197. A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption

198. Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs

199. Single Approximation for Biobjective Max TSP

200. An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems

Catalog

Books, media, physical & digital resources