Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDariush Kiani
Person information
- affiliation: Amirkabir University of Technology, Iran
- unicode name: داریوش کیانی
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j17]Mohammad Rouzbahani Malayeri, Sara Saeedi Madani, Dariush Kiani:
A proof for a conjecture on the regularity of binomial edge ideals. J. Comb. Theory A 180: 105432 (2021)- 2019
- [j16]Nastaran Haghparast, Dariush Kiani
:
Edge-connectivity and edges of even factors of graphs. Discuss. Math. Graph Theory 39(2): 357-364 (2019) - [j15]Nastaran Haghparast, Dariush Kiani:
Spanning Eulerian Subgraphs of Large Size. Graphs Comb. 35(1): 201-206 (2019) - [j14]Dariush Kiani, Amir Saki:
The lattice of subracks is atomic. J. Comb. Theory A 162: 55-64 (2019) - 2017
- [j13]A. Ilkhani, Dariush Kiani:
Existence of equitable h-edge-colorings of type s = 2, 3 of Kt. Ars Comb. 131: 347-354 (2017) - [j12]Maryam Mirzakhah, Dariush Kiani:
Some Posets Of Unicyclic Graphs Based On Signless Laplacian Coefficients. Ars Comb. 132: 371-388 (2017) - [j11]Hassan Khodaiemehr, Dariush Kiani, Mohammad-Reza Sadeghi:
LDPC Lattice Codes for Full-Duplex Relay Channels. IEEE Trans. Commun. 65(2): 536-548 (2017) - [j10]Hassan Khodaiemehr, Dariush Kiani:
Construction and Encoding of QC-LDPC Codes Using Group Rings. IEEE Trans. Inf. Theory 63(4): 2039-2060 (2017) - 2016
- [j9]Dariush Kiani, Sara Saeedi Madani:
The Castelnuovo-Mumford regularity of binomial edge ideals. J. Comb. Theory A 139: 80-86 (2016) - 2015
- [j8]Hassan Khodaiemehr, Dariush Kiani:
High-rate space-time block codes from twisted Laurent series rings. Adv. Math. Commun. 9(3): 255-275 (2015) - [j7]Saieed Akbari, Dariush Kiani, Fatemeh Mohammadi, Somayeh Moradi, Farhad Rahmati:
An Algebraic Criterion for the Choosability of Graphs. Graphs Comb. 31(3): 497-506 (2015) - 2014
- [j6]Saieed Akbari, Dariush Kiani, Maryam Mirzakhah:
Graphs whose Spectrum Determined by Non-constant Coefficients. Electron. Notes Discret. Math. 45: 29-34 (2014) - 2013
- [j5]Saieed Akbari, Dariush Kiani, Fatemeh Mohammadi, Somayeh Moradi:
Characterization of M3(2)-graphs. Ars Comb. 111: 505-513 (2013) - [j4]Sara Saeedi Madani, Dariush Kiani:
On The Binomial Edge Ideal of a Pair of Graphs. Electron. J. Comb. 20(1): 48 (2013) - 2012
- [j3]Dariush Kiani, Mohsen Molla Haji Aghaei:
On the Unitary Cayley Graph of a Ring. Electron. J. Comb. 19(2): 10 (2012) - [j2]Dariush Kiani, Sara Saeedi Madani:
Binomial Edge Ideals of Graphs. Electron. J. Comb. 19(2): 44 (2012) - 2010
- [j1]Hasti Hamidzade, Dariush Kiani:
Erratum to "The lollipop graph is determined by its Q-spectrum". Discret. Math. 310(10-11): 1649 (2010)
Conference and Workshop Papers
- 2015
- [c1]Hassan Khodaiemehr, Dariush Kiani, Mohammad-Reza Sadeghi:
One-level LDPC lattice codes for the relay channels. IWCIT 2015: 1-6
Informal and Other Publications
- 2019
- [i3]Asghar Bahmani, Dariush Kiani:
Structure of Trees with Respect to Nodal Vertex Sets. CoRR abs/1907.12062 (2019) - 2017
- [i2]Hassan Khodaiemehr, Dariush Kiani:
Construction and Encoding of QC-LDPC Codes Using Group Rings. CoRR abs/1701.00210 (2017) - 2016
- [i1]Hassan Khodaiemehr, Dariush Kiani, Mohammad-Reza (Rafsanjani) Sadeghi:
LDPC Lattice Codes for Full-Duplex Relay Channels. CoRR abs/1608.03874 (2016)
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:28 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:
