Covers in partitioned intersecting hypergraphs. - Ron Aharoni; C. J. Argue (Eur. J. Comb., 2016)

A Nearly-Linear Bound for Chasing Nested Convex Bodies. - C. J. Argue; Sébastien Bubeck; Michael B. Cohen; Anupam Gupta 001; Yin Tat Lee (SODA, 2019)

Dimension-Free Bounds for Chasing Convex Functions. - C. J. Argue; Anupam Gupta 001; Guru Guruganesh (COLT, 2020)

Chasing convex bodies with linear competitive ratio (invited paper). - C. J. Argue; Anupam Gupta 001; Guru Guruganesh; Ziye Tang (STOC, 2021)

Chasing Convex Bodies with Linear Competitive Ratio. - C. J. Argue; Anupam Gupta 001; Ziye Tang; Guru Guruganesh (J. ACM, 2021)

Learning from a Sample in Online Algorithms. - C. J. Argue; Alan M. Frieze; Anupam Gupta 001; Christopher Seiler (NeurIPS, 2022)

Robust Secretary and Prophet Algorithms for Packing Integer Programs. - C. J. Argue; Anupam Gupta 001; Marco Molinaro 001; Sahil Singla 001 (SODA, 2022)

Necessary and Sufficient Conditions for Rank-One-Generated Cones. - C. J. Argue; Fatma Kilinç-Karzan; Alex L. Wang (Math. Oper. Res., 2023)

Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing. - C. J. Argue; Anupam Gupta 001; Marco Molinaro 001 (Discret. Comput. Geom., 2023)