- Publications
- Influence
Claim Your Author Page
Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications (all current information on this profile has been aggregated automatically from publisher and metadata sources).
A perfect matching in a 3-uniform hypergraph on $n=3k$ vertices is a subset of $\frac{n}{3}$ disjoint edges. We prove that if $H$ is a 3-uniform hypergraph on $n=3k$ vertices such that every vertex… Continue Reading
A perfect matching in a 4-uniform hypergraph on n vertices is a subset of ? n 4 ? disjoint edges. We prove that if H is a sufficiently large 4-uniform hypergraph on n = 4 k vertices such that every… Continue Reading
Sequence classification algorithms, such as SVM, require a definition of distance (similarity) measure between two sequences. A commonly used notion of similarity is the number of matches between… Continue Reading
Massive sizes of real-world graphs, such as social networks and web graph, impose serious challenges to process and perform analytics on them. These issues can be resolved by working on a small… Continue Reading
The problem of identifying important players in a given network is of pivotal importance for viral marketing, public health management, network security and various other fields of social network… Continue Reading
String kernel-based machine learning methods have yielded great success in practical tasks of structured/sequential data analysis. They often exhibit state-of-the-art performance on tasks such as… Continue Reading
IEEE 37th International Conference on Distributed…
Evaluating an extremely useful graph property, the spectral radius (largest absolute eigenvalue of the graph adjacency matrix), for large graphs requires excessive computing resources. This problem… Continue Reading
Discrete Mathematics & Theoretical Computer…
A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, P\'osa conjectured that every graph with minimum degree at least… Continue Reading
Paraphrase detection is an important task in text analytics with numerous applications such as plagiarism detection, duplicate question identification, and enhanced customer support helpdesks. Deep… Continue Reading
Accurate short term electricity load forecasting is crucial for efficient operations of the power sector. Predicting loads at a fine granularity (e.g. households) is made challenging due to a large… Continue Reading