default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMihai Ciucu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Mihai Ciucu:
Two counterparts of the TFK formula for cylinder graphs. J. Comb. Theory A 196: 105722 (2023)- 2021
- [j19]Mihai Ciucu, Tri Lai, Ranjan Rohatgi:
Tilings of hexagons with a removed triad of bowties. J. Comb. Theory A 178: 105359 (2021)
2010 – 2019
- 2019
- [j18]Mihai Ciucu, Tri Lai:
Lozenge tilings of doubly-intruded hexagons. J. Comb. Theory A 167: 294-339 (2019) - 2018
- [j17]Mihai Ciucu:
Symmetries of Shamrocks II: Axial Shamrocks. Electron. J. Comb. 25(2): 2 (2018) - [j16]Mihai Ciucu:
Symmetries of shamrocks, Part I. J. Comb. Theory A 155: 376-397 (2018) - 2016
- [j15]Mihai Ciucu, Ilse Fischer
:
Lozenge tilings of hexagons with arbitrary dents. Adv. Appl. Math. 73: 1-22 (2016) - [j14]Mihai Ciucu:
A Short Conceptual Proof of Narayana's Path-Counting Formula. Electron. J. Comb. 23(4): 4 (2016) - 2015
- [j13]Mihai Ciucu, Ilse Fischer:
Proof of two conjectures of Ciucu and Krattenthaler on the enumeration of lozenge tilings of hexagons with cut off corners. J. Comb. Theory A 133: 228-250 (2015) - [j12]Mihai Ciucu:
A generalization of Kuo condensation. J. Comb. Theory A 134: 221-241 (2015) - 2014
- [j11]Mihai Ciucu, Tri Lai:
Proof of Blum's conjecture on hexagonal dungeons. J. Comb. Theory A 125: 273-305 (2014)
2000 – 2009
- 2007
- [j10]Mihai Ciucu:
A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd order. Discret. Math. 307(15): 1957-1960 (2007) - 2005
- [j9]Mihai Ciucu, Weigen Yan, Fuji Zhang:
The number of spanning trees of plane graphs with reflective symmetry. J. Comb. Theory A 112(1): 105-116 (2005) - 2002
- [j8]Mihai Ciucu, Christian Krattenthaler:
Enumeration of Lozenge Tilings of Hexagons with Cut-Off Corners. J. Comb. Theory A 100(2): 201-231 (2002) - 2001
- [j7]Mihai Ciucu, Theresia Eisenkölbl, Christian Krattenthaler, D. Zare:
Enumeration of Lozenge Tilings of Hexagons with a Central Triangular Hole. J. Comb. Theory A 95(2): 251-334 (2001)
1990 – 1999
- 1999
- [j6]Mihai Ciucu, Christian Krattenthaler:
The Number of Centered Lozenge Tilings of a Symmetric Hexagon. J. Comb. Theory A 86(1): 103-126 (1999) - [j5]Mihai Ciucu:
The Equivalence between Enumerating Cyclically Symmetric, Self-Complementary and Totally Symmetric, Self-Complementary Plane Partitions. J. Comb. Theory A 86(2): 382-389 (1999) - 1998
- [j4]Mihai Ciucu:
A Complementation Theorem for Perfect Matchings of Graphs Having a Cellular Completion. J. Comb. Theory A 81(1): 34-68 (1998) - [j3]Mihai Ciucu:
Enumeration of Lozenge Tilings of Punctured Hexagons. J. Comb. Theory A 83(2): 268-272 (1998) - 1997
- [j2]Mihai Ciucu:
Enumeration of Perfect Matchings in Graphs with Reflective Symmetry. J. Comb. Theory A 77(1): 67-97 (1997) - 1996
- [j1]Mihai Ciucu:
A Remark on Sets Having the Steinhaus Property. Comb. 16(3): 321-324 (1996)
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 20:32 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:
