default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPapa A. Sissokho
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j20]Papa A. Sissokho
:
Geometry of the Minimal Solutions of a Linear Diophantine Equation. SIAM J. Discret. Math. 35(3): 1952-1963 (2021)
2010 – 2019
- 2018
- [j19]Füsun Akman, Papa Amar Sissokho:
Subspace partitions of Fqn containing direct sums. Discret. Math. 341(7): 1850-1863 (2018) - 2017
- [j18]Esmeralda Nastase, Papa A. Sissokho:
The structure of the minimum size supertail of a subspace partition. Des. Codes Cryptogr. 83(3): 549-563 (2017) - [j17]Esmeralda Nastase, Papa A. Sissokho:
The maximum size of a partial spread II: Upper bounds. Discret. Math. 340(7): 1481-1487 (2017) - [j16]C. Augspurger, M. Minter, Katie Shoukry, Papa A. Sissokho, Kayla Voss:
Avoiding Zero-Sum Sequences of Prescribed Length Over the Integers. Integers 17: A18 (2017) - [j15]Esmeralda Nastase, Papa Amar Sissokho:
The maximum size of a partial spread in a finite projective space. J. Comb. Theory A 152: 353-362 (2017) - 2016
- [j14]Olof Heden, Papa Amar Sissokho:
On the existence of a (2, 3)-spread in V(7, 2). Ars Comb. 124: 161-164 (2016) - 2015
- [j13]Füsun Akman, Papa A. Sissokho:
Counting the Restricted Gaussian Partitions of a Finite Vector Space. J. Integer Seq. 18(7): 15.7.5 (2015) - 2014
- [j12]Olof Heden, Juliane Lehmann, Esmeralda Nastase, Papa A. Sissokho:
On the type(s) of minimum size subspace partitions. Discret. Math. 332: 1-9 (2014) - 2013
- [j11]Olof Heden, Juliane Lehmann, Esmeralda Nastase, Papa A. Sissokho:
The supertail of a subspace partition. Des. Codes Cryptogr. 69(3): 305-316 (2013) - [j10]Yuejian Peng, Papa A. Sissokho:
The Feasible Matching Problem. Graphs Comb. 29(3): 695-704 (2013) - [j9]Marvin L. Sahs, Papa A. Sissokho, Jordan N. Torf:
A Zero-Sum Theorem Over Z. Integers 13: A70 (2013) - 2012
- [j8]Olof Heden, Juliane Lehmann, Esmeralda Nastase, Papa A. Sissokho:
Extremal sizes of subspace partitions. Des. Codes Cryptogr. 64(3): 265-274 (2012) - [j7]Füsun Akman, Papa Amar Sissokho:
The lattice of finite subspace partitions. Discret. Math. 312(8): 1487-1491 (2012) - [j6]G. F. Seelinger, Papa A. Sissokho, L. E. Spence, Charles Vanden Eynden:
Partitions of finite vector spaces over GF(2) into subspaces of dimensions 2 and s. Finite Fields Their Appl. 18(6): 1114-1132 (2012) - 2011
- [j5]Saad I. El-Zanati, G. F. Seelinger, Papa A. Sissokho, L. E. Spence, Charles Vanden Eynden:
On lambda-fold partitions of finite vector spaces and duality. Discret. Math. 311(4): 307-318 (2011) - [i1]Olof Heden, Papa Amar Sissokho:
On the existence of a (2,3)-spread in V(7,2). CoRR abs/1101.5336 (2011) - 2010
- [j4]Saad I. El-Zanati, Heather Jordon, G. F. Seelinger, Papa A. Sissokho, L. E. Spence:
The maximum size of a partial 3-spread in a finite vector space over GF(2). Des. Codes Cryptogr. 54(2): 101-107 (2010)
2000 – 2009
- 2009
- [j3]Saad I. El-Zanati, G. F. Seelinger, Papa Amar Sissokho, L. E. Spence, Charles Vanden Eynden:
On partitions of finite vector spaces of low dimension over GF(2). Discret. Math. 309(14): 4727-4735 (2009) - 2008
- [j2]Andrew Blinco, Saad I. El-Zanati, G. F. Seelinger, Papa Amar Sissokho, L. E. Spence, Charles Vanden Eynden:
On vector space partitions and uniformly resolvable designs. Des. Codes Cryptogr. 48(1): 69-77 (2008) - 2007
- [j1]Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht, Papa A. Sissokho, Jozef Skokan:
Turán's theorem for pseudo-random graphs. J. Comb. Theory A 114(4): 631-657 (2007) - 2004
- [c2]Artur Czumaj, Michelangelo Grigni, Papa A. Sissokho, Hairong Zhao:
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. SODA 2004: 496-505 - 2002
- [c1]Michelangelo Grigni, Papa A. Sissokho:
Light spanners and approximate TSP in weighted graphs with forbidden minors. SODA 2002: 852-857
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
