The following pages link to Gergely Csáji (Q2167892):
Displaying 12 items.
- On the complexity of stable hypergraph matching, stable multicommodity flow and related problems (Q2167893) (← links)
- On the complexity of packing rainbow spanning trees (Q2685331) (← links)
- Short proof of a theorem of Brylawski on the coefficients of the Tutte polynomial (Q2700984) (← links)
- The Merino-Welsh conjecture is false for matroids (Q6496873) (← links)
- Permutation Tutte polynomial (Q6514103) (← links)
- Approximating maximum-size properly colored forests (Q6519973) (← links)
- Approximation algorithms for matroidal and cardinal generalizations of stable matching (Q6539115) (← links)
- Computational complexity of \(k\)-stable matchings (Q6546302) (← links)
- Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains (Q6565042) (← links)
- Permutation Tutte polynomial (Q6568865) (← links)
- Solving the maximum popular matching problem with matroid constraints (Q6581613) (← links)
- Manipulating the outcome of stable marriage and roommates problems (Q6634129) (← links)
