New Lower Bounds for Element Distinctness on a On-Tape Turing Machine. - Alejandro López-Ortiz (Inf. Process. Lett., 1994)

Linear pattern matching of repeated substrings. - Alejandro López-Ortiz (SIGACT News, 1994)

Going Home Through an Unknown Street. - Alejandro López-Ortiz; Sven Schuierer (WADS, 1995)

Generalized Streets Revisited. - Alejandro López-Ortiz; Sven Schuierer (ESA, 1996)

Walking Streets Faster. - Alejandro López-Ortiz; Sven Schuierer (SWAT, 1996)

Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons. - Alejandro López-Ortiz; Sven Schuierer (SCG, 1997)

The exact cost of exploring streets with a cab. - Alejandro López-Ortiz; Sven Schuierer (CCCG, 1998)

The Ultimate Strategy to Search on m Rays? - Alejandro López-Ortiz; Sven Schuierer (COCOON, 1998)

Position-Independent Street Searching. - Christoph A. Bröcker; Alejandro López-Ortiz (WADS, 1999)

A New Lower Bound for Kernel Searching. - Peter Anderson; Alejandro López-Ortiz (CCCG, 2000)

Online Routing in Convex Subdivisions. - Prosenjit Bose; Pat Morin; Andrej Brodnik; Svante Carlsson; Erik D. Demaine; Rudolf Fleischer; J. Ian Munro; Alejandro López-Ortiz (ISAAC, 2000)

Adaptive set intersections, unions, and differences. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (SODA, 2000)

Experiments on Adaptive Set Intersections for Text Retrieval Systems. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (ALENEX, 2001)

Parallel searching on a lattice. - Alejandro López-Ortiz; Graeme Sweet (CCCG, 2001)

A linear lower bound on index size for text retrieval. - Erik D. Demaine; Alejandro López-Ortiz (SODA, 2001)

On universally easy classes for NP-complete problems. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (SODA, 2001)

Lower Bounds for Streets and Generalized Streets. - Alejandro López-Ortiz; Sven Schuierer (Int. J. Comput. Geom. Appl., 2001)

Drawing k2, n: A lower bound. - Therese Biedl; Timothy M. Chan; Alejandro López-Ortiz (CCCG, 2002)

Searching for the center of a circle. - Therese Biedl; Masud Hasan; Joseph Douglas Horton; Alejandro López-Ortiz; Tomás Vinar (CCCG, 2002)

Frequency Estimation of Internet Packet Streams with Limited Space. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (ESA, 2002)

Robot Localization without Depth Perception. - Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (SWAT, 2002)

Online Parallel Heuristics and Robot Searching under the Competitive Framework. - Alejandro López-Ortiz; Sven Schuierer (SWAT, 2002)

Curves of width one and the river shore problem. - Timothy M. Chan; Alexander Golynski; Alejandro López-Ortiz; Claude-Guy Quimper (CCCG, 2003)

Finding Hidden Independent Sets in Interval Graphs. - Therese Biedl; Brona Brejová; Erik D. Demaine; Angèle M. Hamel; Alejandro López-Ortiz; Tomás Vinar (COCOON, 2003)

the asteroid surveying problem and other puzzles. - Timothy M. Chan; Alexander Golynski; Alejandro López-Ortiz; Claude-Guy Quimper (SCG, 2003)

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. - Claude-Guy Quimper; Peter van Beek; Alejandro López-Ortiz; Alexander Golynski; Sayyed Bashir Sadjad (CP, 2003)

Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. - Therese Biedl; Erik D. Demaine; Alexander Golynski; Joseph Douglas Horton; Alejandro López-Ortiz; Guillaume Poirier; Claude-Guy Quimper (ESA, 2003)

The Cost of Cache-Oblivious Searching. - Michael A. Bender; Gerth Stølting Brodal; Rolf Fagerberg; Dongdong Ge; Simai He; Haodong Hu; John Iacono; Alejandro López-Ortiz (FOCS, 2003)

