Dorit S. HOCHBAUM

Dorit S. HOCHBAUM

University of California, Berkeley

H-index: 54

North America-United States

About Dorit S. HOCHBAUM

Dorit S. HOCHBAUM, With an exceptional h-index of 54 and a recent h-index of 28 (since 2020), a distinguished researcher at University of California, Berkeley,

His recent articles reflect a diverse array of research interests and contributions to the field:

Binary weights spanning trees and the -red spanning tree problem in linear time

Algorithms and Complexities of Matching Variants in Covariate Balancing

Obituary for Professor Emeritus Jakob Kraurp

The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings

Errata: A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem

Unified New Techniques for NP-Hard Budgeted Problems with Applications in Team Collaboration, Pattern Recognition, Document Summarization, Community Detection and Imaging

A breakpoints based method for the maximum diversity and dispersion problems

Automatic Algorithm Selection for Pseudo-Boolean Optimization with Given Computational Time Limits

Dorit S. HOCHBAUM Information

University

Position

___

Citations(all)

17002

Citations(since 2020)

3583

Cited By

14929

hIndex(all)

54

hIndex(since 2020)

28

i10Index(all)

127

i10Index(since 2020)

68

Email

University Profile Page

University of California, Berkeley

Google Scholar

View Google Scholar Profile

Top articles of Dorit S. HOCHBAUM

Title

Journal

Author(s)

Publication Date

Binary weights spanning trees and the -red spanning tree problem in linear time

arXiv preprint arXiv:2401.07341

Dorit S Hochbaum

2024/1/14

Algorithms and Complexities of Matching Variants in Covariate Balancing

Operations Research

Dorit S Hochbaum

Asaf Levin

Xu Rao

2023/9

Obituary for Professor Emeritus Jakob Kraurp

European Journal of Operational Research

Anita Schöbel

David Pisinger

Dorit Hochbaum

2023

The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings

arXiv preprint arXiv:2307.15702

Nathan Atkinson

Scott C Ganz

Dorit S Hochbaum

James B Orlin

2023/7/28

Errata: A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem

Dorit S Hochbaum

2023/6/6

Unified New Techniques for NP-Hard Budgeted Problems with Applications in Team Collaboration, Pattern Recognition, Document Summarization, Community Detection and Imaging

Dorit S Hochbaum

2023

A breakpoints based method for the maximum diversity and dispersion problems

Dorit S Hochbaum

Zhihao Liu

Olivier Goldschmidt

2023

Automatic Algorithm Selection for Pseudo-Boolean Optimization with Given Computational Time Limits

arXiv preprint arXiv:2309.03924

Catalina Pezo

Dorit Hochbaum

Julio Godoy

Roberto Asin-Acha

2023/9/7

Obituary for Professor Emeritus Jakob Krarup

David Pisinger

Anita Schöbel

Dorit Hochbaum

2023

A better decision tree: The max-cut decision tree with modified PCA improves accuracy and running time

SN Computer Science

Jonathan Bodine

Dorit S Hochbaum

2022/5/31

Fast algorithms for the Capacitated Vehicle Routing Problem using Machine Learning selection of algorithm’s parameters

International Conference on Knowledge Discovery and Information Retrieval

Roberto Asın-Achá

Olivier Goldschmidt

Dorit S Hochbaum

Isaıas Huerta

2022

PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm

arXiv preprint arXiv:2212.14437

Philipp Baumann

Dorit S Hochbaum

2022/12/29

A k-means algorithm for clustering with soft must-link and cannot-link constraints

Philipp Baumann

Dorit Hochbaum

2022

Isolation branching: a branch and bound algorithm for the k-terminal cut problem

Journal of Combinatorial Optimization

Mark Velednitsky

Dorit S Hochbaum

2022/10

Network flow methods for the minimum covariate imbalance problem

European Journal of Operational Research

Dorit S Hochbaum

Xu Rao

Jason Sauppe

2022/8/1

A unified approach for a 1D generalized total variation problem

Mathematical Programming

Cheng Lu

Dorit S Hochbaum

2022/7

Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition

arXiv preprint arXiv:2101.04765

Dorit S Hochbaum

Erick Moreno-Centeno

2021/1/12

Applications and efficient algorithms for integer programming problems on monotone constraints

Networks

Dorit S Hochbaum

2021/1

Complexity, algorithms and applications of the integer network flow with fractional supplies problem

Operations Research Letters

Dorit S Hochbaum

Asaf Levin

Xu Rao

2021/7/1

A graph-theoretic approach for spatial filtering and its impact on mixed-type spatial pattern recognition in wafer bin maps

IEEE Transactions on Semiconductor Manufacturing

Ahmed Aziz Ezzat

Sheng Liu

Dorit S Hochbaum

Yu Ding

2021/3/2

See List of Professors in Dorit S. HOCHBAUM University(University of California, Berkeley)

Co-Authors

H-index: 81
Ron Shamir

Ron Shamir

Tel Aviv University

H-index: 76
Wolfgang Maass

Wolfgang Maass

Technische Universität Graz

H-index: 69
J. George Shanthikumar

J. George Shanthikumar

Purdue University

H-index: 68
James B. Orlin

James B. Orlin

Massachusetts Institute of Technology

H-index: 64
Joseph Seffi Naor

Joseph Seffi Naor

Technion - Israel Institute of Technology

H-index: 59
marshall fisher

marshall fisher

University of Pennsylvania

academic-engine