Results 71 to 80 of about 137,342 (261)
BMC Research Notes, 2017 Objective Nowadays, due to the technological advances of high-throughput techniques, Systems Biology has seen a tremendous growth of data generation. With network analysis, looking at biological systems at a higher level in order to better understand a ...
Theodosios Theodosiou +6 more
doaj +1 more source
Advanced Healthcare Materials, EarlyView.Ionizable lipid nanoparticles target multiple pathological pathways in neurodegeneration. The designed self‐assembled materials undergo a pH‐triggered structural transformation from a cubosome/hexosome coexistence to a hexosome phase, enhancing intracellular delivery of a multi‐target phytochemical formulation. The antioxidant‐loaded pH‐responsive LNPs
Thelma Akanchise +4 more
wiley +1 more source
On acyclic edge coloring of planar graphs without intersecting triangles
Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheng, Ping, Wang, Yingqian
openaire +1 more source
Engineered Protein‐Based Ionic Conductors for Sustainable Energy Storage Applications
Advanced Materials, EarlyView.Rational incorporation of charged residues into an engineered, self‐assembling protein scaffold yields solid‐state protein films with outstanding ionic conductivity. Salt‐doping further enhances conductivity, an effect amplified in the engineered variants. These properties enable the material integration into an efficient supercapacitor.
Juan David Cortés‐Ossa +14 more
wiley +1 more source
Complexity Results on Graphs with Few Cliques
Discrete Mathematics & Theoretical Computer Science, 2007 A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the class. This restriction is equivalent to the requirement that any graph in the class has a polynomial sized intersection ...
Bill Rosgen, Lorna Stewart
doaj
Kneser graphs are like Swiss cheese
Discrete Analysis, 2018 Kneser graphs are like Swiss cheese, Discrete Analysis 2018:2, 18 pp. This paper relates two very interesting areas of research in extremal combinatorics: removal lemmas, and influence of variables.
Ehud Friedgut, Oded Regev
doaj +1 more source
Complex Networks from Classical to Quantum
, 2019 Recent progress in applying complex network theory to problems in quantum information has resulted in a beneficial crossover. Complex network methods have successfully been applied to transport and entanglement models while information physics is setting
Biamonte, Jacob +2 more
core +1 more source
Advanced Materials, EarlyView.Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs
, 2014 The Transversal problem, i.e, the enumeration of all the minimal transversals of a hypergraph in output-polynomial time, i.e, in time polynomial in its size and the cumulated size of all its minimal transversals, is a fifty years old open problem, and up
A Shioura +16 more
core +2 more sources
Triangulated edge intersection graphs of paths in a tree
Discrete Mathematics, 1985 An EPT (VPT) graph is an intersection graph of paths in a tree, where two paths intersect if they share an edge (a vertex, resp.). In this note, author's conjecture that every triangulated EPT graph is VPT graph is solved in the affirmative.
openaire +2 more sources