|
Parameterized complexity of fair many-to-one matchings
|
10.1016/j.tcs.2025.115727 |
|
THEORETICAL COMPUTER SCIENCE
|
|
Application of graph autoencoder in outlier detection
|
10.1016/j.asoc.2026.114953 |
|
APPLIED SOFT COMPUTING
|
|
A conjecture on rainbow Hamiltonian cycle decomposition
|
10.1016/j.disc.2025.114676 |
|
DISCRETE MATHEMATICS
|
|
On a conjecture of Erdos on size Ramsey number of star forests
|
10.26493/1855-3974.3081.d6c |
|
ARS Mathematica Contemporanea
|
|
On the parameterized complexity of Sparsest Cut and Small-Set Expansion problems
|
10.1016/j.dam.2024.04.014 |
|
DISCRETE APPLIED MATHEMATICS
|
|
On the parameterized complexity of the acyclic matching problem
|
10.1016/j.tcs.2023.113862 |
|
|
|
The multicolor size-Ramsey numbers of cycles
|
10.1016/j.jctb.2022.10.003 |
|
|
|
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
|
10.1016/j.dam.2020.11.013 |
|
|
|
Packing cliques in 3-uniform hypergraphs
|
10.1002/jcd.21717 |
|
|
|
On the Size-Ramsey Number of Cycles
|
10.1017/S0963548319000221 |
|
|
|
عدد رمزي اندازه اي چند رنگي مسيرها
|
# |
|
|
|
Size Ramsey Number of Bipartite Graphs and Bipartite Ramanujan Graphs
|
# |
|
|
|
The spectrum for large sets of (3,lambda)-GDDs of type gu
|
10.1002/jcd.21631 |
|
|
|
On a Question of Erdos and Faudree on the Size Ramsey Numbers
|
10.1137/17M1115022 |
|
|
|
Edge clique cover of claw-free graphs
|
10.1002/jgt.22403 |
|
|
|
Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles
|
10.1002/jgt.22226 |
|
|