Publications
Publications
Author:  
All :: A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z 
All :: S. Dolado, ... , Szmidt, Szymańska, Szymanska, Székelyhidi 
References
5.
Andrzej Dudek, Marek Karpinski, Andrzej Ruciński and Edyta Szymańska
Approximate counting of matchings in (3,3)-hypergraphs
Algorithm theory---SWAT 2014 Volume 8503 of Lecture Notes in Comput. Sci.
page 380--391.
Publisher: Springer, Cham,
2014
4.
Marek Karpiński, Andrzej Ruciński and Edyta Szymańska
Approximate counting of matchings in sparse uniform hypergraphs
ANALCO13---Meeting on Analytic Algorithmics and Combinatorics
page 72--79.
Publisher: SIAM, Philadelphia, PA,
2013
3.
Marek Karpiński, Andrzej Ruciński and Edyta Szymańska
Computational complexity of the perfect matching problem in hypergraphs with subcritical density
Internat. J. Found. Comput. Sci., 21(6):905--924
2010
2.
Marek Karpiński, Andrzej Ruciński and Edyta Szymańska
Computational complexity of the Hamiltonian cycle problem in dense hypergraphs
LATIN 2010: theoretical informatics Volume 6034 of Lecture Notes in Comput. Sci.
page 662--673.
Publisher: Springer, Berlin,
2010
1.
Marek Karpiński, Andrzej Ruciński and Edyta Szymańska
The complexity of perfect matching problems on dense hypergraphs
Algorithms and computation Volume 5878 of Lecture Notes in Comput. Sci.
page 626--636.
Publisher: Springer, Berlin,
2009
Export as:
BibTeX, XML