( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Flow Problems in Multi-Interface Networks.

, , и . IEEE Trans. Computers, 63 (2): 361-374 (2014)

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.

Uta D'Angelo

Rainer D'Angelo

Gennaro D'Angelo

Pablo D'Angelo

Igor D'Angelo

 

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

Election Control with Voters' Uncertainty: Hardness and Approximation Results., , , и . CoRR, (2019)The Minimum k-Storage Problem: Complexity, Approximation, and Experimental Analysis., , , и . IEEE Trans. Mob. Comput., 15 (7): 1797-1811 (2016)How to Gather Asynchronous Oblivious Robots on Anonymous Rings., , и . DISC, том 7611 из Lecture Notes in Computer Science, стр. 326-340. Springer, (2012)Maximum flow and minimum-cost flow in multi-interface networks., , и . ICUIMC, стр. 19. ACM, (2011)Dynamic Multi-level Overlay Graphs for Shortest Paths., , , , и . Math. Comput. Sci., 1 (4): 709-736 (2008)Fairness in Influence Maximization through Randomization., , , и . J. Artif. Intell. Res., (2022)Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases., , , , и . J. Comb. Optim., 18 (3): 229-257 (2009)Finding disjoint paths in networks with star shared risk link groups., , , и . Theor. Comput. Sci., (2015)Exploiting social influence to control elections based on positional scoring rules., , , и . Inf. Comput., 289 (Part): 104940 (2022)Generalized budgeted submodular set function maximization., , , и . Inf. Comput., (2021)