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]Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi:
A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations. Comb. 18(1): 61-83 (1998) - [j107]Koji Nonobe, Toshihide Ibaraki:
A tabu search approach to the constraint satisfaction problem as a general problem solver. Eur. J. Oper. Res. 106(2-3): 599-623 (1998) - [j106]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. Inf. Comput. 140(2): 254-283 (1998) - [j105]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Double Horn Functions. Inf. Comput. 144(2): 155-190 (1998) - [j104]Hiroshi Nagamochi, Toshihide Ibaraki:
A Note on Minimizing Submodular Functions. Inf. Process. Lett. 67(5): 239-244 (1998) - [j103]Kazuhisa Makino, Toshihide Ibaraki:
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. J. Algorithms 26(2): 291-305 (1998) - [j102]András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
Two Arc-Disjoint Paths in Eulerian Digraphs. SIAM J. Discret. Math. 11(4): 557-589 (1998) - [c32]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Computing Intersections of Horn Theories for Reasoning with Models. AAAI/IAAI 1998: 292-297 - [c31]Mutsunori Yagiura, Toshihide Ibaraki:
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. COCOON 1998: 105-116 - [c30]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Disjunctions of Horn Theories and Their Cores. ISAAC 1998: 49-58 - [c29]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. ISAAC 1998: 159-168 - [c28]Hiroshi Nagamochi, Toshihide Ibaraki:
Polyhedral Structure of Submodular and Posi-modular Systems. ISAAC 1998: 169-178 - [c27]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. SODA 1998: 280-289 - [c26]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
On Disguised Double Horn Functions and Extensions. STACS 1998: 50-60 - 1997
- [j101]Rainer E. Burkard, Toshihide Ibaraki, Maurice Queyranne:
Preface. Ann. Oper. Res. 69: 0 (1997) - [j100]Yves Crama, Toshihide Ibaraki:
Hitting or avoiding balls in Euclidean space. Ann. Oper. Res. 69: 47-64 (1997) - [j99]Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki:
Vehicle scheduling on a tree with release and handling times. Ann. Oper. Res. 69: 193-207 (1997) - [j98]Kazuhisa Makino, Kojin Yano, Toshihide Ibaraki:
Positive and Horn Decomposability of Partially Defined Boolean Functions. Discret. Appl. Math. 74(3): 251-274 (1997) - [j97]Hiroshi Nagamochi, Toshihide Ibaraki:
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. J. Comb. Optim. 1(1): 5-46 (1997) - [j96]Hiroshi Nagamochi, Dao-Zhi Zeng, Naohisa Kabutoya, Toshihide Ibaraki:
Complexity of the Minimum Base Game on Matroids. Math. Oper. Res. 22(1): 146-164 (1997) - [j95]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Logical analysis of numerical data. Math. Program. 79: 163-190 (1997) - [j94]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) - [j93]Kazuhisa Makino, Toshihide Ibaraki:
The Maximum Latency and Identification of Positive Boolean Functions. SIAM J. Comput. 26(5): 1363-1383 (1997) - [j92]Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki:
Computing All Small Cuts in an Undirected Network. SIAM J. Discret. Math. 10(3): 469-481 (1997) - [c25]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Monotone Extensions of Boolean Data Sets. ALT 1997: 161-175 - [c24]Toshihide Ibaraki, Tiko Kameda:
Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited. ICCCN 1997: 4-10 - [c23]Toshihide Ibaraki:
Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract). ISAAC 1997: 1 - [c22]Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Augmenting Edge and Vertex Connectivities Simultaneously. ISAAC 1997: 102-111 - [c21]Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Two-Face Horn Extensions. ISAAC 1997: 112-121 - [c20]Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki:
Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. SODA 1997: 649-658 - [c19]Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi:
Combinatorial Optimization Games. SODA 1997: 720-729 - 1996
- [j91]Kazuhisa Makino, Toshihide Ibaraki:
Interior and Exterior Functions of Boolean Functions. Discret. Appl. Math. 69(3): 209-231 (1996) - [c18]Kazuhisa Makino, Takashi Suda, Kojin Yano, Toshihide Ibaraki:
Data Analysis by Positive Decision Trees. CODAS 1996: 257-264 - [c17]Mutsunori Yagiura, Toshihide Ibaraki:
Metaheuristics as Robust and Simple Optimization Tools. International Conference on Evolutionary Computation 1996: 541-546 - [c16]Hiroshi Nagamochi, Toshihide Ibaraki:
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. STOC 1996: 64-73 - [c15]Endre Boros, Toshihide Ibaraki, Kazuhisa Makino:
Boolean Analysis of Incomplete Examples. SWAT 1996: 440-451 - 1995
- [j90]Rainer E. Burkard, Toshihide Ibaraki, Maurice Queyranne:
Preface. Ann. Oper. Res. 57(1) (1995) - [j89]Komei Fukuda, Toshihide Ibaraki:
Preface. Discret. Appl. Math. 56(2-3): 99-100 (1995) - [j88]Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan:
Decomposability of Partially Defined Boolean Functions. Discret. Appl. Math. 62(1-3): 51-75 (1995) - [j87]Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda:
Optimal Coteries for Rings and Related Networks. Distributed Comput. 8(4): 191-201 (1995) - [j86]Jan C. Bioch, Toshihide Ibaraki:
Decompositions of positive self-dual boolean functions. Discret. Math. 140(1-3): 23-46 (1995) - [j85]Jan C. Bioch, Toshihide Ibaraki:
Complexity of Identification and Dualization of Positive Boolean Functions. Inf. Comput. 123(1): 50-63 (1995) - [j84]Jan C. Bioch, Toshihide Ibaraki:
Generating and Approximating Nondominated Coteries. IEEE Trans. Parallel Distributed Syst. 6(9): 905-914 (1995) - [c14]Hiroshi Nagamochi, Toshihide Ibaraki:
A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. IPCO 1995: 403-413 - [c13]András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
Two Arc Disjoint Paths in Eulerian Diagraphs. ISAAC 1995: 92-101 - [c12]Kazuhisa Makino, Toshihide Ibaraki:
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. ISAAC 1995: 291-300 - 1994
- [j83]Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki:
Implementing an efficient minimum capacity cut algorithm. Math. Program. 67: 325-341 (1994) - [j82]Terunao Soneoka, Toshihide Ibaraki:
Logically Instantaneous Message Passing in Asynchronous Distributed Systems. IEEE Trans. Computers 43(5): 513-527 (1994) - [c11]Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki:
Computing All Small Cuts in Undirected Networks. ISAAC 1994: 190-198 - [c10]Kazuhisa Makino, Toshihide Ibaraki:
The Maximum Latency and Identification of Positive Boolean Functions. ISAAC 1994: 324-332 - 1993
- [j81]András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
On sparse subgraphs preserving connectivity properties. J. Graph Theory 17(3): 275-281 (1993) - [j80]Kouichi Taji, Masao Fukushima, Toshihide Ibaraki:
A globally convergent Newton method for solving strongly monotone variational inequalities. Math. Program. 58: 369-383 (1993) - [j79]Toshihide Ibaraki, Tiko Kameda:
A Theory of Coteries: Mutual Exclusion in Distributed Systems. IEEE Trans. Parallel Distributed Syst. 4(7): 779-794 (1993) - [c9]Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki:
Vehicle Scheduling on a Tree with Release and Handling Times. ISAAC 1993: 486-495 - 1992
- [j78]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) - [j77]Satoru Ibaraki, Masao Fukushima, Toshihide Ibaraki:
Primal-dual proximal point algorithm for linearly constrained convex programming problems. Comput. Optim. Appl. 1(2): 207-226 (1992) - [j76]Naoki Katoh, Junji Koyanagi, Masamitsu Ohnishi, Toshihide Ibaraki:
Optimal strategies for some team games. Discret. Appl. Math. 35(3): 275-291 (1992) - [j75]Naoki Katoh, Toshihide Ibaraki, Tiko Kameda:
A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. Discret. Appl. Math. 40(4): 379-395 (1992) - [j74]Koichi Nakade, Masamitsu Ohnishi, Toshihide Ibaraki, Katsuhisa Ohno:
On the average optimality of circular assignment policy. Queueing Syst. Theory Appl. 11(3): 241-254 (1992) - [j73]Hiroshi Nagamochi, Toshihide Ibaraki:
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. SIAM J. Discret. Math. 5(1): 54-66 (1992) - [c8]Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda:
Optimal Coteries for Rings and Related Networks. ICDCS 1992: 650-656 - [e2]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. Lecture Notes in Computer Science 650, Springer 1992, ISBN 3-540-56279-6 [contents] - 1991
- [j72]Shigeru Masuyama, Toshihide Ibaraki:
Chain Packing in Graphs. Algorithmica 6(6): 826-839 (1991) - [j71]Hiroshi Nagamochi, Toshihide Ibaraki:
Maximum flows in probabilistic networks. Networks 21(6): 645-666 (1991) - [j70]Toshihide Ibaraki, Svatopluk Poljak:
Weak Three-Linking in Eulerian Digraphs. SIAM J. Discret. Math. 4(1): 84-98 (1991) - [c7]Susumu Suzuki, Toshihide Ibaraki, Masahichi Kishi:
Using Relaxation Techniques to Evaluate Queries in Deductive Databases. DEXA 1991: 67-72 - [c6]Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami:
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. ISA 1991: 104-115 - [c5]Toshihide Ibaraki, Tiko Kameda:
Boolean theory of coteries. SPDP 1991: 150-157 - 1990
- [j69]Toshihide Ibaraki, Naoki Katoh:
Searching Minimax Game Trees under Memory Space Constraint. Ann. Math. Artif. Intell. 1: 141-153 (1990) - [j68]Hiroshi Nagamochi, Toshihide Ibaraki:
Multicommodity flows in certain planar directed networks. Discret. Appl. Math. 27(1-2): 125-145 (1990) - [j67]Toshihide Ibaraki:
Preface. Discret. Appl. Math. 28(1): 1 (1990) - [j66]Yves Crama, Peter L. Hammer, Toshihide Ibaraki:
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices. Math. Oper. Res. 15(2): 258-267 (1990) - [j65]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) - [j64]Jigui Li, Toshihide Ibaraki:
Distributed database concurrency control by cautious schedulers with a central clock site. Syst. Comput. Jpn. 21(7): 35-42 (1990) - [j63]Toshihide Ibaraki, Tiko Kameda, Naoki Katoh:
Multiversion Cautious Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 16(3): 302-315 (1990) - [c4]Hiroshi Nagamochi, Toshihide Ibaraki:
Computing Edge-Connectivity in Multiple and Capacitated Graphs. SIGAL International Symposium on Algorithms 1990: 12-20 - [e1]Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki:
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 [contents]
1980 – 1989
- 1989
- [j62]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) - [j61]Shojiro Nishio, Shinichi Taniguchi, Toshihide Ibaraki:
On the Efficiency of Cautious Schedulers for Database Concurrency Control - Why Insist on Two-Phase Locking? Real Time Syst. 1(2): 177-195 (1989) - 1988
- [b1]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 - [j60]Yoshinao Suzuki, Tomio Hirata, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki:
Reconfiguration of a fault-tolerant rectangular systolic array. Syst. Comput. Jpn. 19(1): 79-89 (1988) - [j59]Hiroshi Yamasaki, Tomio Hirata, Masaharu Imai, Toshihide Ibaraki:
Computational complexity of the file allocation problem in distributed database systems. Syst. Comput. Jpn. 19(3): 53-63 (1988) - [j58]Makoto Takeda, Shigeru Masuyama, Toshihide Ibaraki:
Cautious Transaction Schedulers with k Versions. Syst. Comput. Jpn. 19(7): 46-55 (1988) - [j57]Yoshiroh Katoh, Toshihide Ibaraki:
Game Solving Procedure SSSR is Unsurpassed. Syst. Comput. Jpn. 19(7): 93-106 (1988) - [j56]Toshihide Ibaraki, Tiko Kameda, Naoki Katoh:
Cautious Transaction Schedulers for Database Concurrency Control. IEEE Trans. Software Eng. 14(7): 997-1009 (1988) - 1987
- [j55]Naoki Katoh, Tiko Kameda, Toshihide Ibaraki:
A Cautious Scheduler for Multistep Transactions. Algorithmica 2: 1-26 (1987) - [j54]Toshihide Ibaraki, Masao Iri:
Preface. Discret. Appl. Math. 17(1-2): 1-2 (1987) - [j53]Naoki Katoh, Toshihide Ibaraki:
A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program. Discret. Appl. Math. 17(1-2): 39-66 (1987) - [j52]Satoru Hashizume, Masao Fukushima, Naoki Katoh, Toshihide Ibaraki:
Approximation algorithms for combinatorial fractional programming problems. Math. Program. 37(3): 255-267 (1987) - [j51]Hiromoto Usui, Masafumi Yamashita, Masaharu Imai, Toshihide Ibaraki:
Parallel searches of game trees. Syst. Comput. Jpn. 18(8): 97-109 (1987) - [j50]Tohru Naoi, Masafumi Yamashita, Toshihide Ibaraki, Namio Honda:
A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy. Syst. Comput. Jpn. 18(9): 19-30 (1987) - [j49]Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura:
Serializability with Constraints. ACM Trans. Database Syst. 12(3): 429-452 (1987) - [j48]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
- [j47]Toshihide Ibaraki:
Generalization of Alpha-Beta and SSS Search Procedures. Artif. Intell. 29(1): 73-117 (1986) - [j46]Yves Crama, Peter L. Hammer, Toshihide Ibaraki:
Strong unimodularity for matrices and hypergraphs. Discret. Appl. Math. 15(2-3): 221-239 (1986) - [j45]Masafumi Yamashita, Toshihide Ibaraki:
Distances defined by neighborhood sequences. Pattern Recognit. 19(3): 237-246 (1986) - [j44]Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda:
Lower bounds on time complexity for some subgraph detection problems. Syst. Comput. Jpn. 17(6): 95-102 (1986) - [c3]Hajime Miura, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki:
Implementation of Parallel Prolog on Tree Machines. FJCC 1986: 287-296 - 1985
- [j43]Naoki Katoh, Toshihide Ibaraki:
An efficient algorithm for the parametric resource allocation problem. Discret. Appl. Math. 10(3): 261-274 (1985) - [j42]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for the Equipollent Resource Allocation Problem. Math. Oper. Res. 10(1): 44-53 (1985) - [j41]Naoki Katoh, Toshihide Ibaraki, Tiko Kameda:
Cautious Transaction Schedulers with Admission Control. ACM Trans. Database Syst. 10(2): 205-229 (1985) - [j40]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
- [j39]Toshihide Ibaraki, Tiko Kameda:
On the Optimal Nesting Order for Computing N-Relational Joins. ACM Trans. Database Syst. 9(3): 482-502 (1984) - 1983
- [j38]Toshihide Ibaraki, Naoki Katoh:
On-Line Computation of Transitive Closures of Graphs. Inf. Process. Lett. 16(2): 95-97 (1983) - [j37]Toshihide Ibaraki, Hussein M. Abdel-Wahab, Tiko Kameda:
Design of Minimum-Cost Deadlock-Free Systems. J. ACM 30(4): 736-751 (1983) - [j36]Toshihide Ibaraki, Shojiro Muro, T. Murakami, Toshiharu Hasegawa:
Using branch-and-bound algorithms to obtain suboptimal solutions. Z. Oper. Research 27(1): 177-202 (1983) - [j35]Toshihide Ibaraki:
Parametric approaches to fractional programs. Math. Program. 26(3): 345-362 (1983) - [c2]Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura:
Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract). VLDB 1983: 89-91 - [c1]Shojiro Muro, Toshihide Ibaraki, Hidehiro Miyajima, Toshiharu Hasegawa:
File Redundancy Issues in Distributed Database Systems. VLDB 1983: 275-277 - 1982
- [j34]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An efficient algorithm for K shortest simple paths. Networks 12(4): 411-427 (1982) - [j33]Toshihide Ibaraki, Tsunehiko Kameda:
Deadlock-Free Systems for a Bounded Number of Processes. IEEE Trans. Computers 31(3): 188-193 (1982) - 1981
- [j32]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for the K Best Solutions of the Resource Allocation Problem. J. ACM 28(4): 752-764 (1981) - [j31]Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for Finding K Minimum Spanning Trees. SIAM J. Comput. 10(2): 247-255 (1981) - [j30]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) - 1980
- [j29]Toshihide Ibaraki:
The number of additional variables required for the integer programming formulation. Discret. Appl. Math. 2(2): 155-158 (1980)
1970 – 1979
- 1978
- [j28]Toshihide Ibaraki:
Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems. Inf. Control. 36(1): 1-27 (1978) - [j27]Toshihide Ibaraki:
Finite Automata Having Cost Functions: Nondeterministic Models. Inf. Control. 37(1): 40-69 (1978) - [j26]Toshihide Ibaraki:
Depth-m search in branch-and-bound algorithms. Int. J. Parallel Program. 7(4): 315-343 (1978) - [j25]Hiroshi Kise, Toshihide Ibaraki, Hisashi Mine:
A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times. Oper. Res. 26(1): 121-126 (1978) - 1977
- [j24]Toshihide Ibaraki:
The Power of Dominance Relations in Branch-and-Bound Algorithms. J. ACM 24(2): 264-279 (1977) - [j23]Hiroaki Ishii, Toshihide Ibaraki, Hisashi Mine:
Fractional knapsack problems. Math. Program. 13(1): 255-271 (1977) - 1976
- [j22]Toshihide Ibaraki:
Finite Automata Having Cost Functions. Inf. Control. 31(2): 153-176 (1976) - [j21]Toshihide Ibaraki:
Theoretical comparisons of search strategies in branch-and-bound algorithms. Int. J. Parallel Program. 5(4): 315-344 (1976) - [j20]Toshihide Ibaraki:
Computational Efficiency of Approximate Branch-and-Bound Algorithms. Math. Oper. Res. 1(3): 287-298 (1976) - 1975
- [j19]Toshihide Ibaraki:
Minimal Representations of Some Classes of Dynamic Programming. Inf. Control. 27(4): 289-328 (1975) - 1974
- [j18]Toshihide Ibaraki:
Classes of Discrete Optimization Problems and Their Decision Problems. J. Comput. Syst. Sci. 8(1): 84-116 (1974) - [j17]Toshihide Ibaraki:
Comments on "Monotone Functions in Sequential Circuits". IEEE Trans. Computers 23(9): 989-990 (1974) - 1973
- [j16]Tadao Takaoka, Toshihide Ibaraki:
Fail-Safe Realization of Sequential Machines. Inf. Control. 22(1): 31-55 (1973) - [j15]Toshihide Ibaraki:
Technical Note - The Use of Cuts in Complementary Programming. Oper. Res. 21(1): 353-359 (1973) - [j14]Toshihide Ibaraki:
Finite State Representations of Discrete Optimization Problems. SIAM J. Comput. 2(3): 193-210 (1973) - 1972
- [j13]Toshihide Ibaraki:
Representation Theorems for Equivalent Optimization Problems. Inf. Control. 21(5): 397-435 (1972) - [j12]Toshihide Ibaraki, Tso-Kai Liu, Charles R. Baugh, Saburo Muroga:
An implicit enumeration program for zero-one integer programming. Int. J. Parallel Program. 1(1): 75-92 (1972) - [j11]Saburo Muroga, Toshihide Ibaraki:
Design of Optimal Switching Networks by Integer Programming. IEEE Trans. Computers 21(6): 573-582 (1972) - [j10]Tadao Takaoka, Toshihide Ibaraki:
N-Fail-Safe Sequential Machines. IEEE Trans. Computers 21(11): 1189-1196 (1972) - 1971
- [j9]Charles R. Baugh, Toshihide Ibaraki, Saburo Muroga:
Technical Note - Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks. Oper. Res. 19(4): 1090-1096 (1971) - [j8]Toshihide Ibaraki:
Technical Note - Complementary Programming. Oper. Res. 19(6): 1523-1529 (1971) - [j7]Toshihide Ibaraki, Saburo Muroga:
Synthesis of Networks with a Minimum Number of Negative Gates. IEEE Trans. Computers 20(1): 49-58 (1971) - [j6]Toshihide Ibaraki:
Gate-Interconnection Minimization of Switching Networks Using Negative Gates. IEEE Trans. Computers 20(6): 698-706 (1971) - 1970
- [j5]Toshihide Ibaraki, Saburo Muroga:
Adaptive Linear Classifier by Linear Programming. IEEE Trans. Syst. Sci. Cybern. 6(1): 53-62 (1970)
1960 – 1969
- 1968
- [j4]Shuzo Yajima, Toshihide Ibaraki:
A Theory of Completely Monotonic Functions and its Applications to Threshold Logic. IEEE Trans. Computers 17(3): 214-229 (1968) - [j3]Shuzo Yajima, Toshihide Ibaraki:
Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic. IEEE Trans. Computers 17(4): 338-351 (1968) - [j2]Shuzo Yajima, Toshihide Ibaraki, I. Kawano:
On Autonomous Logic Nets of Threshold Elements. IEEE Trans. Computers 17(4): 385-391 (1968) - 1965
- [j1]Shuzo Yajima, Toshihide Ibaraki:
A Lower Bound of the Number of Threshold Functions. IEEE Trans. Electron. Comput. 14(6): 926-929 (1965)
Coauthor Index
[j188] [b2] [c56] [j177] [j168] [j163] [j157] [j151] [j149] [j146] [j145] [j142] [j134] [j133] [j132] [c48] [c47] [j129] [j128] [j127] [j126] [j123] [j122] [j113] [j111] [c41] [c40] [c39] [c38] [c36] [c35] [j108] [j104] [j102] [c29] [c28] [c27] [j99] [j97] [j96] [j92] [c22] [c20] [c19] [c16] [j87] [c14] [c13] [j83] [c11] [j81] [c9] [j78] [j73] [c8] [j71] [j68] [j65] [c4] [j62]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
