Toshihide Ibaraki

Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki: Recent progress of local search in handling the time window constraints of the vehicle routing problem. Annals OR 204(1): 171-187 (2013)

Eishi Chiba, Hiroshi Fujiwara, Yoshiyuki Sekiguchi, Toshihide Ibaraki: Collision Probability in an In-Line Equipment Model under Erlang Distribution. IEICE Transactions 96-D(3): 400-407 (2013)

Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino: Logical analysis of data: classification with justification. Annals OR 188(1): 33-61 (2011)

Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura: Efficient branch-and-bound algorithms for weighted MAX-2-SAT. Math. Program. 127(2): 297-343 (2011)

Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki: Recent progress of local search in handling the time window constraints of the vehicle routing problem. 4OR 8(3): 221-238 (2010)

Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki: Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options. APJOR 27(2): 211-225 (2010)

Kazuki Matsumoto, Hiroyoshi Miwa, Toshihide Ibaraki: Scheduling of corrugated paper production. European Journal of Operational Research 192(3): 782-792 (2009)

Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura: An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Applied Mathematics 156(11): 2050-2069 (2008)

Hideki Hashimoto, Mutsunori Yagiura, Toshihide Ibaraki: An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optimization 5(2): 434-456 (2008)

Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki: A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns. IEICE Transactions 91-D(3): 781-788 (2008)

Toshihide Ibaraki, Toshihide Nomura, Masahiro Sasaki: Integer Programming Approaches to the Problem of Network Upgrading. SAINT 2008: 229-232

Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura: Hybrid Metaheuristics for Packing Problems. Hybrid Metaheuristics 2008: 185-219

Susumu Suzuki, Toshihide Ibaraki: The complexity of assigning genotypes to people in a pedigree consistently. Discrete Mathematics 307(16): 2122-2131 (2007)

Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki: Duality in option pricing based on prices of other derivatives. Oper. Res. Lett. 35(2): 165-171 (2007)

Eishi Chiba, Hiroshi Fujiwara, Yoshiyuki Sekiguchi, Toshihide Ibaraki: Collision Probability in an Automated Production Line under Erlang Distribution. RIVF 2007: 42-49

Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover: A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. SLS 2007: 121-135

Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe, Toshihide Ibaraki, Arne Løkketangen: A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route. SLS 2007: 192-196

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. Algorithmica 44(3): 257-280 (2006)

Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura: The vehicle routing problem with flexible time windows and traveling times. Discrete Applied Mathematics 154(16): 2271-2290 (2006)

Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki: Minimum edge ranking spanning trees of split graphs. Discrete Applied Mathematics 154(16): 2373-2386 (2006)

Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover: A path relinking approach with ejection chains for the generalized assignment problem. European Journal of Operational Research 169(2): 548-569 (2006)

Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki: A 3-flip neighborhood local search for the set covering problem. European Journal of Operational Research 172(2): 472-499 (2006)

Kazuya Haraguchi, Toshihide Ibaraki: Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge. IEICE Transactions 89-A(5): 1284-1291 (2006)

Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki: One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming. J. Math. Model. Algorithms 5(1): 43-64 (2006)

Toshihide Ibaraki, Kouji Nakamura: Packing Problems with Soft Rectangles. Hybrid Metaheuristics 2006: 13-27

Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki: Improved local search algorithms for the rectangle packing problem with general spatial costs. European Journal of Operational Research 167(1): 48-67 (2005)

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: Greedy splitting algorithms for approximating multiway partition problems. Math. Program. 102(1): 167-183 (2005)

Toshihide Ibaraki, Yann Vaxès, Xiao-guang Yang: Lowering eccentricity of a tree by node upgrading. Networks 45(4): 232-239 (2005)

Toshihide Ibaraki, Shinji Imahori, Mikio Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura: Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. Transportation Science 39(2): 206-232 (2005)

Takashi Horiyama, Toshihide Ibaraki: Reasoning with ordered binary decision diagrams. Discrete Applied Mathematics 142(1-3): 151-163 (2004)

Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki: A decomposability index in logical analysis of data. Discrete Applied Mathematics 142(1-3): 165-180 (2004)

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: On generalized greedy splitting algorithms for multiway partition problems. Discrete Applied Mathematics 143(1-3): 130-143 (2004)

Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred Glover: A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discrete Optimization 1(1): 87-98 (2004)

Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover: An Ejection Chain Approach for the Generalized Assignment Problem. INFORMS Journal on Computing 16(2): 133-151 (2004)