A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint. - Alejandro López-Ortiz; Claude-Guy Quimper; John Tromp; Peter van Beek (IJCAI, 2003)

Identifying frequent items in sliding windows over on-line packet streams. - Lukasz Golab; David DeHaan; Erik D. Demaine; Alejandro López-Ortiz; J. Ian Munro (Internet Measurement Conference, 2003)

On the number of distributed measurement points for network tomography. - Joseph Douglas Horton; Alejandro López-Ortiz (Internet Measurement Conference, 2003)

Searching and on-line recognition of star-shaped polygons. - Alejandro López-Ortiz; Sven Schuierer (Inf. Comput., 2003)

Drawing K2, n: A lower bound. - Therese Biedl; Timothy M. Chan; Alejandro López-Ortiz (Inf. Process. Lett., 2003)

Algorithmic Foundations of the Internet: Foreword. - Alejandro López-Ortiz (CAAN, 2004)

Search Engines and Web Information Retrieval. - Alejandro López-Ortiz (CAAN, 2004)

Algorithmic Foundations of the Internet: Roundup. - Alejandro López-Ortiz (CAAN, 2004)

Improved Algorithms for the Global Cardinality Constraint. - Claude-Guy Quimper; Alejandro López-Ortiz; Peter van Beek; Alexander Golynski (CP, 2004)

Efficient View Point Selection for Silhouettes of Convex Polyhedra. - Therese Biedl; Masud Hasan; Alejandro López-Ortiz (MFCS, 2004)

Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies. - Lukasz Golab; David DeHaan; Alejandro López-Ortiz; Erik D. Demaine (SSDBM, 2004)

Longest increasing subsequences in sliding windows. - Michael H. Albert; Alexander Golynski; Angèle M. Hamel; Alejandro López-Ortiz; S. Srinivasa Rao 001; Mohammad Ali Safari (Theor. Comput. Sci., 2004)

On-line parallel heuristics, processor scheduling and robot searching under the competitive framework. - Alejandro López-Ortiz; Sven Schuierer (Theor. Comput. Sci., 2004)

Cross-Stitching Using Little Thread. - Therese Biedl; Joseph Douglas Horton; Alejandro López-Ortiz (CCCG, 2005)

From Linear Relaxations to Global Constraint Propagation. - Claude-Guy Quimper; Alejandro López-Ortiz (CP, 2005)

Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern. - Brona Brejová; Daniel G. Brown 001; Ian M. Harrower; Alejandro López-Ortiz; Tomás Vinar (CPM, 2005)

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. - Claude-Guy Quimper; Alexander Golynski; Alejandro López-Ortiz; Peter van Beek (Constraints An Int. J., 2005)

Fast string sorting using order-preserving compression. - Alejandro López-Ortiz; Mehdi Mirzazadeh; Mohammad Ali Safari; M. Hossein Sheikh Attar (ACM J. Exp. Algorithmics, 2005)

A Survey of Performance Measures for On-line Algorithms - Reza Dorrigiv; Alejandro López-Ortiz (SIGACT News, 2005)

Algorithmic foundations of the internet. - Alejandro López-Ortiz (SIGACT News, 2005)

Optimal Scheduling of Contract Algorithms for Anytime Problems. - Alejandro López-Ortiz; Spyros Angelopoulos 001; Angèle M. Hamel (AAAI, 2006)

A Quadratic Propagator for the Inter-Distance Constraint. - Claude-Guy Quimper; Alejandro López-Ortiz; Gilles Pesant (AAAI, 2006)

Adaptive Analysis of On-line Algorithms. - Reza Dorrigiv; Alejandro López-Ortiz (Robot Navigation, 2006)

06421 Executive Summary – Robot Navigation. - Sándor P. Fekete; Rudolf Fleischer; Rolf Klein; Alejandro López-Ortiz (Robot Navigation, 2006)

