default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYahya Ould Hamidoune
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j68]Yahya Ould Hamidoune:
Hyper-Atoms Applied to the Critical Pair Theory. Comb. 39(6): 1281-1315 (2019)- 2013
- [j67]Yahya Ould Hamidoune:
Two inverse results. Comb. 33(2): 217-230 (2013) - [j66]Éric Balandraud, Benjamin Girard, Simon Griffiths, Yahya Ould Hamidoune:
Subset sums in abelian groups. Eur. J. Comb. 34(8): 1269-1286 (2013) - [j65]Yahya Ould Hamidoune, Susana-Clara López
, Alain Plagne:
Large restricted sumsets in general Abelian groups. Eur. J. Comb. 34(8): 1348-1364 (2013) - [j64]Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López:
On Vosperian and Superconnected Vertex-Transitive Digraphs. Graphs Comb. 29(2): 241-251 (2013) - 2012
- [j63]Benjamin Girard, Simon Griffiths, Yahya Ould Hamidoune:
k-Sums in Abelian Groups. Comb. Probab. Comput. 21(4): 582-596 (2012) - 2011
- [j62]Yahya Ould Hamidoune, Juanjo Rué:
A Lower Bound for the Size of a Minkowski Sum of Dilates. Comb. Probab. Comput. 20(2): 249-256 (2011) - [j61]Yahya Ould Hamidoune:
Counting Certain Pairings in Arbitrary Groups. Comb. Probab. Comput. 20(6): 855-865 (2011) - [j60]Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López:
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. J. Graph Theory 67(2): 124-138 (2011) - 2010
- [j59]Yahya Ould Hamidoune:
Extensions of the Scherk-Kemperman Theorem. J. Comb. Theory A 117(7): 974-980 (2010)
2000 – 2009
- 2009
- [j58]Javier Cilleruelo, Yahya Ould Hamidoune, Oriol Serra:
On Sums of Dilates. Comb. Probab. Comput. 18(6): 871-880 (2009) - 2008
- [j57]Yahya Ould Hamidoune, Oriol Serra, Gilles Zémor:
On the critical pair theory in abelian groups: Beyond Chowla's Theorem. Comb. 28(4): 441-467 (2008) - [j56]Yahya Ould Hamidoune:
On Iterated Image Size for Point-Symmetric Relations. Comb. Probab. Comput. 17(1): 61-66 (2008) - [j55]Yahya Ould Hamidoune:
A Weighted Generalization of Gao's n + D - 1 Theorem. Comb. Probab. Comput. 17(6): 793-798 (2008) - [j54]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
On complete subsets of the cyclic group. J. Comb. Theory A 115(7): 1279-1285 (2008) - 2005
- [j53]Yahya Ould Hamidoune, Domingo Quiroz:
On Subsequence Weighted Products. Comb. Probab. Comput. 14(4): 485-489 (2005) - 2003
- [j52]Weidong Gao, Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
Covering a Finite Abelian Group by Subset Sums. Comb. 23(4): 599-611 (2003) - [j51]Yahya Ould Hamidoune:
Subsequence Sums. Comb. Probab. Comput. 12(4): 413-425 (2003) - 2000
- [j50]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
On Restricted Sums. Comb. Probab. Comput. 9(6): 513-518 (2000) - [j49]Yahya Ould Hamidoune:
Subsets with a Small Sum II: the Critical Pair Problem. Eur. J. Comb. 21(2): 231-239 (2000) - [j48]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra, Ralph Tindell:
On Isoperimetric Connectivity in Vertex-Transitive Graphs. SIAM J. Discret. Math. 13(1): 139-144 (2000)
1990 – 1999
- 1999
- [j47]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
On Sets With A Small Subset Sum. Comb. Probab. Comput. 8(5): 461-466 (1999) - [j46]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
An Isoperimetric Problem in Cayley Graphs. Theory Comput. Syst. 32(5): 507-516 (1999) - 1998
- [j45]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
On Subsets with Small Product in Torsion-Free Groups. Comb. 18(4): 529-540 (1998) - [j44]Yahya Ould Hamidoune:
Adding Distinct Congruence Classes. Comb. Probab. Comput. 7(1): 81-87 (1998) - [j43]Weidong Gao, Yahya Ould Hamidoune:
Zero Sums in Abelian Groups. Comb. Probab. Comput. 7(3): 261-263 (1998) - [j42]Yahya Ould Hamidoune, Oscar Ordaz, Asdrubal Ortuño:
On a Combinatorial Theorem of Erdös, Ginzburg and Ziv. Comb. Probab. Comput. 7(4): 403-412 (1998) - 1997
- [j41]Yahya Ould Hamidoune, Michel Las Vergnas:
Directed switching games II The Arborescence Game. Discret. Math. 165-166: 395-402 (1997) - [j40]Yahya Ould Hamidoune:
Subsets with Small Sums in Abelian Groups' I: the Vosper Property. Eur. J. Comb. 18(5): 541-556 (1997) - 1996
- [j39]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
Small cutsets in quasiminimal Cayley graphs. Discret. Math. 159(1-3): 131-142 (1996) - [j38]Yahya Ould Hamidoune:
On weighted sums in abelian groups. Discret. Math. 162(1-3): 127-132 (1996) - [j37]Yahya Ould Hamidoune, Oriol Serra:
On Small Cuts Separating an Abelian Cayley Graph into Two Equal Parts. Math. Syst. Theory 29(4): 407-409 (1996) - 1995
- [j36]Yahya Ould Hamidoune:
On Weighted Sequence Sums. Comb. Probab. Comput. 4: 363-367 (1995) - [j35]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
Minimum order of loop networks of given degree and girth. Graphs Comb. 11(2): 131-138 (1995) - 1994
- [j34]Charles Delorme, Yahya Ould Hamidoune:
On products of sets in groups. Graphs Comb. 10(2-4): 101-104 (1994) - 1993
- [j33]Yahya Ould Hamidoune:
The minimum order of a cayley graph with given degree and diameter. Networks 23(4): 283-287 (1993) - 1992
- [j32]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
The Connectivity of Hierarchical Cayley Digraphs. Discret. Appl. Math. 37/38: 275-280 (1992) - [j31]Yahya Ould Hamidoune:
On a subgroup contained in some words with a bounded length. Discret. Math. 103(2): 171-176 (1992) - [j30]Yahya Ould Hamidoune:
A generalization of an addition theorem of shatrowsky. Eur. J. Comb. 13(4): 249-255 (1992) - 1991
- [j29]Yahya Ould Hamidoune:
On the Subsets Product in Finite Groups. Eur. J. Comb. 12(3): 211-221 (1991) - [j28]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
Vosperian and superconnected Abelian Cayley digraphs. Graphs Comb. 7(2): 143-152 (1991) - 1990
- [j27]Yahya Ould Hamidoune:
Connectivite des graphes de cayley abeliens sans K4. Discret. Math. 83(1): 21-26 (1990) - [j26]Yahya Ould Hamidoune:
A note on the addition of residues. Graphs Comb. 6(2): 147-152 (1990) - [j25]Yahya Ould Hamidoune:
On the numbers of independent k-sets in a claw free graph. J. Comb. Theory B 50(2): 241-244 (1990) - [j24]Yahya Ould Hamidoune, Ralph Tindell:
Vertex Transitivity and Super Line Connectedness. SIAM J. Discret. Math. 3(4): 524-530 (1990)
1980 – 1989
- 1989
- [j23]Yahya Ould Hamidoune:
Factorisations courtes dans un groupe fini. Discret. Appl. Math. 24(1-3): 153-165 (1989) - [j22]Yahya Ould Hamidoune:
Sur les atomes d'un graphe de Cayley infini. Discret. Math. 73(3): 297-300 (1989) - [j21]Yahya Ould Hamidoune, David Roeder, Steven Janke, Todd Feil, Richard Koo:
The Probability of Splitters in a List. J. Algorithms 10(1): 151-154 (1989) - [j20]Yahya Ould Hamidoune, Isabelle Salaün:
On the independence numbers of a matroid. J. Comb. Theory B 47(2): 146-152 (1989) - 1988
- [j19]Yahya Ould Hamidoune, Michel Las Vergnas:
A solution to the Misère Shannon switching Game. Discret. Math. 72(1-3): 163-166 (1988) - [j18]Yahya Ould Hamidoune, Michel Las Vergnas:
Local edge-connectivity in regular bipartite graphs. J. Comb. Theory B 44(3): 370-371 (1988) - 1987
- [j17]Yahya Ould Hamidoune, Michel Las Vergnas:
A solution to the Box Game. Discret. Math. 65(2): 157-171 (1987) - [j16]Pierre Duchet, Yahya Ould Hamidoune, Henry Meyniel:
Sur les quasi-noyaux d'un graphe. Discret. Math. 65(3): 231-235 (1987) - [j15]Yahya Ould Hamidoune:
On a Pursuit Game on Cayley Digraphs. Eur. J. Comb. 8(3): 289-295 (1987) - [j14]Yahya Ould Hamidoune:
A note on minimal directed graphs with given girth. J. Comb. Theory B 43(3): 343-348 (1987) - 1986
- [j13]Yahya Ould Hamidoune, Michel Las Vergnas:
Directed Switching Games on graphs and matroids. J. Comb. Theory B 40(3): 237-269 (1986) - 1985
- [j12]Yahya Ould Hamidoune:
Sur la separation dans les graphes de Cayley abeliens. Discret. Math. 55(3): 323-326 (1985) - 1984
- [j11]Yahya Ould Hamidoune:
On the Connectivity of Cayley Digraphs. Eur. J. Comb. 5(4): 309-312 (1984) - 1983
- [j10]Pierre Duchet, Yahya Ould Hamidoune, Michel Las Vergnas, Henry Meyniel:
Representing a planar graph by vertical lines joining different levels. Discret. Math. 46(3): 319-321 (1983) - 1982
- [j9]Yahya Ould Hamidoune:
A note on the girth of digraphs. Comb. 2(2): 143-147 (1982) - [j8]Yahya Ould Hamidoune:
On a conjecture of entringer and slater. Discret. Math. 41(3): 323-326 (1982) - 1981
- [j7]Yahya Ould Hamidoune:
An Application of Connectivity Theory in Graphs to Factorizations of Elements in Groups. Eur. J. Comb. 2(4): 349-355 (1981) - [j6]Yahya Ould Hamidoune:
Quelques problèmes de connexité dans les graphes orientés. J. Comb. Theory B 30(1): 1-10 (1981) - [j5]Yahya Ould Hamidoune:
On multiply critically h-connected graphs. J. Comb. Theory B 30(1): 108-112 (1981) - 1980
- [j4]Yahya Ould Hamidoune:
On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic sub-graphs. Discret. Math. 31(1): 89-90 (1980) - [j3]Yahya Ould Hamidoune:
A property of a-fragments of a digraph. Discret. Math. 31(1): 105-106 (1980) - [j2]Yahya Ould Hamidoune:
On critically h-connected simple graphs. Discret. Math. 32(3): 257-262 (1980)
1970 – 1979
- 1979
- [j1]Yahya Ould Hamidoune:
Sur les parcours hamiltoniens dans les graphes orientes. Discret. Math. 26(3): 227-234 (1979)
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-06-10 21:25 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:
