Database Location in Computer Networks. - Marshall L. Fisher; Dorit S. Hochbaum (J. ACM, 1980)

Probabilistic Analysis of the Planar k-Median Problem. - Marshall L. Fisher; Dorit S. Hochbaum (Math. Oper. Res., 1980)

Heuristics for the fixed cost median problem. - Dorit S. Hochbaum (Math. Program., 1982)

Approximation Algorithms for the Set Covering and Vertex Cover Problems. - Dorit S. Hochbaum (SIAM J. Comput., 1982)

Efficient bounds for the stable set, vertex cover and set packing problems. - Dorit S. Hochbaum (Discret. Appl. Math., 1983)

Approximation Schemes for Covering and Packing Problems in Robotics and VLSI. - Dorit S. Hochbaum; Wolfgang Maass 001 (STACS, 1984)

Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems - Dorit S. Hochbaum; David B. Shmoys (STOC, 1984)

When are NP-hard location problems easy? - Dorit S. Hochbaum (Ann. Oper. Res., 1984)

A Best Possible Heuristic for the k-Center Problem. - Dorit S. Hochbaum; David B. Shmoys (Math. Oper. Res., 1985)

Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI - Dorit S. Hochbaum; Wolfgang Maass 001 (J. ACM, 1985)

A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach. - Dorit S. Hochbaum; David B. Shmoys (FSTTCS, 1986)

A fast approximation algorithm for the multicovering problem. - Nicholas G. Hall; Dorit S. Hochbaum (Discret. Appl. Math., 1986)

The Linzertorte problem, or a unified approach to painting, baking and weaving. - Dorit S. Hochbaum; Edna Wigderson (Discret. Appl. Math., 1986)

OR Practice - Lagrangian Relaxation for Testing Infeasibility in VLSI Routing. - Thomas A. Feo; Dorit S. Hochbaum (Oper. Res., 1986)

A unified approach to approximation algorithms for bottleneck problems. - Dorit S. Hochbaum; David B. Shmoys (J. ACM, 1986)

A Better than "Best Possible" Algorithm to Edge Color Multigraphs. - Dorit S. Hochbaum; Takao Nishizeki; David B. Shmoys (J. Algorithms, 1986)

Using dual approximation algorithms for scheduling problems theoretical and practical results. - Dorit S. Hochbaum; David B. Shmoys (J. ACM, 1987)

Fast Approximation Algorithms for a Nonconvex Covering Problem. - Dorit S. Hochbaum; Wolfgang Maass 001 (J. Algorithms, 1987)

Polynomial Algorithm for the k-Cut Problem - Olivier Goldschmidt; Dorit S. Hochbaum (FOCS, 1988)

A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach. - Dorit S. Hochbaum; David B. Shmoys (SIAM J. Comput., 1988)

The Complexity of Nonlinear Separable Optimization. - Dorit S. Hochbaum; J. George Shanthikumar (ICALP, 1989)

An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem. - Dorit S. Hochbaum; Ron Shamir (Inf. Process. Lett., 1989)

Analysis of a flow problem with fixed charges. - Dorit S. Hochbaum; Arie Segev (Networks, 1989)

On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions. - Dorit S. Hochbaum (IPCO, 1990)

Minimizing the number of tardy job units under release time constraints. - Dorit S. Hochbaum; Ron Shamir (Discret. Appl. Math., 1990)

A Fast Perfect-Matching Algorithm in Random Graphs. - Olivier Goldschmidt; Dorit S. Hochbaum (SIAM J. Discret. Math., 1990)

Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph. - Olivier Goldschmidt; Dorit S. Hochbaum (SIAM J. Discret. Math., 1990)

Convex Separable Optimization Is Not Much Harder than Linear Optimization - Dorit S. Hochbaum; J. George Shanthikumar (J. ACM, 1990)

Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem. - Dorit S. Hochbaum; Ron Shamir (Oper. Res., 1991)

An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs. - Dorit S. Hochbaum (Oper. Res., 1992)

