PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Roy, Sambuddha"

Author of the publication

copydeleteadd this publication to your clipboard
Extracting dense communities from telecom call graphs.

, , , , , and . COMSWARE, page 82-89. IEEE, (2008)

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.

Ph. D. Sarbani Roy University of Stuttgart

Rajarshi Roy University of Stuttgart

Ranjith Mathew Roy University of Stuttgart

 

Other publications of authors with the same name

Planar and Grid Graph Reachability Problems., , , , and . Theory Comput. Syst., 45 (4): 675-723 (2009)Approximating maximum weight K-colorable subgraphs in chordal graphs., and . Inf. Process. Lett., 109 (7): 365-368 (2009)Arthur and Merlin as Oracles., and . Electronic Colloquium on Computational Complexity (ECCC), (2009)Grid Graph Reachability Problems, , , , and . Electronic Colloquium on Computational Complexity (ECCC), (2005)Approximation Algorithms for Edge Partitioned Vertex Cover Problems, , , and . CoRR, (2011)Fenchel Duals for Drifting Adversaries., , , , and . CoRR, (2013)Grid Graph Reachability Problems., , , , and . Computational Complexity Conference, page 299-313. IEEE Computer Society, (2006)Finding Independent Sets in Unions of Perfect Graphs., , , and . FSTTCS, volume 8 of LIPIcs, page 251-259. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2010)Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs., , and . Theory Comput. Syst., 47 (3): 737-757 (2010)The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory., , , and . J. Comput. Syst. Sci., 77 (1): 14-40 (2011)