Susumu Suzuki, Toshihide Ibaraki: An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions. CCCG 2004: 196-199

Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki: One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming. Hybrid Metaheuristics 2004: 101-114

Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino: Inferring Minimal Functional Dependencies in Horn and q-Horn Theories. Ann. Math. Artif. Intell. 38(4): 233-255 (2003)

Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura: Finding Essential Attributes from Binary Data. Ann. Math. Artif. Intell. 39(3): 223-257 (2003)

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. Discrete Applied Mathematics 126(2-3): 275-289 (2003)

Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki: Interior and exterior functions of positive Boolean functions. Discrete Applied Mathematics 130(3): 417-436 (2003)

Susumu Suzuki, Toshihide Ibaraki: Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. Discrete Mathematics 273(1-3): 211-220 (2003)

Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki: One-dimensional cutting stock problem to minimize the number of different patterns. European Journal of Operational Research 146(2): 388-402 (2003)

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Variations on extending partially defined Boolean functions with missing bits. Inf. Comput. 180(1): 53-70 (2003)

Takashi Horiyama, Toshihide Ibaraki: Translation among CNFs, characteristic models and ordered binary decision diagrams. Inf. Process. Lett. 85(4): 191-198 (2003)

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. Inf. Process. Lett. 86(2): 63-70 (2003)

Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki: Local search algorithms for the rectangle packing problem with general spatial costs. Math. Program. 97(3): 543-569 (2003)

Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono (Eds.): Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings. Lecture Notes in Computer Science 2906, Springer 2003, isbn 3-540-20695-7

Takashi Horiyama, Toshihide Ibaraki: Ordered binary decision diagrams as knowledge-bases. Artif. Intell. 136(2): 189-213 (2002)

Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki: Convex Embeddings and Bisections of 3-Connected Graphs 1. Combinatorica 22(4): 537-554 (2002)

Hiroshi Nagamochi, Toshihide Ibaraki: Graph connectivity and its augmentation: applications of MA orderings. Discrete Applied Mathematics 123(1-3): 447-472 (2002)

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: Recognition and dualization of disguised bidual Horn functions. Inf. Process. Lett. 82(6): 283-291 (2002)

Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti: Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. J. Algorithms 43(1): 138-152 (2002)

Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Networks 39(4): 203-209 (2002)

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: Decision lists and related Boolean functions. Theor. Comput. Sci. 270(1-2): 493-524 (2002)

Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki: Logical analysis of data with decomposable structures. Theor. Comput. Sci. 289(2): 977-995 (2002)

Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki: Minimum Edge Ranking Spanning Trees of Threshold Graphs. ISAAC 2002: 428-440

Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino: On functional dependencies in q-Horn theories. Artif. Intell. 131(1-2): 171-187 (2001)

Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven Noble, William R. Pulleyblank: Preface. Annals OR 107(1-4): 13 (2001)

Susumu Suzuki, Toshihide Ibaraki: Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products. Electronic Notes in Discrete Mathematics 10: 272-276 (2001)

Mutsunori Yagiura, Toshihide Ibaraki: Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. J. Heuristics 7(5): 423-442 (2001)

Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki: On Minimum Edge Ranking Spanning Trees. J. Algorithms 38(2): 411-437 (2001)

Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki: Augmenting a Submodular and Posi-modular Set Function by a Multigraph. J. Comb. Optim. 5(2): 175-212 (2001)

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. J. Comb. Optim. 5(4): 397-410 (2001)

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Networks 37(3): 144-155 (2001)

Mutsunori Yagiura, Toshihide Ibaraki: On metaheuristic algorithms for combinatorial optimization problems. Systems and Computers in Japan 32(3): 33-55 (2001)

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: Disjunctions of Horn Theories and Their Cores. SIAM J. Comput. 31(1): 269-288 (2001)

Takashi Horiyama, Toshihide Ibaraki: Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. ISAAC 2001: 231-243

Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki: An Index for the Data Size to Extract Decomposable Structures in LAD. ISAAC 2001: 279-290

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: A Unified Framework for Approximating Multiway Partition Problems. ISAAC 2001: 682-694

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. STACS 2001: 478-489

Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki: A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs. Algorithmica 26(1): 50-67 (2000)

