Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Talya Eden
Faster Sublinear Approximation of the Number of K-Cliques in Low-Arboricity Graphs
Related publications
Sublinear Time Approximation of the Cost of a Metric K-Nearest Neighbor Graph
Point Arboricity Critical Graphs Exist
Journal of the London Mathematical Society
Mathematics
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
Ordered Graphs and Large Bi-Cliques in Intersection Graphs of Curves
European Journal of Combinatorics
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Theoretical Computer Science
Topology
On the Problem of Finding Approximation of Bipatite Cliques
Proceedings of the Institute for System Programming of the RAS
An Approach to Determination of Maximal Cliques in Undirected Graphs
International Journal of Modern Education and Computer Science
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs
A Note on Bipartite Graphs Whose [1,k]-Domination Number Equal to Their Number of Vertices
Opuscula Mathematica
Mathematics
