Papa A. Sissokho

According to our database1, Papa A. Sissokho authored at least 23 papers between 2002 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Geometry of the Minimal Solutions of a Linear Diophantine Equation.
SIAM J. Discret. Math., 2021

2018
Subspace partitions of Fqn containing direct sums.
Discret. Math., 2018

2017
The maximum size of a partial spread in a finite projective space.
J. Comb. Theory A, 2017

Avoiding Zero-Sum Sequences of Prescribed Length Over the Integers.
Integers, 2017

The maximum size of a partial spread II: Upper bounds.
Discret. Math., 2017

The structure of the minimum size supertail of a subspace partition.
Des. Codes Cryptogr., 2017

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

2015
Counting the Restricted Gaussian Partitions of a Finite Vector Space.
J. Integer Seq., 2015

2014
On the type(s) of minimum size subspace partitions.
Discret. Math., 2014

2013
A Zero-Sum Theorem Over Z.
Integers, 2013

The Feasible Matching Problem.
Graphs Comb., 2013

The supertail of a subspace partition.
Des. Codes Cryptogr., 2013

2012
Partitions of finite vector spaces over GF(2) into subspaces of dimensions 2 and s.
Finite Fields Their Appl., 2012

The lattice of finite subspace partitions.
Discret. Math., 2012

Extremal sizes of subspace partitions.
Des. Codes Cryptogr., 2012

2011
On lambda-fold partitions of finite vector spaces and duality.
Discret. Math., 2011

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

2010
The maximum size of a partial 3-spread in a finite vector space over <i>GF</i>(2).
Des. Codes Cryptogr., 2010

2009
On partitions of finite vector spaces of low dimension over GF(2).
Discret. Math., 2009

2008
On vector space partitions and uniformly resolvable designs.
Des. Codes Cryptogr., 2008

2007
Turán's theorem for pseudo-random graphs.
J. Comb. Theory 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


  Loading...