The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Satoru Iwata: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  44. Submodular Function Minimization under Covering Constraints. [Citation Graph (, )][DBLP]


  45. Approximating submodular functions everywhere. [Citation Graph (, )][DBLP]


  46. A simple combinatorial algorithm for submodular function minimization. [Citation Graph (, )][DBLP]


  47. An Algorithm for Minimum Cost Arc-Connectivity Orientations. [Citation Graph (, )][DBLP]


  48. Finding coherent cyclic orders in strong digraphs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002