default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDToshihide Ibaraki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2018
[c59]Ryouei Takahashi, Yukihiro Nakamura, Toshihide Ibaraki:
Experimental Evaluation of ACO for Continuous Domains to Solve Function Optimization Problems. ANTS Conference 2018: 360-367- [p2]Wei Wu, Mutsunori Yagiura, Toshihide Ibaraki:
Generalized Assignment Problem. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 713-736 - 2013
- [j191]Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki:
Recent progress of local search in handling the time window constraints of the vehicle routing problem. Ann. Oper. Res. 204(1): 171-187 (2013) - [j190]Eishi Chiba, Hiroshi Fujiwara, Yoshiyuki Sekiguchi, Toshihide Ibaraki:
Collision Probability in an In-Line Equipment Model under Erlang Distribution. IEICE Trans. Inf. Syst. 96-D(3): 400-407 (2013) - 2011
- [j189]Endre Boros
, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino:
Logical analysis of data: classification with justification. Ann. Oper. Res. 188(1): 33-61 (2011) - [j188]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) - 2010
- [j187]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) - [j186]Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki:
Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options. Asia Pac. J. Oper. Res. 27(2): 211-225 (2010) - [j185]Toshihide Ibaraki:
A personal perspective on problem solving by general purpose solvers. Int. Trans. Oper. Res. 17(3): 303-315 (2010)
2000 – 2009
- 2009
- [j184]Kazuki Matsumoto, Hiroyoshi Miwa, Toshihide Ibaraki:
Scheduling of corrugated paper production. Eur. J. Oper. Res. 192(3): 782-792 (2009) - [j183]Shunji Umetani, Mutsunori Yagiura, Shinji Imahori, Takashi Imamichi, Koji Nonobe, Toshihide Ibaraki:
Solving the irregular strip packing problem via guided local search for overlap minimization. Int. Trans. Oper. Res. 16(6): 661-683 (2009) - 2008
- [b2]Hiroshi Nagamochi, Toshihide Ibaraki:
Algorithmic Aspects of Graph Connectivity. Encyclopedia of Mathematics and its Applications 123, Cambridge University Press 2008, ISBN 9780511721649 - [j182]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. Discret. Appl. Math. 156(11): 2050-2069 (2008) - [j181]Hideki Hashimoto, Mutsunori Yagiura, Toshihide Ibaraki:
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discret. Optim. 5(2): 434-456 (2008) - [j180]Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki:
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns. IEICE Trans. Inf. Syst. 91-D(3): 781-788 (2008) - [c58]Toshihide Ibaraki, Toshihide Nomura, Masahiro Sasaki:
Integer Programming Approaches to the Problem of Network Upgrading. SAINT 2008: 229-232 - [p1]Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura:
Hybrid Metaheuristics for Packing Problems. Hybrid Metaheuristics 2008: 185-219 - 2007
- [j179]Susumu Suzuki, Toshihide Ibaraki:
The complexity of assigning genotypes to people in a pedigree consistently. Discret. Math. 307(16): 2122-2131 (2007) - [j178]Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki:
Duality in option pricing based on prices of other derivatives. Oper. Res. Lett. 35(2): 165-171 (2007) - [c57]Eishi Chiba, Hiroshi Fujiwara, Yoshiyuki Sekiguchi, Toshihide Ibaraki:
Collision Probability in an Automated Production Line under Erlang Distribution. RIVF 2007: 42-49 - [c56]Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred W. Glover:
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. SLS 2007: 121-135 - [c55]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 - [r1]Toshihide Ibaraki, Mutsunori Yagiura:
Generalized Assignment Problem. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j177]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) - [j176]Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura:
The vehicle routing problem with flexible time windows and traveling times. Discret. Appl. Math. 154(16): 2271-2290 (2006) - [j175]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
Minimum edge ranking spanning trees of split graphs. Discret. Appl. Math. 154(16): 2373-2386 (2006) - [j174]Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover:
A path relinking approach with ejection chains for the generalized assignment problem. Eur. J. Oper. Res. 169(2): 548-569 (2006) - [j173]Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki:
A 3-flip neighborhood local search for the set covering problem. Eur. J. Oper. Res. 172(2): 472-499 (2006) - [j172]Kazuya Haraguchi, Toshihide Ibaraki:
Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1284-1291 (2006) - [j171]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) - [c54]Toshihide Ibaraki, Kouji Nakamura:
Packing Problems with Soft Rectangles. Hybrid Metaheuristics 2006: 13-27 - 2005
- [j170]Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki:
Improved local search algorithms for the rectangle packing problem with general spatial costs. Eur. J. Oper. Res. 167(1): 48-67 (2005) - [j169]Konstantin Kogan, Eugene Khmelnitsky, Toshihide Ibaraki:
Dynamic Generalized Assignment Problems with Stochastic Demands and Multiple Agent-Task Relationships. J. Glob. Optim. 31(1): 17-43 (2005) - [j168]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
Greedy splitting algorithms for approximating multiway partition problems. Math. Program. 102(1): 167-183 (2005) - [j167]Toshihide Ibaraki, Yann Vaxès, Xiao Guang Yang:
Lowering eccentricity of a tree by node upgrading. Networks 45(4): 232-239 (2005) - [j166]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. Transp. Sci. 39(2): 206-232 (2005) - 2004
- [j165]Takashi Horiyama, Toshihide Ibaraki:
Reasoning with ordered binary decision diagrams. Discret. Appl. Math. 142(1-3): 151-163 (2004) - [j164]Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki:
A decomposability index in logical analysis of data. Discret. Appl. Math. 142(1-3): 165-180 (2004) - [j163]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
On generalized greedy splitting algorithms for multiway partition problems. Discret. Appl. Math. 143(1-3): 130-143 (2004) - [j162]Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred W. Glover:
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discret. Optim. 1(1): 87-98 (2004) - [j161]Susumu Suzuki, Toshihide Ibaraki:
An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Size of the Union of Cartesian Products. Informatica (Slovenia) 28(3): 227-232 (2004) - [j160]Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover:
An Ejection Chain Approach for the Generalized Assignment Problem. INFORMS J. Comput. 16(2): 133-151 (2004) - [c53]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 - [c52]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 - 2003
- [j159]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) - [j158]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) - [j157]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. Discret. Appl. Math. 126(2-3): 275-289 (2003) - [j156]Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki:
Interior and exterior functions of positive Boolean functions. Discret. Appl. Math. 130(3): 417-436 (2003) - [j155]Susumu Suzuki, Toshihide Ibaraki:
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. Discret. Math. 273(1-3): 211-220 (2003) - [j154]Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki:
One-dimensional cutting stock problem to minimize the number of different patterns. Eur. J. Oper. Res. 146(2): 388-402 (2003) - [j153]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Variations on extending partially defined Boolean functions with missing bits. Inf. Comput. 180(1): 53-70 (2003) - [j152]Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki:
An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1093-1102 (2003) - [j151]Hiroshi Nagamochi, Yukihiro Nishida, Toshihide Ibaraki:
Approximability of the Minimum Maximal Matching Problem in Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(12): 3251-3258 (2003) - [j150]Takashi Horiyama, Toshihide Ibaraki:
Translation among CNFs, characteristic models and ordered binary decision diagrams. Inf. Process. Lett. 85(4): 191-198 (2003) - [j149]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) - [j148]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) - [e3]Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono:
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 [contents] - 2002
- [j147]Takashi Horiyama, Toshihide Ibaraki:
Ordered binary decision diagrams as knowledge-bases. Artif. Intell. 136(2): 189-213 (2002) - [j146]Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki:
Convex Embeddings and Bisections of 3-Connected Graphs 1. Comb. 22(4): 537-554 (2002) - [j145]Hiroshi Nagamochi, Toshihide Ibaraki:
Graph connectivity and its augmentation: applications of MA orderings. Discret. Appl. Math. 123(1-3): 447-472 (2002) - [j144]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Recognition and dualization of disguised bidual Horn functions. Inf. Process. Lett. 82(6): 283-291 (2002) - [j143]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) - [j142]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) - [j141]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Decision lists and related Boolean functions. Theor. Comput. Sci. 270(1-2): 493-524 (2002) - [j140]Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki:
Logical analysis of data with decomposable structures. Theor. Comput. Sci. 289(2): 977-995 (2002) - [c51]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
Minimum Edge Ranking Spanning Trees of Threshold Graphs. ISAAC 2002: 428-440 - 2001
- [j139]Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino:
On functional dependencies in q-Horn theories. Artif. Intell. 131(1-2): 171-187 (2001) - [j138]Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven D. Noble, William R. Pulleyblank:
Preface. Ann. Oper. Res. 107(1-4): 13 (2001) - [j137]Susumu Suzuki, Toshihide Ibaraki:
Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products. Electron. Notes Discret. Math. 10: 272-276 (2001) - [j136]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) - [j135]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
On Minimum Edge Ranking Spanning Trees. J. Algorithms 38(2): 411-437 (2001) - [j134]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) - [j133]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) - [j132]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Multigraph augmentation under biconnectivity and general edge-connectivity requirements. Networks 37(3): 144-155 (2001) - [j131]Mutsunori Yagiura, Toshihide Ibaraki:
On metaheuristic algorithms for combinatorial optimization problems. Syst. Comput. Jpn. 32(3): 33-55 (2001) - [j130]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Disjunctions of Horn Theories and Their Cores. SIAM J. Comput. 31(1): 269-288 (2001) - [c50]Takashi Horiyama, Toshihide Ibaraki:
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. ISAAC 2001: 231-243 - [c49]Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki:
An Index for the Data Size to Extract Decomposable Structures in LAD. ISAAC 2001: 279-290 - [c48]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
A Unified Framework for Approximating Multiway Partition Problems. ISAAC 2001: 682-694 - [c47]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. STACS 2001: 478-489 - 2000
- [j129]Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki:
A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs. Algorithmica 26(1): 50-67 (2000) - [j128]Hiroshi Nagamochi, Toshihide Ibaraki:
Polyhedral structure of submodular and posi-modular systems. Discret. Appl. Math. 107(1-3): 165-189 (2000) - [j127]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) - [j126]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) - [j125]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
On the Difference of Horn Theories. J. Comput. Syst. Sci. 61(3): 478-507 (2000) - [j124]Konstantin Kogan, Toshihide Ibaraki:
Optimal Scheduling in Parallel and Serial Manufacturing Systems via the Maximum Principle. J. Glob. Optim. 16(3): 271-294 (2000) - [j123]Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi, Wenan Zang:
Totally balanced combinatorial optimization games. Math. Program. 87(3): 441-452 (2000) - [j122]Hiroshi Nagamochi, Toshihide Ibaraki:
A fast algorithm for computing minimum 3-way and 4-way cuts. Math. Program. 88(3): 507-520 (2000) - [j121]Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Boolean Normal Forms, Shellability, and Reliability Computations. SIAM J. Discret. Math. 13(2): 212-226 (2000) - [j120]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) - [c46]Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki:
Logical Analysis of Data with Decomposable Structures. COCOON 2000: 396-406 - [c45]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 - [c44]Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura:
Finding Essential Attributes in Binary Data. IDEAL 2000: 133-138 - [c43]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. IFIP TCS 2000: 257-272 - [c42]Takashi Horiyama, Toshihide Ibaraki:
Reasoning with Ordered Binary Decision Diagrams. ISAAC 2000: 120-131
1990 – 1999
- 1999
- [j119]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Logical Analysis of Binary Data with Missing Bits. Artif. Intell. 107(2): 219-263 (1999) - [j118]Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino:
Functional Dependencies in Horn Theories. Artif. Intell. 108(1-2): 1-30 (1999) - [j117]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Computing Intersections of Horn Theories for Reasoning with Models. Artif. Intell. 110(1): 57-101 (1999) - [j116]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Bidual Horn Functions and Extensions. Discret. Appl. Math. 96-97: 55-88 (1999) - [j115]Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino:
Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. Discret. Appl. Math. 96-97: 307-326 (1999) - [j114]Kazuhisa Makino, Toshihide Ibaraki:
Inner-core and Outer-core Functions of Partially Defined Boolean Functions. Discret. Appl. Math. 96-97: 443-460 (1999) - [j113]Hiroshi Nagamochi, Toshihide Ibaraki:
Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. J. Algorithms 30(2): 253-301 (1999) - [j112]Mutsunori Yagiura, Toshihide Ibaraki:
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. J. Comb. Optim. 3(1): 95-114 (1999) - [j111]Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi:
Algorithmic Aspects of the Core of Combinatorial Optimization Games. Math. Oper. Res. 24(3): 751-766 (1999) - [j110]Kazuhisa Makino, Ken'ichi Hatanaka, Toshihide Ibaraki:
Horn Extensions of a Partially Defined Boolean Function. SIAM J. Comput. 28(6): 2168-2186 (1999) - [c41]Hiroshi Nagamochi, Toshihide Ibaraki:
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. COCOON 1999: 31-40 - [c40]Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki:
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. COCOON 1999: 164-173 - [c39]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 - [c38]Hiroshi Nagamochi, Toshihide Ibaraki:
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. IPCO 1999: 377-390 - [c37]Takashi Horiyama, Toshihide Ibaraki:
Ordered Binary Decision Diagrams as Knowledge-Bases. ISAAC 1999: 83-92 - [c36]Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki:
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. ISAAC 1999: 373-382 - [c35]Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki:
Bisecting Two Subsets in 3-Connected Graphs. ISAAC 1999: 425-434 - [c34]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki:
On Minimum Edge Ranking Spanning Trees. MFCS 1999: 398-409 - [c33]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
On the Difference of Horn Theories. STACS 1999: 467-477 - 1998
- [j109]Rainer E. Burkard, Toshihide Ibaraki, William R. Pulleyblank:
Preface: Mathematics of Industrial Systems III. Ann. Oper. Res. 76: 0 (1998) - [j108]