( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Local Search Algorithm for Large Maximum Weight Independent Set Problems.

, , , , , и . ESA, том 244 из LIPIcs, стр. 45:1-45:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Blagoje Nikosavi

Nikos Green

Nikos Papamichail

Nikos Wallburger

Nikos Parlavantzas

 

Другие публикации лиц с тем же именем

Incremental 2-Edge-Connectivity in Directed Graphs., , и . ICALP, том 55 из LIPIcs, стр. 49:1-49:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Decremental Data Structures for Connectivity and Dominators in Directed Graphs., , , , и . ICALP, том 80 из LIPIcs, стр. 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)2-Edge Connectivity in Directed Graphs., , , и . CoRR, (2014)Fully Dynamic k-Clustering in Õ(k) Update Time., , , и . CoRR, (2023)Fully Dynamic Consistent Facility Location., , , , и . NeurIPS, стр. 3250-3260. (2019)Strong Connectivity in Directed Graphs under Failures, with Applications., , и . SIAM J. Comput., 49 (5): 865-926 (2020)2-Connectivity in Directed Graphs., , и . ESA, том 57 из LIPIcs, стр. 1:1-1:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)New Instances for Maximum Weight Independent Set From a Vehicle Routing Application., , , , , и . Oper. Res. Forum, (2021)Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs., , , , и . SODA, стр. 1900-1918. SIAM, (2017)Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor., , , , и . FOCS, стр. 468-479. IEEE, (2021)