C. Seshadhri

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering	2021	Noujan Pashanasangi C. Seshadhri
+ PDF Chat	Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles	2021	Suman K. Bera Noujan Pashanasangi C. Seshadhri

Common Coauthors

Coauthor	Papers Together
Noujan Pashanasangi	2
Suman K. Bera	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Bounded Arboricity to Determine the Local Structure of Sparse Graphs	2006	Gaurav Goel Jens Gustedt	1
+	Counting H-Colorings of Partial k-Trees	2001	Josep Dı́az Marı́a Serna Dimitrios M. Thilikos	1
+	Counting Graph Homomorphisms	2007	Christian Borgs Jennifer Chayes László Lovász Vera T. Sós K. Vesztergombi	1
+ PDF Chat	Finding and counting given length cycles	1997	Noga Alon Raphael Yuster Uri Zwick	1
+ PDF Chat	Counting Triangles in Massive Graphs with MapReduce	2014	Tamara G. Kolda Ali Pınar Todd Plantenga C. Seshadhri Christine Task	1
+	Reductions in streaming algorithms, with an application to counting triangles in graphs	2002	Ziv Bar-Yossef Ravi Kumar D. Sivakumar	1
+	A space efficient streaming algorithm for triangle counting using the birthday paradox	2013	Madhav Jha C. Seshadhri Ali Pınar	1
+	The complexity of counting homomorphisms seen from the other side	2004	Víctor Dalmau Peter Jönsson	1
+	Graph Homomorphisms and Phase Transitions	1999	Graham Brightwell Peter Winkler	1
+	An inequality for the chromatic number of a graph	1968	G Szekeres Herbert S. Wilf	1
+	The parameterized complexity of counting problems	2003	J. Flum Martin Grohe	1
+	Counting Arbitrary Subgraphs in Data Streams	2012	Daniel M. Kane Kurt Mehlhorn Thomas Sauerwald He Sun	1
+ PDF Chat	Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems	2014	Amir Abboud Virginia Vassilevska Williams	1
+ PDF Chat	Efficient Graphlet Counting for Large Networks	2015	Nesreen K. Ahmed Jennifer Neville Ryan A. Rossi Nick Duffield	1
+ PDF Chat	Homomorphisms are a good basis for counting small subgraphs	2017	Radu Curticapean Holger Dell Dániel Marx	1
+	Large Networks and Graph Limits	2012	László Lovász	1
+ PDF Chat	Approximately Counting Triangles in Sublinear Time	2017	Talya Eden Amit Levi Dana Ron C. Seshadhri	1
+	Faster sublinear approximations of $k$-cliques for low arboricity graphs	2018	Talya Eden Dana Ron C. Seshadhri	1
+	Counting Answers to Existential Questions	2019	Holger Dell Marc Roth Philip Wellnitz	1
+	ESCAPE: Efficiently Counting All 5-Vertex Subgraphs	2016	Ali Pınar C. Seshadhri Vaidyanathan Vishal	1
+	Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts	2014	Madhav Jha C. Seshadhri Ali Pınar	1
+ PDF Chat	On approximating the number of k-cliques in sublinear time	2018	Talya Eden Dana Ron C. Seshadhri	1
+	Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by EVOKE	2020	Noujan Pashanasangi C. Seshadhri	1
+ PDF Chat	Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory	2019	Marc Roth Philip Wellnitz	1
+	Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six	2019	Suman K. Bera Noujan Pashanasangi C. Seshadhri	1
+	How the Degeneracy Helps for Triangle Counting in Graph Streams	2020	Suman K. Bera C. Seshadhri	1
+ PDF Chat	Counting Subgraphs in Degenerate Graphs	2022	Suman K. Bera Lior Gishboliner Yevgeny Levanzov C. Seshadhri A. Shapira	1
+	The complexity of counting graph homomorphisms	2000	Martin J.S. Dyer Catherine Greenhill	1
+	Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models	2019	Suman K. Bera Amit Chakrabarti Prantar Ghosh	1