Ricardo Mamede

Orcid: 0000-0002-9264-6604

According to our database1, Ricardo Mamede authored at least 11 papers between 2009 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Diameter of the commutation classes graph of a permutation.
Eur. J. Comb., 2022

The commutation graph for the longest signed permutation.
Discret. Math., 2022

2020
Commutation Classes of the Reduced Words for the Longest Element of S<sub>n</sub>.
Electron. J. Comb., 2020

2019
Optimal Gray code for involutions.
Inf. Process. Lett., 2019

2018
Gray codes for signed involutions.
Discret. Math., 2018

2017
Gray codes for noncrossing and nonnesting partitions of classical types.
Int. J. Algebra Comput., 2017

2015
Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions.
Theor. Comput. Sci., 2015

2014
Dominant Shi regions with a fixed separating wall: bijective enumeration.
Australas. J Comb., 2014

2013
On the Largest Size of an Antichain in the Bruhat Order for <i>A</i>(2k, k).
Order, 2013

2011
A bijection between noncrossing and nonnesting partitions of types A, B and C.
Contributions Discret. Math., 2011

2009
On (0, 1)-matrices with prescribed row and column sum vectors.
Discret. Math., 2009


  Loading...