Performance of scheduling policies in adversarial networks with non synchronized clocks. - Juan Cespedes; Antonio Fernández 001; José Luis López-Presa; M. Araceli Lorenzo; Pilar Manzano; Juan Martínez-Romo; Alberto Mozo; Anna Puig-Centelles; Agustín Santos; Christopher Thraves (ISCC, 2007)

Deterministic Communication in the Weak Sensor Model. - Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (OPODIS, 2007)

Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks. - Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (DISC, 2008)

Optimal switch location in mobile communication networks using hybrid genetic algorithms. - Sancho Salcedo-Sanz; José Antonio Portilla-Figueras; Emilio G. Ortíz-García; Ángel M. Pérez-Bellido; Christopher Thraves; Antonio Fernández Anta; Xin Yao 001 (Appl. Soft Comput., 2008)

MetroSim: a planning tool for metropolitan WiFi networks. - Gilberto A. Urueta; Christopher Thraves; Marcin Solarski; Pablo Vidales (SimuTools, 2009)

Adversarial Queueing Model for Continuous Network Dynamics. - Maria J. Blesa; Daniel Calzada; Antonio Fernández 001; Luis López 003; Andrés L. Martínez; Agustín Santos; Maria J. Serna; Christopher Thraves (Theory Comput. Syst., 2009)

Adversarial queuing theory with setups. - Marcos A. Kiwi; Mauricio Soto; Christopher Thraves (Theor. Comput. Sci., 2009)

Application of Random Walks to Decentralized Recommender Systems. - Anne-Marie Kermarrec; Vincent Leroy 001; Afshin Moin; Christopher Thraves (OPODIS, 2010)

Allocation of Clients to Multiple Servers on Large Scale Heterogeneous Platforms. - Olivier Beaumont; Lionel Eyraud-Dubois; Hejer Rejeb; Christopher Thraves (PDP, 2010)

Can Everybody Sit Closer to Their Friends Than Their Enemies? - Anne-Marie Kermarrec; Christopher Thraves (MFCS, 2011)

Converging Quickly to Independent Uniform Random Topologies. - Anne-Marie Kermarrec; Vincent Leroy 001; Christopher Thraves (PDP, 2011)

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks. - Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (Discret. Math. Theor. Comput. Sci., 2011)

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks. - Antonio Fernández Anta; José Luis López-Presa; M. Araceli Lorenzo; Pilar Manzano; Juan Martínez-Romo; Alberto Mozo; Christopher Thraves (Theory Comput. Syst., 2011)

Deterministic recurrent communication in restricted Sensor Networks. - Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (Theor. Comput. Sci., 2012)

Estimating Time Complexity of Rumor Spreading in Ad-Hoc Networks. - Dariusz R. Kowalski; Christopher Thraves Caro (ADHOC-NOW, 2013)

(c-)AND(1) graphs - more than intersection, more than geometric. - Mauricio Soto; Christopher Thraves (CoRR, 2013)

Power-efficient Assignment of Virtual Machines to Physical Machines - Jordi Arjona Aroca; Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (CoRR, 2013)

An early-stopping protocol for computing aggregate functions in Sensor Networks. - Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves (J. Parallel Distributed Comput., 2013)

Heterogeneous Resource Allocation under Degree Constraints. - Olivier Beaumont; Lionel Eyraud-Dubois; Christopher Thraves Caro; Hejer Rejeb (IEEE Trans. Parallel Distributed Syst., 2013)

Signed graph embedding: when everybody can sit closer to friends than enemies. - Anne-Marie Kermarrec; Christopher Thraves (CoRR, 2014)

p-Box: A new graph model. - Mauricio Soto; Christopher Thraves Caro (Discret. Math. Theor. Comput. Sci., 2015)

Embedding signed graphs in the line - Heuristics to solve MinSA problem. - Eduardo G. Pardo; Mauricio Soto; Christopher Thraves (J. Comb. Optim., 2015)

Power-efficient assignment of virtual machines to physical machines. - Jordi Arjona Aroca; Antonio Fernández Anta; Miguel A. Mosteiro; Christopher Thraves; Lin Wang 015 (Future Gener. Comput. Syst., 2016)

FIFO Queues Are Bad for Rumor Spreading. - Marcos A. Kiwi; Christopher Thraves Caro (IEEE Trans. Inf. Theory, 2017)

Randomized Rumor Spreading in Ad Hoc Networks with Buffers. - Dariusz R. Kowalski; Christopher Thraves Caro (CoRR, 2018)

On The Sitting Closer to Friends than Enemies Problem in Trees and An Intersection Model for Strongly Chordal Graphs. - Rosa Becerra; Christopher Thraves Caro (CoRR, 2019)

Stability Under Adversarial Injection of Dependent Tasks (Extended Abstract). - Vicent Cholvi; Juan Echagüe; Antonio Fernández Anta; Christopher Thraves Caro (NETYS, 2020)

The Dimension of Valid Distance Drawings of Signed Graphs. - Quico Spaen; Christopher Thraves Caro; Mark Velednitsky (Discret. Comput. Geom., 2020)

Optimal Path Discovery Problem with Homogeneous Knowledge. - Christopher Thraves Caro; Josu Doncel; Olivier Brun (Theory Comput. Syst., 2020)

System Stability Under Adversarial Injection of Dependent Tasks. - Vicent Cholvi; Juan Echagüe; Antonio Fernández Anta; Christopher Thraves Caro (IEEE Access, 2021)

On the Recognition of Strong-Robinsonian Incomplete Matrices. - Julio Aracena; Christopher Thraves Caro (CoRR, 2021)

Dynamic Windows Scheduling with Reallocation. - Martin Farach-Colton; Katia Leal; Miguel A. Mosteiro; Christopher Thraves Caro (ACM J. Exp. Algorithmics, 2021)

The weighted sitting closer to friends than enemies problem in the line. - Julio Aracena; Christopher Thraves Caro (J. Comb. Optim., 2023)

Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces. - François Brucker; Pascal Préa; Christopher Thraves Caro (CoRR, 2024)

Totally odd immersions in line graphs. - Andrea Jiménez; Daniel A. Quiroz; Christopher Thraves Caro (Discret. Math., 2024)