Hiroshi Nagamochi, Toshihide Ibaraki: Polyhedral structure of submodular and posi-modular systems. Discrete Applied Mathematics 107(1-3): 165-189 (2000)

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. J. Comb. Optim. 4(1): 35-77 (2000)

Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki: A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. J. Comb. Optim. 4(2): 151-169 (2000)

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: On the Difference of Horn Theories. J. Comput. Syst. Sci. 61(3): 478-507 (2000)

Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan: Boolean Normal Forms, Shellability, and Reliability Computations. SIAM J. Discrete Math. 13(2): 212-226 (2000)

Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya B. Muchnik: An Implementation of Logical Analysis of Data. IEEE Trans. Knowl. Data Eng. 12(2): 292-306 (2000)

Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki: Logical Analysis of Data with Decomposable Structures. COCOON 2000: 396-406

Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti: Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. ESA 2000: 211-219

Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura: Finding Essential Attributes in Binary Data. IDEAL 2000: 133-138

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. IFIP TCS 2000: 257-272

Takashi Horiyama, Toshihide Ibaraki: Reasoning with Ordered Binary Decision Diagrams. ISAAC 2000: 120-131

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Logical Analysis of Binary Data with Missing Bits. Artif. Intell. 107(2): 219-263 (1999)

Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino: Functional Dependencies in Horn Theories. Artif. Intell. 108(1-2): 1-30 (1999)

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: Computing Intersections of Horn Theories for Reasoning with Models. Artif. Intell. 110(1): 57-101 (1999)

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: Bidual Horn Functions and Extensions. Discrete Applied Mathematics 96-97: 55-88 (1999)

Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino: Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. Discrete Applied Mathematics 96-97: 307-326 (1999)

Kazuhisa Makino, Toshihide Ibaraki: Inner-core and Outer-core Functions of Partially Defined Boolean Functions. Discrete Applied Mathematics 96-97: 443-460 (1999)

Hiroshi Nagamochi, Toshihide Ibaraki: Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. J. Algorithms 30(2): 253-301 (1999)

Mutsunori Yagiura, Toshihide Ibaraki: Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. J. Comb. Optim. 3(1): 95-114 (1999)

Kazuhisa Makino, Ken'ichi Hatanaka, Toshihide Ibaraki: Horn Extensions of a Partially Defined Boolean Function. SIAM J. Comput. 28(6): 2168-2186 (1999)

Hiroshi Nagamochi, Toshihide Ibaraki: An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. COCOON 1999: 31-40

Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki: A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. COCOON 1999: 164-173

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. ESA 1999: 414-425

Hiroshi Nagamochi, Toshihide Ibaraki: A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. IPCO 1999: 377-390

Takashi Horiyama, Toshihide Ibaraki: Ordered Binary Decision Diagrams as Knowledge-Bases. ISAAC 1999: 83-92

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki: Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. ISAAC 1999: 373-382

Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki: Bisecting Two Subsets in 3-Connected Graphs. ISAAC 1999: 425-434

Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki: On Minimum Edge Ranking Spanning Trees. MFCS 1999: 398-409

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: On the Difference of Horn Theories. STACS 1999: 467-477

Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi: A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations. Combinatorica 18(1): 61-83 (1998)

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. Inf. Comput. 140(2): 254-283 (1998)

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: Double Horn Functions. Inf. Comput. 144(2): 155-190 (1998)

Hiroshi Nagamochi, Toshihide Ibaraki: A Note on Minimizing Submodular Functions. Inf. Process. Lett. 67(5): 239-244 (1998)

Kazuhisa Makino, Toshihide Ibaraki: A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. J. Algorithms 26(2): 291-305 (1998)

András Frank, Toshihide Ibaraki, Hiroshi Nagamochi: Two Arc-Disjoint Paths in Eulerian Digraphs. SIAM J. Discrete Math. 11(4): 557-589 (1998)

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: Computing Intersections of Horn Theories for Reasoning with Models. AAAI/IAAI 1998: 292-297

Mutsunori Yagiura, Toshihide Ibaraki: Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. COCOON 1998: 105-116

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: Disjunctions of Horn Theories and Their Cores. ISAAC 1998: 49-58

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. ISAAC 1998: 159-168

Hiroshi Nagamochi, Toshihide Ibaraki: Polyhedral Structure of Submodular and Posi-modular Systems. ISAAC 1998: 169-178

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. SODA 1998: 280-289

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: On Disguised Double Horn Functions and Extensions. STACS 1998: 50-60

Kazuhisa Makino, Kojin Yano, Toshihide Ibaraki: Positive and Horn Decomposability of Partially Defined Boolean Functions. Discrete Applied Mathematics 74(3): 251-274 (1997)

Hiroshi Nagamochi, Toshihide Ibaraki: Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. J. Comb. Optim. 1(1): 5-46 (1997)

Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan: Logical analysis of numerical data. Math. Program. 79: 163-190 (1997)

Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami: Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle. SIAM J. Comput. 26(1): 93-109 (1997)

Kazuhisa Makino, Toshihide Ibaraki: The Maximum Latency and Identification of Positive Boolean Functions. SIAM J. Comput. 26(5): 1363-1383 (1997)

Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki: Computing All Small Cuts in an Undirected Network. SIAM J. Discrete Math. 10(3): 469-481 (1997)

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Monotone Extensions of Boolean Data Sets. ALT 1997: 161-175

Toshihide Ibaraki, Tiko Kameda: Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited. ICCCN 1997: 4-10

Toshihide Ibaraki: Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract). ISAAC 1997: 1

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki: Augmenting Edge and Vertex Connectivities Simultaneously. ISAAC 1997: 102-111

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: Two-Face Horn Extensions. ISAAC 1997: 112-121

Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki: Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. SODA 1997: 649-658

Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi: Combinatorial Optimization Games. SODA 1997: 720-729

Kazuhisa Makino, Toshihide Ibaraki: Interior and Exterior Functions of Boolean Functions. Discrete Applied Mathematics 69(3): 209-231 (1996)

Kazuhisa Makino, Takashi Suda, Kojin Yano, Toshihide Ibaraki: Data Analysis by Positive Decision Trees. CODAS 1996: 257-264

Mutsunori Yagiura, Toshihide Ibaraki: Metaheuristics as Robust and Simple Optimization Tools. International Conference on Evolutionary Computation 1996: 541-546

Hiroshi Nagamochi, Toshihide Ibaraki: Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. STOC 1996: 64-73

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Boolean Analysis of Incomplete Examples. SWAT 1996: 440-451

Komei Fukuda, Toshihide Ibaraki: Preface. Discrete Applied Mathematics 56(2-3): 99-100 (1995)

Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan: Decomposability of Partially Defined Boolean Functions. Discrete Applied Mathematics 62(1-3): 51-75 (1995)

Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda: Optimal Coteries for Rings and Related Networks. Distributed Computing 8(4): 191-201 (1995)

Jan C. Bioch, Toshihide Ibaraki: Decompositions of positive self-dual boolean functions. Discrete Mathematics 140(1-3): 23-46 (1995)

Jan C. Bioch, Toshihide Ibaraki: Complexity of Identification and Dualization of Positive Boolean Functions. Inf. Comput. 123(1): 50-63 (1995)

Jan C. Bioch, Toshihide Ibaraki: Generating and Approximating Nondominated Coteries. IEEE Trans. Parallel Distrib. Syst. 6(9): 905-914 (1995)

Hiroshi Nagamochi, Toshihide Ibaraki: A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. IPCO 1995: 403-413

András Frank, Toshihide Ibaraki, Hiroshi Nagamochi: Two Arc Disjoint Paths in Eulerian Diagraphs. ISAAC 1995: 92-101

Kazuhisa Makino, Toshihide Ibaraki: A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. ISAAC 1995: 291-300

Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki: Implementing an efficient minimum capacity cut algorithm. Math. Program. 67: 325-341 (1994)

Terunao Soneoka, Toshihide Ibaraki: Logically Instantaneous Message Passing in Asynchronous Distributed Systems. IEEE Trans. Computers 43(5): 513-527 (1994)

Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki: Computing All Small Cuts in Undirected Networks. ISAAC 1994: 190-198

Kazuhisa Makino, Toshihide Ibaraki: The Maximum Latency and Identification of Positive Boolean Functions. ISAAC 1994: 324-332

András Frank, Toshihide Ibaraki, Hiroshi Nagamochi: On sparse subgraphs preserving connectivity properties. Journal of Graph Theory 17(3): 275-281 (1993)

Kouichi Taji, Masao Fukushima, Toshihide Ibaraki: A globally convergent Newton method for solving strongly monotone variational inequalities. Math. Program. 58: 369-383 (1993)

Toshihide Ibaraki, Tiko Kameda: A Theory of Coteries: Mutual Exclusion in Distributed Systems. IEEE Trans. Parallel Distrib. Syst. 4(7): 779-794 (1993)

Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki: Vehicle Scheduling on a Tree with Release and Handling Times. ISAAC 1993: 486-495

