David A. Bader

From MaRDI portal
Person:346503

Available identifiers

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

List of research outcomes





PublicationDate of PublicationType
Parallel suffix sorting for large string analytics2023-08-25Paper
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges2023-03-30Paper
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs2022-09-06Paper
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs2021-08-04Paper
Spectral partitioning with blends of eigenvectors2021-04-22Paper
Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing2019-09-25Paper
Local community detection in dynamic graphs using personalized centrality2018-08-13Paper
A parallel local search framework for the fixed-charge multicommodity network flow problem2018-07-11Paper
Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs2018-02-06Paper
Generalized block shift network for clusters2017-08-25Paper
Exemplar or matching: modeling DCJ problems with unequal content genome data2016-11-29Paper
A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents2014-09-26Paper
https://portal.mardi4nfdi.de/entity/Q52989452013-06-25Paper
https://portal.mardi4nfdi.de/entity/Q31086962012-01-05Paper
https://portal.mardi4nfdi.de/entity/Q31087022012-01-05Paper
Approximating Betweenness Centrality2008-04-11Paper
On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures2007-09-03Paper
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs2007-01-09Paper
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols2006-06-30Paper
Experimental and Efficient Algorithms2005-11-30Paper
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)2005-09-28Paper
Power balance and apportionment algorithms for the United States Congress2005-08-04Paper
Irredundant intervals2005-08-04Paper
An improved, randomized algorithm for parallel selection with an experimental study2004-11-18Paper
https://portal.mardi4nfdi.de/entity/Q44176692003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44174352003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q47855782003-01-05Paper
https://portal.mardi4nfdi.de/entity/Q47785712002-11-18Paper
High-performance algorithm engineering for computational phylogenetics2002-08-20Paper
https://portal.mardi4nfdi.de/entity/Q27796802002-04-15Paper
A randomized parallel sorting algorithm with an experimental study1999-03-30Paper

Research outcomes over time

This page was built for person: David A. Bader