| 2008 |
|---|
| 171 | EE | 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) |
| 2007 |
|---|
| 170 | EE | 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 |
| 169 | EE | 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 |
| 168 | EE | Susumu Suzuki,
Toshihide Ibaraki:
The complexity of assigning genotypes to people in a pedigree consistently.
Discrete Mathematics 307(16): 2122-2131 (2007) |
| 167 | EE | Michi Nishihara,
Mutsunori Yagiura,
Toshihide Ibaraki:
Duality in option pricing based on prices of other derivatives.
Oper. Res. Lett. 35(2): 165-171 (2007) |
| 2006 |
|---|
| 166 | EE | Toshihide Ibaraki,
Kouji Nakamura:
Packing Problems with Soft Rectangles.
Hybrid Metaheuristics 2006: 13-27 |
| 165 | EE | 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) |
| 164 | EE | 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) |
| 163 | EE | Kazuhisa Makino,
Yushi Uno,
Toshihide Ibaraki:
Minimum edge ranking spanning trees of split graphs.
Discrete Applied Mathematics 154(16): 2373-2386 (2006) |
| 162 | EE | 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) |
| 161 | EE | 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) |
| 160 | EE | Kazuya Haraguchi,
Toshihide Ibaraki:
Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge.
IEICE Transactions 89-A(5): 1284-1291 (2006) |
| 2005 |
|---|
| 159 | EE | 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) |
| 158 | EE | Liang Zhao,
Hiroshi Nagamochi,
Toshihide Ibaraki:
Greedy splitting algorithms for approximating multiway partition problems.
Math. Program. 102(1): 167-183 (2005) |
| 157 | EE | Toshihide Ibaraki,
Yann Vaxès,
Xiao-guang Yang:
Lowering eccentricity of a tree by node upgrading.
Networks 45(4): 232-239 (2005) |
| 2004 |
|---|
| 156 | EE | 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 |
| 155 | EE | 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 |
| 154 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Reasoning with ordered binary decision diagrams.
Discrete Applied Mathematics 142(1-3): 151-163 (2004) |
| 153 | EE | Hirotaka Ono,
Mutsunori Yagiura,
Toshihide Ibaraki:
A decomposability index in logical analysis of data.
Discrete Applied Mathematics 142(1-3): 165-180 (2004) |
| 152 | EE | Liang Zhao,
Hiroshi Nagamochi,
Toshihide Ibaraki:
On generalized greedy splitting algorithms for multiway partition problems.
Discrete Applied Mathematics 143(1-3): 130-143 (2004) |
| 151 | EE | Mutsunori Yagiura,
Toshihide Ibaraki,
Fred Glover:
An Ejection Chain Approach for the Generalized Assignment Problem.
INFORMS Journal on Computing 16(2): 133-151 (2004) |
| 2003 |
|---|
| 150 | | Toshihide Ibaraki,
Naoki Katoh,
Hirotaka Ono:
Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings
Springer 2003 |
| 149 | | 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) |
| 148 | | 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) |
| 147 | | 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) |
| 146 | EE | Kazuhisa Makino,
Hirotaka Ono,
Toshihide Ibaraki:
Interior and exterior functions of positive Boolean functions.
Discrete Applied Mathematics 130(3): 417-436 (2003) |
| 145 | EE | 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) |
| 144 | EE | 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) |
| 143 | EE | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Variations on extending partially defined Boolean functions with missing bits.
Inf. Comput. 180(1): 53-70 (2003) |
| 142 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Translation among CNFs, characteristic models and ordered binary decision diagrams.
Inf. Process. Lett. 85(4): 191-198 (2003) |
| 141 | EE | 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) |
| 2002 |
|---|
| 140 | EE | Kazuhisa Makino,
Yushi Uno,
Toshihide Ibaraki:
Minimum Edge Ranking Spanning Trees of Threshold Graphs.
ISAAC 2002: 428-440 |
| 139 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Ordered binary decision diagrams as knowledge-bases.
Artif. Intell. 136(2): 189-213 (2002) |
| 138 | EE | Hiroshi Nagamochi,
Tibor Jordán,
Yoshitaka Nakao,
Toshihide Ibaraki:
Convex Embeddings and Bisections of 3-Connected Graphs 1.
Combinatorica 22(4): 537-554 (2002) |
| 137 | | Hiroshi Nagamochi,
Toshihide Ibaraki:
Graph connectivity and its augmentation: applications of MA orderings.
Discrete Applied Mathematics 123(1-3): 447-472 (2002) |
| 136 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Recognition and dualization of disguised bidual Horn functions.
Inf. Process. Lett. 82(6): 283-291 (2002) |
| 135 | EE | 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) |
| 134 | EE | 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) |
| 133 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Decision lists and related Boolean functions.
Theor. Comput. Sci. 270(1-2): 493-524 (2002) |
| 132 | | Hirotaka Ono,
Kazuhisa Makino,
Toshihide Ibaraki:
Logical analysis of data with decomposable structures.
Theor. Comput. Sci. 289(2): 977-995 (2002) |
| 2001 |
|---|
| 131 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams.
ISAAC 2001: 231-243 |
| 130 | EE | Hirotaka Ono,
Mutsunori Yagiura,
Toshihide Ibaraki:
An Index for the Data Size to Extract Decomposable Structures in LAD.
ISAAC 2001: 279-290 |
| 129 | EE | Liang Zhao,
Hiroshi Nagamochi,
Toshihide Ibaraki:
A Unified Framework for Approximating Multiway Partition Problems.
ISAAC 2001: 682-694 |
| 128 | EE | Liang Zhao,
Hiroshi Nagamochi,
Toshihide Ibaraki:
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.
STACS 2001: 478-489 |
| 127 | EE | Toshihide Ibaraki,
Alexander Kogan,
Kazuhisa Makino:
On functional dependencies in q-Horn theories.
Artif. Intell. 131(1-2): 171-187 (2001) |
| 126 | | Kazuhisa Makino,
Yushi Uno,
Toshihide Ibaraki:
On Minimum Edge Ranking Spanning Trees.
J. Algorithms 38(2): 411-437 (2001) |
| 125 | | 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) |
| 124 | | 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) |
| 123 | | 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) |
| 122 | EE | Toshimasa Ishii,
Hiroshi Nagamochi,
Toshihide Ibaraki:
Multigraph augmentation under biconnectivity and general edge-connectivity requirements.
Networks 37(3): 144-155 (2001) |
| 121 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Disjunctions of Horn Theories and Their Cores.
SIAM J. Comput. 31(1): 269-288 (2001) |
| 120 | EE | Mutsunori Yagiura,
Toshihide Ibaraki:
On metaheuristic algorithms for combinatorial optimization problems.
Systems and Computers in Japan 32(3): 33-55 (2001) |
| 2000 |
|---|
| 119 | EE | Hirotaka Ono,
Kazuhisa Makino,
Toshihide Ibaraki:
Logical Analysis of Data with Decomposable Structures.
COCOON 2000: 396-406 |
| 118 | | 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 |
| 117 | EE | Endre Boros,
Takashi Horiyama,
Toshihide Ibaraki,
Kazuhisa Makino,
Mutsunori Yagiura:
Finding Essential Attributes in Binary Data.
IDEAL 2000: 133-138 |
| 116 | EE | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits.
IFIP TCS 2000: 257-272 |
| 115 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Reasoning with Ordered Binary Decision Diagrams.
ISAAC 2000: 120-131 |
| 114 | EE | Hiroshi Nagamochi,
S. Nakamura,
Toshihide Ibaraki:
A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs.
Algorithmica 26(1): 50-67 (2000) |
| 113 | | Hiroshi Nagamochi,
Toshihide Ibaraki:
Polyhedral structure of submodular and posi-modular systems.
Discrete Applied Mathematics 107(1-3): 165-189 (2000) |
| 112 | EE | 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) |
| 111 | | 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) |
| 110 | | 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) |
| 109 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
On the Difference of Horn Theories.
J. Comput. Syst. Sci. 61(3): 478-507 (2000) |
| 108 | EE | 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) |
| 1999 |
|---|
| 107 | EE | Hiroshi Nagamochi,
Shigeki Katayama,
Toshihide Ibaraki:
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.
COCOON 1999: 164-173 |
| 106 | EE | Hiroshi Nagamochi,
Toshihide Ibaraki:
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree.
COCOON 1999: 31-40 |
| 105 | EE | 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 |
| 104 | EE | Hiroshi Nagamochi,
Toshihide Ibaraki:
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts.
IPCO 1999: 377-390 |
| 103 | EE | Liang Zhao,
Hiroshi Nagamochi,
Toshihide Ibaraki:
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.
ISAAC 1999: 373-382 |
| 102 | EE | Hiroshi Nagamochi,
Tibor Jordán,
Yoshitaka Nakao,
Toshihide Ibaraki:
Bisecting Two Subsets in 3-Connected Graphs.
ISAAC 1999: 425-434 |
| 101 | EE | Takashi Horiyama,
Toshihide Ibaraki:
Ordered Binary Decision Diagrams as Knowledge-Bases.
ISAAC 1999: 83-92 |
| 100 | | Kazuhisa Makino,
Yushi Uno,
Toshihide Ibaraki:
On Minimum Edge Ranking Spanning Trees.
MFCS 1999: 398-409 |
| 99 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
On the Difference of Horn Theories.
STACS 1999: 467-477 |
| 98 | EE | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Logical Analysis of Binary Data with Missing Bits.
Artif. Intell. 107(2): 219-263 (1999) |
| 97 | EE | Toshihide Ibaraki,
Alexander Kogan,
Kazuhisa Makino:
Functional Dependencies in Horn Theories.
Artif. Intell. 108(1-2): 1-30 (1999) |
| 96 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Computing Intersections of Horn Theories for Reasoning with Models.
Artif. Intell. 110(1): 57-101 (1999) |
| 95 | EE | 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) |
| 94 | EE | Kazuhisa Makino,
Toshihide Ibaraki:
Inner-core and Outer-core Functions of Partially Defined Boolean Functions.
Discrete Applied Mathematics 96-97: 443-460 (1999) |
| 93 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Bidual Horn Functions and Extensions.
Discrete Applied Mathematics 96-97: 55-88 (1999) |
| 92 | | Hiroshi Nagamochi,
Toshihide Ibaraki:
Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time.
J. Algorithms 30(2): 253-301 (1999) |
| 91 | | Mutsunori Yagiura,
Toshihide Ibaraki:
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT.
J. Comb. Optim. 3(1): 95-114 (1999) |
| 90 | | Kazuhisa Makino,
Ken-ichi Hatanaka,
Toshihide Ibaraki:
Horn Extensions of a Partially Defined Boolean Function.
SIAM J. Comput. 28(6): 2168-2186 (1999) |
| 1998 |
|---|
| 89 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Computing Intersections of Horn Theories for Reasoning with Models.
AAAI/IAAI 1998: 292-297 |
| 88 | EE | Mutsunori Yagiura,
Toshihide Ibaraki:
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT.
COCOON 1998: 105-116 |
| 87 | EE | Toshimasa Ishii,
Hiroshi Nagamochi,
Toshihide Ibaraki:
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph.
ISAAC 1998: 159-168 |
| 86 | EE | Hiroshi Nagamochi,
Toshihide Ibaraki:
Polyhedral Structure of Submodular and Posi-modular Systems.
ISAAC 1998: 169-178 |
| 85 | EE | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Disjunctions of Horn Theories and Their Cores.
ISAAC 1998: 49-58 |
| 84 | | Toshimasa Ishii,
Hiroshi Nagamochi,
Toshihide Ibaraki:
Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.
SODA 1998: 280-289 |
| 83 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
On Disguised Double Horn Functions and Extensions.
STACS 1998: 50-60 |
| 82 | EE | 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) |
| 81 | | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions.
Inf. Comput. 140(2): 254-283 (1998) |
| 80 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Double Horn Functions.
Inf. Comput. 144(2): 155-190 (1998) |
| 79 | EE | Hiroshi Nagamochi,
Toshihide Ibaraki:
A Note on Minimizing Submodular Functions.
Inf. Process. Lett. 67(5): 239-244 (1998) |
| 78 | | Kazuhisa Makino,
Toshihide Ibaraki:
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions.
J. Algorithms 26(2): 291-305 (1998) |
| 77 | EE | András Frank,
Toshihide Ibaraki,
Hiroshi Nagamochi:
Two Arc-Disjoint Paths in Eulerian Digraphs.
SIAM J. Discrete Math. 11(4): 557-589 (1998) |
| 1997 |
|---|
| 76 | | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Monotone Extensions of Boolean Data Sets.
ALT 1997: 161-175 |
| 75 | EE | Toshihide Ibaraki,
Tiko Kameda:
Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited.
ICCCN 1997: 4-10 |
| 74 | | Toshihide Ibaraki:
Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract).
ISAAC 1997: 1 |
| 73 | | Toshimasa Ishii,
Hiroshi Nagamochi,
Toshihide Ibaraki:
Augmenting Edge and Vertex Connectivities Simultaneously.
ISAAC 1997: 102-111 |
| 72 | | Thomas Eiter,
Toshihide Ibaraki,
Kazuhisa Makino:
Two-Face Horn Extensions.
ISAAC 1997: 112-121 |
| 71 | | Hiroshi Nagamochi,
Takashi Shiraki,
Toshihide Ibaraki:
Computing Edge-Connectivity Augmentation Function in Õ(nm) Time.
SODA 1997: 649-658 |
| 70 | | Xiaotie Deng,
Toshihide Ibaraki,
Hiroshi Nagamochi:
Combinatorial Optimization Games.
SODA 1997: 720-729 |
| 69 | EE | Kazuhisa Makino,
Kojin Yano,
Toshihide Ibaraki:
Positive and Horn Decomposability of Partially Defined Boolean Functions.
Discrete Applied Mathematics 74(3): 251-274 (1997) |
| 68 | | Hiroshi Nagamochi,
Toshihide Ibaraki:
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs.
J. Comb. Optim. 1(1): 5-46 (1997) |
| 67 | | Endre Boros,
Peter L. Hammer,
Toshihide Ibaraki,
Alexander Kogan:
Logical analysis of numerical data.
Math. Program. 79: 163-190 (1997) |
| 66 | | 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) |
| 65 | | Kazuhisa Makino,
Toshihide Ibaraki:
The Maximum Latency and Identification of Positive Boolean Functions.
SIAM J. Comput. 26(5): 1363-1383 (1997) |
| 64 | EE | Hiroshi Nagamochi,
Kazuhiro Nishimura,
Toshihide Ibaraki:
Computing All Small Cuts in an Undirected Network.
SIAM J. Discrete Math. 10(3): 469-481 (1997) |
| 1996 |
|---|
| 63 | | Kazuhisa Makino,
Takashi Suda,
Kojin Yano,
Toshihide Ibaraki:
Data Analysis by Positive Decision Trees.
CODAS 1996: 257-264 |
| 62 | | Mutsunori Yagiura,
Toshihide Ibaraki:
Metaheuristics as Robust and Simple Optimization Tools.
International Conference on Evolutionary Computation 1996: 541-546 |
| 61 | EE | Hiroshi Nagamochi,
Toshihide Ibaraki:
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs.
STOC 1996: 64-73 |
| 60 | | Endre Boros,
Toshihide Ibaraki,
Kazuhisa Makino:
Boolean Analysis of Incomplete Examples.
SWAT 1996: 440-451 |
| 59 | EE | Kazuhisa Makino,
Toshihide Ibaraki:
Interior and Exterior Functions of Boolean Functions.
Discrete Applied Mathematics 69(3): 209-231 (1996) |
| 1995 |
|---|
| 58 | | Hiroshi Nagamochi,
Toshihide Ibaraki:
A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem.
IPCO 1995: 403-413 |
| 57 | | Kazuhisa Makino,
Toshihide Ibaraki:
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions.
ISAAC 1995: 291-300 |
| 56 | | András Frank,
Toshihide Ibaraki,
Hiroshi Nagamochi:
Two Arc Disjoint Paths in Eulerian Diagraphs.
ISAAC 1995: 92-101 |
| 55 | EE | Komei Fukuda,
Toshihide Ibaraki:
Preface.
Discrete Applied Mathematics 56(2-3): 99-100 (1995) |
| 54 | EE | 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) |
| 53 | EE | Jan C. Bioch,
Toshihide Ibaraki:
Decompositions of positive self-dual boolean functions.
Discrete Mathematics 140(1-3): 23-46 (1995) |
| 52 | | Toshihide Ibaraki,
Hiroshi Nagamochi,
Tsunehiko Kameda:
Optimal Coteries for Rings and Related Networks.
Distributed Computing 8(4): 191-201 (1995) |
| 51 | EE | Jan C. Bioch,
Toshihide Ibaraki:
Generating and Approximating Nondominated Coteries.
IEEE Trans. Parallel Distrib. Syst. 6(9): 905-914 (1995) |
| 50 | | Jan C. Bioch,
Toshihide Ibaraki:
Complexity of Identification and Dualization of Positive Boolean Functions.
Inf. Comput. 123(1): 50-63 (1995) |
| 1994 |
|---|
| 49 | | Hiroshi Nagamochi,
Kazuhiro Nishimura,
Toshihide Ibaraki:
Computing All Small Cuts in Undirected Networks.
ISAAC 1994: 190-198 |
| 48 | | Kazuhisa Makino,
Toshihide Ibaraki:
The Maximum Latency and Identification of Positive Boolean Functions.
ISAAC 1994: 324-332 |
| 47 | | Terunao Soneoka,
Toshihide Ibaraki:
Logically Instantaneous Message Passing in Asynchronous Distributed Systems.
IEEE Trans. Computers 43(5): 513-527 (1994) |
| 46 | | Hiroshi Nagamochi,
Tadashi Ono,
Toshihide Ibaraki:
Implementing an efficient minimum capacity cut algorithm.
Math. Program. 67: 325-341 (1994) |
| 1993 |
|---|
| 45 | | Yoshiyuki Karuno,
Hiroshi Nagamochi,
Toshihide Ibaraki:
Vehicle Scheduling on a Tree with Release and Handling Times.
ISAAC 1993: 486-495 |
| 44 | EE | Toshihide Ibaraki,
Tiko Kameda:
A Theory of Coteries: Mutual Exclusion in Distributed Systems.
IEEE Trans. Parallel Distrib. Syst. 4(7): 779-794 (1993) |
| 43 | | Kouichi Taji,
Masao Fukushima,
Toshihide Ibaraki:
A globally convergent Newton method for solving strongly monotone variational inequalities.
Math. Program. 58: 369-383 (1993) |
| 1992 |
|---|
| 42 | | Toshihide Ibaraki,
Yasuyoshi Inagaki,
Kazuo Iwama,
Takao Nishizeki,
Masafumi Yamashita:
Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings
Springer 1992 |
| 41 | | Toshihide Ibaraki,
Hiroshi Nagamochi,
Tiko Kameda:
Optimal Coteries for Rings and Related Networks.
ICDCS 1992: 650-656 |
| 40 | | 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) |
| 39 | | 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) |
| 38 | | Hiroshi Nagamochi,
Toshihide Ibaraki:
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs.
SIAM J. Discrete Math. 5(1): 54-66 (1992) |
| 1991 |
|---|
| 37 | | Susumu Suzuki,
Toshihide Ibaraki,
Masahichi Kishi:
Using Relaxation Techniques to Evaluate Queries in Deductive Databases.
DEXA 1991: 67-72 |
| 36 | | Endre Boros,
Peter L. Hammer,
Toshihide Ibaraki,
Kazuhiko Kawakami:
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time.
ISA 1991: 104-115 |
| 35 | | Shigeru Masuyama,
Toshihide Ibaraki:
Chain Packing in Graphs.
Algorithmica 6(6): 826-839 (1991) |
| 34 | | Toshihide Ibaraki,
Svatopluk Poljak:
Weak Three-Linking in Eulerian Digraphs.
SIAM J. Discrete Math. 4(1): 84-98 (1991) |
| 1990 |
|---|
| 33 | | Tetsuo Asano,
Toshihide Ibaraki,
Hiroshi Imai,
Takao Nishizeki:
Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings
Springer 1990 |
| 32 | | Hiroshi Nagamochi,
Toshihide Ibaraki:
Computing Edge-Connectivity in Multiple and Capacitated Graphs.
SIGAL International Symposium on Algorithms 1990: 12-20 |
| 31 | | Toshihide Ibaraki,
Naoki Katoh:
Searching Minimax Game Trees under Memory Space Constraint.
Ann. Math. Artif. Intell. 1: (1990) |
| 30 | EE | Toshihide Ibaraki,
Tiko Kameda,
Naoki Katoh:
Multiversion Cautious Schedulers for Database Concurrency Control.
IEEE Trans. Software Eng. 16(3): 302-315 (1990) |
| 1989 |
|---|
| 29 | | 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) |
| 28 | | 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) |
| 1988 |
|---|
| 27 | EE | Toshihide Ibaraki,
Tiko Kameda,
Naoki Katoh:
Cautious Transaction Schedulers for Database Concurrency Control.
IEEE Trans. Software Eng. 14(7): 997-1009 (1988) |
| 1987 |
|---|
| 26 | EE | Toshihide Ibaraki,
Tiko Kameda,
Toshimi Minoura:
Serializability with Constraints.
ACM Trans. Database Syst. 12(3): 429-452 (1987) |
| 25 | | Naoki Katoh,
Tiko Kameda,
Toshihide Ibaraki:
A Cautious Scheduler for Multistep Transactions.
Algorithmica 2: 1-26 (1987) |
| 24 | | 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) |
| 1986 |
|---|
| 23 | | Hajime Miura,
Masaharu Imai,
Masafumi Yamashita,
Toshihide Ibaraki:
Implementation of Parallel Prolog on Tree Machines.
FJCC 1986: 287-296 |
| 22 | | Toshihide Ibaraki:
Generalization of Alpha-Beta and SSS Search Procedures.
Artif. Intell. 29(1): 73-117 (1986) |
| 21 | EE | Masafumi Yamashita,
Toshihide Ibaraki:
Distances defined by neighborhood sequences.
Pattern Recognition 19(3): 237-246 (1986) |
| 1985 |
|---|
| 20 | EE | Naoki Katoh,
Toshihide Ibaraki,
Tiko Kameda:
Cautious Transaction Schedulers with Admission Control.
ACM Trans. Database Syst. 10(2): 205-229 (1985) |
| 19 | | 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) |
| 1984 |
|---|
| 18 | EE | Toshihide Ibaraki,
Tiko Kameda:
On the Optimal Nesting Order for Computing N-Relational Joins.
ACM Trans. Database Syst. 9(3): 482-502 (1984) |
| 1983 |
|---|
| 17 | EE | Shojiro Muro,
Toshihide Ibaraki,
Hidehiro Miyajima,
Toshiharu Hasegawa:
File Redundancy Issues in Distributed Database Systems.
VLDB 1983: 275-277 |
| 16 | EE | Toshihide Ibaraki,
Tiko Kameda,
Toshimi Minoura:
Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract).
VLDB 1983: 89-91 |
| 15 | | Toshihide Ibaraki,
Naoki Katoh:
On-Line Computation of Transitive Closures of Graphs.
Inf. Process. Lett. 16(2): 95-97 (1983) |
| 14 | EE | Toshihide Ibaraki,
Hussein M. Abdel-Wahab,
Tiko Kameda:
Design of Minimum-Cost Deadlock-Free Systems
J. ACM 30(4): 736-751 (1983) |
| 1982 |
|---|
| 13 | | Toshihide Ibaraki,
Tsunehiko Kameda:
Deadlock-Free Systems for a Bounded Number of Processes.
IEEE Trans. Computers 31(3): 188-193 (1982) |
| 1981 |
|---|
| 12 | | 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) |
| 11 | EE | 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) |
| 10 | | Naoki Katoh,
Toshihide Ibaraki,
H. Mine:
An Algorithm for Finding K Minimum Spanning Trees.
SIAM J. Comput. 10(2): 247-255 (1981) |
| 1978 |
|---|
| 9 | | Toshihide Ibaraki:
Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems
Information and Control 36(1): 1-27 (1978) |
| 8 | | Toshihide Ibaraki:
Finite Automata Having Cost Functions: Nondeterministic Models
Information and Control 37(1): 40-69 (1978) |
| 1977 |
|---|
| 7 | EE | Toshihide Ibaraki:
The Power of Dominance Relations in Branch-and-Bound Algorithms.
J. ACM 24(2): 264-279 (1977) |
| 1976 |
|---|
| 6 | | Toshihide Ibaraki:
Finite Automata Having Cost Functions
Information and Control 31(2): 153-176 (1976) |
| 1975 |
|---|
| 5 | | Toshihide Ibaraki:
Minimal Representations of Some Classes of Dynamic Programming
Information and Control 27(4): 289-328 (1975) |
| 1974 |
|---|
| 4 | | Toshihide Ibaraki:
Classes of Discrete Optimization Problems and Their Decision Problems.
J. Comput. Syst. Sci. 8(1): 84-116 (1974) |
| 1973 |
|---|
| 3 | | Tadao Takaoka,
Toshihide Ibaraki:
Fail-Safe Realization of Sequential Machines
Information and Control 22(1): 31-55 (1973) |
| 2 | | Toshihide Ibaraki:
Finite State Representations of Discrete Optimization Problems.
SIAM J. Comput. 2(3): 193-210 (1973) |
| 1972 |
|---|
| 1 | | Toshihide Ibaraki:
Representation Theorems for Equivalent Optimization Problems
Information and Control 21(5): 397-435 (1972) |