A polynomial algorithm for an integer quadratic non-separable transportation problem. - Dorit S. Hochbaum; Ron Shamir; J. George Shanthikumar (Math. Program., 1992)

The empirical performance of a polynomial algorithm for constrained nonlinear optimization. - Dorit S. Hochbaum; Sridhar Seshadri (Ann. Oper. Res., 1993)

Why Should Biconnected Components be Identified First. - Dorit S. Hochbaum (Discret. Appl. Math., 1993)

A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound. - Olivier Goldschmidt; Dorit S. Hochbaum; Gang Yu 001 (Inf. Process. Lett., 1993)

Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. - Dorit S. Hochbaum; Nimrod Megiddo; Joseph Naor; Arie Tamir (Math. Program., 1993)

Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources. - Steven Cosares; Dorit S. Hochbaum (Math. Oper. Res., 1994)

A Polynomial Algorithm for the k-cut Problem for Fixed k. - Olivier Goldschmidt; Dorit S. Hochbaum (Math. Oper. Res., 1994)

Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems. - Dorit S. Hochbaum (Math. Oper. Res., 1994)

Scheduling with batching: minimizing the weighted number of tardy jobs. - Dorit S. Hochbaum; Dan Landy (Oper. Res. Lett., 1994)

Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality. - Dorit S. Hochbaum; Joseph Naor (SIAM J. Comput., 1994)

About strongly polynomial time algorithms for quadratic optimization over submodular constraints. - Dorit S. Hochbaum; Sung-Pil Hong (Math. Program., 1995)

A nonlinear Knapsack problem. - Dorit S. Hochbaum (Oper. Res. Lett., 1995)

Approximation Algorithms for Network Design Problems on Bounded Subsets. - Dorit S. Hochbaum; Joseph Naor (J. Algorithms, 1996)

The bottleneck graph partition problem. - Dorit S. Hochbaum; Anu Pathria (Networks, 1996)

Approximation Algorithms for the k-Clique Covering Problem. - Olivier Goldschmidt; Dorit S. Hochbaum; Cor A. J. Hurkens; Gang Yu 001 (SIAM J. Discret. Math., 1996)

On the Complexity of the Production-Transportation Problem. - Dorit S. Hochbaum; Sung-Pil Hong (SIAM J. Optim., 1996)

An optimal test compression procedure for combinational circuits. - Dorit S. Hochbaum (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996)

An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane. - Naveen Garg 001; Dorit S. Hochbaum (Algorithmica, 1997)

k-edge Subgraph Problems. - Olivier Goldschmidt; Dorit S. Hochbaum (Discret. Appl. Math., 1997)

Scheduling with Batching: Two Job Types. - Dorit S. Hochbaum; Dan Landy (Discret. Appl. Math., 1997)

Generalized p-Center problems: Complexity results and approximation algorithms. - Dorit S. Hochbaum; Anu Pathria (Eur. J. Oper. Res., 1997)

A New and Fast Approach to Very Large Scale Integrated Sequential Circuit Test Generation. - J. B. Adams; Dorit S. Hochbaum (Oper. Res., 1997)

Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime. - Dorit S. Hochbaum; Dan Landy (Oper. Res., 1997)

Path Costs in Evolutionary Tree Reconstruction. - Dorit S. Hochbaum; Anu Pathria (J. Comput. Biol., 1997)

Approximation Algorithms for NP-Hard Problems. - Dorit S. Hochbaum (SIGACT News, 1997)

Instant Recognition of Half Integrality and 2-Approximations. - Dorit S. Hochbaum (APPROX, 1998)

The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints. - Dorit S. Hochbaum (APPROX, 1998)

The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem. - Dorit S. Hochbaum (IPCO, 1998)

Approximating Clique and Biclique Problems. - Dorit S. Hochbaum (J. Algorithms, 1998)

A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. - Fabián A. Chudak; Michel X. Goemans; Dorit S. Hochbaum; David P. Williamson (Oper. Res. Lett., 1998)

A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. - Fabián A. Chudak; Dorit S. Hochbaum (Oper. Res. Lett., 1999)

