AAAAAA
Results: 1-25/40
Authors:
Kawata, K
Ibaraki, T
Tanabe, A
Yagoh, H
Shinoda, A
Suzuki, H
Yasuhara, A
Citation: K. Kawata et al., Gas chromatographic-mass spectrometric determination of hydrophilic compounds in environmental water by solid-phase extraction with activated carbon fiber felt, J CHROMAT A, 911(1), 2001, pp. 75-83
Authors:
Zhao, L
Nagamochi, H
Ibaraki, T
Citation: L. Zhao et al., Approximating the minimum k-way cut in a graph via minimum 3-way cuts, J COMB OPTI, 5(4), 2001, pp. 397-410
Authors:
Nagamochi, H
Shiraki, T
Ibaraki, T
Citation: H. Nagamochi et al., Augmenting a submodular and posi-modular set function by a multigraph, J COMB OPTI, 5(2), 2001, pp. 175-212
Authors:
Yagiura, M
Ibaraki, T
Citation: M. Yagiura et T. Ibaraki, Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: Experimental evaluation, J HEURISTIC, 7(5), 2001, pp. 423-442
Authors:
Nagamochi, H
Mochizuki, K
Ibaraki, T
Citation: H. Nagamochi et al., Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree, IEICE T FUN, E84A(5), 2001, pp. 1135-1143
Authors:
Nonobe, K
Ibaraki, T
Citation: K. Nonobe et T. Ibaraki, An improved tabu search method for the weighted constraint satisfaction problem, INFOR, 39(2), 2001, pp. 131-151
Authors:
Makino, K
Uno, Y
Ibaraki, T
Citation: K. Makino et al., On minimum edge ranking spanning trees, J ALGORITHM, 38(2), 2001, pp. 411-437
Authors:
Eiter, T
Ibaraki, T
Makino, K
Citation: T. Eiter et al., Disjunctions of Horn theories and their cores, SIAM J COMP, 31(1), 2001, pp. 269-288
Authors:
Ishii, T
Nagamochi, H
Ibaraki, T
Citation: T. Ishii et al., Multigraph augmentation under biconnectivity and general edge-connectivityrequirements, NETWORKS, 37(3), 2001, pp. 144-155
Authors:
Ibaraki, T
Kogan, A
Makino, K
Citation: T. Ibaraki et al., On functional dependencies in q-Horn theories, ARTIF INTEL, 131(1-2), 2001, pp. 171-187
Authors:
Nagamochi, H
Ibaraki, T
Citation: H. Nagamochi et T. Ibaraki, Polyhedral structure of submodular and posi-modular systems, DISCR APP M, 107(1-3), 2000, pp. 165-189
Authors:
Nagamochi, H
Katayama, S
Ibaraki, T
Citation: H. Nagamochi et al., A faster algorithm for computing minimum 5-way and 6-way cuts in graphs, J COMB OPTI, 4(2), 2000, pp. 151-169
Authors:
Ishii, T
Nagamochi, H
Ibaraki, T
Citation: T. Ishii et al., Optimal augmentation of a 2-vertex-connected multigraph to an l-edge-connected and 3-vertex-connected multigraph, J COMB OPTI, 4(1), 2000, pp. 35-77
Authors:
Boros, E
Hammer, PL
Ibaraki, T
Kogan, A
Mayoraz, E
Muchnik, I
Citation: E. Boros et al., An implementation of logical analysis of data, IEEE KNOWL, 12(2), 2000, pp. 292-306
Authors:
Kogan, K
Ibaraki, T
Citation: K. Kogan et T. Ibaraki, Optimal scheduling in parallel and serial manufacturing systems via the maximum principle, J GLOB OPT, 16(3), 2000, pp. 271-294
Authors:
Ibaraki, T
Yamashita, M
Citation: T. Ibaraki et M. Yamashita, Special issue on algorithm engineering: Surveys - Foreword, IEICE T INF, E83D(3), 2000, pp. 319-321
Authors:
Nagamochi, H
Seki, K
Ibaraki, T
Citation: H. Nagamochi et al., A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem, IEICE T FUN, E83A(4), 2000, pp. 687-691
Authors:
Nagamochi, H
Nakao, Y
Ibaraki, T
Citation: H. Nagamochi et al., A fast algorithm for cactus representations of minimum cuts, JPN J I A M, 17(2), 2000, pp. 245-264
Authors:
Boros, E
Crama, Y
Ekin, O
Hammer, PL
Ibaraki, T
Kogan, A
Citation: E. Boros et al., Boolean normal forms, shellability, and reliability computations, SIAM J DISC, 13(2), 2000, pp. 212-226
Authors:
Santibanez-Gonzalez, E
Burkard, RE
Ibaraki, T
Pulleyblank, WR
Citation: E. Santibanez-gonzalez et al., Mathematics of Industrial Systems IV - Preface, ANN OPER R, 96, 2000, pp. NIL_15-NIL_15
Authors:
Nagamochi, H
Nakamura, S
Ibaraki, T
Citation: H. Nagamochi et al., A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirectedgraphs, ALGORITHMIC, 26(1), 2000, pp. 50-67
Authors:
Nagamochi, H
Ibaraki, T
Citation: H. Nagamochi et T. Ibaraki, A fast algorithm for computing minimum 3-way and 4-way cuts, MATH PROGR, 88(3), 2000, pp. 507-520
Authors:
Deng, XT
Ibaraki, T
Nagamochi, H
Zang, WN
Citation: Xt. Deng et al., Totally balanced combinatorial optimization games, MATH PROGR, 87(3), 2000, pp. 441-452
Authors:
Eiter, T
Ibaraki, T
Makino, K
Citation: T. Eiter et al., On the difference of Horn theories, J COMPUT SY, 61(3), 2000, pp. 478-507
Authors:
Eiter, T
Ibaraki, T
Makino, K
Citation: T. Eiter et al., Bidual Horn functions and extensions, DISCR APP M, 97, 1999, pp. 55-88