Hiroshi Nagamochi, Toshihide Ibaraki: A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. Algorithmica 7(5&6): 583-596 (1992)

Naoki Katoh, Junji Koyanagi, Masamitsu Ohnishi, Toshihide Ibaraki: Optimal strategies for some team games. Discrete Applied Mathematics 35(3): 275-291 (1992)

Naoki Katoh, Toshihide Ibaraki, Tiko Kameda: A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. Discrete Applied Mathematics 40(4): 379-395 (1992)

Koichi Nakade, Masamitsu Ohnishi, Toshihide Ibaraki, Katsuhisa Ohno: On the average optimality of circular assignment policy. Queueing Syst. 11(3): 241-254 (1992)

Hiroshi Nagamochi, Toshihide Ibaraki: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. SIAM J. Discrete Math. 5(1): 54-66 (1992)

Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda: Optimal Coteries for Rings and Related Networks. ICDCS 1992: 650-656

Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita (Eds.): Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings. Lecture Notes in Computer Science 650, Springer 1992, isbn 3-540-56279-6

Shigeru Masuyama, Toshihide Ibaraki: Chain Packing in Graphs. Algorithmica 6(6): 826-839 (1991)

Hiroshi Nagamochi, Toshihide Ibaraki: Maximum flows in probabilistic networks. Networks 21(6): 645-666 (1991)

Toshihide Ibaraki, Svatopluk Poljak: Weak Three-Linking in Eulerian Digraphs. SIAM J. Discrete Math. 4(1): 84-98 (1991)

Susumu Suzuki, Toshihide Ibaraki, Masahichi Kishi: Using Relaxation Techniques to Evaluate Queries in Deductive Databases. DEXA 1991: 67-72

Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami: Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. ISA 1991: 104-115

Toshihide Ibaraki, Tiko Kameda: Boolean theory of coteries. SPDP 1991: 150-157

Toshihide Ibaraki, Naoki Katoh: Searching Minimax Game Trees under Memory Space Constraint. Ann. Math. Artif. Intell. 1: 141-153 (1990)

Hiroshi Nagamochi, Toshihide Ibaraki: Multicommodity flows in certain planar directed networks. Discrete Applied Mathematics 27(1-2): 125-145 (1990)

Toshihide Ibaraki: Preface. Discrete Applied Mathematics 28(1): 1 (1990)

Hiroshi Nagamochi, Masao Fukushima, Toshihide Ibaraki: Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities. Networks 20(4): 409-426 (1990)

Toshihide Ibaraki, Tiko Kameda, Naoki Katoh: Multiversion Cautious Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 16(3): 302-315 (1990)

Hiroshi Nagamochi, Toshihide Ibaraki: Computing Edge-Connectivity in Multiple and Capacitated Graphs. SIGAL International Symposium on Algorithms 1990: 12-20

Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki (Eds.): Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings. Lecture Notes in Computer Science 450, Springer 1990, isbn 3-540-52921-7

Hiroshi Nagamochi, Toshihide Ibaraki: On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. Inf. Process. Lett. 31(6): 279-285 (1989)

Shojiro Nishio, Shinichi Taniguchi, Toshihide Ibaraki: On the Efficiency of Cautious Schedulers for Database Concurrency Control - Why Insist on Two-Phase Locking? Real-Time Systems 1(2): 177-195 (1989)

Toshihide Ibaraki, Naoki Katoh: Resource allocation problems - algorithmic approaches. MIT Press series in the foundations of computing, MIT Press 1988, isbn 978-0-262-09027-8, pp. I-IX, 1-229

Toshihide Ibaraki, Tiko Kameda, Naoki Katoh: Cautious Transaction Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 14(7): 997-1009 (1988)

Naoki Katoh, Tiko Kameda, Toshihide Ibaraki: A Cautious Scheduler for Multistep Transactions. Algorithmica 2: 1-26 (1987)

Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura: Serializability with Constraints. ACM Trans. Database Syst. 12(3): 429-452 (1987)

Shigeru Masuyama, Toshihide Ibaraki, Shojiro Nishio, Toshiharu Hasegawa: Shortest Semijoin Schedule for a Local Area Distributed Database System. IEEE Trans. Software Eng. 13(5): 602-606 (1987)

Toshihide Ibaraki: Generalization of Alpha-Beta and SSS Search Procedures. Artif. Intell. 29(1): 73-117 (1986)

