Christopher Thraves

Orcid: 0000-0002-9909-5315

According to our database1, Christopher Thraves authored at least 34 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Totally odd immersions in line graphs.
Discret. Math., April, 2024

2023
The weighted sitting closer to friends than enemies problem in the line.
J. Comb. Optim., 2023

2021
Dynamic Windows Scheduling with Reallocation.
ACM J. Exp. Algorithmics, 2021

On the Recognition of Strong-Robinsonian Incomplete Matrices.
CoRR, 2021

System Stability Under Adversarial Injection of Dependent Tasks.
IEEE Access, 2021

2020
Optimal Path Discovery Problem with Homogeneous Knowledge.
Theory Comput. Syst., 2020

The Dimension of Valid Distance Drawings of Signed Graphs.
Discret. Comput. Geom., 2020

Stability Under Adversarial Injection of Dependent Tasks (Extended Abstract).
Proceedings of the Networked Systems - 8th International Conference, 2020

2019
On The Sitting Closer to Friends than Enemies Problem in Trees and An Intersection Model for Strongly Chordal Graphs.
CoRR, 2019

2018
Randomized Rumor Spreading in Ad Hoc Networks with Buffers.
CoRR, 2018

2017
FIFO Queues Are Bad for Rumor Spreading.
IEEE Trans. Inf. Theory, 2017

2016
Power-efficient assignment of virtual machines to physical machines.
Future Gener. Comput. Syst., 2016

2015
Embedding signed graphs in the line - Heuristics to solve MinSA problem.
J. Comb. Optim., 2015

p-Box: A new graph model.
Discret. Math. Theor. Comput. Sci., 2015

2014
Signed graph embedding: when everybody can sit closer to friends than enemies.
CoRR, 2014

2013
Heterogeneous Resource Allocation under Degree Constraints.
IEEE Trans. Parallel Distributed Syst., 2013

An early-stopping protocol for computing aggregate functions in Sensor Networks.
J. Parallel Distributed Comput., 2013

Power-efficient Assignment of Virtual Machines to Physical Machines
CoRR, 2013

(c-)AND(1) graphs - more than intersection, more than geometric.
CoRR, 2013

Estimating Time Complexity of Rumor Spreading in Ad-Hoc Networks.
Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012
Deterministic recurrent communication in restricted Sensor Networks.
Theor. Comput. Sci., 2012

2011
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks.
Theory Comput. Syst., 2011

Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks.
Discret. Math. Theor. Comput. Sci., 2011

Converging Quickly to Independent Uniform Random Topologies.
Proceedings of the 19th International Euromicro Conference on Parallel, 2011

Can Everybody Sit Closer to Their Friends Than Their Enemies?
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010
Allocation of Clients to Multiple Servers on Large Scale Heterogeneous Platforms.
Proceedings of the 18th Euromicro Conference on Parallel, 2010

Application of Random Walks to Decentralized Recommender Systems.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009
Adversarial queuing theory with setups.
Theor. Comput. Sci., 2009

Adversarial Queueing Model for Continuous Network Dynamics.
Theory Comput. Syst., 2009

MetroSim: a planning tool for metropolitan WiFi networks.
Proceedings of the 2nd International Conference on Simulation Tools and Techniques for Communications, 2009

2008
Optimal switch location in mobile communication networks using hybrid genetic algorithms.
Appl. Soft Comput., 2008

Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

2007
Deterministic Communication in the Weak Sensor Model.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Performance of scheduling policies in adversarial networks with non synchronized clocks.
Proceedings of the 12th IEEE Symposium on Computers and Communications (ISCC 2007), 2007


  Loading...