A polynomial time algorithm for unloading boxes off a gravity conveyor. - Pierre Baptiste; Alain Hertz; André Linhares; Djamal Rebaine (Discret. Optim., 2013)

Improved Algorithms for MST and Metric-TSP Interdiction. - André Linhares; Chaitanya Swamy (ICALP, 2017)

Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems. - André Linhares; Chaitanya Swamy (Math. Program., 2018)

Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions. - André Linhares; Chaitanya Swamy (STOC, 2019)

Approximate multi-matroid intersection via iterative refinement. - André Linhares; Neil Olver; Chaitanya Swamy; Rico Zenklusen (Math. Program., 2020)

Streaming Belief Propagation for Community Detection. - Yuchen Wu 002; Jakab Tardos; MohammadHossein Bateni; André Linhares; Filipe Miguel Gonçalves de Almeida; Andrea Montanari; Ashkan Norouzi-Fard (NeurIPS, 2021)

TF-GNN: Graph Neural Networks in TensorFlow. - Oleksandr Ferludin; Arno Eigenwillig; Martin Blais; Dustin Zelle; Jan Pfeifer; Alvaro Sanchez-Gonzalez; Wai Lok Sibon Li; Sami Abu-El-Haija; Peter W. Battaglia; Neslihan Bulut; Jonathan Halcrow; Filipe Miguel Gonçalves de Almeida; et al. (CoRR, 2022)

Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality. - Filipe Miguel Gonçalves de Almeida; CJ Carey; Hendrik Fichtenberger; Jonathan Halcrow; Silvio Lattanzi; André Linhares; Tao Meng; Ashkan Norouzi-Fard; Nikos Parotsidis; Bryan Perozzi; David Simcha (CoRR, 2025)