06421 Abstracts Collection – Robot Navigation. - Sándor P. Fekete; Rudolf Fleischer; Rolf Klein; Alejandro López-Ortiz (Robot Navigation, 2006)

Faster Adaptive Set Intersections for Text Searching. - Jérémy Barbay; Alejandro López-Ortiz; Tyler Lu (WEA, 2006)

Foreword. - Alejandro López-Ortiz; J. Ian Munro (ACM Trans. Algorithms, 2006)

Valiant Load Balancing, Benes Networks and Resilient Backbone Design. - Alejandro López-Ortiz (CAAN, 2007)

Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design. - Alejandro López-Ortiz (CAAN, 2007)

Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. - Therese Biedl; Masud Hasan; Alejandro López-Ortiz (FSTTCS, 2007)

On the Relative Dominance of Paging Algorithms. - Reza Dorrigiv; Alejandro López-Ortiz; J. Ian Munro (ISAAC, 2007)

Search Algorithms for Unstructured Peer-to-Peer Networks. - Reza Dorrigiv; Alejandro López-Ortiz; Pawel Pralat (LCN, 2007)

On the separation and equivalence of paging strategies. - Spyros Angelopoulos 001; Reza Dorrigiv; Alejandro López-Ortiz (SODA, 2007)

Optimal Scheduling of Contract Algorithms with Soft Deadlines. - Spyros Angelopoulos 001; Alejandro López-Ortiz; Angèle M. Hamel (AAAI, 2008)

Adaptive Searching in One and Two Dimensions. - Reza Dorrigiv; Alejandro López-Ortiz (CCCG, 2008)

List Update Algorithms for Data Compression. - Reza Dorrigiv; Alejandro López-Ortiz; J. Ian Munro (DCC, 2008)

List Update with Locality of Reference. - Spyros Angelopoulos 001; Reza Dorrigiv; Alejandro López-Ortiz (LATIN, 2008)

Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM). - Reza Dorrigiv; Alejandro López-Ortiz; Alejandro Salinger (SPAA, 2008)

Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis. - Reza Dorrigiv; Alejandro López-Ortiz (WALCOM, 2008)

On Certain New Models for Paging with Locality of Reference. - Reza Dorrigiv; Alejandro López-Ortiz (WALCOM, 2008)

09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms. - Jérémy Barbay; Rolf Klein; Alejandro López-Ortiz; Rolf Niedermeier (Adaptive, Output Sensitive, Online and Parameterized Algorithms, 2009)

09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms. - Jérémy Barbay; Rolf Klein; Alejandro López-Ortiz; Rolf Niedermeier (Adaptive, Output Sensitive, Online and Parameterized Algorithms, 2009)

Interruptible Algorithms for Multi-Problem Solving. - Spyros Angelopoulos 001; Alejandro López-Ortiz (IJCAI, 2009)

Capacity Provisioning a Valiant Load-Balanced Network. - Andrew R. Curtis; Alejandro López-Ortiz (INFOCOM, 2009)

Untangled Monotonic Chains and Adaptive Range Search. - Diego Arroyuelo; Francisco Claude; Reza Dorrigiv; Stephane Durocher; Meng He 001; Alejandro López-Ortiz; J. Ian Munro; Patrick K. Nicholson; Alejandro Salinger; Matthew Skala (ISAAC, 2009)

Online Sorted Range Reporting. - Gerth Stølting Brodal; Rolf Fagerberg; Mark Greve; Alejandro López-Ortiz (ISAAC, 2009)

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm. - Francisco Claude; Reza Dorrigiv; Stephane Durocher; Robert Fraser; Alejandro López-Ortiz; Alejandro Salinger (ISAAC, 2009)

