#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2002

2017

- This year (3)
- Last 5 years (9)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Saad El-Zanati, Heather Jordon, G. F. Seelinger, Papa Sissokho, L. E. Spence
- Des. Codes Cryptography
- 2010

Let n â‰¥ 3 be an integer, let Vn(2) denote the vector space of dimension n over G F(2), and let c be the least residue of n modulo 3. We prove that the maximum number of 3-dimensional subspaces inâ€¦ (More)

- Michelangelo Grigni, Papa Sissokho
- SODA
- 2002

Given an edge weighted graph <i>G</i> with <i>n</i> vertices and no <i>K</i><inf>Ï„</inf>-minor and a small positive constant Îµ, we show that a simple greedy algorithm [1] finds a spanning subgraphâ€¦ (More)

- Artur Czumaj, Michelangelo Grigni, Papa Sissokho, Hairong Zhao
- SODA
- 2004

Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2-vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that for planar graphs,â€¦ (More)

- Yoshiharu Kohayakawa, V. Rodl, Papa Sissokho, Veronika Roedl
- 2002

In this paper, we show the equivalence of some quasi-random properties for sparse graphs, that is, graphsG with edge density p = |E(G)|/ ( n 2 ) = o(1), where o(1) â†’ 0 as n = |V (G)| â†’ âˆž. Inâ€¦ (More)

- Fusun Akman, Papa Sissokho
- Discrete Mathematics
- 2012

Let V denote V (n, q), the vector space of dimension n over GF(q). A subspace partition of V is a collection Î of subspaces of V such that every nonzero vector in V is contained in exactly oneâ€¦ (More)

- Andrew Blinco, Saad El-Zanati, G. F. Seelinger, Papa Sissokho, L. E. Spence, Charles Vanden Eynden
- Des. Codes Cryptography
- 2008

Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained in exactly oneâ€¦ (More)

- Yoshiharu Kohayakawa, Vojtech RÃ¶dl, Mathias Schacht, Papa Sissokho, Jozef Skokan
- J. Comb. Theory, Ser. A
- 2007

The generalized TurÃ¡n number ex(G,H) of two graphs G and H is the maximum number of edges in a subgraph of G not containing H. When G is the complete graph Km on m vertices, the value of ex(Km, H) isâ€¦ (More)

- Esmeralda Nastase, Papa Sissokho
- J. Comb. Theory, Ser. A
- 2017

Let n and t be positive integers with t < n, and let q be a prime power. A partial (t âˆ’ 1)-spread of PG(n âˆ’ 1, q) is a set of (t âˆ’ 1)-dimensional subspaces of PG(n âˆ’ 1, q) that are pairwise disjoint.â€¦ (More)

- Olof Heden, Juliane Lehmann, Esmeralda Nastase, Papa Sissokho
- Des. Codes Cryptography
- 2013

- Esmeralda Nastase, Papa Sissokho
- Discrete Mathematics
- 2017

Let n and t be positive integers with t < n, and let q be a prime power. A partial (t âˆ’ 1)-spread of PG(n âˆ’ 1, q) is a set of (t âˆ’ 1)-dimensional subspaces of PG(n âˆ’ 1, q) that are pairwise disjoint.â€¦ (More)