A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources. - Dorit S. Hochbaum; Gerhard J. Woeginger (Oper. Res. Lett., 1999)

Instant recognition of polynominal time solvability, half integrality and 2-approximations. - Dorit S. Hochbaum (APPROX, 2000)

Approximating a generalization of MAX 2SAT and MIN 2SAT. - Dorit S. Hochbaum; Anu Pathria (Discret. Appl. Math., 2000)

Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem. - Dorit S. Hochbaum; Anna Chen (Oper. Res., 2000)

The Bounded Cycle-Cover Problem. - Dorit S. Hochbaum; Eli V. Olinick (INFORMS J. Comput., 2001)

An efficient algorithm for image segmentation, Markov random fields and related problems. - Dorit S. Hochbaum (J. ACM, 2001)

Capacity Acquisition, Subcontracting, and Lot Sizing. - Alper Atamtürk; Dorit S. Hochbaum (Manag. Sci., 2001)

A new - old algorithm for minimum-cut and maximum-flow in closure graphs. - Dorit S. Hochbaum (Networks, 2001)

Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations. - Dorit S. Hochbaum (Eur. J. Oper. Res., 2002)

Baseball, Optimization, and the World Wide Web. - Ilan Adler; Alan L. Erera; Dorit S. Hochbaum; Eli V. Olinick (Interfaces, 2002)

Minimax problems with bitonic matrices. - Dorit S. Hochbaum; Paul A. Tucker (Networks, 2002)

Efficient Algorithms for the Inverse Spanning-Tree Problem. - Dorit S. Hochbaum (Oper. Res., 2003)

Solving the Convex Cost Integer Dual Network Flow Problem. - Ravindra K. Ahuja; Dorit S. Hochbaum; James B. Orlin (Manag. Sci., 2003)

The SONET edge-partition problem. - Olivier Goldschmidt; Dorit S. Hochbaum; Asaf Levin; Eli V. Olinick (Networks, 2003)

Minimizing a Convex Cost Closure Set. - Dorit S. Hochbaum; Maurice Queyranne (SIAM J. Discret. Math., 2003)

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. - Ravindra K. Ahuja; Dorit S. Hochbaum; James B. Orlin (Algorithmica, 2004)

50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today. - Dorit S. Hochbaum (Manag. Sci., 2004)

Monotonizing linear programs with up to two nonzeroes per column. - Dorit S. Hochbaum (Oper. Res. Lett., 2004)

Due Date Quotation Models and Algorithms. - Philip M. Kaminsky; Dorit S. Hochbaum (Handbook of Scheduling, 2004)

Complexity and algorithms for convex network optimization and other nonlinear problems. - Dorit S. Hochbaum (4OR, 2005)

The k-Allocation Problem and Its Variants. - Dorit S. Hochbaum; Asaf Levin (WAOA, 2006)

Ranking Sports Teams and the Inverse Equal Paths Problem. - Dorit S. Hochbaum (WINE, 2006)

Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. - Dorit S. Hochbaum; Asaf Levin (Discret. Optim., 2006)

Methodologies and Algorithms for Group-Rankings Decision. - Dorit S. Hochbaum; Asaf Levin (Manag. Sci., 2006)

Optimizing over Consecutive 1's and Circular 1's Constraints. - Dorit S. Hochbaum; Asaf Levin (SIAM J. Optim., 2006)

Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. - Dorit S. Hochbaum; Asaf Levin (WAOA, 2007)

Complexity and algorithms for nonlinear optimization problems. - Dorit S. Hochbaum (Ann. Oper. Res., 2007)

Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions - Dorit S. Hochbaum (CoRR, 2008)

Technical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time. - Ravindra K. Ahuja; Dorit S. Hochbaum (Oper. Res., 2008)

The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem. - Dorit S. Hochbaum (Oper. Res., 2008)

Country credit-risk rating aggregation via the separation-deviation model. - Dorit S. Hochbaum; Erick Moreno-Centeno (Optim. Methods Softw., 2008)