Efficient Algorithms for Context Query Evaluation over a Tagged Corpus. - Jérémy Barbay; Alex López-Ortiz (SCCC, 2009)

Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. - Reza Dorrigiv; Stephane Durocher; Arash Farzan; Robert Fraser; Alejandro López-Ortiz; J. Ian Munro; Alejandro Salinger; Matthew Skala (WADS, 2009)

Parameterized Analysis of Paging and List Update Algorithms. - Reza Dorrigiv; Martin R. Ehmsen; Alejandro López-Ortiz (WAOA, 2009)

An Application of Self-organizing Data Structures to Compression. - Reza Dorrigiv; Alejandro López-Ortiz; J. Ian Munro (SEA, 2009)

An experimental investigation of set intersection algorithms for text searching. - Jérémy Barbay; Alejandro López-Ortiz; Tyler Lu; Alejandro Salinger (ACM J. Exp. Algorithmics, 2009)

On Developing New Models, with Paging as a Case Study. - Reza Dorrigiv; Alejandro López-Ortiz (SIGACT News, 2009)

LEGUP: using heterogeneity to reduce the cost of data center network upgrades. - Andrew R. Curtis; Srinivasan Keshav; Alejandro López-Ortiz (CoNEXT, 2010)

Some New Equiprojective Polyhedra - Masud Hasan; Mohammad Monoar Hossain; Alejandro López-Ortiz; Sabrina Nusrat; Saad Altaful Quader; Nabila Rahman (CoRR, 2010)

Sorting with networks of data structures. - Therese Biedl; Alexander Golynski; Angèle M. Hamel; Alejandro López-Ortiz; J. Ian Munro (Discret. Appl. Math., 2010)

An Improved Line-Separable Algorithm for Discrete Unit Disk Cover. - Francisco Claude; Gautam K. Das; Reza Dorrigiv; Stephane Durocher; Robert Fraser; Alejandro López-Ortiz; Bradford G. Nickerson; Alejandro Salinger (Discret. Math. Algorithms Appl., 2010)

Brief announcement: paging for multicore processors. - Alejandro López-Ortiz; Alejandro Salinger (SPAA, 2011)

COCA Filters: Co-occurrence Aware Bloom Filters. - Kamran Tirdad; Pedram Ghodsnia; J. Ian Munro; Alejandro López-Ortiz (SPIRE, 2011)

A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times. - Alejandro López-Ortiz; Claude-Guy Quimper (STACS, 2011)

Multi-target Ray Searching Problems. - Spyros Angelopoulos 001; Alejandro López-Ortiz; Konstantinos Panagiotou (WADS, 2011)

On the Discrete Unit Disk Cover Problem. - Gautam K. Das; Robert Fraser; Alejandro López-Ortiz; Bradford G. Nickerson (WALCOM, 2011)

A New Perspective on List Update: Probabilistic Locality and Working Set. - Reza Dorrigiv; Alejandro López-Ortiz (WAOA, 2011)

Orthogonal Query Expansion - Margareta Ackerman; David Loker; Alejandro López-Ortiz (CoRR, 2011)

Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections. - Therese Biedl; Masud Hasan; Alejandro López-Ortiz (Int. J. Comput. Geom. Appl., 2011)

The Within-Strip Discrete Unit Disk Cover Problem. - Robert Fraser; Alejandro López-Ortiz (CCCG, 2012)

Optimal Average Case Strategy for Looking Around a Corner. - Reza Dorrigiv; Alejandro López-Ortiz; Selim Tawfik (CCCG, 2012)

REWIRE: An optimization-based framework for unstructured data center network design. - Andrew R. Curtis; Tommy Carpenter; Mustafa Elsheikh; Alejandro López-Ortiz; Srinivasan Keshav (INFOCOM, 2012)

Paging for multi-core shared caches. - Alejandro López-Ortiz; Alejandro Salinger (ITCS, 2012)

A taxonomy of Semi-FIFO policies. - Kirill Kogan; Alejandro López-Ortiz; Sergey I. Nikolenko; Alexander Sirotkin 001 (IPCCC, 2012)

