André Linhares

15 papers A* 3B 2Journal 10
YearRankTypeTitle / Venue / Authors
2025 J jnl
Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality.
CoRR
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
2022 J jnl
TF-GNN: Graph Neural Networks in TensorFlow.
CoRR
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, Silvio Lattanzi, André Linhares, Brandon A. Mayer, Vahab S. Mirrokni, John Palowitch, Mihir Paradkar, Jennifer She, Anton Tsitsulin, Kevin Villela, Lisa Wang, David Wong, Bryan Perozzi
2021 A* conf
Streaming Belief Propagation for Community Detection.
NeurIPS
Yuchen Wu, Jakab Tardos, MohammadHossein Bateni, André Linhares, Filipe Miguel Gonçalves de Almeida, Andrea Montanari, Ashkan Norouzi-Fard
2021 J jnl
Streaming Belief Propagation for Community Detection.
CoRR
Yuchen Wu, MohammadHossein Bateni, André Linhares, Filipe Miguel Gonçalves de Almeida, Andrea Montanari, Ashkan Norouzi-Fard, Jakab Tardos
2020 J jnl
Approximate multi-matroid intersection via iterative refinement.
Math. Program.
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2019 B conf
Approximate Multi-matroid Intersection via Iterative Refinement.
IPCO
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2019 J jnl
Approximation Algorithms for Distributionally Robust Stochastic Optimization with Black-Box Distributions.
CoRR
André Linhares, Chaitanya Swamy
2019 A* conf
Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions.
STOC
André Linhares, Chaitanya Swamy
2018 J jnl
Approximate Multi-Matroid Intersection via Iterative Refinement.
CoRR
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2018 J jnl
Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems.
Math. Program.
André Linhares, Chaitanya Swamy
2017 A* conf
Improved Algorithms for MST and Metric-TSP Interdiction.
ICALP
André Linhares, Chaitanya Swamy
2017 J jnl
Improved Algorithms for MST and Metric-TSP Interdiction.
CoRR
André Linhares, Chaitanya Swamy
2016 B conf
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems.
IPCO
André Linhares, Chaitanya Swamy
2016 J jnl
Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems.
CoRR
André Linhares, Chaitanya Swamy
2013 J jnl
A polynomial time algorithm for unloading boxes off a gravity conveyor.
Discret. Optim.
Pierre Baptiste, Alain Hertz, André Linhares, Djamal Rebaine