| 2026 | CPAIOR | Backbone-Based Predict and Search for Pseudo-Boolean Optimization. | Bryan Alvarado-Ulloa, Bistra Dilkina, Dorit S. Hochbaum, Ricardo anculef, Roberto Asn-Ach |
| 2026 | CPAIOR | Probing Features for Automatic Algorithm Selection for Pseudo-boolean Optimization. | Amanda Salinas-Pinto, Catalina Pezo, Dorit S. Hochbaum, Bistra Dilkina, Ricardo anculef, Roberto Asn-Ach |
| 2026 | ICAART | Backbones in Pseudo-Boolean Optimization: Extraction and Analysis. | Matas Francia-Carramiana, Bryan Alvarado-Ulloa, Dorit S. Hochbaum, Bistra Dilkina, Ricardo anculef, Roberto Asn-Ach |
| 2026 | ICPRAM | A Fast Algorithm for Euclidean Maximum Weight Non-Bipartite Matching. | Philipp Baumann, Olivier Goldschmidt, Dorit S. Hochbaum |
| 2024 | IC3K | Flow Is Best, Fast and Scalable: The Incremental Parametric Cut for Maximum Density and Other Ratio Subgraph Problems. | Dorit S. Hochbaum |
| 2024 | IC3K | Positive-Unlabeled Learning Using Pairwise Similarity and Parametric Minimum Cuts. | Torpong Nitayanont, Dorit S. Hochbaum |
| 2024 | IC3K | Text-Based Feature-Free Automatic Algorithm Selection. | Amanda Salinas-Pinto, Bryan Alvarado-Ulloa, Dorit S. Hochbaum, Matas Francia-Carramiana, Ricardo anculef, Roberto Javier Asn Ach |
| 2024 | ICPRAM | Path of Solutions for Fused Lasso Problems. | Torpong Nitayanont, Cheng Lu, Dorit S. Hochbaum |
| 2023 | IC3K | Unified New Techniques for NP-Hard Budgeted Problems with Applications in Team Collaboration, Pattern Recognition, Document Summarization, Community Detection and Imaging. | Dorit S. Hochbaum |
| 2022 | IC3K | Fast Algorithms for the Capacitated Vehicle Routing Problem using Machine Learning Selection of Algorithm's Parameters. | Roberto Javier Asn Ach, Olivier Goldschmidt, Dorit S. Hochbaum, Isaas I. Huerta |
| 2022 | ICPRAM | A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints. | Philipp Baumann, Dorit S. Hochbaum |
| 2020 | IC3K | The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees. | Jonathan Bodine, Dorit S. Hochbaum |
| 2019 | IC3K | Detecting Aberrant Linking Behavior in Directed Networks. | Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky |
| 2018 | COCOA | Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem. | Mark Velednitsky, Dorit S. Hochbaum |
| 2018 | RECOMB | Efficient Algorithms to Discover Alterations with Complementary Functional Association in Cancer. | Rebecca Sarto Basso, Dorit S. Hochbaum, Fabio Vandin |
| 2018 | WAOA | 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 |
| 2016 | ICPRAM | Sparse-Reduced Computation - Enabling Mining of Massively-large Data Sets. | Philipp Baumann, Dorit S. Hochbaum, Quico Spaen |
| 2011 | GLOBECOM | On Hardness of Multiflow Transmission in Delay Constrained Cooperative Wireless Networks. | Marjan A. Baghaie, Dorit S. Hochbaum, Bhaskar Krishnamachari |
| 2009 | ICCV | An efficient algorithm for Co-segmentation. | Dorit S. Hochbaum, Vikas Singh |
| 2007 | WAOA | Covering the Edges of Bipartite Graphs Using | Dorit S. Hochbaum, Asaf Levin |
| 2006 | WAOA | The | Dorit S. Hochbaum, Asaf Levin |
| 2000 | ESA | Minimizing a Convex Cost Closure Set. | Dorit S. Hochbaum, Maurice Queyranne |
| 1999 | IPCO | Solving the Convex Cost Integer Dual Network Flow Problem. | Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin |
| 1998 | IPCO | The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem. | Dorit S. Hochbaum |
| 1994 | STOC | An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane. | Naveen Garg, Dorit S. Hochbaum |
| 1992 | IPCO | Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality. | Dorit S. Hochbaum, Joseph Naor |
| 1990 | IPCO | On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions. | Dorit S. Hochbaum |
| 1989 | ICALP | The Complexity of Nonlinear Separable Optimization. | Dorit S. Hochbaum, J. George Shanthikumar |
| 1988 | FOCS | Polynomial Algorithm for the k-Cut Problem | Olivier Goldschmidt, Dorit S. Hochbaum |
| 1985 | FOCS | Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results | Dorit S. Hochbaum, David B. Shmoys |
| 1984 | STOC | Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems | Dorit S. Hochbaum, David B. Shmoys |
| 1984 | STACS | Approximation Schemes for Covering and Packing Problems in Robotics and VLSI. | Dorit S. Hochbaum, Wolfgang Maass |