FIFO Queueing Policies for Packets with Heterogeneous Processing. - Kirill Kogan; Alejandro López-Ortiz; Sergey I. Nikolenko; Alexander Sirotkin 001; Denis Tugaryov (MedAlg, 2012)

On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods. - Reza Dorrigiv; Robert Fraser; Meng He 001; Shahin Kamali; Akitoshi Kawamura; Alejandro López-Ortiz; Diego Seco (WAOA, 2012)

Minimizing Cache Usage in Paging. - Alejandro López-Ortiz; Alejandro Salinger (WAOA, 2012)

Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). - Alejandro López-Ortiz (Algorithmica, 2012)

Large Profits or Fast Gains: A Dilemma in Maximizing Throughput with Applications to Network Processors - Kirill Kogan; Alejandro López-Ortiz; Gabriel Scalosub; Michael Segal 001 (CoRR, 2012)

List update with probabilistic locality of reference. - Reza Dorrigiv; Alejandro López-Ortiz (Inf. Process. Lett., 2012)

Optimal strategies for the list update problem under the MRM alternative cost model. - Alexander Golynski; Alejandro López-Ortiz (Inf. Process. Lett., 2012)

A Survey of Algorithms and Models for List Update. - Shahin Kamali; Alejandro López-Ortiz (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Multi-queued network processors for packets with heterogeneous processing requirements. - Kirill Kogan; Alejandro López-Ortiz; Sergey I. Nikolenko; Alexander Sirotkin 001 (COMSNETS, 2013)

Context-Based Algorithms for the List-Update Problem under Alternative Cost Models. - Shahin Kamali; Susana Ladra; Alejandro López-Ortiz; Diego Seco (DCC, 2013)

Efficient demand assignment in multi-connected microgrids. - Kirill Kogan; Sergey I. Nikolenko; Srinivasan Keshav; Alejandro López-Ortiz (e-Energy, 2013)

Efficient demand assignment in multi-connected microgrids with a shared central grid. - Kirill Kogan; Sergey I. Nikolenko; Srinivasan Keshav; Alejandro López-Ortiz (SustainIT, 2013)

Toward a Generic Hybrid CPU-GPU Parallelization of Divide-and-Conquer Algorithms. - Alejandro López-Ortiz; Alejandro Salinger; Robert Suderman (IPDPS Workshops, 2013)

The Distance 4-Sector of Two Points Is Unique. - Robert Fraser; Meng He 001; Akitoshi Kawamura; Alejandro López-Ortiz; J. Ian Munro; Patrick K. Nicholson (ISAAC, 2013)

Orthogonal query recommendation. - Hossein Vahabi; Margareta Ackerman; David Loker; Ricardo Baeza-Yates; Alejandro López-Ortiz (RecSys, 2013)

Faster and smaller inverted indices with treaps. - Roberto Konow; Gonzalo Navarro 001; Charles L. A. Clarke; Alejandro López-Ortiz (SIGIR, 2013)

On Advice Complexity of the k-server Problem under Sparse Metrics. - Sushmita Gupta; Shahin Kamali; Alejandro López-Ortiz (SIROCCO, 2013)

On the Sublinear Processor Gap for Parallel Architectures. - Alejandro López-Ortiz; Alejandro Salinger (TAMC, 2013)

Broadcasting in Conflict-Aware Multi-channel Networks. - Francisco Claude; Reza Dorrigiv; Shahin Kamali; Alejandro López-Ortiz; Pawel Pralat; Jazmín Romero; Alejandro Salinger; Diego Seco (WALCOM, 2013)

A novel approach for leveraging co-occurrence to improve the false positive error in signature files. - Pedram Ghodsnia; Kamran Tirdad; J. Ian Munro; Alejandro López-Ortiz (J. Discrete Algorithms, 2013)

Multi-Pivot Quicksort: Theory and Experiments. - Shrinu Kushagra; Alejandro López-Ortiz; Aurick Qiao; J. Ian Munro (ALENEX, 2014)

Almost Online Square Packing. - Shahin Kamali; Alejandro López-Ortiz (CCCG, 2014)

Balancing work and size with bounded buffers. - Kirill Kogan; Alejandro López-Ortiz; Sergey I. Nikolenko; Gabriel Scalosub; Michael Segal 001 (COMSNETS, 2014)

A Parameterized Algorithm for Packing Overlapping Subgraphs. - Jazmín Romero; Alejandro López-Ortiz (CSR, 2014)

Better Compression through Better List Update Algorithms. - Shahin Kamali; Alejandro López-Ortiz (DCC, 2014)

On the List Update Problem with Advice. - Joan Boyar; Shahin Kamali; Kim S. Larsen; Alejandro López-Ortiz (LATA, 2014)

On the online fault-tolerant server consolidation problem. - Khuzaima Daudjee; Shahin Kamali; Alejandro López-Ortiz (SPAA, 2014)

Online Bin Packing with Advice. - Joan Boyar; Shahin Kamali; Kim S. Larsen; Alejandro López-Ortiz (STACS, 2014)

The ${ mathcal{G}}$ -Packing with t-Overlap Problem. - Jazmín Romero; Alejandro López-Ortiz (WALCOM, 2014)

An All-Around Near-Optimal Solution for the Classic Bin Packing Problem. - Shahin Kamali; Alejandro López-Ortiz (CoRR, 2014)

Optimal Strategies for Search and Rescue Operations with Robot Swarms. - Alejandro López-Ortiz; Daniela Maftuleac (CoRR, 2014)

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091). - Alejandro López-Ortiz; Ulrich Carsten Meyer; Robert Sedgewick (Dagstuhl Reports, 2014)

Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving. - Alejandro López-Ortiz; Spyros Angelopoulos 001; Angèle M. Hamel (J. Artif. Intell. Res., 2014)

