( en | de | ru )

 

Disambiguation of "Spaen, Quico"

Author of the publication

copydeleteadd this publication to your clipboard
High-performance geometric algorithms for sparse computation in big data analytics.

, , and . IEEE BigData, page 546-555. IEEE Computer Society, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ludwig Spaenle

Pierre-Jean Spaenlehauer

 

Other publications of authors with the same name

A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems., , , , , and . CoRR, (2022)DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals., , , and . CoRR, (2018)DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals., , , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 149-164. Springer, (2018)Detecting Aberrant Linking Behavior in Directed Networks., , and . KDIR, page 72-82. ScitePress, (2019)Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets., , and . ICPRAM, page 224-231. SciTePress, (2016)The Dimension of Valid Distance Drawings of Signed Graphs., , and . Discret. Comput. Geom., 63 (1): 158-168 (2020)An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals., , , and . Theory Comput. Syst., 64 (4): 645-661 (2020)HNCcorr: combinatorial optimization for neuron identification., , and . Ann. Oper. Res., 289 (1): 5-32 (2020)New Instances for Maximum Weight Independent Set From a Vehicle Routing Application., , , , , and . Oper. Res. Forum, (2021)A Local Search Algorithm for Large Maximum Weight Independent Set Problems., , , , , and . ESA, volume 244 of LIPIcs, page 45:1-45:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)