Results 141 to 150 of about 11,475 (265)
Coloring hypergraphs that are the union of nearly disjoint cliques [PDF]
Dhruv Mubayi, Jacques Verstraëte
openalex +1 more source
ABSTRACT Although allyship has the potential to foster inclusivity and bring about social change, its consequences have received too little attention in the literature. In the current contribution, we aim to review the allyship literature by focusing on the consequences of (1) individual‐, (2) organizational‐, and (3) societal‐level allyship.
Özden Melis Uluğ +2 more
wiley +1 more source
Automated design of dynamic programming schemes for RNA folding with pseudoknots. [PDF]
Marchand B +4 more
europepmc +1 more source
ABSTRACT In knowledge‐based societies, withdrawal from doctoral education is often seen and spoken about as embarrassing, undesirable, and awkward. Emerging from complex conditions—a mix of profoundly personal factors and weighty contextual factors—withdrawal tends to be a silenced or shamed process, producing a layered dynamic of taboo upon taboo upon
Patrícia Alves +4 more
wiley +1 more source
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. [PDF]
Marchand B, Ponty Y, Bulteau L.
europepmc +1 more source
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds
Merav Parter, Hsin-Hao Su
openalex +2 more sources
ABSTRACT Despite the increasing emphasis on addressing the intersections of client and therapist identity to improve therapeutic outcomes, therapy clients holding marginalized identities continue to experience othering. Othering is a process that engenders marginalization and inequality based on preconceived group identity, involves the hegemonic ...
Caitlin Edwards +3 more
wiley +1 more source
Initial State Encoding via Reverse Quantum Annealing and H-Gain Features. [PDF]
Pelofske E, Hahn G, Djidjev H.
europepmc +1 more source
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w) is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP‐hard.
Jannick Borowitz +2 more
wiley +1 more source
Protein binding sites for drug design. [PDF]
Konc J, Janežič D.
europepmc +1 more source

