Author of the publication

Clustering Categorical Data: An Approach Based on Dynamical Systems.

, , and . VLDB, page 311-322. Morgan Kaufmann, (1998)

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.

 

Other publications of authors with the same name

Detecting Strong Ties Using Network Motifs., , , and . WWW (Companion Volume), page 983-992. ACM, (2017)Keynote: On-Line Social Systems with Long-Range Goals.. COSN, page 1. ACM, (2015)Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem.. STOC, page 530-539. ACM, (1998)Can Deep Reinforcement Learning solve Erdos-Selfridge-Spencer Games?, , , , , and . ICLR (Workshop), OpenReview.net, (2018)Preventing Unraveling in Social Networks: The Anchored k-Core Problem., , , , and . ICALP (2), volume 7392 of Lecture Notes in Computer Science, page 440-451. Springer, (2012)Are randomly grown graphs really random?, , , , and . Physical Review E, 64 (4): 041902+ (Jun 14, 2001)Planted Hitting Set Recovery in Hypergraphs., , and . CoRR, (2019)Link Prediction in Networks with Core-Fringe Data., and . WWW, page 94-104. ACM, (2019)Subgraph frequencies: mapping the empirical and extremal geography of large graph collections., , and . WWW, page 1307-1318. International World Wide Web Conferences Steering Committee / ACM, (2013)The Convergence of Social and Technological Networks.. TAMC, volume 7287 of Lecture Notes in Computer Science, page 29. Springer, (2012)