Results 31 to 40 of about 197 (95)

Fine-grained Meta-Theorems for Vertex Integrity [PDF]

open access: yesLogical Methods in Computer Science
Vertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained attention as a structural graph parameter.
Michael Lampis, Valia Mitsou
doaj   +1 more source

Parameterized Complexity of Directed Spanner Problems. [PDF]

open access: yesAlgorithmica, 2022
Fomin FV   +5 more
europepmc   +1 more source

Reoptimization of parameterized problems. [PDF]

open access: yesActa Inform, 2022
Böckenhauer HJ   +3 more
europepmc   +1 more source

Distributed hybrid-indexing of compressed pan-genomes for scalable and fast sequence alignment. [PDF]

open access: yesPLoS One, 2021
Maarala AI   +4 more
europepmc   +1 more source

Kernelized multiview signed graph learning for single-cell RNA sequencing data. [PDF]

open access: yesBMC Bioinformatics, 2023
Karaaslanli A   +3 more
europepmc   +1 more source

Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. [PDF]

open access: yesProc 2021 SIAM Conf Appl Comput Discret Algorithms (2021), 2021
Cooley M   +4 more
europepmc   +1 more source

Demonstration of an AI-driven workflow for autonomous high-resolution scanning microscopy. [PDF]

open access: yesNat Commun, 2023
Kandel S   +9 more
europepmc   +1 more source

Non-Preemptive Tree Packing. [PDF]

open access: yesAlgorithmica, 2023
Lendl S, Woeginger G, Wulf L.
europepmc   +1 more source

Home - About - Disclaimer - Privacy