| Publication | Date of Publication | Type |
|---|
Break maximization for round-robin tournaments without consecutive breaks
Operations Research Letters | 2025-05-05 | Paper |
| Nash equilibria for information diffusion games on weighted cycles and paths | 2021-06-23 | Paper |
Strongly separable matrices for nonadaptive combinatorial group testing
Discrete Applied Mathematics | 2021-03-25 | Paper |
Non-adaptive group testing on graphs with connectivity
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Cancel-and-tighten algorithm for quickest flow problems
Networks | 2018-06-13 | Paper |
Pure-strategy Nash equilibria on competitive diffusion games
Discrete Applied Mathematics | 2018-05-24 | Paper |
A fast cost scaling algorithm for submodular flow
Information Processing Letters | 2016-06-16 | Paper |
On the number of edges in a minimum \(C_6\)-saturated graph
Graphs and Combinatorics | 2015-07-20 | Paper |
Approximation algorithms for a winner determination problem of single-item multi-unit auctions
JSIAM Letters | 2013-08-09 | Paper |
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
Information Processing Letters | 2012-03-12 | Paper |
A comment on pure-strategy Nash equilibria in competitive diffusion games
Information Processing Letters | 2012-03-09 | Paper |
New bounds on the minimum number of calls in failure‐tolerant gossiping
Networks | 2009-07-28 | Paper |
AN ADJUSTABLE ROBUST APPROACH FOR A 1-MEDIAN LOCATION PROBLEM ON A TREE
Journal of the Operations Research Society of Japan | 2008-11-10 | Paper |
Maximum network flows with concave gains
Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)
Journal of the Operations Research Society of Japan | 2005-04-23 | Paper |
Fast cycle canceling algorithms for minimum cost submodular flow
Combinatorica | 2004-10-19 | Paper |
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
SIAM Journal on Optimization | 2003-01-05 | Paper |
Minimax inverse problems of minimum cuts
Networks | 2002-04-08 | Paper |
Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow
Mathematics of Operations Research | 2001-11-26 | Paper |
| scientific article; zbMATH DE number 1395409 (Why is no real title available?) | 2000-01-30 | Paper |
| scientific article; zbMATH DE number 1342135 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1303553 (Why is no real title available?) | 1999-06-17 | Paper |
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
Mathematics of Operations Research | 1998-04-13 | Paper |
| scientific article; zbMATH DE number 1091558 (Why is no real title available?) | 1997-11-25 | Paper |
A cost-scaling algorithm for \(0-1\) submodular flows
Discrete Applied Mathematics | 1997-04-27 | Paper |
A dual approximation approach to weighted matroid intersection
Operations Research Letters | 1996-08-01 | Paper |
An algorithm for fractional assignment problems
Discrete Applied Mathematics | 1995-09-14 | Paper |
