David A. Bader

Available identifiers

zbMath Open bader.david-aDBLP41/3005WikidataQ5230435 ScholiaQ5230435MaRDI QIDQ346503

List of research outcomes

Publication	Date of Publication	Type
Parallel suffix sorting for large string analytics	2023-08-25	Paper
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges	2023-03-30	Paper
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs	2022-09-06	Paper
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs	2021-08-04	Paper
Spectral partitioning with blends of eigenvectors	2021-04-22	Paper
Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing	2019-09-25	Paper
Local community detection in dynamic graphs using personalized centrality	2018-08-13	Paper
A parallel local search framework for the fixed-charge multicommodity network flow problem	2018-07-11	Paper
Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs	2018-02-06	Paper
Generalized block shift network for clusters	2017-08-25	Paper
Exemplar or matching: modeling DCJ problems with unequal content genome data	2016-11-29	Paper
A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents	2014-09-26	Paper
https://portal.mardi4nfdi.de/entity/Q5298945	2013-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q3108696	2012-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q3108702	2012-01-05	Paper
Approximating Betweenness Centrality	2008-04-11	Paper
On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures	2007-09-03	Paper
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs	2007-01-09	Paper
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols	2006-06-30	Paper
Experimental and Efficient Algorithms	2005-11-30	Paper
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)	2005-09-28	Paper
Power balance and apportionment algorithms for the United States Congress	2005-08-04	Paper
Irredundant intervals	2005-08-04	Paper
An improved, randomized algorithm for parallel selection with an experimental study	2004-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q4417669	2003-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q4417435	2003-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q4785578	2003-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q4778571	2002-11-18	Paper
High-performance algorithm engineering for computational phylogenetics	2002-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q2779680	2002-04-15	Paper
A randomized parallel sorting algorithm with an experimental study	1999-03-30	Paper

Research outcomes over time

This page was built for person: David A. Bader