The inequality-satisfiability problem. - Dorit S. Hochbaum; Erick Moreno-Centeno (Oper. Res. Lett., 2008)

An Efficient and Effective Image Segmentation Interactive Tool. - Dorit S. Hochbaum (BIOSIGNALS, 2009)

An efficient algorithm for Co-segmentation. - Dorit S. Hochbaum; Vikas Singh (ICCV, 2009)

Dynamic evolution of economically preferred facilities. - Dorit S. Hochbaum (Eur. J. Oper. Res., 2009)

A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem. - Bala G. Chandran; Dorit S. Hochbaum (Oper. Res., 2009)

The multi-integer set cover and the facility terminal cover problem. - Dorit S. Hochbaum; Asaf Levin (Networks, 2009)

How to allocate review tasks for robust ranking. - Dorit S. Hochbaum; Asaf Levin (Acta Informatica, 2010)

Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems - Barak Fishbain; Dorit S. Hochbaum; Stefan Müller (CoRR, 2010)

Submodular problems - approximations and algorithms - Dorit S. Hochbaum (CoRR, 2010)

Complexity of some inverse shortest path lengths problems. - Tingting Cui; Dorit S. Hochbaum (Networks, 2010)

Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut. - Dorit S. Hochbaum (IEEE Trans. Pattern Anal. Mach. Intell., 2010)

Covering the edges of bipartite graphs using K2, 2 graphs. - Dorit S. Hochbaum; Asaf Levin (Theor. Comput. Sci., 2010)

On Hardness of Multiflow Transmission in Delay Constrained Cooperative Wireless Networks. - Marjan A. Baghaie; Dorit S. Hochbaum; Bhaskar Krishnamachari (GLOBECOM, 2011)

An Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization. - Dorit S. Hochbaum (SSVM, 2011)

Nuclear threat detection with mobile distributed sensor networks. - Dorit S. Hochbaum; Barak Fishbain (Ann. Oper. Res., 2011)

Experimental Analysis of the MRF Algorithm for Segmentation of Noisy Medical Images. - Joe Qranfal; Dorit S. Hochbaum; Germain Tanoh (Algorithmic Oper. Res., 2011)

Benchmark Problems for Totally Unimodular Set System Auction - Ilan Adler; Dorit S. Hochbaum (CoRR, 2011)

Practical and theoretical improvements for bipartite matching using the pseudoflow algorithm - Bala G. Chandran; Dorit S. Hochbaum (CoRR, 2011)

Rating Customers According to Their Promptness to Adopt New Products. - Dorit S. Hochbaum; Erick Moreno-Centeno; Phillip Yelland; Rodolfo A. Catena (Oper. Res., 2011)

Ranking of multidimensional drug profiling data by fractional-adjusted bi-partitional scores. - Dorit S. Hochbaum; Chun-Nan Hsu; Yan T. Yang (Bioinform., 2012)

Multiflow Transmission in Delay Constrained Cooperative Wireless Networks - Marjan A. Baghaie; Dorit S. Hochbaum; Bhaskar Krishnamachari (CoRR, 2012)

Real-time robust target tracking in videos via graph-cuts. - Barak Fishbain; Dorit S. Hochbaum; Yan T. Yang (Real-Time Image and Video Processing, 2013)

Evaluating performance of image segmentation criteria and techniques. - Dorit S. Hochbaum; Cheng Lyu; Erik Bertelli (EURO J. Comput. Optim., 2013)

A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant. - Dorit S. Hochbaum (Oper. Res., 2013)

Simplifications and speedups of the pseudoflow algorithm. - Dorit S. Hochbaum; James B. Orlin (Networks, 2013)

Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems. - Dorit S. Hochbaum; Asaf Levin (ACM Trans. Algorithms, 2013)

The Supervised Normalized Cut Method for Detecting, Classifying, and Identifying Special Nuclear Materials. - Yan T. Yang; Barak Fishbain; Dorit S. Hochbaum; Eric B. Norman; Erik Swanberg (INFORMS J. Comput., 2014)

