The following pages link to Alejandro López-Ortiz (Q255273):
Displaying 50 items.
- (Q2955029) (← links)
- (Q2965482) (← links)
- The Hausdorff core problem on simple polygons (Q2968107) (← links)
- RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS (Q2999095) (← links)
- (Q3024783) (← links)
- Robot Localization without Depth Perception (Q3046498) (← links)
- Online Parallel Heuristics and Robot Searching under the Competitive Framework (Q3046499) (← links)
- On the Discrete Unit Disk Cover Problem (Q3078392) (← links)
- Finding Hidden Independent Sets in Interval Graphs (Q3082926) (← links)
- (Q3113703) (← links)
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance (Q3183457) (← links)
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem (Q3459910) (← links)
- Fast string sorting using order-preserving compression (Q3507741) (← links)
- Parameterized Analysis of Paging and List Update Algorithms (Q3558918) (← links)
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER (Q3560062) (← links)
- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm (Q3652190) (← links)
- Online Sorted Range Reporting (Q3652203) (← links)
- Untangled Monotonic Chains and Adaptive Range Search (Q3652206) (← links)
- (Q4218409) (← links)
- (Q4411371) (← links)
- A linear lower bound on index size for text retrieval (Q4458870) (← links)
- (Q4472479) (← links)
- (Q4472971) (← links)
- Generalized streets revisited (Q4595514) (← links)
- Computing $k$-Atomicity in Polynomial Time (Q4637504) (← links)
- Arbitrary Overlap Constraints in Graph Packing Problems (Q4639933) (← links)
- LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS (Q4682162) (← links)
- (Q4801183) (← links)
- ONLINE ROUTING IN CONVEX SUBDIVISIONS (Q4818562) (← links)
- Broadcasting in Conflict-Aware Multi-channel Networks (Q4914444) (← links)
- FIFO Queueing Policies for Packets with Heterogeneous Processing (Q4916048) (← links)
- On the Sublinear Processor Gap for Parallel Architectures (Q4922126) (← links)
- (Q4952695) (← links)
- A Parameterized Algorithm for Packing Overlapping Subgraphs (Q4981171) (← links)
- Walking streets faster (Q5054825) (← links)
- Going home through an unknown street (Q5057428) (← links)
- Position-independent near optimal searching and on-line recognition in star polygons (Q5096946) (← links)
- (Q5104357) (← links)
- Efficient Online Strategies for Renting Servers in the Cloud (Q5175114) (← links)
- Multi-target Ray Searching Problems (Q5199229) (← links)
- Multi-Pivot Quicksort: Theory and Experiments (Q5232491) (← links)
- ON THE DISCRETE UNIT DISK COVER PROBLEM (Q5300002) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311145) (← links)
- On the Relative Dominance of Paging Algorithms (Q5387781) (← links)
- An experimental investigation of set intersection algorithms for text searching (Q5406215) (← links)
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis (Q5452148) (← links)
- On Certain New Models for Paging with Locality of Reference (Q5452166) (← links)
- List Update with Locality of Reference (Q5458546) (← links)
- Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections (Q5458852) (← links)
- Combinatorial Pattern Matching (Q5713531) (← links)