default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenri Mühle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Wenjie Fang, Henri Mühle, Jean-Christophe Novelli:
Parabolic Tamari Lattices in Linear Type B. Electron. J. Comb. 31(1) (2024)- [j13]Henri Mühle:
Combinatorics of $(m,n)$-Word Lattices. Electron. J. Comb. 31(4) (2024) - 2022
- [j12]Henri Mühle:
Hochschild lattices and shuffle lattices. Eur. J. Comb. 103: 103521 (2022) - 2021
- [j11]Wenjie Fang
, Henri Mühle, Jean-Christophe Novelli:
A Consecutive Lehmer Code for Parabolic Quotients of the Symmetric Group. Electron. J. Comb. 28(3) (2021) - 2020
- [j10]Cesar Ceballos, Wenjie Fang, Henri Mühle:
The Steep-Bounce zeta map in Parabolic Cataland. J. Comb. Theory A 172: 105210 (2020) - [j9]Henri Mühle, Vivien Ripoll:
Connectivity Properties of Factorization Posets in Generated Groups. Order 37(1): 115-149 (2020)
2010 – 2019
- 2019
- [j8]Henri Mühle, Nathan Williams:
Tamari Lattices for Parabolic Quotients of the Symmetric Group. Electron. J. Comb. 26(4): 4 (2019) - 2017
- [j7]Henri Mühle:
Two Posets of Noncrossing Set Partitions. Electron. Notes Discret. Math. 61: 885-891 (2017) - [j6]Henri Mühle:
A Heyting Algebra on Dyck Paths of Type A and B. Order 34(2): 327-348 (2017) - 2015
- [j5]Myrto Kallipoliti, Henri Mühle:
The m-cover posets and their applications. Adv. Appl. Math. 69: 65-108 (2015) - [j4]Henri Mühle:
SB-Lattices, Distributivity, and Bruhat Order on Sortable Elements. Electron. J. Comb. 22(2): 2 (2015) - [j3]Henri Mühle:
EL-shellability and noncrossing partitions associated with well-generated complex reflection groups. Eur. J. Comb. 43: 249-278 (2015) - 2014
- [j2]Henri Mühle:
Counting proper mergings of chains and antichains. Discret. Math. 327: 118-129 (2014) - 2013
- [j1]Myrto Kallipoliti, Henri Mühle:
On the Topology of the Cambrian Semilattices. Electron. J. Comb. 20(2): 48 (2013) - [c5]Henri Mühle:
Proper Mergings of Stars and Chains Are Counted by Sums of Antidiagonals in Certain Convolution Arrays. ICFCA 2013: 172-187 - 2011
- [c4]Bernhard Ganter, Christian Meschke, Henri Mühle:
Merging Ordered Sets. ICFCA 2011: 183-203 - 2010
- [c3]Henri Mühle:
Using Bonds for Describing Method Dispatch in Role-Oriented Software Models. CLA 2010: 344-349 - [c2]Henri Mühle, Christian Wende:
Describing Role Models in Terms of Formal Concept Analysis. ICFCA 2010: 241-254 - [c1]Henri Mühle, Hannes Voigt, Wolfgang Lehner:
Ein begriffsbasierter Ansatz zur semantischen Extraktion von Datenbankschemata. Software Engineering (Workshops) 2010: 35-42
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-11-08 21:29 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:
