| 2009 |
|---|
| 49 | EE | Satoru Iwata,
James B. Orlin:
A simple combinatorial algorithm for submodular function minimization.
SODA 2009: 1230-1237 |
| 48 | EE | Michel X. Goemans,
Nicholas J. A. Harvey,
Satoru Iwata,
Vahab S. Mirrokni:
Approximating submodular functions everywhere.
SODA 2009: 535-544 |
| 2008 |
|---|
| 47 | EE | Satoru Iwata,
Takuro Matsuda:
Finding coherent cyclic orders in strong digraphs.
Combinatorica 28(1): 83-88 (2008) |
| 46 | EE | Attila Bernáth,
Satoru Iwata,
Tamás Király,
Zoltán Király,
Zoltán Szigeti:
Recent results on well-balanced orientations.
Discrete Optimization 5(4): 663-676 (2008) |
| 45 | EE | Satoru Iwata:
Submodular function minimization.
Math. Program. 112(1): 45-64 (2008) |
| 44 | EE | Satoru Iwata,
Naonori Kakimura:
Solving linear programs from sign patterns.
Math. Program. 114(2): 393-418 (2008) |
| 2007 |
|---|
| 43 | EE | Toshinari Itoko,
Satoru Iwata:
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems.
IPCO 2007: 267-279 |
| 42 | EE | Satoru Iwata,
Kenjiro Takazawa:
The independent even factor problem.
SODA 2007: 1171-1180 |
| 41 | EE | Naonori Kakimura,
Satoru Iwata:
Computing the inertia from sign patterns.
Math. Program. 110(1): 229-244 (2007) |
| 2005 |
|---|
| 40 | EE | Naonori Kakimura,
Satoru Iwata:
Computing the Inertia from Sign Patterns.
IPCO 2005: 236-248 |
| 39 | EE | Satoru Iwata,
Ryo Shimizu:
Combinatorial Analysis of Generic Matrix Pencils.
IPCO 2005: 335-348 |
| 38 | EE | James F. Geelen,
Satoru Iwata:
Matroid Matching Via Mixed Skew-Symmetric Matrices.
Combinatorica 25(2): 187-215 (2005) |
| 37 | EE | Satoru Iwata,
Satoko Moriguchi,
Kazuo Murota:
A capacity scaling algorithm for M-convex submodular flow.
Math. Program. 103(1): 181-202 (2005) |
| 36 | EE | Satoru Iwata,
S. Thomas McCormick,
Maiko Shigeno:
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow.
SIAM J. Discrete Math. 19(2): 304-320 (2005) |
| 35 | EE | Satoru Fujishige,
Satoru Iwata:
Bisubmodular Function Minimization.
SIAM J. Discrete Math. 19(4): 1065-1073 (2005) |
| 2004 |
|---|
| 34 | EE | Satoru Iwata,
Satoko Moriguchi,
Kazuo Murota:
A Capacity Scaling Algorithm for M-convex Submodular Flow.
IPCO 2004: 352-367 |
| 33 | EE | Satoru Iwata,
Nozomu Zuiki:
A network flow approach to cost allocation for rooted trees.
Networks 44(4): 297-301 (2004) |
| 32 | EE | Tamás Fleiner,
András Frank,
Satoru Iwata:
A constrained independent set problem for matroids.
Oper. Res. Lett. 32(1): 23-26 (2004) |
| 2003 |
|---|
| 31 | | Mamoru Mitsuishi,
Jumpei Arata,
Katsuya Tanaka,
Manabu Miyamoto,
Takumi Yoshidome,
Satoru Iwata,
Shin'ichi Warisawa,
Makoto Hashizume:
Development of a remote minimally-invasive surgical system with operational environment transmission capability.
ICRA 2003: 2663-2670 |
| 30 | EE | Satoru Iwata:
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation.
Algorithmica 36(4): 331-341 (2003) |
| 29 | EE | Satoru Iwata,
S. Thomas McCormick,
Maiko Shigeno:
Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*.
Combinatorica 23(3): 503-525 (2003) |
| 28 | EE | Lisa Fleischer,
Satoru Iwata:
A push-relabel framework for submodular function minimization and applications to parametric optimization.
Discrete Applied Mathematics 131(2): 311-322 (2003) |
| 27 | EE | James F. Geelen,
Satoru Iwata,
Kazuo Murota:
The linear delta-matroid parity problem.
J. Comb. Theory, Ser. B 88(2): 377-398 (2003) |
| 26 | EE | Satoru Iwata:
A Faster Scaling Algorithm for Minimizing Submodular Functions.
SIAM J. Comput. 32(4): 833-840 (2003) |
| 2002 |
|---|
| 25 | EE | Satoru Iwata:
A Faster Scaling Algorithm for Minimizing Submodular Functions.
IPCO 2002: 1-8 |
| 24 | EE | Satoru Iwata:
A fully combinatorial algorithm for submodular function minimization.
SODA 2002: 915-919 |
| 23 | EE | Satoru Iwata:
On matroid intersection adjacency.
Discrete Mathematics 242(1-3): 277-281 (2002) |
| 22 | EE | Kouji Arata,
Satoru Iwata,
Kazuhisa Makino,
Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks.
J. Algorithms 42(1): 54-68 (2002) |
| 21 | EE | Satoru Iwata:
A Fully Combinatorial Algorithm for Submodular Function Minimization.
J. Comb. Theory, Ser. B 84(2): 203-212 (2002) |
| 2001 |
|---|
| 20 | EE | Satoru Fujishige,
Satoru Iwata:
Bisubmodular Function Minimization.
IPCO 2001: 160-169 |
| 19 | EE | Satoru Iwata,
Lisa Fleischer,
Satoru Fujishige:
A combinatorial strongly polynomial algorithm for minimizing submodular functions.
J. ACM 48(4): 761-777 (2001) |
| 2000 |
|---|
| 18 | EE | Lisa Fleischer,
Satoru Iwata:
Improved algorithms for submodular function minimization and submodular flow.
STOC 2000: 107-116 |
| 17 | EE | Satoru Iwata,
Lisa Fleischer,
Satoru Fujishige:
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions.
STOC 2000: 97-106 |
| 16 | EE | Kouji Arata,
Satoru Iwata,
Kazuhisa Makino,
Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks.
SWAT 2000: 300-313 |
| 15 | EE | Satoru Iwata,
S. Thomas McCormick,
Maiko Shigeno:
A fast cost scaling algorithm for submodular flow.
Inf. Process. Lett. 74(3-4): 123-128 (2000) |
| 14 | EE | Maiko Shigeno,
Satoru Iwata,
S. Thomas McCormick:
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow.
Math. Oper. Res. 25(1): 76-104 (2000) |
| 1999 |
|---|
| 13 | EE | Satoru Iwata,
S. Thomas McCormick,
Maiko Shigeno:
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.
IPCO 1999: 259-272 |
| 12 | EE | Satoru Iwata:
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation.
SODA 1999: 476-483 |
| 11 | EE | Satoru Fujishige,
Satoru Iwata:
Minimizing a Submodular Function Arising From a Concave Function.
Discrete Applied Mathematics 92(2-3): 211-215 (1999) |
| 1998 |
|---|
| 10 | | Satoru Iwata,
S. Thomas McCormick,
Maiko Shigeno:
A Faster Algorithm for Minimum Cost Submodular Flows.
SODA 1998: 167-174 |
| 9 | EE | Satoru Iwata,
Tomomi Matsui,
S. Thomas McCormick:
A fast bipartite network flow algorithm for selective assembly.
Oper. Res. Lett. 22(4-5): 137-143 (1998) |
| 1997 |
|---|
| 8 | EE | Maiko Shigeno,
Satoru Iwata:
A Cost-scaling Algorithm for 0-1 Submodular Flows.
Discrete Applied Mathematics 73(3): 261-273 (1997) |
| 1996 |
|---|
| 7 | | Hiroshi Imai,
Satoru Iwata,
Kyoko Sekine,
Kensyu Yoshida:
Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders.
COCOON 1996: 68-80 |
| 6 | | Satoru Iwata:
A Capacity Scaling Algorithm for Convex Cost Submodular Flows.
SODA 1996: 482-489 |
| 5 | | Satoru Iwata:
Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows.
Combinatorica 16(3): 449 (1996) |
| 4 | | Satoru Iwata:
A capacity scaling algorithm for convex cost submodular flows.
Math. Program. 76: 299-308 (1996) |
| 3 | EE | Satoru Iwata,
Kazuo Murota:
Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections.
SIAM J. Discrete Math. 9(1): 71-86 (1996) |
| 1995 |
|---|
| 2 | | Satoru Iwata:
Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows.
Combinatorica 15(4): 515-532 (1995) |
| 1 | EE | Satoru Iwata,
Kazuo Murota:
A Theorem on the Principal Structure for Independent Matchings.
Discrete Applied Mathematics 61(3): 229-244 (1995) |
