|
On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems
|
10.1016/j.dam.2024.04.014
|
1403 - 07
|
|
|
On the parameterized complexity of the acyclic matching problem
|
10.1016/j.tcs.2023.113862
|
1402 - 02
|
|
|
The multicolor size-Ramsey numbers of cycles
|
10.1016/j.jctb.2022.10.003
|
1401 - 10
|
|
|
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
|
10.1016/j.dam.2020.11.013
|
1399 - 10
|
|
|
Packing cliques in 3-uniform hypergraphs
|
10.1002/jcd.21717
|
1398 - 12
|
|
|
On the Size-Ramsey Number of Cycles
|
10.1017/S0963548319000221
|
1398 - 08
|
|
|
Size Ramsey Number of Bipartite Graphs and Bipartite Ramanujan Graphs
|
#
|
1398 - 03
|
|
|
The spectrum for large sets of (3,lambda)-GDDs of type gu
|
10.1002/jcd.21631
|
1397 - 08
|
|
|
Edge clique cover of claw-free graphs
|
10.1002/jgt.22403
|
1397 - 04
|
|
|
On a Question of Erdos and Faudree on the Size Ramsey Numbers
|
10.1137/17M1115022
|
1397 - 04
|
|
|
Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles
|
10.1002/jgt.22226
|
1396 - 09
|
|
|
Edge clique covering sum of graphs
|
#
|
1394 - 12
|
|
|
Pairwise balanced designs and sigma clique partitions
|
#
|
1394 - 10
|
|
|
Local Clique Covering of Claw-Free Graphs
|
#
|
1393 - 11
|
|
|
Clustering and outlier detection using isoperimetric number of trees
|
#
|
1392 - 09
|
|
|
On the complexity of isoperimetric problems on trees
|
#
|
1390 - 01
|
|
|
On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
|
#
|
1390 - 01
|
|
|
On b-coloring of cartesian product of graphs
|
#
|
1390 - 01
|
|
|
On the isoperimetric spectrum of graphs and its approximations
|
#
|
1388 - 01
|
|