Brendan Mumey

Available identifiers

Publication	Date of Publication	Type
Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time	2024-07-19	Paper
Flow Decomposition with Subpath Constraints	2023-07-24	Paper
Scheduling jobs with precedence constraints to minimize peak demand	2023-03-21	Paper
A Safety Framework for Flow Decomposition Problems via Integer Linear Programming	2023-01-30	Paper
Extending Maximal Perfect Haplotype Blocks to the Realm of Pangenomics	2022-10-13	Paper
Fast, flexible, and exact minimum flow decompositions via ILP	2022-08-30	Paper
A linear-time parameterized algorithm for computing the width of a DAG	2022-06-08	Paper
Scheduling non-preemptible jobs to minimize peak demand	2019-05-08	Paper
An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling	2015-09-11	Paper
Approximating the fixed linear crossing number	2007-10-29	Paper
Discovering classes in microarray data using island counts	2007-07-19	Paper
Computational Science and Its Applications – ICCSA 2004	2007-07-19	Paper
Probe location in the presence of errors: A problem from DNA mapping	2001-03-17	Paper
https://portal.mardi4nfdi.de/entity/Q4352831	1997-12-17	Paper
Upper and Lower Bounds on Constructing Alphabetic Binary Trees	1996-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q3140420	1994-11-29	Paper

This page was built for person: Brendan Mumey