p_ꗗ (ǕtGEۉcȂǁj English Publications (Refereed Journals and International Conferences) ؁@rG (Toshihide Ibaraki)

1. S. Yajima and T. Ibaraki, A lower bound on the number of threshold functions, IEEE Trans. on Electronic Computers, EC-14, 926-929, 1965.
2. S. Yajima and T. Ibaraki, A theory of completely monotonic functions and its applications to threshold logic, IEEE Trans. on Computers, C-17, 214-229, 1968.
3. S. Yajima and T. Ibaraki, Realization of arbitrary logic functions by completely monotonic functions and its applications to threshold logic, IEEE Trans. on Computers, C-17, 338-351, 1968.
4. S. Yajima, T. Ibaraki and I. Kawano, On autonomous logic nets of threshold elements, IEEE Trans. on Computers, C-17, 385-391, 1968.
5. T. Ibaraki and S. Muroga, Adaptive linear classifier by linear programming, IEEE Trans. on Systems Science and Cybernetics, SSC-4, 53-62, 1970.
6. T. Ibaraki and S. Muroga, Synthesis of networks with a minimum number of negative gates, IEEE Trans. on Computers, C-20, 49-58, 1971.
7. T. Ibaraki, Gate-interconnection minimization of switching networks using negative gates, IEEE Trans. on Computers, C-20, 698-706, 1971.
8. C.R. Baugh, T. Ibaraki and S. Muroga, Results in using Gomory's all-integer integer programming algorithm to design optimum logic networks, Operations Research, 19, 1090-1096, 1971.
9. T. Ibaraki, Complementary programming, Operations Research, 19, 1523-1529, 1971.
10. T. Ibaraki, An algorithm for the asymptotic problem of an integer program, J. of Operations Research Society of Japan, 14, 163-168, 1971.
11. T. Ibaraki, T.K. Liu, C.R. Baugh and S. Muroga, An implicit enumeration program for zero-one integer programming, International J. of Computer and Information Science, 1, 75-92, 1972.
12. S. Muroga and T. Ibaraki, Design of optimal switching networks by integer programming, IEEE Trans. on Computers, C-21, 573-582, 1972.
13. T. Ibaraki, Complementary convex programming, J. of Operations Research Society of Japan, 15, 138-160, 1972.
14. T. Takaoka and T. Ibaraki, N-fail-safe sequential machines, IEEE Trans. on Computers, C-21, 1189-1196, 1972.
15. T. Ibaraki, Representation theorems for equivalent optimization problems, Infromation and Control, 21, 397-435, 1972.
16. ] T. Takaoka and T. Ibaraki, Fail-safe realization of sequential machines, Information and Control, 22, 31-55, 1973.
17. T. Ibaraki, The use of cuts in complementary programming, Operations Research, 21, 353-359, 1973.
18. T. Ibaraki, Algorithms for obtaining shortest paths visiting sepcified nodes, SIAM Review, 15, 309-317, 1973.
19. T. Ibaraki, Solvable classes of discrete dynamic programming, J. of Mathematical Analysis and Applications, 43, 642-693, 1973.
20. T. Ibaraki, Finite state representations of discrete optimization problems, SIAM J. on Computing, 2, 193-210, 1973.
21. T. Ibaraki, Classes of discrete optimization problems and their decision problems, J. of Computer and System Sciences, 8, 84-116, 1974.
22. T. Ibaraki, T. Ohashi and H. Mine, A heuristic algorithm for mixed-integer programming problems, Mathematical Programming Study, 2, 115-136, 1974.
23. T. Ibaraki, Minimal representations of some classes of dynamic programming, Information and Control, 27, 289-328, 1975.
24. H. Ishii, T. Ibaraki and H. Mine, Traveling salesman problems with a capacity constraint of the delivery truck, Memoirs of the Faculty of Engineering, Kyoto University, XXXVII, 252-263, 1975.
25. T. Ibaraki, H. Ishii and H. Mine, An assignment problem on a network, J. of Operations Research Society of Japan, 19, 70-90, 1976.
26. T. Ibaraki, On the optimality of algorithms for finite state sequential decision processes, J. of Mathematical Analysis and Applications, 53, 1976.
27. T. Ibaraki, H. Ishii, J. Iwase, T. Hasegawa and H. Mine, Algorithms for quadratic fractional programming problems, J. of Operations Research Society of Japan, 19, 174-191, 1976.
28. T. Ibaraki, H. Kise and H. Mine, Parallel-machine scheduling problem with unit processing time when jobs have ready and due times, Trans. of the IECE of Japan, E-59, 1-6, 1976.
29. T. Ibaraki, Finite automata having cost functions, Information and Control, 31, 153-176, 1976.
30. H. Ishii, T. Ibaraki and H. Mine, A primal cutting plane algorithm for integer fractional programming problem, J. of Operations Research Society of Japan, 19, 228-244, 1976.
31. T. Ibaraki, Integer programming formulation of combinatorial optimization problems, Discrete Mathematics, 16, 39-52, 1976.
32. T. Ibaraki, Theoretical comparisons of search strategies in branch-and-bound algorithms, International J. of Computer and Information Sciences, 5, 315-344, 1976.
33. T. Ibaraki, Computational efficiency of approximate branch-and-bound algorithms, Mathematics of Operations Research, 1, 287-298, 1976.
34. T. Ibaraki, On the computational efficiency of branch-and-bound algorithms, J. of Operations Research Society of Japan, 20, 16-35, 1977.
35. T. Ibaraki, The power of dominance relations in branch-and-bound algorithms, J. ACM, 24, 264-279, 1977.
36. H. Ishii, T. Ibaraki and H. Mine, Fractional knapsack problems, Mathematical Programming, 13, 255-271, 1977.
37. T. Ibaraki, Branch-and-bound procedures and state-space representation of combinatorial optimization problems, Information and Control, 36, 1-27, 1978.
38. H. Kise, T. Ibaraki and H. Mine, A solvable case of the one-machine scheduling problem with ready and due times, Operations Research, 26, 121-126, 1978.
39. T. Ibaraki, T. Hasegawa, K. Teranaka and J. Iwase, The multiple-choice knapsack problem, J. of Operations Research Society of Japan, 21, 59-93, 1978.
40. T. Ibaraki, Finite automata having cost functions: Nondeterministic models, Information and Control, 37, 40-69, 1978.
41. T. Ibaraki, Depth-$m$ search in branch-and-bound algorithms, International J. of Computer and Information Sciences, 7, 315-343, 1978.
42. T. Ibaraki, T. Kameda and S. Toida, NP-complete diagnosis problems on system graphs, Trans. of the IECE of Japan, E-62, 81-88, 1979.
43. N. Katoh, T. Ibaraki and H. Mine, A polynomial time algorithm for the resource allocation problem with a convex objective function, J. Operational Research Society (United Kingdom), 30, 449-455, 1979.
44. H. Kise, T. Ibaraki and H. Mine, Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times, J. of Operations Research Society of Japan, 22, 205-223, 1979.
45. N. Katoh, T. Ibaraki and H. Mine, Algorithms for a variant of the resource allocation problem, J. of Operations Research Society of Japan, 22, 287-299, 1979.
46. T. Ibaraki, Approximate algorithms for the multiple-choice continuous knapsack problems, J. of Operations Research Society of Japan, 23, 28-62, 1980.
47. T. Ibaraki, Theoretical and simulation studies on computational performance of branch-and-bound algorithms, in Survey of Mathematical Programming, edited by A. Prekopa, Hungarian Academy of Sciences, 1980.
48. N. Katoh, T. Ibaraki and H. Mine, Notes on the problem of the allocation of resources to activities in discrete quantities, J. Operational Research Society (United Kingdom), 31, 595-598, 1980.
49. T. Ibaraki, The number of additional variables required for the integer programming foumulations, Discrete Applied Mathematics, 2, 155-158, 1980.
50. S. Masuyama, T. Ibaraki and T. Hasegawa, The computational complexity of the $m$-center problems on the plane, Trans. of the IECE of Japan, E-64, 57-64, 1981.
51. T. Ibaraki, T. Kameda and S. Toida, On minimal test sets for locating single link failures in networks, IEEE Trans. on Computers, C-30, 182-190, 1981.
52. N. Katoh, T. Ibaraki and H. Mine, An algorithm for finding $K$ minimum spanning trees, SIAM J. on Computing, 10, 247-255, 1981.
53. P.L. Hammer, T. Ibaraki and B. Simeone, Threshold sequences, SIAM J. on Algebraic and Discrete Methods, 2, 39-49, 1981.
54. N. Katoh, T. Ibaraki and H. Mine, An algorithm for $K$ best solutions of the resource allocation problem, J. ACM, 28, 752-764, 1981.
55. P.L. Hammer, T. Ibaraki and U. Peled, Threshold numbers and threshold completions, in Studies on Graphs and Discrete Programming (Annals of Discrete Mathematics), edited by P. Hansen, North-Holland, 125-145, 1981.
56. T. Ibaraki, T. Kameda and S. Toida, Minimal test set for diagnosing a tree system, ditto, 215-240, 1981.
57. T. Ibaraki and U. Peled, Sufficient conditions for graphs to have threshold number 2, ditto, 241-268, 1981.
58. T. Ibaraki, Solving mathematical programming problems with fractional objective fucntions, in Generalized Concavity in Optimization and Economics edited by M. Avriel and S. Schaible, Academic Press, 441-472, 1981.
59. T. Ibaraki and T. Kameda, Deadlock-free systems for a bounded number of processes, IEEE Trans. on Computers, C-31, 188-193, 1982.
60. N. Katoh, T. Ibaraki and H. Mine, An efficient algorithm for $K$ shortest simple paths, Networks, 12, 411-427, 1982.
61. T. Ibaraki, The power of upper and lower bounding functions in branch-and-bound algorithms, J. of Operations Research Society of Japan, 25, 292-320, 1982.
62. T. Ibaraki, H.M. Abdel-Wahab and T. Kameda, Design of minimum cost deadlock-free systems, J. ACM, 30, 736-751, 1983.
63. I. Morihara, T. Ibaraki and T. Hasegawa, Bin packing and multiprocessor scheduling with side constraint on job types, Discrete Applied Mathematics, 6, 173-191, 1983.
64. T. Ibaraki and N. Katoh, On-line computation of transitive closures of graphs, Information Processing Letters, 16, 95-97, 1983.
65. T. Ibaraki, Parametric approaches to fractional programs, Mathematical Programming, 26, 345-362, 1983.
66. H. Kise and T. Ibaraki, On Balut's algotithm and NP-completeness for a chance-constrained schduling problem, Management Science, 29, 384-388, 1983.
67. S. Schaible and T. Ibaraki, Invited Review: Fractional programming, European J. of Operational Research, 12, 325-338, 1983.
68. N. Katoh and T. Ibaraki, A polynomial time algorithm for a chance-constrained single machine scheduling problem, Operations Research Letters, 2, 62-65, 1983.
69. T. Ibaraki, S. Muro, T. Murakami and T. Hasegawa, Using branch-and-bound algorithms to obtain suboptimal solutions, Zeitschrift f\"{u}r Operations Research, 27, 177-202, 1983.
70. T. Ibaraki and T. Kameda, On the optimal nesting order for computing $n$-relatinal joins, ACM Trans. on Database Systems, 9, 482-502, 1984.
71. N. Katoh, T. Ibaraki and H. Mine, An algorithm for the equipollent resource allocation problem, Mathematics of Operations Research, 10, 44-53, 1985.
72. N. Katoh and T. Ibaraki, An efficient algorithm for the parametric resource allocation problem, Discrete Applied Mathematics, 10, 261-274, 1985.
73. S. Muro, T. Ibaraki, H. Miyajima and T. Hasegawa, Evaluation of the file redundancy in distributed database systems, IEEE Trans. on Software Engineering, SE-11, 199-205. 1985.
74. N. Katoh, T. Ibaraki and T. Kameda, Cautious schedulers with admission control, ACM Trans. on Database Systems, 10, 205-229, 1985.
75. T. Ibaraki, Generalizations of alpha-beta and SSS* search procedures, Artificial Intelligence, 29, 73-117, 1986.
76. Y. Crama, P.L. Hammer and T. Ibaraki, Strong unimodularity for matrices and hypergraphs, Discrete Applied Mathematics, 15, 221-239, 1986.
77. M. Ohnishi, Z-M. Zou, T. Ibaraki and H. Mine, An optimal replacement problem of a semi-Markovian deteriorating system, Memoirs of the Faculty of Engineering, Kyoto University, XLVIII, Part 3, 344-358, 1986.
78. M. Yamashita and T. Ibaraki, Distances defined by neighbourhood sequences, Pattern Recognition, 19, 237-246, 1986
79. N. Katoh, T. Kameda and T. Ibaraki, A cautious scheduler for multistep transactions, Algorithmica, 2, 1-26, 1987.
80. T. Ibaraki, Game solving procedure H* is unsurpassed, in Discrete Algorithms and Complexity edited by D.S. Johnson, T. Nishizeki, A. Nozaki and H.S. Wilf, 185-200, 1987.
81. N. Katoh and T. Ibaraki, A parametric characterization and an $\epsilon$-approximation scheme for the minimization of a quasiconcave program, Discrete Applied Mathematics, 17, 39-66, 1987.
82. S. Hashizume, M. Fukushima, N. Katoh and T. Ibaraki, Approximation algorithms for combinatorial fractional programming problems, Mathematical Programming, 37, 255-267, 1987.
83. T. Ibaraki, T. Kameda and T. Minoura, Serializability with constraints, ACM Trans. on Database Systems, 12, 429-452, 1987.
84. S. Masuyama, T. Ibaraki, S. Muro and T. Hasegawa, Shortest semijoin schedule for a local area distributed database system, IEEE Trans. on Software Engineering, SE-13, 602-606, 1987.
85. Z-Z. Zang, S. Masuyama, T. Ibaraki and H. Mine, Graph packing over a rooted tree, Memoirs of the Faculty of Engineering, Kyoto University, 49, 206-215, 1987.
86. T. Morioka, M. Ohnishi and T. Ibaraki, Optimal inspection and replacement problem of Markovian deteriorating system and its computational algorithms, in Reliability Theory and Applications (S. Osaki and J.-H. Cao, eds.), Proceedings of the China-Japan Reliability Symposium held in Shanghai, Xian and Beijing, China, September 13-25, 1987, World Scientific Publishing, Singapore, pp. 245-254.
87. M. Ohnishi, T. Ibaraki, C.-G. Liu and H. Mine, Adaptive $(t, T)$-minimal repair and replacement policy when failure distribution includes unknown parameter, in Reliability Theory and Applications (S. Osaki and J.-H. Cao, eds.), Proceedings of the China-Japan Reliability Symposium held in Shanghai, Xian and Beijing, China, September 13-25, 1987, World Scientific Publishing, Singapore, pp. 304-313.
88. T. Ibaraki, T. Kameda and N. Katoh, Cautious transaction schedulers for database concurrency control, IEEE Trans. on Software Engineering, SE-14, 997-1009, 1988.
89. Y. Tanaka, M. Fukushima and T. Ibaraki, A comparative study of several semi-infinite nonlinear programming algorithms, European J. of Operational Research, 36, 92-100, 1988.
90. Y. Tanaka, M. Fukushima and T. Ibaraki, A globally convergent SQP method for semi-infinite nonlinear optimization, J. of Computational and Applied Mathematics, 23, 141-153, 1988.
91. T. Itoh, M. Fukushima and T. Ibaraki, An iterative method for variational inequalities with application to traffic equilibrium problems, J. of Operations Research Society of Japan, 31, 82-103, 1988.
92. Y. Crama, P.L. Hammer and T. Ibaraki, Cause-effect relationships and partially defined Boolean functions, Annals of Operations Research, 16, 299-326, 1988.
93. S. Nishio, S. Taniguchi and T. Ibaraki, On the efficiency of cautious schedulers for database concurrency control -- Why insitst on two-phase locking?, J. of Real-Time Systems, 1, 177-195, 1989.
94. R. Katsura, M. Fukushima and T. Ibaraki, Interior methods for nonlinear minimum cost network flow problems, J. of Oprations Research Society of Japan, 32, 174-198, 1989.
95. E. Yamakawa, M. Fukushima and T. Ibaraki, An efficient trust region algorithm for minimizing nondifferentiable composite functions, SIAM J. on Sci. Stat. Comput., 10, 562-580, 1989.
96. H. Nagamochi and T. Ibaraki, On max-flow min-cut and integral flow properties for multicommodity flows in directed networks, Information Processing Letters, 31, 279-285, 1989.
97. Y. Tanaka, M. Fukushima and T. Ibaraki, On generalized pseudoconvex functions, J. of Mathematical Analysis and Applications, 144, 342-355, 1989.
98. T. Ibaraki, T. Kameda and N. Katoh, Multiversion cautious schedulers for database concurrency control, IEEE Trans. on Software Engineering, 16, 302-315, 1990.
99. H. Nagamochi and T. Ibaraki, Multicommodity flows in certain planar directed graphs, Discrete Applied Mathematics, 27, 125-145, 1990.
100. H. Nagamochi, M. Fukushima and T. Ibaraki, Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities, Networks, 20, 409-426, 1990.
101. Y. Crama, P.L. Hammer and T. Ibaraki, Packing, covering and partitioning problems with strongly unimodular constraint matrices, Mathematics of Operations Research, 15, 258-267, 1990.
102. T. Ibaraki and Y. Katoh, Searching minimax game trees under memory space constraint, Annals of Mathematics and Artificial Intelligence, 1, 141-153, 1990.
103. S. Suzuki, T. Ibaraki and M. Kishi, Reverse counting method for linear recursive query with many cyclic extensional predicates, Proc. of the IASTED International Symposium Artificial Intelligence Applications and Neural Networks - AINN'90, Zurich, 22-25, 1990.
104. M. Ohnishi, T. Ibaraki and H. Mine, On the optimality of $(t, T)$-policy in the minimal-repair and replacement problem under the average cost criterion, Proc. International Symposium on Maintainability and Reliability, Tokyo, June 5-8, pp. 329-334, 1990.
105. T. Ibaraki and S. Poljak, Weak three-linking in Eulerian digraphs, SIAM J. on Discrete Mathematics, 4, 84-98, 1991.
106. Y. Uno and T. Ibaraki, Complexity of the optimum join order problem in relational databases, Trans. of the IEICE of Japan, E-74, 2067-2075, 1991.
107. H. Kise, T. Shioyama and T. Ibaraki, Automated two-machine flowshop scheduling: A solvable case, IIE Trans., 23, 10-16, 1991.
108. H. Nagamochi, Z. Sun and T. Ibaraki, Counting the number of minimum cuts in undirected multigraphs, IEEE Trans. on Reliability, 40, 610-614, 1991.
109. S. Masuyama and T. Ibaraki, Chain packing in graphs, Algorithmica, 6, 826-839, 1991.
110. K. Namikawa and T. Ibaraki, An algorithm for the fair resource allocation problem with a submodular constraint, Japan J. of Industrial and Applied Mathematics, 8, 377-387, 1991.
111. E. Boros, P.L. Hammer, T. Ibaraki and K. Kawakami, Identifying 2-monotonic positive boolean functions in polynomial time, ISA'91 (International Symposium on Algorithms), Taipei, Lecture Notes in Computer Science 557 (edited by W.L. Hsu and R.C.T. Lee), 104-115, 1991.
112. H. Nagamochi and T. Ibaraki, Maximum flows in probabilistic networks, Networks, 21, 645-666, 1991.
113. S. Ibaraki, M. Fukushima and T. Ibaraki, Dual-based Newton methods for nonlinear minimum cost network flow problems, J. of Operations Research Society of Japan, 34, 263-286, 1991.
114. T. Ibaraki and T. Kameda, Boolean theory of coteries, Proc. of the Third IEEE Symposium on Parallel and Distributed Processing, 3, 150-157, 1991.
115. S. Suzuki, T. Ibaraki and M. Kishi, Using relaxation techniques to evaluate queries in deductive databases, Proc. of the International Conference on Database and Expert Systems Applications (DEXA), Berlin, 67-72, 1991.
116. N. Katoh, J. Koyanagi, M. Ohnishi and T. Ibaraki, Optimal strategies for some team games, Discrete Applied Mathematics, 35, 275-291, 1992.
117. H. Nagamochi and T. Ibaraki, Computing edge-connectivity in multiple and capacitated graphs, SIAM J. on Discrete Mathematics, 5, 54-66, 1992.
118. H. Nagamochi and T. Ibaraki, A linear time algorithm for finding a sparse $k$-connected spanning subgraph of a $k$-connected graph, Algorithmica, 7, 583-596, 1992.
119. M. Fukushima, K. Takazawa, S. Ohsaki and T. Ibaraki, Successive linearization methods for large-scale nonlinear programming problems, Japan J. of Industrial and Applied Mathematics, 9, 117-132, 1992.
120. T. Ibaraki, H. Nagamochi and T. Kameda, Optimal coteries for rings and related networks, Proc. 12th International Conference on Distributed Computing Systems (ICDCS), Yokohama, 650-656, 1992.
121. H. Nagamochi and T. Ibaraki, On Onaga's upper bound on the mean values of probabilistic maximum flows, IEEE Trans. on Reliability, 41, No.2, pp.225-229, 1992.
122. H. Nagamochi and T. Ibaraki, A linear time algorithm for computing 3-edge-connected components in a multigraph, Japan. J. of Industrial and Applied Mathematics, 9, No.2, pp.163-180, 1992.
123. K. Nakade, M. Ohnishi, T. Ibaraki and K. Ohno, On the average optimality of circular assignment policy, Queueing Systems, 11, pp.241-254, 1992.
124. H. Sandoh, H. Kawai and T. Ibaraki, An optimal backup policy for a hard computer disk depending on age under availability criterion, Computers Math. Applications, 24, No.1/2, pp.57-62, 1992.
125. Y. Segawa, M. Ohnishi and T. Ibaraki, Optimal minimal-repair and replacement problem with age dependent cost structure, Computers Math. Applications, 24, No.1/2, pp.91-101, 1992.
126. N. Katoh, T. Ibaraki and T. Kameda, A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control, Discrete Applied Mathematics, 40, pp.379-395, 1992.
127. S. Ibaraki, M. Fukushima and T. Ibaraki, Primal-dual proximal point algorithm for linearly constrained convex programming problems, Computational Optimization and Applications, Vol.1, pp.207-226, 1992.
128. T. Ibaraki and T. Kameda, A theory of coteries: Mutual exclusion in distributed systems, IEEE Trans. on Parallel and Distributed Systems, Vol.4, No.7, pp.779-794, 1993.
129. K. Taji, M. Fukushima and T. Ibaraki, A globally convergent Newton method for solving strongly monotone variational inequalities, Mathematical Programming, Vol. 58, pp.369-383, 1993.
130. T. Wakahara, M. Fukushima and T. Ibaraki, A practical approach to decomposable nonlinear programming problems, J. of the Operations Research Society of Japan, Vol. 36, No. 1, pp.1-12, 1993.
131. Y. Shimazu, M. Fukushima and T. Ibaraki, A successive over-relaxation method for quadratic programming problems with interval constraints, J. of the Operations Research Society of Japan, Vol.36, No.2, pp.73-89, 1993.
132. Andras Frank, T. Ibaraki and H. Nagamochi, On sparse subgraphs preserving connectivity properties, J. Graph Theory, Vol. 17, pp. 275-281, 1993.
133. Yoshiyuki Karuno, H. Nagamochi and T. Ibaraki, Vehicle scheduling on a tree with release and handling times, Fourth Annual Symposium on Algorithms and Computation ISAAC'93, Hong Kong, December 1993. (Lecture Notes in Computer Science 762, Algorithms and Computation, edited by K. W. Ng, P. Raghavan, N. V. Balasubramanian, F. Y. L. Chin, pp.486-495, 1993.)
134. M. Ohnishi, Hiroshi Maeda and T. Ibaraki, Optimal scheduling policies in time sharing service systems, in Stochastic Models in Engineering, Technology and Management (S. Osaki and D. N. P. Murty, eds.), Proceedings of the Australia-Japan Workshop held at Gold Coast, Australia, July 14-16, 1993, World Scientific Publishing, Singapore, pp. 444-453.
135. Terunao Soneoka and T. Ibaraki, Logically instantaneous message passing in asynchronous distributed systems, IEEE Trans. on Computers, Vol. 43, No. 5, pp. 513-527, May 1994.
136. T. Ibaraki and Y. Nakamura, A dynamic programming method for single machine scheduling, European J. Operational Research, Vol. 76, pp. 72-82, 1994.
137. H. Nagamochi, Kazuhiro Nishimura and T. Ibaraki, Computing all small cuts in undirected networks, Fifth Annual Symposium on Algorithms and Computation ISAAC'94, Beijing, August 1994; Springer Lecture Notes in Computer Science 834, edited by Ding-Zhu Du and Xiang-Sun Zhang, pp. 190-198, 1994.
138. Kazuhisa Makino and T. Ibaraki, The maximum latency and identification of positive Boolean functions, Fifth Annual Symposium on Algorithms and Computation ISAAC'94, Beijing, August 1994; Springer Lecture Notes in Computer Science 834, edited by Ding-Zhu Du and Xiang-Sun Zhang, pp. 324-332, 1994.
139. Y. Karuno and T. Ibaraki, Online routing control for AGV-systems, Japan-USA Symposium on Flexible Automation - A Pacific Rim Conference -, Kobe, Japan, pp. 637-644, July 1994.
140. H. Nagamochi, Tadashi Ono and T. Ibaraki, Implementing an efficient minimum capacity cut algorithm, Mathematical Programming, Vol. 67, pp. 325-341, 1994.
141. M. Ohnishi, T. Morioka and T. Ibaraki, Optimal minimal-repair and replacement problem of discrete-time Markovian deterioratin system under incomplete state information, Computers and Industrial Engineering, Vol. 27, pp. 409-412, 1994.
142. M. Tsujino, M. Fukushima and T. Ibaraki, A model of time-varying flow on a congested multidestination network, Asia-Pacific Journal of Operational Research, Vol. 11, pp. 141-153, 1994.
143. D.-Z. Zeng, M. Ohnishi and T. Ibaraki, Double-offer bargaining rule, in Proceedings of the third Conference of the Asian-Pacific Operations Research Societies (APORS) (M. Fushimi and K. Tone, eds.), held at Fukuoka, Japan, July 26-29, 1994, World Scientific Publishing, Singapore, pp. 243-250.
144. J. C. Bioch and T. Ibaraki, Decomposition of positive self-dual Boolean functions, Discrete Mathematics, Vol. 140, pp. 23-46, 1995.
145. E. Boros, V. Gurvich, P. L. Hammer, T. Ibaraki and A. Kogan, Decomposability of partially defined Boolean functions, Discrete Applied Mathematics, Vol.62, pp. 51-75, 1995.
146. T. Ibaraki, H. Nagamochi and T. Kameda, Optimal coteries for rings and related networks, Distributed Computing, Vol. 8, pp. 191-201, 1995.
147. H. Nagamochi and T. Ibaraki, A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem, Fourth Conference on Integer Programming and Combinatorial Optimization (IPCO IV), May 1995; Lecture Notes in Computer Science 920, Integer Programming and Combinatorial Optimization, edited by Egon Balas and Jens Clausen, Springer, pp. 403-413.
148. K. Iwaoka, M. Fukushima and T. Ibaraki, A primal-dual proximal point algorithm for variational inequality problems, Variational Inequalities and Network Equilibrium Problems, edited by F. Giannessi and A. Maugeri, Plenum Press, New York, pp. 143-153, 1995.
149. D.-Z. Zeng, M. Ohnishi, T. Ibaraki and Ting Chen, On arbitration for the Bayesian Collective Choice Problem, Memoirs of the Faculty of Engineering, Kyoto University, Vol. LVII, Part 1, pp.27-40, January 1995.
150. M. Yagiura and T. Ibaraki, Genetic and local search algorithms as robust and simple optimization tools, Proceedings of Metaheuristics International Conference 95, to appear.
151. A. Frank, T. Ibaraki and H. Nagamochi, Two arc disjoint paths in Eulerian digraphs, 6th International Symposium on Algorithms and Computation ISAAC'95, Cairns, December 1995; Algorithms and Computation", edited by John Staples, Peter Eades, Naoki Katoh and Alistair Moffat, Lecture Notes in Computer Science 1004, Springer, pp.92-101, 1995.
152. K. Makino and T. Ibaraki, A fast and simple algorithm for identifying 2-monotonic positive Boolean functions, 6th International Symposium on Algorithms and Computation ISAAC'95, Cairns, December 1995; Algorithms and Computation", edited by John Staples, Peter Eades, Naoki Katoh and Alistair Moffat, Lecture Notes in Computer Science 1004, Springer, pp.291-300, 1995.
153. Y. Karuno, H. Nagamochi and T. Ibaraki, Vehicle scheduling on a tree to minimize maximum lateness, J. Operations Research Society of Japan, Vol. 39, No. 3, pp. 345-355, 1996.
154. D.-Z. Zeng, S. Nakamura and T. Ibaraki, An equilibrium analysis for final-double-offer arbitration, Mathematical Social Sciences, Vol. 31, pp.147-170, 1996.
155. K. Makino and T. Ibaraki, Interior and exterior functions of Boolean functions, Discrete Applied Mathematics, Vol.69, No. 3, pp. 209-231, August 1996.
156. J. C. Bioch and T. Ibaraki, Generating and approximating non-dominated coteries, IEEE Trans. on Parallel and Distributed Systems, Vol.6, No.9, pp.905-914, September 1995.
157. J. C. Bioch and T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Information and Computation, Vol.123, No.1, pp.50-63, 1995.
158. M. Yagiura and T. Ibaraki, The use of dynamic programming in genetic algorithms for permutation problems, European J. of Operational Research, Vol. 92, pp. 387-401, 1996.
159. E. Boros, P. L. Hammer, T. Ibaraki and K. Kawakami, Polynomial time recognition of 2-monotonic positive Boolean functions given by an oracle, SIAM J. on Computing, Vol.26, No.1, pp.93-109, 1997.
160. T. Sugimoto, M. Fukushima and T. Ibaraki, A parallel relaxation method for quadratic programming problems with interval constraints, J. of Computational and Applied Mathematics, Vol. 60, pp.219-236, 1995.
161. M. Yagiura and T. Ibaraki, Metaheuristics as robust and simple optimization tools, Proceedings of 1996 IEEE International Conference on Evolutionary Computation (IECE'96), pp.541-546, Nagoya, Japan, May 20-22, 1996.
162. E. Boros, T. Ibaraki and K. Makino, Boolean analysis of incomplete examples, 5th Scandinavian Workshop on Algorithm Theory (SWAT'96), Reykjavik, Iceland, July 1996; Algorithm Theory -- SWAT'96", edited by Rolf Karlsson and Andrzej Lingas, Lecture Notes in Computer Science 1097, Springer, pp.440-451, 1996.
163. Y. Crama and T. Ibaraki, Hitting or avoiding balls in Euclidian space, MIS (Mathematics of Industiral Systems) II, Annals of Operations Research, Baltzer Science Publishers, pp. 47-64, 1997.
164. Y. Karuno, H. Nagamochi and T. Ibaraki, Vehicle scheduling on a tree with release and handling times, MIS (Mathematics of Industiral Systems) II, Annals of Operations Research, Baltzer Science Publishers, pp. 193-207, 1997.
165. H. Nagamochi and T. Ibaraki, Computing edge-connectivity augmentation function in $\tilde{O}(nm)$ time, Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 1997.
166. X. Deng, T. Ibaraki and H. Nagamochi, Combinatorial optimization games, Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 1997.
167. H. Nagamochi, D.-Z. Zeng, N. Kabutoya, T. Ibaraki, Complexity of minimum base games in matroids, Mathematics of Operations Research, Vol.22, No.1, pp.146-164, February 1997.
168. M. Yagiura and T. Ibaraki, Genetic and local search algorithms as robust and simple optimization tools, in Meta Heuristics: Theory and Applications, edited by I. H. Osman and J. P. Kelly, pp.63-82, Kluwer Academic Publishers, 1996.
169. H. Nagamochi and T. Ibaraki, Deterministic $\tilde{O}(nm)$ time edge-splitting in undirected graphs, J. Combinatorial Optimization, pp. 5-46, Vol. 1, No. 1, 1997.
170. K. Makino, T. Suda, K. Yano and T. Ibaraki, Data analysis by positive decision tree, International Symposium on Cooperative Database Systems for Advanced Applications (CODAS 97), pp. 282-289, December 5-7, 1997, Heian Shrine, Kyoto.
171. E. Boros, P. Hammer, T. Ibaraki and Alexander Kogan, Logical analysis of numerical data, Mathematical Programming, Vol.79, No.1-3, pp.163-190, October 1997.
172. H. Nagamochi, K. Nishimura and T. Ibaraki, Computing all small cuts in an undirected network, SIAM J. on Discrete Mathematics, Vol. 10, No.3, pp. 469-481, August, 1997.
173. K. Makino and T. Ibaraki, The maximum latency and identification of positive Boolean functions, SIAM J. on Computing, SIAM J. on Computing, Vol. 26, pp. 1363-1383, 1997.
174. K. Makino, K. Yano and T. Ibaraki, Positive and Horn decomposability of partially defined Boolean functions, Discrete Applied Mathematics, Vol.74, pp. 251-274, 1997.
175. T. Ibaraki and T. Kameda, Multi-frame isochronous service for ATM networks: Stop-and-go revisited, Proc. IC3N'97 (Sixth International Conference on Computer Communications and Networks), pp. 4-10, Sept. 22-25, 1997, Las Vegas.
176. D.-Z. Zeng and T. Ibaraki, Arbitrations when players have different information, Kagawa University Economic Review, Vol. 70, No. 1, pp. 55-95, June 1997.
177. E. Boros, T. Ibaraki and K. Makino, Monotone extensions of Boolean data sets, The 8th International Workshop on Algorithmic Learning Theory (ALT'97), Sendai Japan, October 1997; Algorithmic Learning Theory -- ALT'97, edited by M. Li and A. Maruoka, Springer Lecture Notes in Artificial Intelligence 1316, pp. 440-451, 1997.
178. T. Ibaraki, Solving NP-hard combinatorial problems in the practical sense, Eight Annual International Symposium on Algorithms and Computation (ISAAC'97), Singapore, December 17-19, 1997; Algorithms and Computation, edited by Hon Wai Leong, Hiroshi Imai and Sanjay Jain, Springer Lecture Notes in Computer Science 1350, p. 1, 1997.
179. T. Eiter, T. Ibaraki and K. Makino, Two-face Horn extensions, Eight Annual International Symposium on Algorithms and Computation (ISAAC'97), Singapore, December 17-19, 1997; Algorithms and Computation, edited by Hon Wai Leong, Hiroshi Imai and Sanjay Jain, Springer Lecture Notes in Computer Science 1350, pp. 102-111, 1997.
180. T. Ishii, H. Nagamochi and T. Ibaraki, Augmenting edge and vertex connectivity simultaneously, Eight Annual International Symposium on Algorithms and Computation (ISAAC'97), Singapore, December 17-19, 1997; Algorithms and Computation, edited by Hon Wai Leong, Hiroshi Imai and Sanjay Jain, Springer Lecture Notes in Computer Science 1350, pp. 112-121, 1997.
181. E. Boros, T. Ibaraki and K. Makino, Monotone extensions of Boolean data sets, The 8th International Workshop on Algorithmic Learning Theory (ALT'97), Sendai Japan, October 1997; Algorithmic Learning Theory -- ALT'97, edited by M. Li and A. Maruoka, Springer Lecture Notes in Artificial Intelligence 1316, pp. 440-451, 1997.
182. H. Nagamochi, K. Mochizuki and T. Ibaraki, Complexity of the single vehicle scheduling problem on graphs, INFOR (Information Systems and Operations Research), Vol. 35, No. 4, pp.256-276, Nov. 1997.
183. T. Ibaraki, A. Kogan and K. Makino, Functional dependencies in Horn theories, Fifth International Symposium on Artificial Intelligence and Mathematics, January 4-6, 1998, Fort Lauderdale, Florida.
184. T. Eiter, T. Ibaraki and K. Makino, On disguised double Horn functions and extensions, 15th Symposium on Theoretical Aspects of Computer Science STACS'98, Paris, France, February 25-27, 1998; Theoretical Aspects of Computer Science, edited by M. Morvan, C. Meinel and D. Krob, Springer Lecture Notes in Computer Science 1373, pp. 50-60, 1998.
185. K. Nonobe and T. Ibaraki, A tabu search approach for the CSP (constraint satisfaction problem) as a general problem solver, European J. of Operational Research, Vol. 106, pp.599-623, 1998.
186. T. Ishii, H. Nagamochi and T. Ibaraki, Optimal augmentation of a biconnected graph to a k-edge-connected and triconnected graph, Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98), January 25-27, San Francisco, 1998.
187. E. Boros, T. Ibaraki and K. Makino, Error-free and best-fit extensions of partially defined Boolean functions, Information and Computation, Vol. 140, pp.254-283, 1998.
188. K. Makino and T. Ibaraki, A fast and simple algorithm for identifying 2-monotnic positive Boolean functions, Journal of Algorithms, Vol.26, pp.291-305, 1998.
189. T. Eiter, T. Ibaraki and K. Makino, Double Horn functions, Information and Computation, Vol.144, pp.155-190, 1998.
190. T. Eiter, T. Ibaraki and K. Makino, Computing intersections of Horn theories for reasoning with models, Proc. AAAI'98, pp.292-297, 1998.
191. Y. Karuno, H. Nagamochi and T. Ibaraki, A 1.5-Approximation for Single-Vehicle Scheduling Problem on a Line with Release and Handling Times, Proceedings, 1998 Japan-U.S.A. Symposium on Flexible Automation, ISCIE/ASME, Otsu, Japan, July 12--15, pp.1363--1366, 1998.
192. K. Makino, K. Hatanaka and T. Ibaraki, Horn extensions of a partially defined Boolean function, SIAM J. on Computing, to appear.
193. M. Yagiura and T. Ibaraki, Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT, 4th Annual International Conference on Computing and Combinatorics, COCOON'98, Taipei, Taiwan, August 1998; Computing and Combinatorics, edited by Wen-Lian Hsu and Ming-Yang Kao, Springer Lecture Notes in Computer Science 1449, pp.105-116, 1998.
194. T. Ibaraki, A. V. Karzanov and H. Nagamochi, A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations, Combinatorica, Vol.18, No.1, pp. 61-83, 1998.
195. E. Boros, T. Ibaraki and K. Makino, Logical analysis of binary data with missing bits, Artificial Intelligence, to appear.
196. T. Ibaraki, A.r Kogan and K. Makino, Functional Dependencies in Horn Theories, Artificial Intelligence, to appear.
197. T. Eiter, T. Ibaraki and K. Makino, Disjunctions of Horn Theories and their Cores, ISAAC'98, Taejon, Korea, December 1998; Algorithms and Computation, edited by K.-Y. Chwa and O. H. Ibarra, Springer Lecture Notes in Computer Science 1533, pp.49-58, 1998.
198. T. Ishii, H. Nagamochi, T. Ibaraki, k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph, ISAAC'98, Taejon, Korea, December 1998; Algorithms and Computation, edited by K.-Y. Chwa and O. H. Ibarra, Springer Lecture Notes in Computer Science 1533, pp.159-168, 1998.
199. H. Nagamochi, T. Ibaraki, Polyhedral Structure of Submodular and Posi-modular Systems, ISAAC'98, Taejon, Korea, December 1998; Algorithms and Computation, edited by K.-Y. Chwa and O. H. Ibarra, Springer Lecture Notes in Computer Science 1533, pp.169-178, 1998.
200. H. Nagamochi and T. Ibaraki, A note on minimizing submodular functions, Information Processing Letters, Vol. 67, pp. 239-244, 1998.
201. H. Ono, K. Makino and T. Ibaraki, Logical analysis of data by decomposable Boolean functions, Advanced Database Systems for Integration of Media and User Environments'98, edited by Y. Kambayashi, A. Makinouchi, S. Uemura, K. Tanaka and Y. Masunaga, World Scientific, Singapore, pp.29-34, 1998.
202. M. Yagiura, T. Yamaguchi and T. Ibaraki, A variable depth search algorithm with branching search for the generalized assignment problem, Optimization Methods and Software, Vol. 10, No. 2, pp. 419-441, 1998.
203. Y. Uno and T. Ibaraki, Reachability problems of random digraphs, IEICE (The Institute of Electronics, Information and Communication Engineers) Trans. Fundamentals, Vol. E81-A, No. 12, pp. 2694-2702, December 1998.
204. A. Frank, T. Ibaraki and H. Nagamochi, Two arc-disjoint paths in Eulerian digraphs, SIAM J. Discrete Math., Vol. 11, No. 4, pp. 557-589, November 1998.
205. M. Yagiura, T. Yamaguchi and T. Ibaraki, A variable depth search algorithm for the generalized assignment problem, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, edited by Stefan Voss, Silvano Martello, Ibrahim H. Osman and Catherine Roucairol, Kluwer Academic Publishers, Boston, pp. 459-471, 1999.
206. E. Boros, T. Ibaraki and K. Makino, Logical analysis of binary data with missing bits, Artificial Intelligence, Vol. 107, No.2, pp. 219-264, February 1999.
207. T. Ibaraki, A. Kogan and K. Makino, Functional Dependencies in Horn Theories, Artificial Intelligence, Vol. 108, Nos 1-2, pp.1-30, 1999.
208. T. Eiter, T. Ibaraki and K. Makino, On the difference of Horn theories, Theoretical Aspects of Computing (STACS'99), Meinel et al. (eds), Trier (Germany). Springer LNCS, 1999.
209. K. Makino and T. Ibaraki, Inner-core and outer-core functions of partially defined Boolean functions, Discrete Applied Mathematics, Vol. 96-97, pp.443-460, 1999.
210. J. C. Bioch, T. Ibaraki and K. Makino, Minimum self-dual decompositions of positive dual-minor Boolean fucntions, Discrete Applied Mathematics, Vol. 96-97, pp.307-326, 1999.
211. T. Eiter, T. Ibaraki and K. Makino, Bidual Horn functions and extensions, Discrete Applied Mathematics, Vol. 96-97, pp. 55-88, 1999.
212. M. Yagiura and T. Ibaraki, Analyses on the 2 and 3-flip neighborhoods for the MAX SAT, J. of Combinatorial Optimization, Vol.3, pp. 95-114, 1999.
213. K. Makino, T. Suda, H. Ono and T. Ibaraki, Data analysis by positive decision trees, IEICE Transactions on Information and Systems, Vol. E82-D, No.1, pp. 76-88, January 1999.
214. H. Nagamochi and T. Ibaraki, Augmenting edge-connectivity over the entire range in $\tilde{O}(nm)$ time, J. Algorithms, Vol. 30, pp. 253-301, 1999.
215. H. Nagamochi and T. Ibaraki, A fast algorithm for computing minimum 3-way and 4-way cuts, 7th Conference on Integer Programming and Combinatorianl Optimization (IPCO'99), Graz, Austria, June 9-11, 1999; Lecture Notes in Computer Science, Springer-Verlag, to appear.
216. H. Nagamochi and T. Ibaraki, An approximation of the minimum vertex cover in a graph, Japan J. of Industrial and Applied Mathematics, Vol. 16, No. 3, pp. 369-375, 1999.
217. T. Eiter, T. Ibaraki and K. Makino, Computing intersections of Horn theories for reasoning with models, Artificial Intelligence, Vol. 110, pp. 57-101, 1999.
218. H. Nagamochi and T. Ibaraki, A fast algorithm for computing minimum 3-way and 4-way cuts, Integer Programming and Combinatorial Optimization, IPCO'99, June 9-11, 1999, Graz, Austria; Springer Lecture Notes in Computer Science, 1999.
219. H. Nagamochi and T. Ibaraki, An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree, 5th Annual International Conference on Computing and Combinatorics, COCOON'99, Tokyo, July 1999; Springer Lecture Notes in Computer Science, 1999.
220. H. Nagamochi, S. Katayama and T. Ibaraki, Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts, 5th Annual International Conference on Computing and Combinatorics, COCOON'99, Tokyo, July 1999; Springer Lecture Notes in Computer Science, 1999.
221. K. Makino, Y. Uno and T. Ibaraki, On Minimum Edge Ranking Spanning Trees, The 24th International Symposium on Mathematical Foundations of Computer Science, September, 1999, Szklarska Poreba, Poland; Lecture Notes in Computer Science, 1672, Mathematical Foundations of Computer Science 1999, edited by M. Kutylowski, L. Pacholski and T. Wierxbicki, Springer-Verlag, pp. 398-409, 1999.
222. T. Ishii, H. Nagamochi and T. Ibaraki, Augmenting an $(k-1)$-vertex-connected multigraph to a $l$-edge-connected and $k$-vertex-connected multigraph, 7th Annual European Symposium on Algorithms, July, 1999, Prague, Czech Republic; Lecture Notes in Computer Science, 1643, Springer-Verlag, pp. 414-425, 1999.
223. K. Makino, H. Ono and T. Ibaraki, Interior and exterior functions of positive Boolean functions, The 1st Japanese- Hungarian Symposium on Discrete Mathematics and its Applications, Kyoto, March 17-19, 1999.
224. T. Horiyama and T. Ibaraki, Ordered binary decision diagrams representing knowledge-bases, The 1st Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, Kyoto, March 17-19, 1999.
225. H. Nagamochi, T. Shiraki and T. Ibaraki, Augmenting a submodular and posi-modular set function by a multigraph, The 1st Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, Kyoto, March 17-19, 1999.
226. H. Nagamochi, T. Ishii and T. Ibaraki, A simple proof of a minimum cut algorithm and its applications, IEICE Trans. Fundamentals, Vol. E82-A, No. 10, pp.2231-2236, 1999.
227. X. Deng, T. Ibaraki and H. Nagamochi, Algorithmic aspects of the core of combinatorial optimization gemes, Mathematics of Operations Research, Vol. 24, No. 3, pp. 751-766, 1999.
228. H. Nagamochi, S. Nakamura and T. Ibaraki, A simplified $\tilde {O}(nm)$ time edge-splitting algorithm in undirected graphs, Algorithmica, Vol. 26, pp. 50-67, 2000.
229. T. Ibaraki, Partially defined Boolean functions with applications to data analysis: A survey, Mathematica Japonica, Vol. 51, No. 1, pp. 153-165, 2000.
230. E. Boros, P. L. Hammer, T. Ibaraki, A. Kogan, E. Mayoraz and I. Muchnik, An implementation of logical analysis of data, IEEE Trans. on Knowledge and Data Engineering, Vol. 12, No. 2, pp. 292-306, 2000.
231. T. Ishii, H. Nagamochi and T. Ibaraki, Optimal augmentation of a 2-vertex-connected multigraph to an $l$-edge-connected and 3-vertex-connected multigraph, J. of Combinatorial Optimization, Vol. 4, pp. 35-78, 2000.
232. H. Nagamochi, K. Seki and T. Ibaraki, A 7/3 approximation for the minimum weight 3-Connected spanning subgraph problem, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E83-A, No. 4, pp. 687-691, April 2000.
233. X. Deng, T. Ibaraki, H. Nagamochi and W. Zang, Totally balanced combinatorial optimization games, Mathematical Programming, Series A, Vol. 87, pp.441-452, 2000.
234. ] H. Nagamochi, Y. Nakao and T. Ibaraki, A fast algorithm for cactus representations of minimum cuts, Japan Journal of Industrial and Applied Mathematics, Vol. 17-2, pp. 245-264, 2000.
235. H. Nagamochi, S. Katayama and T. ibaraki, A faster algorithm for computing minimum 5-way and 6-way cuts in graphs, J. of Combinatorial Optimization, Vol. 4, pp. 151-169, 2000.
236. E. Boros, T. Ibaraki and K. Makino, Fully consistent extensions of partially defined Boolean functions, International Conference IFIP TCS 2000, August 2000, Sendai, Japan; Theoretical Computer Science, edited by J. van Leeuwen, O. Watanabe, M. Hagiya, P.D. Mosses and T. Ito, Lecture Notes in Computer Science, Springer, Vol. 1872, pp. 257-272, 2000.
237. D. R. Gaur, T. Ibaraki and R. Krishnamurti, Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem, 8th Annual European Symposium (ESA2000), Saarb\"{u}cken, Germany, September 2000; Algorithms - ESA 2000, edited by Mike Paterson, Lecture Notes in Computer Science, Springer, Vol. 1879, pp. 211-219, 2000.
238. E. Boros, T. Horiyama, T. Ibaraki, K. Makino and M. Yagiura, Finding essential attributes in binary data, IDEAL2000 (Second International Conference on Intelligent Data Engineering and Automated Learning), Dec. 13-15, Hong Kong, 2000; Intelligent Data Engineering and Automated Learning, Lecture Notes in Computer Science, Springer, Vol. 1983, pp. 133-138, 2000.
239. T. Horiyama and T. Ibaraki, Reasoning with Ordered Binary Decision Diagrams, Proc. International Symposium on Algorithms and Computation (ISAAC 2000), Taipei, Dec. 2000; Algorithms and Computation, Lecture Notes in Computer Science, Springer, Vol. 1969, pp. 120-131, 2000.
240. H. Nagamochi and T. Ibaraki, A fast algorithm for computing minimum 3-way and 4-way cuts, Mathematical Programming, Vol. 88, No. 3, pp. 507-520, 2000.
241. K. Kogan and T. Ibaraki, Optimal scheduling in parallel and serial manufacturing via the maximum principle, J. of Global Optimization, Vol. 16, pp. 271-294, 2000.
242. E. Boros, Y. Crama, O. Ekin, P. L. Hammer, T. Ibaraki, A. Kogan, Boolean normal forms, shellability and reliability computations, SIAM J. Discrete Mathematics, Vol. 13, No.2, pp. 212-226, 2000.
243. T. Eiter, T. Ibaraki and K. Makino, On the difference of Horn theories, J. of Computer and System Sciences, Vol. 61, No. 3, pp. 478-507, December 2000.
244. H. Nagamochi and T. Ibaraki, Polyhedral structure of submodular and posimodular systems, Discrete Applied Mathematics, Vol.107, pp.165-189, 2000.
245. K. Makino, Y. Uno and T. Ibaraki, On minimum edge ranking spanning trees, J. of Algorithms, Vol. 38, pp. 411-437, 2001.
246. T. Ishii, H. Nagamochi and T. Ibaraki, Multigraph augmentation under biconnectivity and general edge-connectivity requirements, Networks, Vol. 37, No.3, pp. 144-155, May 2001.
247. K. Nonobe and T. Ibaraki, An improved tabu search method for the weighted constraint satisfaction problem, INFOR, Vol. 39, No.2, pp. 131-151, May 2001.
248. H.Nagamochi, T.Shiraki and T. Ibaraki, Augmenting a submodular and posi-modular set function by a multigraph, J. Combinatorial Optimization, Vol. 5, pp. 175-212, 2001.
249. H. Nagamochi, K. Mochizuki and T.Ibaraki, Solving the single-vehicle scheduling problem for all home locations under depth-first routing on a tree, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, Vol. E84-A, No. 5, pp. 1135-1143, May 2001.
250. T. Eiter, T. Ibaraki and K. Makino, Disjunctions of Horn theories and their cores, SIAM J. on Computing, Vol. 31, No. 1, pp. 269-288, 2001.
251. T. Ibaraki, A. Kogan and K. Makino, On functional dependencies in q-Horn theories, Artificial Intelligence, Vol. 131, pp. 171-187, 2001.
252. S. Suzuki and T. Ibaraki, Average time analysis of an algorithm to calculate the size of the union of Cartesian products, EuroConference on Combinatorics, Graph Theory and Applications, Bellaterra, Spain, Sept. 12-15, 2001, pp.291-295.
253. L. Zhao, H. Nagamochi and T. Ibaraki, Approximating the minimum $k$-way cut in a graph via minimum 3-way cuts, J. Combinatorial Optimization, Vol. 5, pp. 397-410, 2001.
254. M. Yagiura and T. Ibaraki, Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: Experimental evaluation, Journal of Heuristics, Vol. 7, No. 5, pp. 423-442, 2001.
255. L. Zhao, H. Nagamochi and T. Ibaraki, A unified framework for approximating multiway partition problems, International Symposium on Algorithms and Computation (ISAAC2001), Christchurch, New Zealand, Dec. 19-21, 2001; Peter Eades and Tadao Takaoka (editors), Algorithms and Computation, Lecture Notes in Computer Science, Vol. 2223, pp. 682-694, Springer, 2001.
256. T. Horiyama and T. Ibaraki, Translation among CNFs, characteristic models and ordered binary decision diagrams, International Symposium on Algorithms and Computation (ISAAC2001), Christchurch, New Zealand, Dec. 19-21, 2001; Peter Eades and Tadao Takaoka (editors), Algorithms and Computation, Lecture Notes in Computer Science, Vol. 2223, pp. 231-243, Springer, 2001.
257. H. Ono, M. Yagiura and T. Ibaraki, An index for the data size to extract decomposable structures in LAD, International Symposium on Algorithms and Computation (ISAAC2001), Christchurch, New Zealand, Dec. 19-21, 2001; Peter Eades and Tadao Takaoka (editors), Algorithms and Computation, Lecture Notes in Computer Science, Vol. 2223, pp. 279-290, Springer, 2001.
258. L. Zhao, H. Nagamochi and T. Ibaraki, A primal-dual approximation algorithm for the survival network design problem in hypergraphs, STACS2001, February 15-17; Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Springer, Vol. 2010, pp. 478-489, 2001.
259. R. Enkhbat and T. Ibaraki, Global optimization algorithms for general quadratic programming, Journal of the Mongolian Mathematical Society, Number 5, Ulaanbaatar, pp. 22-56, 2001.
260. R. Enkhbat and T. Ibaraki, On the maximization and minimization of a quasiconvex function, Proceedings of the International Conference on Nonlinear Analysis and Convex Analysis, Hirosaki, Yokohama Publishers, pp. 37-48, 2001.
261. K. Nonobe and T. Ibaraki, Formulation and tabu search algorithm for the resource constrained project scheduling problem, in Essays and Surveys in Metaheuristics (MIC'99), edited by Celso C. Rebeiro and Pierre Hansen, Kluwer Academic Publishers, Boston, pp. 557-588, 2002.
262. H. Nagamochi and T. Ibaraki, Graph connectivity and its augmentation: Applications of MA orderings, Discrete Applied Mathematics, Vol. 123, pp. 447-472, 2002.
263. H. Nagamochi, K. Mochizuki and T. Ibaraki, Solving the single-vehicle scheduling problem for all home locations under depth-first routing on a tree, Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals (to appear).
264. T. Eiter, T. Ibaraki and K. Makino, Decision lists and related Boolean functions, Theoretical Computer Science, Vol.270, pp. 493-524, 2002.
265. L. Zhao, H. Nagamochi and T. Ibaraki, A Note on Approximating the Survivable Network Design Problem in Hypergraphs, Inst. Electron. Inform. Comm. Eng. (IEICE) Transactions on Information and Systems, Vol. E85-D, No.2, pp. 322-326, February 2002.
266. T. Eiter, T. Ibaraki and K. Makino, Recognition and dualization of disguised bidual Horn functions, Information Processing Letters, Vol. 82, pp. 283-291, 2002.
267. Takashi Horiyama and T. Ibaraki, Ordered binary decision diagrams as knowledge-bases, Artificial Intelligence, Vol. 136, pp.189-213, 2002.
268. Y. Karuno, H. Nagamochi and T. Ibaraki, Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks, Networks, Vol. 39 (4), pp.203-209, 2002.
269. K. Makino, Y. Uno and T. Ibaraki, Minimum edge ranking spanning trees of threshold graphs, International Symposium on Algorithms and Computation (ISAAC2002), Vancouver Canada, Nov. 21-23, 2002; Prosenjit Bose and Pat Morin (editors), Algorithms and Computation, Lecture Notes in Computer Science, Vol. 2518, pp. 428-440, Springer, 2002.
270. D. R. Gaur, T. Ibaraki and R. Krishnamurti, Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem, J. of Algorithms, Vol. 43, pp. 138-152, 2002.
271. H. Nagamochi, T. Jordan, Y. Nakao and T. Ibaraki, Convex embeddings and bisections of 3-connected graphs, Combinatorica, Vol. 22(4), pp.537-554, 2002.
272. S. Umetani, M. Yagiura and T. Ibaraki, One-dimensional cutting stock problem to minimize the number of different patterns, European Journal of Operational Research, Vol. 146, pp. 388-402, 2003.
273. L. Zhao, H. Nagamochi and T. Ibaraki, A primal-dual approximation algorithm for the survivable network design problem in hypergraphs, Discrete Applied Mathematics, Vol. 126, pp. 275-289, 2003.
274. L. Zhao, H. Nagamochi and T. Ibaraki, A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem, Information Processing Letters, Vol. 86/2, pp. 63-70, 2003.
275. T. Ibaraki, A. Kogan and K. Makino, Inferring minimal functional dependencies in Horn and q-Horn theories, Annals of Mathematics and Artificial Intelligence, Vol. 38, pp. 233-255, 2003.
276. S. Suzuki and T. Ibaraki, An average running time analysis of a backtracking algorithm to calculate the size of the union of Cartesian products, Information Society 2003, Sub conference on Theoretical computer science (IS03-TCS) Ljubljana, Slovenia, October 16, 2003.
277. S. Suzuki and T. Ibaraki, The complexity of assigning genotypes to people in a pedigree consistently, Eurocomb'03 - European conference on Combinatorics, Graph Theory and Applications, Prague, September 8 - 12, 2003.
278. S. Imahori, M. Yagiura and T. Ibaraki, Local search algorithms for the rectangle packing problem with general spatial costs, Mathematical Programming, Vol. B97, pp. 543-569, 2003.
279. S. Umetani, M. Yagiura, T. Ibaraki, An LP-based local search to the one dimensional cutting stock problem using a given number of cutting patterns, IEICE Transaction on Fundamentals, Vol. E86-A, No. 5, pp. 1093-1102, May, 2003.
280. K. Makino, H. Ono and T. Ibaraki, Interior and exterior functions of positive Boolean functions, Discrete Applied Mathematics, Vol. 130, pp. 417-436, 2003.
281. E. Boros, T. Horiyama, T. Ibaraki, K. Makino and M. Yagiura, Finding essential attributes from binary data, Annals of Mathematics and Artificial Intelligence, Vol. 39, pp. 223-257, 2003.
282. E. Boros, T. Ibaraki and K. Makino, Variations on extending partially defined Boolean functions with missing bits, Information and Computation, Vol. 180, pp. 53-70, 2003.
283. H. Nagamochi, Y. Nishida, T. Ibaraki, Approximability of the minimum maximal matching problem in planar graphs, IEICE Transsactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E86-A, No.12, pp. 3251-3258, December 2003.
284. S. Umetani, M. Yagiura, T. Ibaraki, A local search approach to the pattern restricted one dimensional cutting stock problem, Metaheuristics: Computer Decision-Making, edited by Mauricio G. C. Resende and Jorge P. de Sousa, Kluwer Academic Publishers, 673-698, 2003.
285. S. Umetani, M. Yagiura, T. Ibaraki, An LP-based local search for one dimensional cutting stock problem, MIC2003(The Fifth Metaheuristics International Conference), Kyoto, August 25-28, 2003.
286. K. Nonobe, T. Ibaraki A tabu search algorithm for a generalized resource constrained project scheduling problem, MIC2003(The Fifth Metaheuristics International Conference), Kyoto, August 25-28, 2003.
287. M. Yagiura, S. Iwasaki, T. Ibaraki, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, MIC2003(The Fifth Metaheuristics International Conference), Kyoto, August 25-28, 2003.
288. T. Ibaraki, S. Imahori, K. Nonobe, K. Sobue, T. Uno, Mutsunori Yagiura, An iterated local search algorithm for routing and scheduling problem with convex time penalty functions, MIC2003(The Fifth Metaheuristics International Conference), Kyoto, August 25-28, 2003.
289. S. Suzuki and T. Ibaraki, Average running time analysis of an algorithm to calculate the size of the union of Cartesian products, Discrete Mathematics, Vol. 273, pp. 211-220, 2003.
290. T. Horiyama and T. Ibaraki, Translation among CNFs, caharacteristic models and ordered binary decision diagrams, Information Processing Letters, Vol. 85, No. 4, pp.191-198, Feb. 2003.
291. M.Yagiura, T. Ibaraki and F. Glover, An ejection chain approach for the generalized assignment problem, INFORMS Journal on Computing, Vol. 16, No. 2, pp. 133-151, 2004.
292. M. Yagiura, S. Iwasaki, T. Ibaraki and F. Glover, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Discrete Optimization, Vol. 1, No. 1, pp.87-98, 2004.
293. T. Ibaraki, Building problem solving engines" for combinatorial optimization, SCI2004 (The 8th World Multi-Conferences on Systemics, Cybernetics and Informatics), Orlando Florida, July 18-21, 2004.
294. T. Horiyama and T. Ibaraki, Reasoning with ordered binary decision diagrams, Discrete Applied Mathematics, Vol. 142, No. 1-3, pp. 151-163, 2004.
295. H. Ono, M. Yagiura, T. Ibaraki, A Decomposability index in logical analysis of data, Discrete Applied Mathematics, Vol. 142, pp. 165-180, 2004.
296. L. Zhao, H. Nagamochi, T. Ibaraki, Greedy splitting algorithms for approximating multiway partition problems, Mathematical Programming, Vol. 102, No. 1, pp. 167-183, January 2005.
297. S. Imahori, M. Yagiura and T. Ibaraki, Improved local search algorithms for the rectangle packing problem with general spatial costs, European Journal of Operational Research, Vol. 167, Issue 1, 16, pp. 48--67, Nov. 2005.
298. T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno and M. Yagiura, Effective local search algorithms for routing and scheduling problems with general time window constraints, Transportation Science, Vol. 39, No. 2, pp. 206-232, May 2005.
299. T. Ibaraki, Y.Vax\`{e}s, X.-G. Yang, Lowering eccentricity of a tree by node-upgrading, Networks, Vol. 45, No. 4, pp. 232-239, July 2005.
300. E. Boros, T. Ibaraki, H. Ichikawa, K. Nonobe, T. Uno and M. Yagiura, Heuristic approaches to the capacitated square covering problem, Pacific Journal of Optimization, Vol. 1, No. 3, pp.465-490, 2005.
301. M. Yagiura, T. Ibaraki and F. Glover, A path relinking approach for the generalized assignment problem, European J. of Operational Research, Vol. 169, No. 2, pp. 548-569, 2005.
302. S. Umetani, M. Yagiura and T. Ibaraki, One-dimensional cutting stock problem with a given number of setups: A hybrid approach of metaheuristics and linear programming, Journal of Mathematical Modelling and Algorithms, Vol. 5, pp. 43-64, Feb. 2006.
303. H. Hashimoto, T. Ibaraki, S. Imahori and M. Yagiura, The vehicle routing problem with flexible time windows and traveling times, Discrete Applied Mathematics, Vol. 154, Issue 16, pp. 2271-2290, November 2006.
304. T. Ishii, H. Nagamochi and T. Ibaraki, Augmenting a (k-1)-vertex-connected multigraph to an L-edge-connected and k-vertex-connected multigraph, Algorithmica, Vol. 44, pp.257-280, 2006.
305. T. Ibaraki and K. Nakamura, Packing problems with soft rectangles, Hybrid Metaheuristics (Third International Workshop on hybrid metaheuristics, Gran Canaria, Spain, October 13-14, 2006), edited by F. Almeida, M. J. B. Aguilera, C. Blum, J. M. M. Vega, M. P. Perez, A. Rodi and M. Sampels, Springer LNCS 4030, pp. 13-27, 2006.
306. K. Makino, Y. Uno and T. Ibaraki, Minimum edge ranking spanning trees of split graphs, Discrete Applied Mathematics, Vol. 154, pp. 2373-2386, 2006.
307. T. Ibaraki, A. Ishikawa, H. Nagamochi, K. Nonobe and M. Yagiura, An iterated local search algorithm for the multi-resource generalized assignment problem with flexible assignment cost, Proceedings of the Third International Symposium on Scheduling, pp. 160-165, 2006.
308. K. Matsumoto, H. Miwa, and T. Ibaraki, Scheduling of corrugated paper production, Proceedings of the Third International Symposium on Scheduling, pp. 6-11, Tokyo, 2006.
309. K. Haraguchi and T. Ibaraki, Construction of classifiers by iterative compositions of features with partial knowledge, IEICE Transactions on Fundamentals, E89-A, No. 5, pp. 1284-1291, 2006.
310. M. Nishihara, M. Yagiura and T. Ibaraki, Duality in option pricing based on prices of other derivatives, Operations Research Letters, Vol. 35, Issue 2, pp. 165-171, March 2007.
311. E. Chiba, H. Fujiwara, Y. Sekiguchi and T. Ibaraki, Collision probability in an automated production line under Erlang distribution, Proceedings of the 5th International Conference on Research, Innovation and Vision for the Future (RIVF 2007), pp. 42-49, 2007.
312. Y. Kurebe, H. Miwa, T. Ibaraki, Weighted module placement based on rectangle packing, 4th ESICUP meeting (EURO Special Interest Group on Cutting and Packing), March, 2007.
313. E. Chiba, H. Fujiwara and T. Ibaraki, A new approach to approximate the collision probability in an automated production line, Information Technology Letters, Vol. 6, pp. 1--4, 2007.
314. Y. Kurebe, H. Miwa, T. Ibaraki, Weighted module placement based on rectangle packing, 4th ESICUP meeting (EURO Special Interest Group on Cutting and Packing), March, 2007.
315. K. Haraguchi, M. Yagiura, E. Boros and T. Ibaraki, A randomness based analysis on the data size needed for removing deceptive patterns, IEICE Transactions on Information and Systems, Vol. E91-D, No. 3, March pp. 781-788, 2008.
316. H. Hashimoto, M. Yagiura and T. Ibaraki, An Iterated local search algorithm for the time-dependent vehicle routing problem with time windows, Discrete Optimization, Vol. 5/2, pp. 434-456, 2008.
317. T. Ibaraki, S. Imahori, K. Nonobe, K. Sobue, T. Uno, M. Yagiura, An iterated local search algorithm for the vehicle routing problem with convex time penalty functions, Discrete Applied Mathematics, Vol. 156, pp. 2050-2069, 2008.
318. K. Matsumoto, H. Miwa, and T. Ibaraki, Scheduling of corrugated paper production, European Journal of Operational Research, Vol. 192, pp. 782-792, 2009.
319. H. Hashimoto, Y. Ezaki, M. Yagiura, K. Nonobe, T. Ibaraki and A. Lokketangen, A set covering approach for the pickup and delivery problem with general constraints on each route, Pacific Journal of Optimization, Vol. 5, No. 2, pp. 185-202, 2009.
320. S. Umetani, M. Yagiura, S. Imahori, T. Imamichi, K. Nonobe, T. Ibaraki, Solving the irregular strip packing problem via guided local search for overlap minimization, ITOR (International Transactions in Operational Research), Vol.16, pp.661-683, 2009.
321. T. Ibaraki, A personal perspective on problem solving by general purpose solvers, ITOR (International Transactions in Operational Research), Vol. 17, pp. 303-315, 2010.
322. M. Nishihara, M. Yagiura and T. Ibaraki, Computing bounds on risk-neutral distributions form the observed prices of call options, Asia-Pacific J. of Operational Research, Vol.27, No.2, pp.211-225, 2010.
323. H. Hashimoto, M. Yagiura, S. Imahori and T. Ibaraki, Recent progress of local search in handling the time window constraints of the vehicle routing problem, 4OR: A Quarterly Journal of Operations Research, Volume 8, Number 3, pp. 221-238, 2010.
324. T. Ibaraki, T. Imamichi, Y. Koga, H. Nagamochi, K. Nonobe and M. Yagiura, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, Mathematical Programming (Series A), Volume 127, Number 2, pp.297-343, 2011.
Return to homepage of T. Ibaraki

< Last update: April 2010 >