# Papa Sissokho

According to our database

Collaborative distances:

^{1}, Papa Sissokho authored at least 18 papers between 2002 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2018

Subspace partitions of Fqn containing direct sums.

Discrete Mathematics, 2018

2017

The maximum size of a partial spread in a finite projective space.

J. Comb. Theory, Ser. A, 2017

The maximum size of a partial spread II: Upper bounds.

Discrete Mathematics, 2017

The structure of the minimum size supertail of a subspace partition.

Des. Codes Cryptography, 2017

2016

On the existence of a (2, 3)-spread in V(7, 2).

Ars Comb., 2016

2014

On the type(s) of minimum size subspace partitions.

Discrete Mathematics, 2014

2013

The Feasible Matching Problem.

Graphs and Combinatorics, 2013

The supertail of a subspace partition.

Des. Codes Cryptography, 2013

2012

Partitions of finite vector spaces over GF(2) into subspaces of dimensions 2 and s.

Finite Fields and Their Applications, 2012

The lattice of finite subspace partitions.

Discrete Mathematics, 2012

Extremal sizes of subspace partitions.

Des. Codes Cryptography, 2012

2011

On lambda-fold partitions of finite vector spaces and duality.

Discrete Mathematics, 2011

2010

The maximum size of a partial 3-spread in a finite vector space over

*GF*(2).
Des. Codes Cryptography, 2010

2009

On partitions of finite vector spaces of low dimension over GF(2).

Discrete Mathematics, 2009

2008

On vector space partitions and uniformly resolvable designs.

Des. Codes Cryptography, 2008

2007

Turán's theorem for pseudo-random graphs.

J. Comb. Theory, Ser. A, 2007

2004

Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs.

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2002

Light spanners and approximate TSP in weighted graphs with forbidden minors.

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002