Masafumi Yamashita, Toshihide Ibaraki: Distances defined by neighborhood sequences. Pattern Recognition 19(3): 237-246 (1986)

Hajime Miura, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki: Implementation of Parallel Prolog on Tree Machines. FJCC 1986: 287-296

Naoki Katoh, Toshihide Ibaraki, Tiko Kameda: Cautious Transaction Schedulers with Admission Control. ACM Trans. Database Syst. 10(2): 205-229 (1985)

Shojiro Muro, Toshihide Ibaraki, Hidehiro Miyajima, Toshiharu Hasegawa: Evaluation of the File Redundancy in Distributed Database Systems. IEEE Trans. Software Eng. 11(2): 199-205 (1985)

Toshihide Ibaraki, Tiko Kameda: On the Optimal Nesting Order for Computing N-Relational Joins. ACM Trans. Database Syst. 9(3): 482-502 (1984)

Toshihide Ibaraki, Naoki Katoh: On-Line Computation of Transitive Closures of Graphs. Inf. Process. Lett. 16(2): 95-97 (1983)

Toshihide Ibaraki, Hussein M. Abdel-Wahab, Tiko Kameda: Design of Minimum-Cost Deadlock-Free Systems. J. ACM 30(4): 736-751 (1983)

Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura: Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract). VLDB 1983: 89-91

Shojiro Muro, Toshihide Ibaraki, Hidehiro Miyajima, Toshiharu Hasegawa: File Redundancy Issues in Distributed Database Systems. VLDB 1983: 275-277

Naoki Katoh, Toshihide Ibaraki, H. Mine: An efficient algorithm for K shortest simple paths. Networks 12(4): 411-427 (1982)

Toshihide Ibaraki, Tsunehiko Kameda: Deadlock-Free Systems for a Bounded Number of Processes. IEEE Trans. Computers 31(3): 188-193 (1982)

Naoki Katoh, Toshihide Ibaraki, H. Mine: An Algorithm for the K Best Solutions of the Resource Allocation Problem. J. ACM 28(4): 752-764 (1981)

Naoki Katoh, Toshihide Ibaraki, H. Mine: An Algorithm for Finding K Minimum Spanning Trees. SIAM J. Comput. 10(2): 247-255 (1981)

Toshihide Ibaraki, Tsunehiko Kameda, Shunichi Toida: On Minimal Test Sets for Locating Single Link Failures in Networks. IEEE Trans. Computers 30(3): 182-190 (1981)

Toshihide Ibaraki: Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems. Information and Control 36(1): 1-27 (1978)

Toshihide Ibaraki: Finite Automata Having Cost Functions: Nondeterministic Models. Information and Control 37(1): 40-69 (1978)

Toshihide Ibaraki: Depth-m search in branch-and-bound algorithms. International Journal of Parallel Programming 7(4): 315-343 (1978)

Toshihide Ibaraki: The Power of Dominance Relations in Branch-and-Bound Algorithms. J. ACM 24(2): 264-279 (1977)

Toshihide Ibaraki: Finite Automata Having Cost Functions. Information and Control 31(2): 153-176 (1976)

Toshihide Ibaraki: Theoretical comparisons of search strategies in branch-and-bound algorithms. International Journal of Parallel Programming 5(4): 315-344 (1976)

Toshihide Ibaraki: Minimal Representations of Some Classes of Dynamic Programming. Information and Control 27(4): 289-328 (1975)

Toshihide Ibaraki: Classes of Discrete Optimization Problems and Their Decision Problems. J. Comput. Syst. Sci. 8(1): 84-116 (1974)

Tadao Takaoka, Toshihide Ibaraki: Fail-Safe Realization of Sequential Machines. Information and Control 22(1): 31-55 (1973)

Toshihide Ibaraki: Finite State Representations of Discrete Optimization Problems. SIAM J. Comput. 2(3): 193-210 (1973)

Toshihide Ibaraki: Representation Theorems for Equivalent Optimization Problems. Information and Control 21(5): 397-435 (1972)

Toshihide Ibaraki, T. K. Liu, C. R. Baugh, Saburo Muroga: An implicit enumeration program for zero-one integer programming. International Journal of Parallel Programming 1(1): 75-92 (1972)

Toshihide Ibaraki, Saburo Muroga: Adaptive Linear Classifier by Linear Programming. IEEE Trans. Systems Science and Cybernetics 6(1): 53-62 (1970)