From post

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.

 

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

α-Vertex separator is NP-hard even for 3-regular graphs., и . Computing, 46 (4): 343-353 (1991)Preventing Critical Edges when Designing Transmission Networks., и . e-Energy, стр. 264-278. ACM, (2020)Fast, Exact and Scalable Dynamic Ridesharing., , и . CoRR, (2020)Erratum: Customizable Contraction Hierarchies., , и . SEA, том 8504 из Lecture Notes in Computer Science, Springer, (2014)Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study., и . WEA, том 3503 из Lecture Notes in Computer Science, стр. 606-609. Springer, (2005)Intriguingly Simple and Fast Transit Routing., , , и . SEA, том 7933 из Lecture Notes in Computer Science, стр. 43-54. Springer, (2013)Customizable Contraction Hierarchies., , и . ACM Journal of Experimental Algorithmics, 21 (1): 1.5:1-1.5:49 (2016)Book review.. ZOR Methods Model. Oper. Res., 36 (1): 106-109 (1992)Communicating Centrality in Policy Network Drawings., , и . IEEE Trans. Vis. Comput. Graph., 9 (2): 241-253 (2003)Dynamic Time-Dependent Route Planning in Road Networks with User Preferences., , , и . CoRR, (2015)