Network flow methods for the minimum covariate imbalance problem von Hochbaum, Dorit S., Rao, Xu, Sauppe, Jason

Volltext

Algorithms and Complexities of Matching Variants in Covariate Balancing von Hochbaum, Dorit S., Levin, Asaf, Rao, Xu

Volltext

A unified approach for a 1D generalized total variation problem von Lu, Cheng, Hochbaum, Dorit S.

Volltext

Efficient algorithms to discover alterations with complementary functional association in cancer von Sarto Basso, Rebecca, Hochbaum, Dorit S, Vandin, Fabio

Volltext

Obituary for Professor Emeritus Jakob Kraurp von Schöbel, Anita, Pisinger, David, Hochbaum, Dorit

Volltext

The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem von Hochbaum, Dorit S

Volltext

Applications and efficient algorithms for integer programming problems on monotone constraints von Hochbaum, Dorit S.

Volltext

Complexity and approximations for submodular minimization problems on two variables per inequality constraints von Hochbaum, Dorit S.

Volltext

A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem von Hochbaum, Dorit S.

Volltext

Algorithms and complexity of range clustering von Hochbaum, Dorit S.

Volltext

The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem von Hochbaum, Dorit S., Rao, Xu

Volltext

Complexity, algorithms and applications of the integer network flow with fractional supplies problem von Hochbaum, Dorit S., Levin, Asaf, Rao, Xu

Volltext

Isolation branching: a branch and bound algorithm for the k-terminal cut problem von Velednitsky, Mark, Hochbaum, Dorit S.

Volltext

Methodologies and Algorithms for Group-Rankings Decision von Hochbaum, Dorit S, Levin, Asaf

Volltext

Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing von Hochbaum, Dorit S., Liu, Sheng

Volltext

Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut von Hochbaum, D.S.

Volltext

A fully polynomial time approximation scheme for the Replenishment Storage problem von Hochbaum, Dorit S., Rao, Xu

Volltext

A Graph-Theoretic Approach for Spatial Filtering and Its Impact on Mixed-Type Spatial Pattern Recognition in Wafer Bin Maps von Ezzat, Ahmed Aziz, Liu, Sheng, Hochbaum, Dorit S., Ding, Yu

Volltext

A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant von Hochbaum, Dorit S.

Volltext

Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques von Asín‐Achá, Roberto, Espinoza, Alexis, Goldschmidt, Olivier, Hochbaum, Dorit S., Huerta, Isaías I.

Volltext