| Searching for nagamochi. |
Results restricted to the author field.
Retrieving citations...
340 citations found.
Context Doc 57 (8): H. Nagamochi and T. Ibaraki. Computing edge-connectivity in multigraphs and capacitated graphs. SIAM Journal on Discrete Mathematics, 5(1):54-66, February 1992.
Context Doc 54 (0): N. Nagamochi and T. Ibaraki. Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica, 7:583--596, 1992.
Context Doc 12 (0): X. Deng, T. Ibaraki, and H. Nagamochi. Algorithmic aspects of the core of combinatorial optimization games. Math. of Operations Research 24 (1999), pp. 751-766.
Context Doc 12 (4): A. Frank, T. Ibaraki, and H. Nagamochi, On sparse subgraphs preserving connectivity properties, J. Graph Theory, 17 (1993), pp. 275--281.
Context Doc 11 (0): Hiroshi Nagamochi, Tadashi Ono, and Toshihde Ibaraki. Implementing an efficient minimum capacity cut algorithm. Mathematical Programming, 67:325--241, 1994.
Context Doc 9 (2): Nagamochi, H., Nishimura, K., and Ibaraki, T., "Computing all small cuts in undirected networks," Ding-Zhu Du, Xiang-Sun Zhang (Eds.), Lectures Notes in Computer Science, Vol. 834, Springer, Berlin, Algorithms and Computation, ISAAC'94, 1994, pp. 190-198.
Context Doc 7 (1): Ibaraki, T., Nagamochi, H. and Kameda, T. (1995) Optimal coteries for rings and related networks. Distrib. Comput., 8, 191--201.
Context Doc 7 (0): X. Deng, T. Ibaraki, H. Nagamochi and W. Zang: Totally balanced combinatorial optimization games. Math. Program. 87 (2000) 441--452.
Context Doc 6 (5): H. Nagamochi and T. Ibaraki. A linear-time algorithm for nding a sparse k- connected spanning subgraph of a k-connected graph. Algorithmica, 7:583-596, 1992.
Context Doc 6 (0): H. Nagamochi and T. Ibaraki. Linear time algorithms for finding k-edges connected and k-node connected spanning sub-graphs. Algorithmica, 7, 1992, 583--596.
Context Doc 5 (0): Xiaotie Deng, Toshihide Ibaraki, and Hiroshi Nagamochi. Algorithms and complexity in combinatorial optimization games. SODA 1997.
Context Doc 5 (0): H. Nagamochi and T. Ibaraki: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM Journal on Discrete Mathematics, vol. 5 (1992), pp. 54--66.
Context Doc 5 (3): P. Eades, Q. Feng, X. Lin, and H. Nagamochi. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Tech. rep. 98-03, Dept. Comp. Sci., Univ. Newcastle, Callaghan 2308, Australia, 1998.
Context Doc 5 (0): H. Nagamochi, S. Nakamura, and T. Ibaraki. A simpli ed (nm) time edge-splitting algorithm in undirected graphs. Algorithmica, 26(1):50-67, 2000.
Context Doc 5 (2): H. Nagamochi and T. Ibaraki. Deterministic O(nm) time edge-splitting in undirected graphs. Journal of Combinatorial Optimization, 1(1):5-46, 1997.
Context Doc 4 (1): Eades, P., Feng, Q., and Nagamochi, H. Drawing clustered graphs on an orthogonal grid. Journal of Graph Algorithms and Applications 3, 4 (1999), 3--29.
Context Doc 4 (0): X. Deng, T. Ibaraki, H. Nagamochi and W. Zang, Totally balanced combinatorial optimization games, Mathematical Programming 87, 2000, 441--452.
Context Doc 4 (0): H. Nagamochi and P. Eades, Edge-splitting and edge-connectivity augmentation in planar graphs, R.E. Bixby et al., eds., IPCO VI, Springer LNCS 1412, pp. 96-111,
Context Doc 3 (1): Nagamochi, H., D.-Z. Zeng, N. Kabutoya and T. Ibaraki (1997): Complexity of the minimum base game on matroids, Math. Oper. Res.2 2, 146164.
Context Doc 3 (0): L. Zhao, H. Nagamochi, and T. Ibaraki. A primal-dual approximation algorithm for the survivable network design problem in hypergraph. In STACS 2001.
Context Doc 3 (1): Hiroshi Nagamochi, Tadashi Ono, and Toshihide Ibaraki. Implementing an e#cient minimum capacity cut algorithm. Mathematical Programming, 67:325--241, 1994.
Context Doc 3 (2): Karuno, Y., Nagamochi, H., and Ibaraki, T. Vehicle scheduling on a tree with release and handling times. Annals of Operations Research 69 (1997), 193-207. 11
Context Doc 3 (0): Y. Karuno and H. Nagamochi. A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times. In Proceedings of the European Symposium on Algorithms, pages 218--229, 2001.
Context Doc 3 (1): H. Nagamochi and T. Ibaraki, A note on minimizing submodular functions. Information Processing Letters 67 (1998) 239--244.
Context Doc 2 (0): Hiroshi Nagamochi and Toshihide Ibaraki. Graph connectivity and its augmentation: applications of ma orderings. Discrete Appl. Math., 123(1-3):447--472, 2002.
Context Doc 2 (0): H. Nagamochi and T. Ibaraki, Maximum Flows in Probabilistic Networks. Networks 21 (1991) 645---666. 28
Context Doc 2 (0): H. Nagamochi. (2003), An Improved Approximation to the One-sided Bilayer Drawing, in Proceedings of the 11th International Symposium on Graph Drawing (GD '03), Lecture Notes in Computer Science, 2912, 406--418, Springer.
Context Doc 2 (0): H. Nagamochi, Recent development of graph connectivity augmentation algorithms, IEICE Trans. Inf. and Syst., vol E83-D, no.3, March 2000.
Context Doc 2 (0): Y. Karuno, H. Nagamochi, and T. Ibaraki, "A 1.5-approximation for singlevehicle scheduling problem on a line with release and handling times", Technical Report 98007, 1998.
Context Doc 2 (1): H. Nagamochi and T. Kameda, Constructing cactus representation for all minimum cuts in an undirected network, Operations Research Society of Japan 39 (1996), 135-158.
Context Doc 2 (0): H. Nagamochi and T. Kameda, Canonical cactus representation for minimum cuts, Japan Journal of Industrial and Applied Mathematics 11 (1994), 343-361.
Context Doc 2 (0): H. Nagamochi and T. Ibaraki, \An approximation for nding a smallest 2-edgeconnected subgraph containing a specied spanning tree", Lecture Notes In Computer Science, vol. 1627, Springer-Verlag, 5th Annual International Computing and Combinatorics Conference, July 26-28, Tokyo, Japan, (1999) 31-40.
Context Doc 2 (0): H. Nagamochi and T. Ibaraki. On Max-flow Min-cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. Information Processing Letters, 31(6):279--285, 1989.
Context Doc 2 (0): H. Nagamochi, M. Fukushima, and T. Ibaraki. Relaxation Methods for the Strictly Convex Multicommodity Flow Problem with Capacity Constraints on Individual Commodities. Networks, 20(4):409--426, 1990.
Context Doc 2 (0): X. Deng, T. Ibaraki, and H. Nagamochi [1997]: Combinatorial optimization games. Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 720-729.
Context Doc 2 (0): H. Nagamochi, 1988. Studies on Multicommodity Flows in Directed Networks, Ph.D. Thesis, Kyoto University, Japan.
Context Doc 2 (0): Y. Karuno, H. Nagamochi and T. Ibaraki, Vehicle scheduling on a tree with release times and handling times, Proc. 4th. International Symposium on Algorithms and Computation ISAAC'93, LNCS 762 (1993), Springer-Verlag, pp. 486-495.
Context Doc 1 (0): H. Nagamochi, (2004), by private comunication.
Context Doc 1 (0): Yoshiyuki Karuno and Hiroshi Nagamochi, "A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times", ESA 2001, LNCS 2161, p. 218--229, 2001.
Context Doc 1 (3): H. Nagamochi, T. Ishii and T. Ibaraki, A simple proof of a minimum cut algorithm and its applications, Technical Report 96001, Kyoto University, 1996.
Context Doc 1 (0): H. Nagamochi, T. Ishii, and H. Ito, Minimum cost source location problem with vertexconnectivity requirements in digraphs. Info Process Letters, 80 (2001), 287--294.
Context Doc 1 (0): H. Nagamochi and T. Ibaraki: Graph connectivity and its augmentation: applications of MA orderings. Discrete Applied Mathematics, vol. 123 (2002), pp. 447--472.
Context Doc 1 (0): H. Nagamochi and T. Ibaraki, A linear time algorithm for computing 3-edgeconnected components in a multigraph, Japan J. Indust. Appl. Math. 9 (1992), 163-180.
Context Doc 1 (0): L. Zhao, H. Nagamochi, and T. Ibaraki. A note on approximating the survivable network design problem in hypergraphs. IEICE Transactions on Information and Systems, E-85D:322--326, 2002. 31
Context Doc 1 (1): Nagamochi, H., Mochizuki, K., and Ibaraki, T. Complexity of the single vehicle scheduling problem on graphs. INFOR: Information Systems and Operational Research 35, 4 (1997), 256-276.
Context Doc 1 (0): Karuno, Y., Nagamochi, H., and Ibaraki, T. A 1.5-approximation for single-vehicle scheduling problem on a line with release and handling times. In Japan-U.S.A. Symposium on Flexible Automation (July 1998), pp. 1363-1366.
Context Doc 1 (0): H. Nagamochi, T. Ono, and T. Ibaraki. Implementing an Ecient Minimum Capacity Cut Algorithm. Math. Prog., 67:297-324, 1994.
Context Doc 1 (0): H. Nagamochi: Studies in Multicommodity Flows in Directed Networks, Dissertation, Kyoto University, 1988
Context Doc 1 (0): Nagamochi H., K. Nishimara and T. Ibaraki, A tight upper bound on the number of small cuts in undirected graphs, Proceedings of ISAAC Beijing , 1994, to appear in Lecture Notes in Computer Science, Springer--Verlag
Context Doc 1 (0): H. Nagamochi and T. Ibaraki: A note on minimizing submodular functions, Inform. Process. Lett., 67 (1998), 239--244.
First 50 documents Next 50
The numbers before each article are the number of citations (excluding self-citations), and the predicted number of self-citations. 340 citations were found, of which 49 were predicted to be self-citations. Self-citations are not included in the graph.
Try your query at: Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
CiteSeer.IST - Copyright Penn State and NEC