Security routing games with multivehicle Chinese postman problem. - Dorit S. Hochbaum; Cheng Lyu; Fernando Ordóñez (Networks, 2014)

Efficient deployment of mobile detectors for security applications. - Philipp Baumann; Reynold J. Cooper; Dorit S. Hochbaum; Nidhi Patel; Kunal Shalia (IEEM, 2015)

Range contracts: Risk sharing and beyond. - Dorit S. Hochbaum; Michael R. Wagner (Eur. J. Oper. Res., 2015)

Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets. - Philipp Baumann; Dorit S. Hochbaum; Quico Spaen (ICPRAM, 2016)

A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem. - Dorit S. Hochbaum (Comput. Ind. Eng., 2016)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm. - Dorit S. Hochbaum (CoRR, 2016)

A competitive study of the pseudoflow algorithm for the minimum s-t cut problem in vision applications. - Barak Fishbain; Dorit S. Hochbaum; Stefan Müller (J. Real Time Image Process., 2016)

Sparse Computation for Large-Scale Data Mining. - Dorit S. Hochbaum; Philipp Baumann (IEEE Trans. Big Data, 2016)

High-performance geometric algorithms for sparse computation in big data analytics. - Philipp Baumann; Dorit S. Hochbaum; Quico Spaen (IEEE BigData, 2017)

A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems. - Dorit S. Hochbaum; Cheng Lu (SIAM J. Optim., 2017)

DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. - Minjun Chang; Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (WAOA, 2018)

DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals. - Minjun Chang; Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (CoRR, 2018)

Complexity and approximations for submodular minimization problems on two variables per inequality constraints. - Dorit S. Hochbaum (Discret. Appl. Math., 2018)

Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing. - Dorit S. Hochbaum; Sheng Liu 006 (Oper. Res., 2018)

Weighted matching with pair restrictions. - Dorit S. Hochbaum; Asaf Levin (Optim. Lett., 2018)

Detecting Aberrant Linking Behavior in Directed Networks. - Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (KDIR, 2019)

A comparative study of the leading machine learning techniques and two new optimization algorithms. - Philipp Baumann; Dorit S. Hochbaum; Yan T. Yang (Eur. J. Oper. Res., 2019)

The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem. - Dorit S. Hochbaum; Xu Rao (Oper. Res., 2019)

Algorithms and complexity of range clustering. - Dorit S. Hochbaum (Networks, 2019)

Efficient algorithms to discover alterations with complementary functional association in cancer. - Rebecca Sarto Basso; Dorit S. Hochbaum; Fabio Vandin (PLoS Comput. Biol., 2019)

The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees. - Jonathan Bodine; Dorit S. Hochbaum (KDIR, 2020)

HNCcorr: combinatorial optimization for neuron identification. - Roberto Javier Asín Achá; Dorit S. Hochbaum; Quico Spaen (Ann. Oper. Res., 2020)

Network Flow Methods for the Minimum Covariates Imbalance Problem. - Dorit S. Hochbaum; Xu Rao (CoRR, 2020)

Algorithms and Complexity for Variants of Covariates Fine Balance. - Dorit S. Hochbaum; Asaf Levin; Xu Rao (CoRR, 2020)

Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer. - Dorit S. Hochbaum; Xu Rao (Inf. Process. Lett., 2020)

An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. - Minjun Chang; Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (Theory Comput. Syst., 2020)

A fully polynomial time approximation scheme for the Replenishment Storage problem. - Dorit S. Hochbaum; Xu Rao (Oper. Res. Lett., 2020)

Erratum: A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems. - Dorit S. Hochbaum; Cheng Lu (SIAM J. Optim., 2020)

Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition. - Dorit S. Hochbaum; Erick Moreno-Centeno (CoRR, 2021)

Applications and efficient algorithms for integer programming problems on monotone constraints. - Dorit S. Hochbaum (Networks, 2021)

