The following pages link to Ramin Javadi (Q271600):
Displaying 21 items.
- Pairwise balanced designs and sigma clique partitions (Q271601) (← links)
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes (Q424499) (← links)
- On the complexity of isoperimetric problems on trees (Q765346) (← links)
- (Q898222) (redirect page) (← links)
- Clustering and outlier detection using isoperimetric number of trees (Q898224) (← links)
- On the isoperimetric spectrum of graphs and its approximations (Q974467) (← links)
- On \(b\)-coloring of the Kneser graphs (Q1043965) (← links)
- Edge clique covering sum of graphs (Q1701317) (← links)
- The multicolor size-Ramsey numbers of cycles (Q2101174) (← links)
- Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (Q2217481) (← links)
- (Q2864479) (← links)
- Local Clique Covering of Claw-Free Graphs (Q3466357) (← links)
- Decomposition of complete uniform multi‐hypergraphs into Berge paths and cycles (Q4581279) (← links)
- On a Question of Erdös and Faudree on the Size Ramsey Numbers (Q4584957) (← links)
- The spectrum for large sets of ‐GDDs of type (Q4629795) (← links)
- Edge clique cover of claw‐free graphs (Q4629999) (← links)
- Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs (Q5135729) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- Packing cliques in 3‐uniform hypergraphs (Q6187456) (← links)
- A Conjecture on Rainbow Hamiltonian Cycle Decomposition (Q6527683) (← links)
- On the parameterized complexity of \textsc{Sparsest Cut} and \textsc{Small-Set Expansion} problems (Q6559388) (← links)
