On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs

A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

The Complexity of Perfect Matching Problems on Dense Hypergraphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

The polynomially bounded perfect matching problem is in NC2

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Computational complexity of the hamiltonian cycle problem in dense hypergraphs

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Planarizing gadgets for perfect matching do not exist

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science