Skip to content

S. Thomas McCormick

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

15

Venues

5

Active years

1993–2020

Best venue rank

A*

Where they publish

Papers

15 indexed papers, newest first.

YearVenueTitleAuthors
2020IPCOFaster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts.Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
2017ICALPRerouting Flows When Links Fail.Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
2014IPCOA Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts.Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne
2014WAOAPrimal-Dual Algorithms for Precedence Constrained Covering Problems.Andreas Wierz, Britta Peis, S. Thomas McCormick
2011IPCOA Primal-Dual Algorithm for Weighted Abstract Cut Packing.S. Thomas McCormick, Britta Peis
2008IPCOA Polynomial Algorithm for Weighted Abstract Flow.Maren Martens, S. Thomas McCormick
2008SODAStrongly polynomial and fully combinatorial algorithms for bisubmodular function minimization.S. Thomas McCormick, Satoru Fujishige
2000SODAMinimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks.S. Thomas McCormick, Akiyoshi Shioura
1999IPCOA Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
1998SODAA Faster Algorithm for Minimum Cost Submodular Flows.Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
1997SODAPolynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths.S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma
1996SODAA Polynomial Algorithm for Abstract Maximum Flow.S. Thomas McCormick
1996STOCFast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow.S. Thomas McCormick
1995SODAPolynomial Methods for Separable Convex Optimization in Unimodular Spaces.Alexander V. Karzanov, S. Thomas McCormick
1993IPCOCanceling most helpful total submodular cuts for submodular flow.S. Thomas McCormick, Thomas R. Ervolina