Dorit S. Hochbaum
According to our database^{1},
Dorit S. Hochbaum
authored at least 149 papers
between 1980 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on orcid.org

on id.loc.gov

on dnb.info

on isni.org
On csauthors.net:
Bibliography
2021
Applications and efficient algorithms for integer programming problems on monotone constraints.
Networks, 2021
Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition.
CoRR, 2021
2020
Erratum: A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems.
SIAM J. Optim., 2020
A fully polynomial time approximation scheme for the Replenishment Storage problem.
Oper. Res. Lett., 2020
An OptimallyCompetitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.
Theory Comput. Syst., 2020
Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer.
Inf. Process. Lett., 2020
CoRR, 2020
CoRR, 2020
Ann. Oper. Res., 2020
The MaxCut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees.
Proceedings of the 12th International Joint Conference on Knowledge Discovery, 2020
2019
Efficient algorithms to discover alterations with complementary functional association in cancer.
PLoS Comput. Biol., 2019
Networks, 2019
The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem.
Oper. Res., 2019
A comparative study of the leading machine learning techniques and two new optimization algorithms.
Eur. J. Oper. Res., 2019
Proceedings of the 11th International Joint Conference on Knowledge Discovery, 2019
2018
Optim. Lett., 2018
AdjacencyClustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing.
Oper. Res., 2018
Complexity and approximations for submodular minimization problems on two variables per inequality constraints.
Discret. Appl. Math., 2018
DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals.
CoRR, 2018
DISPATCH: An OptimallyCompetitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.
Proceedings of the Approximation and Online Algorithms  16th International Workshop, 2018
Proceedings of the Combinatorial Optimization and Applications, 2018
2017
A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems.
SIAM J. Optim., 2017
Highperformance geometric algorithms for sparse computation in big data analytics.
Proceedings of the 2017 IEEE International Conference on Big Data, 2017
2016
IEEE Trans. Big Data, 2016
A competitive study of the pseudoflow algorithm for the minimum st cut problem in vision applications.
J. Real Time Image Process., 2016
Min cost flow on unit capacity networks and convex cost Kflow are as easy as the assignment problem with AllMinCuts algorithm.
CoRR, 2016
A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem.
Comput. Ind. Eng., 2016
Proceedings of the 5th International Conference on Pattern Recognition Applications and Methods, 2016
2015
Eur. J. Oper. Res., 2015
Proceedings of the 2015 IEEE International Conference on Industrial Engineering and Engineering Management, 2015
2014
Networks, 2014
The Supervised Normalized Cut Method for Detecting, Classifying, and Identifying Special Nuclear Materials.
INFORMS J. Comput., 2014
2013
Approximation Algorithms for a Minimization Variant of the OrderPreserving Submatrices and for Biclustering Problems.
ACM Trans. Algorithms, 2013
Networks, 2013
A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant.
Oper. Res., 2013
EURO J. Comput. Optim., 2013
Proceedings of the RealTime Image and Video Processing 2013, 2013
2012
CoRR, 2012
Ranking of multidimensional drug profiling data by fractionaladjusted bipartitional scores.
Bioinform., 2012
2011
Oper. Res., 2011
Practical and theoretical improvements for bipartite matching using the pseudoflow algorithm
CoRR, 2011
CoRR, 2011
Experimental Analysis of the MRF Algorithm for Segmentation of Noisy Medical Images.
Algorithmic Oper. Res., 2011
Ann. Oper. Res., 2011
An Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2011
On Hardness of Multiflow Transmission in Delay Constrained Cooperative Wireless Networks.
Proceedings of the Global Communications Conference, 2011
2010
Theor. Comput. Sci., 2010
IEEE Trans. Pattern Anal. Mach. Intell., 2010
Networks, 2010
CoRR, 2010
CoRR, 2010
Acta Informatica, 2010
2009
Networks, 2009
A Computational Study of the Pseudoflow and PushRelabel Algorithms for the Maximum Flow Problem.
Oper. Res., 2009
Eur. J. Oper. Res., 2009
Proceedings of the IEEE 12th International Conference on Computer Vision, ICCV 2009, Kyoto, Japan, September 27, 2009
An Efficient and Effective Image Segmentation Interactive Tool.
Proceedings of the BIOSIGNALS 2009, 2009
2008
Oper. Res. Lett., 2008
Optim. Methods Softw., 2008
Oper. Res., 2008
Technical Note  Solving Linear Cost Dynamic LotSizing Problems in <i>O</i>(<i>n</i> log <i>n</i>) Time.
Oper. Res., 2008
Polynomial time algorithms for bicriteria, multiobjective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions
CoRR, 2008
2007
Ann. Oper. Res., 2007
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007
2006
SIAM J. Optim., 2006
Manag. Sci., 2006
Cyclical scheduling and multishift scheduling: Complexity and approximation algorithms.
Discret. Optim., 2006
Proceedings of the Internet and Network Economics, Second International Workshop, 2006
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006
2005
Complexity and algorithms for convex network optimization and other nonlinear problems.
4OR, 2005
2004
Proceedings of the Handbook of Scheduling  Algorithms, Models, and Performance Analysis., 2004
Oper. Res. Lett., 2004
50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today.
Manag. Sci., 2004
A CutBased Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.
Algorithmica, 2004
2003
SIAM J. Discret. Math., 2003
Networks, 2003
Manag. Sci., 2003
Oper. Res., 2003
2002
Networks, 2002
Interfaces, 2002
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations.
Eur. J. Oper. Res., 2002
2001
Networks, 2001
Manag. Sci., 2001
An efficient algorithm for image segmentation, Markov random fields and related problems.
J. ACM, 2001
INFORMS J. Comput., 2001
2000
Performance Analysis and Best Implementations of Old and New Algorithms for the OpenPit Mining Problem.
Oper. Res., 2000
Discret. Appl. Math., 2000
Instant recognition of polynominal time solvability, half integrality and 2approximations.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000
1999
A lineartime algorithm for the bottleneck transportation problem with a fixed number of sources.
Oper. Res. Lett., 1999
A halfintegral linear programming relaxation for scheduling precedenceconstrained jobs on a single machine.
Oper. Res. Lett., 1999
1998
A primaldual interpretation of two 2approximation algorithms for the feedback vertex set problem in undirected graphs.
Oper. Res. Lett., 1998
J. Algorithms, 1998
The Pseudoflow Algorithm and the PseudoflowBased Simplex for the Maximum Flow Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998
The <i>t</i>Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998
1997
J. Comput. Biol., 1997
Oper. Res., 1997
A New and Fast Approach to Very Large Scale Integrated Sequential Circuit Test Generation.
Oper. Res., 1997
Eur. J. Oper. Res., 1997
Discret. Appl. Math., 1997
Discret. Appl. Math., 1997
An O (log k)Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane.
Algorithmica, 1997
1996
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1996
SIAM J. Optim., 1996
SIAM J. Discret. Math., 1996
Networks, 1996
J. Algorithms, 1996
1995
Oper. Res. Lett., 1995
About strongly polynomial time algorithms for quadratic optimization over submodular constraints.
Math. Program., 1995
1994
Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality.
SIAM J. Comput., 1994
Oper. Res. Lett., 1994
Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems.
Math. Oper. Res., 1994
Math. Oper. Res., 1994
Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources.
Math. Oper. Res., 1994
1993
Tight bounds and 2approximation algorithms for integer programs with two variables per inequality.
Math. Program., 1993
A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound.
Inf. Process. Lett., 1993
Discret. Appl. Math., 1993
The empirical performance of a polynomial algorithm for constrained nonlinear optimization.
Ann. Oper. Res., 1993
1992
A polynomial algorithm for an integer quadratic nonseparable transportation problem.
Math. Program., 1992
An Exact Sublinear Algorithm for the MaxFlow, Vertex Disjoint Paths and Communication Problems on Random Graphs.
Oper. Res., 1992
1991
Oper. Res., 1991
1990
J. ACM, October, 1990
Asymptotically Optimal Linear Algorithm for the Minimum <i>k</i>Cut in a Random Graph.
SIAM J. Discret. Math., 1990
SIAM J. Discret. Math., 1990
Discret. Appl. Math., 1990
On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990
1989
Networks, 1989
Inf. Process. Lett., 1989
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989
1988
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach.
SIAM J. Comput., 1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
1987
J. Algorithms, 1987
Using dual approximation algorithms for scheduling problems theoretical and practical results.
J. ACM, 1987
1986
J. Algorithms, 1986
J. ACM, 1986
Oper. Res., 1986
Discret. Appl. Math., 1986
Discret. Appl. Math., 1986
A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986
1985
Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI
J. ACM, January, 1985
Math. Oper. Res., 1985
1984
Ann. Oper. Res., 1984
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984
Proceedings of the STACS 84, 1984
1983
Discret. Appl. Math., 1983
1982
SIAM J. Comput., 1982
Math. Program., 1982
1980
Math. Oper. Res., 1980
J. ACM, 1980