A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs.
You can add a new person with the name "Schemeleva, Kseniya", or you can "Schemeleva, Kseniya" with a person entry that is so far only been referred to by another name (such as a former name or an alias name).
Your choice of the person associated to the publication can be saved in our system, so that no other have to make this choice again. Do you want to save your choice?