Parameterized Algorithms for the H-Packing with t-Overlap Problem. - Alejandro López-Ortiz; Jazmín Romero (J. Graph Algorithms Appl., 2014)

The Hausdorff Core Problem on Simple Polygons. - Reza Dorrigiv; Stephane Durocher; Arash Farzan; Robert Fraser; Alejandro López-Ortiz; J. Ian Munro; Alejandro Salinger; Matthew Skala (J. Comput. Geom., 2014)

Online Packing of Equilateral Triangles. - Shahin Kamali; Alejandro López-Ortiz; Zahed Rahmati (CCCG, 2015)

Local policies for efficiently patrolling a triangulated region by a robot swarm. - Daniela Maftuleac; SeoungKyou Lee; Sándor P. Fekete; Aditya Kumar Akash; Alejandro López-Ortiz; James McLurkin (ICRA, 2015)

All-Around Near-Optimal Solutions for the Online Bin Packing Problem. - Shahin Kamali; Alejandro López-Ortiz (ISAAC, 2015)

List Colouring and Partial List Colouring of Graphs On-line. - Martin Derka; Alejandro López-Ortiz; Daniela Maftuleac (IWOCA, 2015)

Computing Weak Consistency in Polynomial Time: [Extended Abstract]. - Wojciech M. Golab; Xiaozhou (Steve) Li; Alejandro López-Ortiz; Naomi Nishimura (PODC, 2015)

Efficient Online Strategies for Renting Servers in the Cloud. - Shahin Kamali; Alejandro López-Ortiz (SOFSEM, 2015)

Paid Exchanges are Worth the Price. - Alejandro López-Ortiz; Marc P. Renault; Adi Rosén (STACS, 2015)

Algorithms in the Ultra-Wide Word Model. - Arash Farzan; Alejandro López-Ortiz; Patrick K. Nicholson; Alejandro Salinger (TAMC, 2015)

