| On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems |
10.1016/j.dam.2024.04.014 |
|
Journal |
| On the parameterized complexity of the acyclic matching problem |
10.1016/j.tcs.2023.113862 |
|
Journal |
| The multicolor size-Ramsey numbers of cycles |
10.1016/j.jctb.2022.10.003 |
|
Journal |
| Multi-way sparsest cut problem on trees with a control on the number of parts and outliers |
10.1016/j.dam.2020.11.013 |
|
Journal |
| Packing cliques in 3-uniform hypergraphs |
10.1002/jcd.21717 |
|
Journal |
| On the Size-Ramsey Number of Cycles |
10.1017/S0963548319000221 |
|
Journal |
| عدد رمزي اندازه اي چند رنگي مسيرها |
# |
|
Journal |
| Size Ramsey Number of Bipartite Graphs and Bipartite Ramanujan Graphs |
# |
|
Journal |
| The spectrum for large sets of (3,lambda)-GDDs of type gu |
10.1002/jcd.21631 |
|
Journal |
| On a Question of Erdos and Faudree on the Size Ramsey Numbers |
10.1137/17M1115022 |
|
Journal |
| Edge clique cover of claw-free graphs |
10.1002/jgt.22403 |
|
Journal |
| Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles |
10.1002/jgt.22226 |
|
Journal |
| Edge clique covering sum of graphs |
# |
|
Journal |
| Pairwise balanced designs and sigma clique partitions |
# |
|
Journal |
| Local Clique Covering of Claw-Free Graphs |
# |
|
Journal |
| Clustering and outlier detection using isoperimetric number of trees |
# |
|
Journal |
| On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes |
# |
|
Journal |
| On b-coloring of cartesian product of graphs |
# |
|
Journal |
| On the complexity of isoperimetric problems on trees |
# |
|
Journal |
| On the isoperimetric spectrum of graphs and its approximations |
# |
|
Journal |