From post

Temporal Graph Kernels for Classifying Dissemination Processes.

, , , и . SDM, стр. 496-504. SIAM, (2020)The conference was canceled because of the coronavirus pandemic, the reviewed papers are published in this volume..

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.

 

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

More Compact Orthogonal Drawings by Allowing Additional Bends †., , и . Information, 9 (7): 153 (2018)A Diagramming Software for UML Class Diagrams., , , , , и . Graph Drawing Software, Springer, (2004)A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks., , , , и . OR, стр. 197-202. (2006)An Index For Temporal Closeness Computation in Evolving Graphs., и . SDM, стр. 280-288. SIAM, (2023)Compact Layered Drawings of General Directed Graphs., , , , и . GD, том 9801 из Lecture Notes in Computer Science, стр. 209-221. Springer, (2016)An Alternative Method to Crossing Minimization on Hierarchical Graphs.. GD, том 1190 из Lecture Notes in Computer Science, стр. 318-333. Springer, (1996)Parameterized Algorithms for Stochastic Steiner Tree Problems., , и . MEMICS, том 7721 из Lecture Notes in Computer Science, стр. 143-154. Springer, (2012)The Crossing Number of Seq-Shellable Drawings of Complete Graphs., и . IWOCA, том 10979 из Lecture Notes in Computer Science, стр. 273-284. Springer, (2018)Faster Kernels for Graphs with Continuous Attributes via Hashing., , , и . ICDM, стр. 1095-1100. IEEE Computer Society, (2016)Engineering A* Search for the Flip Distance of Plane Triangulations., и . SEA, том 301 из LIPIcs, стр. 23:1-23:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)