Toshihide Ibaraki

258 papers A* 6A 6B 26C 2Misc 4Journal 191Unranked 17
YearRankTypeTitle / Venue / Authors
2018 — conf
Experimental Evaluation of ACO for Continuous Domains to Solve Function Optimization Problems.
ANTS Conference
Ryouei Takahashi, Yukihiro Nakamura, Toshihide Ibaraki
2018 — ch.
Generalized Assignment Problem.
Handbook of Approximation Algorithms and Metaheuristics (1)
Wei Wu, Mutsunori Yagiura, Toshihide Ibaraki
2013 J jnl
Collision Probability in an In-Line Equipment Model under Erlang Distribution.
IEICE Trans. Inf. Syst.
Eishi Chiba, Hiroshi Fujiwara, Yoshiyuki Sekiguchi, Toshihide Ibaraki
2013 J jnl
Recent progress of local search in handling the time window constraints of the vehicle routing problem.
Ann. Oper. Res.
Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki
2011 J jnl
Efficient branch-and-bound algorithms for weighted MAX-2-SAT.
Math. Program.
Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura
2011 J jnl
Logical analysis of data: classification with justification.
Ann. Oper. Res.
Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
2010 J jnl
A personal perspective on problem solving by general purpose solvers.
Int. Trans. Oper. Res.
Toshihide Ibaraki
2010 J jnl
Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options.
Asia Pac. J. Oper. Res.
Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki
2010 J jnl
Recent progress of local search in handling the time window constraints of the vehicle routing problem.
4OR
Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki
2009 J jnl
Scheduling of corrugated paper production.
Eur. J. Oper. Res.
Kazuki Matsumoto, Hiroyoshi Miwa, Toshihide Ibaraki
2009 J jnl
Solving the irregular strip packing problem via guided local search for overlap minimization.
Int. Trans. Oper. Res.
Shunji Umetani, Mutsunori Yagiura, Shinji Imahori, Takashi Imamichi, Koji Nonobe, Toshihide Ibaraki
2008 J jnl
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns.
IEICE Trans. Inf. Syst.
Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki
2008 — book
Algorithmic Aspects of Graph Connectivity
Hiroshi Nagamochi, Toshihide Ibaraki
2008 J jnl
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows.
Discret. Optim.
Hideki Hashimoto, Mutsunori Yagiura, Toshihide Ibaraki
2008 J jnl
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.
Discret. Appl. Math.
Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura
2008 — ch.
Hybrid Metaheuristics for Packing Problems.
Hybrid Metaheuristics
Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura
2008 — conf
Integer Programming Approaches to the Problem of Network Upgrading.
SAINT
Toshihide Ibaraki, Toshihide Nomura, Masahiro Sasaki
2007 — conf
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem.
SLS
Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred W. Glover
2007 — conf
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route.
SLS
Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe, Toshihide Ibaraki, Arne Løkketangen
2007 — conf
Collision Probability in an Automated Production Line under Erlang Distribution.
RIVF
Eishi Chiba, Hiroshi Fujiwara, Yoshiyuki Sekiguchi, Toshihide Ibaraki
2007 J jnl
Duality in option pricing based on prices of other derivatives.
Oper. Res. Lett.
Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki
2007 — ch.
Generalized Assignment Problem.
Handbook of Approximation Algorithms and Metaheuristics
Toshihide Ibaraki, Mutsunori Yagiura
2007 J jnl
The complexity of assigning genotypes to people in a pedigree consistently.
Discret. Math.
Susumu Suzuki, Toshihide Ibaraki
2006 J jnl
A 3-flip neighborhood local search for the set covering problem.
Eur. J. Oper. Res.
Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki
2006 J jnl
A path relinking approach with ejection chains for the generalized assignment problem.
Eur. J. Oper. Res.
Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover
2006 J jnl
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph.
Algorithmica
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
2006 J jnl
Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kazuya Haraguchi, Toshihide Ibaraki
2006 J jnl
Minimum edge ranking spanning trees of split graphs.
Discret. Appl. Math.
Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
2006 J jnl
One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming.
J. Math. Model. Algorithms
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
2006 — conf
Packing Problems with Soft Rectangles.
Hybrid Metaheuristics
Toshihide Ibaraki, Kouji Nakamura
2006 J jnl
The vehicle routing problem with flexible time windows and traveling times.
Discret. Appl. Math.
Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura
2005 J jnl
Dynamic Generalized Assignment Problems with Stochastic Demands and Multiple Agent-Task Relationships.
J. Glob. Optim.
Konstantin Kogan, Eugene Khmelnitsky, Toshihide Ibaraki
2005 J jnl
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints.
Transp. Sci.
Toshihide Ibaraki, Shinji Imahori, Mikio Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura
2005 J jnl
Greedy splitting algorithms for approximating multiway partition problems.
Math. Program.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2005 J jnl
Improved local search algorithms for the rectangle packing problem with general spatial costs.
Eur. J. Oper. Res.
Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki
2005 J jnl
Lowering eccentricity of a tree by node upgrading.
Networks
Toshihide Ibaraki, Yann Vaxès, Xiao Guang Yang
2004 J jnl
A decomposability index in logical analysis of data.
Discret. Appl. Math.
Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
2004 J jnl
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem.
Discret. Optim.
Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred W. Glover
2004 J jnl
An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Size of the Union of Cartesian Products.
Informatica (Slovenia)
Susumu Suzuki, Toshihide Ibaraki
2004 J jnl
An Ejection Chain Approach for the Generalized Assignment Problem.
INFORMS J. Comput.
Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover
2004 — conf
An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions.
CCCG
Susumu Suzuki, Toshihide Ibaraki
2004 J jnl
On generalized greedy splitting algorithms for multiway partition problems.
Discret. Appl. Math.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2004 — conf
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming.
Hybrid Metaheuristics
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
2004 J jnl
Reasoning with ordered binary decision diagrams.
Discret. Appl. Math.
Takashi Horiyama, Toshihide Ibaraki
2003 J jnl
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem.
Inf. Process. Lett.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2003 J jnl
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.
Discret. Appl. Math.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2003 B ed.
Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings
ISAAC
Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono
2003 J jnl
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.
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
2003 J jnl
Approximability of the Minimum Maximal Matching Problem in Planar Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Hiroshi Nagamochi, Yukihiro Nishida, Toshihide Ibaraki
2003 J jnl
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.
Discret. Math.
Susumu Suzuki, Toshihide Ibaraki
2003 J jnl
Finding Essential Attributes from Binary Data.
Ann. Math. Artif. Intell.
Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
2003 J jnl
Inferring Minimal Functional Dependencies in Horn and q-Horn Theories.
Ann. Math. Artif. Intell.
Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
2003 J jnl
Interior and exterior functions of positive Boolean functions.
Discret. Appl. Math.
Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki
2003 J jnl
Local search algorithms for the rectangle packing problem with general spatial costs.
Math. Program.
Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki
2003 J jnl
One-dimensional cutting stock problem to minimize the number of different patterns.
Eur. J. Oper. Res.
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
2003 J jnl
Translation among CNFs, characteristic models and ordered binary decision diagrams.
Inf. Process. Lett.
Takashi Horiyama, Toshihide Ibaraki
2003 J jnl
Variations on extending partially defined Boolean functions with missing bits.
Inf. Comput.
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
2002 J jnl
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks.
Networks
Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
2002 J jnl
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.
J. Algorithms
Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti
2002 J jnl
Convex Embeddings and Bisections of 3-Connected Graphs 1.
Comb.
Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
2002 J jnl
Decision lists and related Boolean functions.
Theor. Comput. Sci.
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
2002 J jnl
Graph connectivity and its augmentation: applications of MA orderings.
Discret. Appl. Math.
Hiroshi Nagamochi, Toshihide Ibaraki
2002 J jnl
Logical analysis of data with decomposable structures.
Theor. Comput. Sci.
Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
2002 B conf
Minimum Edge Ranking Spanning Trees of Threshold Graphs.
ISAAC
Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
2002 J jnl
Ordered binary decision diagrams as knowledge-bases.
Artif. Intell.
Takashi Horiyama, Toshihide Ibaraki
2002 J jnl
Recognition and dualization of disguised bidual Horn functions.
Inf. Process. Lett.
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
2001 A conf
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.
STACS
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2001 B conf
A Unified Framework for Approximating Multiway Partition Problems.
ISAAC
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2001 B conf
An Index for the Data Size to Extract Decomposable Structures in LAD.
ISAAC
Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
2001 J jnl
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.
J. Comb. Optim.
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
2001 J jnl
Augmenting a Submodular and Posi-modular Set Function by a Multigraph.
J. Comb. Optim.
Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki
2001 J jnl
Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products.
Electron. Notes Discret. Math.
Susumu Suzuki, Toshihide Ibaraki
2001 J jnl
Disjunctions of Horn Theories and Their Cores.
SIAM J. Comput.
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
2001 J jnl
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation.
J. Heuristics
Mutsunori Yagiura, Toshihide Ibaraki
2001 J jnl
Multigraph augmentation under biconnectivity and general edge-connectivity requirements.
Networks
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
2001 J jnl
On Minimum Edge Ranking Spanning Trees.
J. Algorithms
Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
2001 J jnl
On functional dependencies in q-Horn theories.
Artif. Intell.
Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
2001 J jnl
On metaheuristic algorithms for combinatorial optimization problems.
Syst. Comput. Jpn.
Mutsunori Yagiura, Toshihide Ibaraki
2001 J jnl
Preface.
Ann. Oper. Res.
Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven D. Noble, William R. Pulleyblank
2001 B conf
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams.
ISAAC
Takashi Horiyama, Toshihide Ibaraki
2000 J jnl
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.
J. Comb. Optim.
Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
2000 J jnl
A Simplified
Algorithmica
Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki
2000 J jnl
A fast algorithm for computing minimum 3-way and 4-way cuts.
Math. Program.
Hiroshi Nagamochi, Toshihide Ibaraki
2000 J jnl
An Implementation of Logical Analysis of Data.
IEEE Trans. Knowl. Data Eng.
Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya B. Muchnik
2000 J jnl
Boolean Normal Forms, Shellability, and Reliability Computations.
SIAM J. Discret. Math.
Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
2000 A conf
Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.
ESA
Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti
2000 C conf
Finding Essential Attributes in Binary Data.
IDEAL
Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
2000 — conf
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits.
IFIP TCS
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
2000 Misc conf
Logical Analysis of Data with Decomposable Structures.
COCOON
Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
2000 J jnl
On the Difference of Horn Theories.
J. Comput. Syst. Sci.
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
2000 J jnl
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph.
J. Comb. Optim.
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
2000 J jnl
Optimal Scheduling in Parallel and Serial Manufacturing Systems via the Maximum Principle.
J. Glob. Optim.
Konstantin Kogan, Toshihide Ibaraki
2000 J jnl
Polyhedral structure of submodular and posi-modular systems.
Discret. Appl. Math.
Hiroshi Nagamochi, Toshihide Ibaraki
2000 B conf
Reasoning with Ordered Binary Decision Diagrams.
ISAAC
Takashi Horiyama, Toshihide Ibaraki
2000 J jnl
Totally balanced combinatorial optimization games.
Math. Program.
Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi, Wenan Zang
1999 B conf
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts.
IPCO
Hiroshi Nagamochi, Toshihide Ibaraki
1999 Misc conf
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.
COCOON
Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
1999 J jnl
Algorithmic Aspects of the Core of Combinatorial Optimization Games.
Math. Oper. Res.
Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi
1999 Misc conf
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree.
COCOON
Hiroshi Nagamochi, Toshihide Ibaraki
1999 J jnl
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT.
J. Comb. Optim.
Mutsunori Yagiura, Toshihide Ibaraki
1999 B conf
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.
ISAAC
Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
1999 J jnl
Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time.
J. Algorithms
Hiroshi Nagamochi, Toshihide Ibaraki
1999 A conf
Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph.
ESA
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
1999 J jnl
Bidual Horn Functions and Extensions.
Discret. Appl. Math.
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1999 B conf
Bisecting Two Subsets in 3-Connected Graphs.
ISAAC
Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
1999 J jnl
Computing Intersections of Horn Theories for Reasoning with Models.
Artif. Intell.
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1999 J jnl
Functional Dependencies in Horn Theories.
Artif. Intell.
Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
1999 J jnl
Horn Extensions of a Partially Defined Boolean Function.
SIAM J. Comput.
Kazuhisa Makino, Ken'ichi Hatanaka, Toshihide Ibaraki
1999 J jnl
Inner-core and Outer-core Functions of Partially Defined Boolean Functions.
Discret. Appl. Math.
Kazuhisa Makino, Toshihide Ibaraki
1999 J jnl
Logical Analysis of Binary Data with Missing Bits.
Artif. Intell.
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1999 J jnl
Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions.
Discret. Appl. Math.
Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino
1999 B conf
On Minimum Edge Ranking Spanning Trees.
MFCS
Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
1999 A conf
On the Difference of Horn Theories.
STACS
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1999 B conf
Ordered Binary Decision Diagrams as Knowledge-Bases.
ISAAC
Takashi Horiyama, Toshihide Ibaraki
1998 J jnl
A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations.
Comb.
Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi
1998 J jnl
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions.
J. Algorithms
Kazuhisa Makino, Toshihide Ibaraki
1998 J jnl
A Note on Minimizing Submodular Functions.
Inf. Process. Lett.
Hiroshi Nagamochi, Toshihide Ibaraki
1998 J jnl
A tabu search approach to the constraint satisfaction problem as a general problem solver.
Eur. J. Oper. Res.
Koji Nonobe, Toshihide Ibaraki
1998 — conf
Computing Intersections of Horn Theories for Reasoning with Models.
AAAI/IAAI
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1998 B conf
Disjunctions of Horn Theories and Their Cores.
ISAAC
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1998 J jnl
Double Horn Functions.
Inf. Comput.
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1998 Misc conf
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT.
COCOON
Mutsunori Yagiura, Toshihide Ibaraki
1998 J jnl
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions.
Inf. Comput.
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1998 B conf
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph.
ISAAC
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
1998 A conf
On Disguised Double Horn Functions and Extensions.
STACS
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1998 A* conf
Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.
SODA
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
1998 B conf
Polyhedral Structure of Submodular and Posi-modular Systems.
ISAAC
Hiroshi Nagamochi, Toshihide Ibaraki
1998 J jnl
Preface: Mathematics of Industrial Systems III.
Ann. Oper. Res.
Rainer E. Burkard, Toshihide Ibaraki, William R. Pulleyblank
1998 J jnl
Two Arc-Disjoint Paths in Eulerian Digraphs.
SIAM J. Discret. Math.
András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
1997 B conf
Augmenting Edge and Vertex Connectivities Simultaneously.
ISAAC
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
1997 A* conf
Combinatorial Optimization Games.
SODA
Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi
1997 J jnl
Complexity of the Minimum Base Game on Matroids.
Math. Oper. Res.
Hiroshi Nagamochi, Dao-Zhi Zeng, Naohisa Kabutoya, Toshihide Ibaraki
1997 J jnl
Computing All Small Cuts in an Undirected Network.
SIAM J. Discret. Math.
Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki
1997 A* conf
Computing Edge-Connectivity Augmentation Function in Õ(nm) Time.
SODA
Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki
1997 J jnl
Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs.
J. Comb. Optim.
Hiroshi Nagamochi, Toshihide Ibaraki
1997 J jnl
Hitting or avoiding balls in Euclidean space.
Ann. Oper. Res.
Yves Crama, Toshihide Ibaraki
1997 J jnl
Logical analysis of numerical data.
Math. Program.
Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
1997 B conf
Monotone Extensions of Boolean Data Sets.
ALT
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1997 B conf
Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited.
ICCCN
Toshihide Ibaraki, Tiko Kameda
1997 J jnl
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle.
SIAM J. Comput.
Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami
1997 J jnl
Positive and Horn Decomposability of Partially Defined Boolean Functions.
Discret. Appl. Math.
Kazuhisa Makino, Kojin Yano, Toshihide Ibaraki
1997 J jnl
Preface.
Ann. Oper. Res.
Rainer E. Burkard, Toshihide Ibaraki, Maurice Queyranne
1997 B conf
Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract).
ISAAC
Toshihide Ibaraki
1997 J jnl
The Maximum Latency and Identification of Positive Boolean Functions.
SIAM J. Comput.
Kazuhisa Makino, Toshihide Ibaraki
1997 B conf
Two-Face Horn Extensions.
ISAAC
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
1997 J jnl
Vehicle scheduling on a tree with release and handling times.
Ann. Oper. Res.
Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
1996 — conf
Boolean Analysis of Incomplete Examples.
SWAT
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
1996 — conf
Data Analysis by Positive Decision Trees.
CODAS
Kazuhisa Makino, Takashi Suda, Kojin Yano, Toshihide Ibaraki
1996 A* conf
Deterministic
STOC
Hiroshi Nagamochi, Toshihide Ibaraki
1996 J jnl
Interior and Exterior Functions of Boolean Functions.
Discret. Appl. Math.
Kazuhisa Makino, Toshihide Ibaraki
1996 — conf
Metaheuristics as Robust and Simple Optimization Tools.
International Conference on Evolutionary Computation
Mutsunori Yagiura, Toshihide Ibaraki
1995 B conf
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions.
ISAAC
Kazuhisa Makino, Toshihide Ibaraki
1995 B conf
A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem.
IPCO
Hiroshi Nagamochi, Toshihide Ibaraki
1995 J jnl
Complexity of Identification and Dualization of Positive Boolean Functions.
Inf. Comput.
Jan C. Bioch, Toshihide Ibaraki
1995 J jnl
Decomposability of Partially Defined Boolean Functions.
Discret. Appl. Math.
Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
1995 J jnl
Decompositions of positive self-dual boolean functions.
Discret. Math.
Jan C. Bioch, Toshihide Ibaraki
1995 J jnl
Generating and Approximating Nondominated Coteries.
IEEE Trans. Parallel Distributed Syst.
Jan C. Bioch, Toshihide Ibaraki
1995 J jnl
Optimal Coteries for Rings and Related Networks.
Distributed Comput.
Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda
1995 J jnl
Preface.
Ann. Oper. Res.
Rainer E. Burkard, Toshihide Ibaraki, Maurice Queyranne
1995 J jnl
Preface.
Discret. Appl. Math.
Komei Fukuda, Toshihide Ibaraki
1995 B conf
Two Arc Disjoint Paths in Eulerian Diagraphs.
ISAAC
András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
1994 B conf
Computing All Small Cuts in Undirected Networks.
ISAAC
Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki
1994 J jnl
Implementing an efficient minimum capacity cut algorithm.
Math. Program.
Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki
1994 J jnl
Logically Instantaneous Message Passing in Asynchronous Distributed Systems.
IEEE Trans. Computers
Terunao Soneoka, Toshihide Ibaraki
1994 B conf
The Maximum Latency and Identification of Positive Boolean Functions.
ISAAC
Kazuhisa Makino, Toshihide Ibaraki
1993 J jnl
A Theory of Coteries: Mutual Exclusion in Distributed Systems.
IEEE Trans. Parallel Distributed Syst.
Toshihide Ibaraki, Tiko Kameda
1993 J jnl
A globally convergent Newton method for solving strongly monotone variational inequalities.
Math. Program.
Kouichi Taji, Masao Fukushima, Toshihide Ibaraki
1993 J jnl
On sparse subgraphs preserving connectivity properties.
J. Graph Theory
András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
1993 B conf
Vehicle Scheduling on a Tree with Release and Handling Times.
ISAAC
Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
1992 J jnl
A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph.
Algorithmica
Hiroshi Nagamochi, Toshihide Ibaraki
1992 J jnl
A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control.
Discret. Appl. Math.
Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
1992 B ed.
Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings
ISAAC
Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
1992 J jnl
Computing Edge-Connectivity in Multigraphs and Capacitated Graphs.
SIAM J. Discret. Math.
Hiroshi Nagamochi, Toshihide Ibaraki
1992 J jnl
On the average optimality of circular assignment policy.
Queueing Syst. Theory Appl.
Koichi Nakade, Masamitsu Ohnishi, Toshihide Ibaraki, Katsuhisa Ohno
1992 A conf
Optimal Coteries for Rings and Related Networks.
ICDCS
Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda
1992 J jnl
Optimal strategies for some team games.
Discret. Appl. Math.
Naoki Katoh, Junji Koyanagi, Masamitsu Ohnishi, Toshihide Ibaraki
1992 J jnl
Primal-dual proximal point algorithm for linearly constrained convex programming problems.
Comput. Optim. Appl.
Satoru Ibaraki, Masao Fukushima, Toshihide Ibaraki
1991 — conf
Boolean theory of coteries.
SPDP
Toshihide Ibaraki, Tiko Kameda
1991 J jnl
Chain Packing in Graphs.
Algorithmica
Shigeru Masuyama, Toshihide Ibaraki
1991 — conf
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time.
ISA
Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami
1991 J jnl
Maximum flows in probabilistic networks.
Networks
Hiroshi Nagamochi, Toshihide Ibaraki
1991 C conf
Using Relaxation Techniques to Evaluate Queries in Deductive Databases.
DEXA
Susumu Suzuki, Toshihide Ibaraki, Masahichi Kishi
1991 J jnl
Weak Three-Linking in Eulerian Digraphs.
SIAM J. Discret. Math.
Toshihide Ibaraki, Svatopluk Poljak
1990 — ed.
Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings
SIGAL International Symposium on Algorithms
Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki
1990 — conf
Computing Edge-Connectivity in Multiple and Capacitated Graphs.
SIGAL International Symposium on Algorithms
Hiroshi Nagamochi, Toshihide Ibaraki
1990 J jnl
Distributed database concurrency control by cautious schedulers with a central clock site.
Syst. Comput. Jpn.
Jigui Li, Toshihide Ibaraki
1990 J jnl
Multicommodity flows in certain planar directed networks.
Discret. Appl. Math.
Hiroshi Nagamochi, Toshihide Ibaraki
1990 J jnl
Multiversion Cautious Schedulers for Database Concurrency Control.
IEEE Trans. Software Eng.
Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
1990 J jnl
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices.
Math. Oper. Res.
Yves Crama, Peter L. Hammer, Toshihide Ibaraki
1990 J jnl
Preface.
Discret. Appl. Math.
Toshihide Ibaraki
1990 J jnl
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities.
Networks
Hiroshi Nagamochi, Masao Fukushima, Toshihide Ibaraki
1990 J jnl
Searching Minimax Game Trees under Memory Space Constraint.
Ann. Math. Artif. Intell.
Toshihide Ibaraki, Naoki Katoh
1989 J jnl
On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks.
Inf. Process. Lett.
Hiroshi Nagamochi, Toshihide Ibaraki
1989 J jnl
On the Efficiency of Cautious Schedulers for Database Concurrency Control - Why Insist on Two-Phase Locking?
Real Time Syst.
Shojiro Nishio, Shinichi Taniguchi, Toshihide Ibaraki
1988 J jnl
Cautious Transaction Schedulers for Database Concurrency Control.
IEEE Trans. Software Eng.
Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
1988 J jnl
Cautious Transaction Schedulers with k Versions.
Syst. Comput. Jpn.
Makoto Takeda, Shigeru Masuyama, Toshihide Ibaraki
1988 J jnl
Computational complexity of the file allocation problem in distributed database systems.
Syst. Comput. Jpn.
Hiroshi Yamasaki, Tomio Hirata, Masaharu Imai, Toshihide Ibaraki
1988 J jnl
Game Solving Procedure SSSR is Unsurpassed.
Syst. Comput. Jpn.
Yoshiroh Katoh, Toshihide Ibaraki
1988 J jnl
Reconfiguration of a fault-tolerant rectangular systolic array.
Syst. Comput. Jpn.
Yoshinao Suzuki, Tomio Hirata, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki
1988 — book
Resource allocation problems - algorithmic approaches.
Toshihide Ibaraki, Naoki Katoh
1987 J jnl
A Cautious Scheduler for Multistep Transactions.
Algorithmica
Naoki Katoh, Tiko Kameda, Toshihide Ibaraki
1987 J jnl
A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy.
Syst. Comput. Jpn.
Tohru Naoi, Masafumi Yamashita, Toshihide Ibaraki, Namio Honda
1987 J jnl
A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program.
Discret. Appl. Math.
Naoki Katoh, Toshihide Ibaraki
1987 J jnl
Approximation algorithms for combinatorial fractional programming problems.
Math. Program.
Satoru Hashizume, Masao Fukushima, Naoki Katoh, Toshihide Ibaraki
1987 J jnl
Parallel searches of game trees.
Syst. Comput. Jpn.
Hiromoto Usui, Masafumi Yamashita, Masaharu Imai, Toshihide Ibaraki
1987 J jnl
Preface.
Discret. Appl. Math.
Toshihide Ibaraki, Masao Iri
1987 J jnl
Serializability with Constraints.
ACM Trans. Database Syst.
Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura
1987 J jnl
Shortest Semijoin Schedule for a Local Area Distributed Database System.
IEEE Trans. Software Eng.
Shigeru Masuyama, Toshihide Ibaraki, Shojiro Nishio, Toshiharu Hasegawa
1986 J jnl
Distances defined by neighborhood sequences.
Pattern Recognit.
Masafumi Yamashita, Toshihide Ibaraki
1986 J jnl
Generalization of Alpha-Beta and SSS Search Procedures.
Artif. Intell.
Toshihide Ibaraki
1986 — conf
Implementation of Parallel Prolog on Tree Machines.
FJCC
Hajime Miura, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki
1986 J jnl
Lower bounds on time complexity for some subgraph detection problems.
Syst. Comput. Jpn.
Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda
1986 J jnl
Strong unimodularity for matrices and hypergraphs.
Discret. Appl. Math.
Yves Crama, Peter L. Hammer, Toshihide Ibaraki
1985 J jnl
An Algorithm for the Equipollent Resource Allocation Problem.
Math. Oper. Res.
Naoki Katoh, Toshihide Ibaraki, Hisashi Mine
1985 J jnl
An efficient algorithm for the parametric resource allocation problem.
Discret. Appl. Math.
Naoki Katoh, Toshihide Ibaraki
1985 J jnl
Cautious Transaction Schedulers with Admission Control.
ACM Trans. Database Syst.
Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
1985 J jnl
Evaluation of the File Redundancy in Distributed Database Systems.
IEEE Trans. Software Eng.
Shojiro Muro, Toshihide Ibaraki, Hidehiro Miyajima, Toshiharu Hasegawa
1984 J jnl
On the Optimal Nesting Order for Computing N-Relational Joins.
ACM Trans. Database Syst.
Toshihide Ibaraki, Tiko Kameda
1983 J jnl
Design of Minimum-Cost Deadlock-Free Systems
J. ACM
Toshihide Ibaraki, Hussein M. Abdel-Wahab, Tiko Kameda
1983 A* conf
Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract).
VLDB
Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura
1983 A* conf
File Redundancy Issues in Distributed Database Systems.
VLDB
Shojiro Muro, Toshihide Ibaraki, Hidehiro Miyajima, Toshiharu Hasegawa
1983 J jnl
On-Line Computation of Transitive Closures of Graphs.
Inf. Process. Lett.
Toshihide Ibaraki, Naoki Katoh
1983 J jnl
Parametric approaches to fractional programs.
Math. Program.
Toshihide Ibaraki
1983 J jnl
Using branch-and-bound algorithms to obtain suboptimal solutions.
Z. Oper. Research
Toshihide Ibaraki, Shojiro Muro, T. Murakami, Toshiharu Hasegawa
1982 J jnl
An efficient algorithm for K shortest simple paths.
Networks
Naoki Katoh, Toshihide Ibaraki, Hisashi Mine
1982 J jnl
Deadlock-Free Systems for a Bounded Number of Processes.
IEEE Trans. Computers
Toshihide Ibaraki, Tsunehiko Kameda
1981 J jnl
An Algorithm for Finding K Minimum Spanning Trees.
SIAM J. Comput.
Naoki Katoh, Toshihide Ibaraki, Hisashi Mine
1981 J jnl
An Algorithm for the K Best Solutions of the Resource Allocation Problem.
J. ACM
Naoki Katoh, Toshihide Ibaraki, Hisashi Mine
1981 J jnl
On Minimal Test Sets for Locating Single Link Failures in Networks.
IEEE Trans. Computers
Toshihide Ibaraki, Tsunehiko Kameda, Shunichi Toida
1980 J jnl
The number of additional variables required for the integer programming formulation.
Discret. Appl. Math.
Toshihide Ibaraki
1978 J jnl
A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times.
Oper. Res.
Hiroshi Kise, Toshihide Ibaraki, Hisashi Mine
1978 J jnl
Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems
Inf. Control.
Toshihide Ibaraki
1978 J jnl
Depth-
Int. J. Parallel Program.
Toshihide Ibaraki
1978 J jnl
Finite Automata Having Cost Functions: Nondeterministic Models
Inf. Control.
Toshihide Ibaraki
1977 J jnl
Fractional knapsack problems.
Math. Program.
Hiroaki Ishii, Toshihide Ibaraki, Hisashi Mine
1977 J jnl
The Power of Dominance Relations in Branch-and-Bound Algorithms.
J. ACM
Toshihide Ibaraki
1976 J jnl
Computational Efficiency of Approximate Branch-and-Bound Algorithms.
Math. Oper. Res.
Toshihide Ibaraki
1976 J jnl
Finite Automata Having Cost Functions
Inf. Control.
Toshihide Ibaraki
1976 J jnl
Theoretical comparisons of search strategies in branch-and-bound algorithms.
Int. J. Parallel Program.
Toshihide Ibaraki
1975 J jnl
Minimal Representations of Some Classes of Dynamic Programming
Inf. Control.
Toshihide Ibaraki
1974 J jnl
Classes of Discrete Optimization Problems and Their Decision Problems.
J. Comput. Syst. Sci.
Toshihide Ibaraki
1974 J jnl
Comments on "Monotone Functions in Sequential Circuits".
IEEE Trans. Computers
Toshihide Ibaraki
1973 J jnl
Fail-Safe Realization of Sequential Machines
Inf. Control.
Tadao Takaoka, Toshihide Ibaraki
1973 J jnl
Finite State Representations of Discrete Optimization Problems.
SIAM J. Comput.
Toshihide Ibaraki
1973 J jnl
Technical Note - The Use of Cuts in Complementary Programming.
Oper. Res.
Toshihide Ibaraki
1972 J jnl
An implicit enumeration program for zero-one integer programming.
Int. J. Parallel Program.
Toshihide Ibaraki, Tso-Kai Liu, Charles R. Baugh, Saburo Muroga
1972 J jnl
Design of Optimal Switching Networks by Integer Programming.
IEEE Trans. Computers
Saburo Muroga, Toshihide Ibaraki
1972 J jnl
N-Fail-Safe Sequential Machines.
IEEE Trans. Computers
Tadao Takaoka, Toshihide Ibaraki
1972 J jnl
Representation Theorems for Equivalent Optimization Problems
Inf. Control.
Toshihide Ibaraki
1971 J jnl
Gate-Interconnection Minimization of Switching Networks Using Negative Gates.
IEEE Trans. Computers
Toshihide Ibaraki
1971 J jnl
Synthesis of Networks with a Minimum Number of Negative Gates.
IEEE Trans. Computers
Toshihide Ibaraki, Saburo Muroga
1971 J jnl
Technical Note - Complementary Programming.
Oper. Res.
Toshihide Ibaraki
1971 J jnl
Technical Note - Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks.
Oper. Res.
Charles R. Baugh, Toshihide Ibaraki, Saburo Muroga
1970 J jnl
Adaptive Linear Classifier by Linear Programming.
IEEE Trans. Syst. Sci. Cybern.
Toshihide Ibaraki, Saburo Muroga
1968 J jnl
A Theory of Completely Monotonic Functions and its Applications to Threshold Logic.
IEEE Trans. Computers
Shuzo Yajima, Toshihide Ibaraki
1968 J jnl
On Autonomous Logic Nets of Threshold Elements.
IEEE Trans. Computers
Shuzo Yajima, Toshihide Ibaraki, I. Kawano
1968 J jnl
Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic.
IEEE Trans. Computers
Shuzo Yajima, Toshihide Ibaraki
1965 J jnl
A Lower Bound of the Number of Threshold Functions.
IEEE Trans. Electron. Comput.
Shuzo Yajima, Toshihide Ibaraki