Results 201 to 210 of about 8,902 (235)

On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)

Networks, EarlyView.
ABSTRACT This work addresses the paper selection problem that each Italian university and department faced in the context of the research quality evaluation (VQR) of the Italian university system for the period 2020–2024. Given the set of researchers of a university and their associated papers, the problem consists of selecting a fixed number of ...
Francesco Carrabs, Martina Cerulli, Carmine Sorgente   +2 more
wiley   +1 more source

Harary index of the zero divisor graph of upper triangular matrices. [PDF]

Sci Rep
Alshanqiti O, Sharma S, Bhat VK.
europepmc   +1 more source

Habitat loss reshuffles ecological and evolutionary interactions in a seed dispersal network

Oikos, EarlyView.
In tropical forests, habitat loss reshapes species composition, favoring generalists and recently emerged lineages while specialists and older evolutionary lineages are lost. However, how changes in species ecological attributes and evolutionary history affect ecological processes is poorly explored.
Fernando César Gonçalves Bonfim, Mauro Galetti, Elaine Rios, Cynthia Oliveira, Milena Gama, Ketlen Bona, Geanne Carla Novais‐ Pereira, Thiago de Castro Ribeiro, Eliana Cazetta   +8 more
wiley   +1 more source

ChemGraphX: an open-source web tool for computing topological indices and entropy measures. [PDF]

J Cheminform
Jacob K, Clement J, Arockiaraj M, Jindal A.   +3 more
europepmc   +1 more source

Individualized mapping of functional brain networks in older adulthood. [PDF]

Imaging Neurosci (Camb)
Hughes C, Krendl AC, French RC, Risacher SL, Wu YC, Saykin AJ, Betzel R.   +6 more
europepmc   +1 more source

A constructive method to determine the total vertex irregularity strength of two flower graph variants. [PDF]

MethodsX
Hinding N, Sunusi N, Mutmainnah S, Rahayu II, Sy S, Sugeng KA, Simanjuntak RG.   +6 more
europepmc   +1 more source

Approximating Vertex Cover on Dense Graphs (Evolutionary Advancement in Fundamental Theories of Computer Science)

Approximating Vertex Cover on Dense Graphs (Evolutionary Advancement in Fundamental Theories of Computer Science)
openaire  

Isoscattering non-isospectral quantum graphs. [PDF]

Sci Rep
Farooq O, Ławniczak M, Kurasov P, Sirko L.   +3 more
europepmc   +1 more source

A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games. [PDF]

Algorithmica
Benford A, Lehre PK.
europepmc   +1 more source

Design and Analysis of Minimum-Weighted Connected Capacitated Vertex Cover Algorithms for Link Monitoring in IoT-Enabled WSNs. [PDF]

Sensors (Basel)
Kol M, Uslu EE, Dagdeviren ZA, Dagdeviren O.   +3 more
europepmc   +1 more source