Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets. - Philipp Baumann; Dorit S. Hochbaum; Quico Spaen (ICPRAM, 2016)

High-performance geometric algorithms for sparse computation in big data analytics. - Philipp Baumann; Dorit S. Hochbaum; Quico Spaen (IEEE BigData, 2017)

DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. - Minjun Chang; Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (WAOA, 2018)

DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals. - Minjun Chang; Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (CoRR, 2018)

Detecting Aberrant Linking Behavior in Directed Networks. - Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (KDIR, 2019)

HNCcorr: combinatorial optimization for neuron identification. - Roberto Javier Asín Achá; Dorit S. Hochbaum; Quico Spaen (Ann. Oper. Res., 2020)

The Dimension of Valid Distance Drawings of Signed Graphs. - Quico Spaen; Christopher Thraves Caro; Mark Velednitsky (Discret. Comput. Geom., 2020)

An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. - Minjun Chang; Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (Theory Comput. Syst., 2020)

New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. - Yuanyuan Dong; Andrew V. Goldberg; Alexander Noe; Nikos Parotsidis; Mauricio G. C. Resende; Quico Spaen (Oper. Res. Forum, 2021)

A Local Search Algorithm for Large Maximum Weight Independent Set Problems. - Yuanyuan Dong; Andrew V. Goldberg; Alexander Noe; Nikos Parotsidis; Mauricio G. C. Resende; Quico Spaen (ESA, 2022)

A metaheuristic algorithm for large maximum weight independent set problems. - Yuanyuan Dong; Andrew V. Goldberg; Alexander Noe; Nikos Parotsidis; Mauricio G. C. Resende; Quico Spaen (Networks, 2025)