Kernelization Algorithms for Packing Problems Allowing Overlaps. - Henning Fernau; Alejandro López-Ortiz; Jazmín Romero (TAMC, 2015)

Guest editorial: Special issue on the 25th Canadian Conference on Computational Geometry (CCCG). - Alejandro López-Ortiz (Comput. Geom., 2015)

List Colouring Big Graphs On-Line. - Martin Derka; Alejandro López-Ortiz; Daniela Maftuleac (CoRR, 2015)

Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps. - Henning Fernau; Alejandro López-Ortiz; Jazmín Romero (ACM Trans. Comput. Theory, 2015)

Recognition of Triangulation Duals of Simple Polygons With and Without Holes. - Martin Derka; Alejandro López-Ortiz; Daniela Maftuleac (CCCG, 2016)

Lower Bounds for Graph Exploration Using Local Policies. - Aditya Kumar Akash; Sándor P. Fekete; Seoung Kyou Lee; Alejandro López-Ortiz; Daniela Maftuleac; James McLurkin (WALCOM, 2016)

Optimal Distributed Searching in the Plane with and Without Uncertainty. - Alejandro López-Ortiz; Daniela Maftuleac (WALCOM, 2016)

Arbitrary Overlap Constraints in Graph Packing Problems. - Alejandro López-Ortiz; Jazmín Romero (CoRR, 2016)

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101). - Alejandro López-Ortiz; Ulrich Carsten Meyer; Markus E. Nebel; Robert Sedgewick (Dagstuhl Reports, 2016)

Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors. - Kirill Kogan; Alejandro López-Ortiz; Sergey I. Nikolenko; Gabriel Scalosub; Michael Segal 001 (J. Netw. Comput. Appl., 2016)

Online Scheduling FIFO Policies with Admission and Push-Out. - Kirill Kogan; Alejandro López-Ortiz; Sergey I. Nikolenko; Alexander V. Sirotkin (Theory Comput. Syst., 2016)

Intersections of Inverted Lists. - Andrew Kane; Alejandro López-Ortiz (Encyclopedia of Algorithms, 2016)

Alternative Performance Measures in Online Algorithms. - Alejandro López-Ortiz (Encyclopedia of Algorithms, 2016)

Analyzing Cache Behaviour in Multicore Architectures. - Alejandro López-Ortiz; Alejandro Salinger (Encyclopedia of Algorithms, 2016)

The impact of processing order on performance: A taxonomy of semi-FIFO policies. - Kirill Kogan; Alejandro López-Ortiz; Sergey I. Nikolenko; Alexander V. Sirotkin (J. Comput. Syst. Sci., 2017)

Multi-processor Search and Scheduling Problems with Setup Cost. - Spyros Angelopoulos 001; Diogo Arsénio; Christoph Dürr; Alejandro López-Ortiz (Theory Comput. Syst., 2017)

Inverted Treaps. - Roberto Konow; Gonzalo Navarro 001; Charles L. A. Clarke; Alejandro López-Ortiz (ACM Trans. Inf. Syst., 2017)

Arbitrary Overlap Constraints in Graph Packing Problems. - Alejandro López-Ortiz; Cynthia B. Pérez; Jazmín Romero (Int. J. Found. Comput. Sci., 2018)

Computing k-Atomicity in Polynomial Time. - Wojciech M. Golab; Xiaozhou (Steve) Li; Alejandro López-Ortiz; Naomi Nishimura (SIAM J. Comput., 2018)

On the Separation and Equivalence of Paging Strategies and Other Online Algorithms. - Spyros Angelopoulos 001; Reza Dorrigiv; Alejandro López-Ortiz (Algorithmica, 2019)

Interruptible algorithms for multiproblem solving. - Spyros Angelopoulos 001; Alejandro López-Ortiz (J. Sched., 2020)