Complexity, algorithms and applications of the integer network flow with fractional supplies problem. - Dorit S. Hochbaum; Asaf Levin; Xu Rao (Oper. Res. Lett., 2021)

Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters. - Roberto Javier Asín Achá; Olivier Goldschmidt; Dorit S. Hochbaum; Isaías I. Huerta (KDIR, 2022)

A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints. - Philipp Baumann; Dorit S. Hochbaum (ICPRAM, 2022)

PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm. - Philipp Baumann; Dorit S. Hochbaum (CoRR, 2022)

Network flow methods for the minimum covariate imbalance problem. - Dorit S. Hochbaum; Xu Rao; Jason J. Sauppe (Eur. J. Oper. Res., 2022)

Isolation branching: a branch and bound algorithm for the k-terminal cut problem. - Mark Velednitsky; Dorit S. Hochbaum (J. Comb. Optim., 2022)

A unified approach for a 1D generalized total variation problem. - Cheng Lu; Dorit S. Hochbaum (Math. Program., 2022)

A Better Decision Tree: The Max-Cut Decision Tree with Modified PCA Improves Accuracy and Running Time. - Jonathan Bodine; Dorit S. Hochbaum (SN Comput. Sci., 2022)

A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems. - Dorit S. Hochbaum; Zhihao Liu; Olivier Goldschmidt (ACDA, 2023)

Unified New Techniques for NP-Hard Budgeted Problems with Applications in Team Collaboration, Pattern Recognition, Document Summarization, Community Detection and Imaging. - Dorit S. Hochbaum (KDIR, 2023)

Obituary for Professor Emeritus Jakob Kraurp. - Anita Schöbel; David Pisinger; Dorit S. Hochbaum (Eur. J. Oper. Res., 2023)

Algorithms and Complexities of Matching Variants in Covariate Balancing. - Dorit S. Hochbaum; Asaf Levin; Xu Rao (Oper. Res., 2023)

Flow Is Best, Fast and Scalable: The Incremental Parametric Cut for Maximum Density and Other Ratio Subgraph Problems. - Dorit S. Hochbaum (KDIR, 2024)

Positive-Unlabeled Learning Using Pairwise Similarity and Parametric Minimum Cuts. - Torpong Nitayanont; Dorit S. Hochbaum (KDIR, 2024)

Text-Based Feature-Free Automatic Algorithm Selection. - Amanda Salinas-Pinto; Bryan Alvarado-Ulloa; Dorit S. Hochbaum; Matías Francia-Carramiñana; Ricardo Ñanculef; Roberto Javier Asín Achá (KDIR, 2024)

Path of Solutions for Fused Lasso Problems. - Torpong Nitayanont; Cheng Lu; Dorit S. Hochbaum (ICPRAM, 2024)

Binary weights spanning trees and the k-red spanning tree problem in linear time. - Dorit S. Hochbaum (CoRR, 2024)

Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques. - Roberto Javier Asín Achá; Alexis Espinoza; Olivier Goldschmidt; Dorit S. Hochbaum; Isaías I. Huerta (Networks, 2024)

Automatic algorithm selection for Pseudo-Boolean optimization with given computational time limits. - Catalina Pezo; Dorit S. Hochbaum; Julio Godoy; Roberto Javier Asín Achá (Comput. Oper. Res., 2025)

A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem. - Dorit S. Hochbaum; Philipp Baumann; Olivier Goldschmidt; Y. Zhang (Eur. J. Oper. Res., 2025)

An Algorithm for Clustering with Confidence-Based Must-Link and Cannot-Link Constraints. - Philipp Baumann; Dorit S. Hochbaum (INFORMS J. Comput., 2025)

The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings. - Nathan Atkinson; Scott C. Ganz; Dorit S. Hochbaum; James B. Orlin (INFORMS J. Optim., 2025)

Confidence HNC: A Network Flow Technique for Binary Classification with Noisy Labels. - Dorit S. Hochbaum; Torpong Nitayanont (CoRR, 2025)

An Effective Flow-based Method for Positive-Unlabeled Learning: 2-HNC. - Dorit S. Hochbaum; Torpong Nitayanont (CoRR, 2025)