Adam G. Polak

From MaRDI portal
Person:4227049

Available identifiers

zbMath Open polak.adam-gMaRDI QIDQ4227049

List of research outcomes





PublicationDate of PublicationType
Bellman-Ford is optimal for shortest Hop-bounded paths2025-01-06Paper
Parameterized algorithms for block-structured integer programs with large entries2024-11-28Paper
On dynamic graph algorithms with predictions2024-11-28Paper
Memoryless worker-task assignment with polylogarithmic switching cost2024-06-24Paper
Tight vector bin packing with few small items via fast exact matching in multigraphs2024-06-24Paper
Learning-augmented maximum flow2024-06-07Paper
On minimizing tardy processing time, Max-Min skewed convolution, and triangular structured ILPs2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q42270501999-07-05Paper

Research outcomes over time

This page was built for person: Adam G. Polak

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:4227049&oldid=11263905"
Powered by MediaWiki