default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKahina Meslem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j11]Kahina Meslem, Éric Sopena
:
Distinguishing numbers and distinguishing indices of oriented graphs. Discret. Appl. Math. 285: 330-342 (2020)
2010 – 2019
- 2019
- [j10]Kahina Meslem, Éric Sopena:
On the distinguishing number of cyclic tournaments: Towards the Albertson-Collins Conjecture. Discret. Appl. Math. 266: 219-236 (2019) - [i3]Kahina Meslem, Éric Sopena:
Distinguishing numbers and distinguishing indices of oriented graphs. CoRR abs/1910.12738 (2019) - 2018
- [j9]Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani:
Game distinguishing numbers of Cartesian products. Ars Math. Contemp. 14(1): 39-54 (2018) - 2017
- [j8]Sylvain Gravier, Kahina Meslem, Simon Schmidt, Souad Slimani:
A New Game Invariant of Graphs: the Game Distinguishing Number. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - 2016
- [i2]Kahina Meslem, Éric Sopena:
On the Distinguishing Number of Cyclic Tournaments: Towards Albertson-Collins Conjecture. CoRR abs/1608.04866 (2016) - 2015
- [i1]Kahina Meslem, Sylvain Gravier, Souad Slimani:
Distinguishing Number and Circulant Graphs. CTW 2015: 9-11
2000 – 2009
- 2009
- [j7]Kahina Meslem, Méziane Aïder:
On an extension of distance hereditary graphs. Discret. Math. 309(11): 3644-3652 (2009) - [j6]Méziane Aïder, Sylvain Gravier, Kahina Meslem:
Isometric embeddings of subdivided connected graphs into hypercubes. Discret. Math. 309(22): 6402-6407 (2009) - [j5]Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Subdivided graphs as isometric subgraphs of Hamming graphs. Eur. J. Comb. 30(5): 1062-1070 (2009) - 2008
- [j4]Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Isometric Embeddings of Subdivided Complete Graphs in the Hypercube. SIAM J. Discret. Math. 22(3): 1226-1238 (2008) - 2007
- [j3]Laurent Beaudou, Sylvain Gravier, Kahina Meslem:
Isometric embeddings of subdivided complete graphs in the hypercube. Electron. Notes Discret. Math. 29: 277-281 (2007) - 2006
- [j2]Méziane Aïder, Sylvain Gravier, Kahina Meslem:
Isometric embedding of subdivided Connected graphs in the hypercube. Electron. Notes Discret. Math. 24: 145-151 (2006) - 2005
- [j1]Kahina Meslem, Méziane Aïder:
On an extension of distance-hereditary graphs. Electron. Notes Discret. Math. 22: 253-259 (2005)
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 2025-01-21 00:19 CET 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:
