William Sean Kennedy

Orcid: 0000-0002-2201-1224

According to our database1, William Sean Kennedy authored at least 29 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
AoI-Aware Energy-Efficient SFC in UAV-Aided Smart Agriculture Using Asynchronous Federated Learning.
IEEE Open J. Commun. Soc., 2024

2023
Heterogeneous GNN-RL-Based Task Offloading for UAV-Aided Smart Agriculture.
IEEE Netw. Lett., December, 2023

IoT-Aerial Base Station Task Offloading With Risk-Sensitive Reinforcement Learning for Smart Agriculture.
IEEE Trans. Green Commun. Netw., March, 2023

Fair Allocation in Crowd-Sourced Systems.
CoRR, 2023

To Risk or Not to Risk: Learning with Risk Quantification for IoT Task Offloading in UAVs.
Proceedings of the IEEE International Conference on Communications, 2023

2022
Reinforcement Learning-Based Deadline and Battery-Aware Offloading in Smart Farm IoT-UAV Networks.
Proceedings of the IEEE International Conference on Communications, 2022

Deep Reinforcement Learning for Task Offloading in UAV-Aided Smart Farm Networks.
Proceedings of the 2022 IEEE Future Networks World Forum, 2022

2020
Delay Colouring in Quartic Graphs.
Electron. J. Comb., 2020

The future of Augmented Intelligence.
Bell Labs Tech. J., 2020

2018
Fast Approximation Algorithms for p-Centers in Large $$\delta $$ δ -Hyperbolic Graphs.
Algorithmica, 2018

2017
A New Family of Near-metrics for Universal Similarity.
CoRR, 2017

Extracting mobile user behavioral similarity via cell-level location trace.
Proceedings of the 2017 IEEE Conference on Computer Communications Workshops, 2017

Overlaying Conditional Circuit Clauses for Secure Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Improving robustness of next-hop routing.
J. Comb. Optim., 2016

Overlaying Circuit Clauses for Secure Computation.
IACR Cryptol. ePrint Arch., 2016

Fast approximation algorithms for $p$-centres in large $δ$-hyperbolic graphs.
CoRR, 2016

On the hyperbolicity of large-scale networks and its estimation.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

2014
A Geometric Distance Oracle for Large Real-World Graphs.
CoRR, 2014

2013
Finding a smallest odd hole in a claw-free graph using global structure.
Discret. Appl. Math., 2013

On the Hyperbolicity of Large-Scale Networks.
CoRR, 2013

Hierarchical community decomposition via oblivious routing techniques.
Proceedings of the Conference on Online Social Networks, 2013

Partial Interval Set Cover - Trade-Offs between Scalability and Optimality.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2010
Linear time construction of 5-phylogenetic roots for tree chordal graphs.
J. Comb. Optim., 2010

Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph.
Discret. Appl. Math., 2010

2009
Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time.
Electron. Notes Discret. Math., 2009

A Characterization of Graphs with Fractional Total Chromatic Number Equal to Delta+2.
Electron. Notes Discret. Math., 2009

2007
Fast Skew Partition Recognition.
Proceedings of the Computational Geometry and Graph Theory, 2007

2006
Strictly chordal graphs are leaf powers.
J. Discrete Algorithms, 2006

2005
5-th Phylogenetic Root Construction for Strictly Chordal Graphs.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005


  Loading...