Toshihide Ibaraki

According to our database, Toshihide Ibaraki authored at least 236 papers between 1965 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Experimental Evaluation of ACO for Continuous Domains to Solve Function Optimization Problems.

Ryouei Takahashi, Yukihiro Nakamura, Toshihide Ibaraki

Proceedings of the Swarm Intelligence - 11th International Conference, 2018

Generalized Assignment Problem.

Wei Wu, Mutsunori Yagiura, Toshihide Ibaraki

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2013

Collision Probability in an In-Line Equipment Model under Erlang Distribution.

Eishi Chiba, Hiroshi Fujiwara, Yoshiyuki Sekiguchi, Toshihide Ibaraki

IEICE Trans. Inf. Syst., 2013

2011

Efficient branch-and-bound algorithms for weighted MAX-2-SAT.

Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura

Math. Program., 2011

Logical analysis of data: classification with justification.

Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino

Ann. Oper. Res., 2011

2010

A personal perspective on problem solving by general purpose solvers.

Toshihide Ibaraki

Int. Trans. Oper. Res., 2010

Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options.

Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki

Asia Pac. J. Oper. Res., 2010

Recent progress of local search in handling the time window constraints of the vehicle routing problem.

Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki

4OR, 2010

2009

Solving the irregular strip packing problem via guided local search for overlap minimization.

Shunji Umetani, Mutsunori Yagiura, Shinji Imahori, Takashi Imamichi, Koji Nonobe, Toshihide Ibaraki

Int. Trans. Oper. Res., 2009

Scheduling of corrugated paper production.

Kazuki Matsumoto, Hiroyoshi Miwa, Toshihide Ibaraki

Eur. J. Oper. Res., 2009

2008

Hybrid Metaheuristics for Packing Problems.

Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura

Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008

A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns.

Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki

IEICE Trans. Inf. Syst., 2008

An iterated local search algorithm for the time-dependent vehicle routing problem with time windows.

Hideki Hashimoto, Mutsunori Yagiura, Toshihide Ibaraki

Discret. Optim., 2008

An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.

Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura

Discret. Appl. Math., 2008

Integer Programming Approaches to the Problem of Network Upgrading.

Toshihide Ibaraki, Toshihide Nomura, Masahiro Sasaki

Proceedings of the 2008 International Symposium on Applications and the Internet, 2008

Algorithmic Aspects of Graph Connectivity

Hiroshi Nagamochi, Toshihide Ibaraki

Encyclopedia of Mathematics and its Applications 123, Cambridge University Press, ISBN: 9780511721649, 2008

2007

Generalized Assignment Problem.

Toshihide Ibaraki, Mutsunori Yagiura

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Duality in option pricing based on prices of other derivatives.

Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki

Oper. Res. Lett., 2007

The complexity of assigning genotypes to people in a pedigree consistently.

Susumu Suzuki, Toshihide Ibaraki

Discret. Math., 2007

A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem.

Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred W. Glover

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route.

Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe, Toshihide Ibaraki, Arne Løkketangen

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

Collision Probability in an Automated Production Line under Erlang Distribution.

Eishi Chiba, Hiroshi Fujiwara, Yoshiyuki Sekiguchi, Toshihide Ibaraki

Proceedings of the 2007 IEEE International Conference on Research, 2007

2006

One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming.

Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki

J. Math. Model. Algorithms, 2006

Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge.

Kazuya Haraguchi, Toshihide Ibaraki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

A 3-flip neighborhood local search for the set covering problem.

Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki

Eur. J. Oper. Res., 2006

A path relinking approach with ejection chains for the generalized assignment problem.

Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover

Eur. J. Oper. Res., 2006

Minimum edge ranking spanning trees of split graphs.

Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki

Discret. Appl. Math., 2006

The vehicle routing problem with flexible time windows and traveling times.

Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura

Discret. Appl. Math., 2006

Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph.

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki

Algorithmica, 2006

Packing Problems with Soft Rectangles.

Toshihide Ibaraki, Kouji Nakamura

Proceedings of the Hybrid Metaheuristics, Third International Workshop, 2006

2005

Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints.

Toshihide Ibaraki, Shinji Imahori, Mikio Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura

Transp. Sci., 2005

Lowering eccentricity of a tree by node upgrading.

Toshihide Ibaraki, Yann Vaxès, Xiao Guang Yang

Networks, 2005

Greedy splitting algorithms for approximating multiway partition problems.

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

Math. Program., 2005

Dynamic Generalized Assignment Problems with Stochastic Demands and Multiple Agent-Task Relationships.

Konstantin Kogan, Eugene Khmelnitsky, Toshihide Ibaraki

J. Glob. Optim., 2005

Improved local search algorithms for the rectangle packing problem with general spatial costs.

Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki

Eur. J. Oper. Res., 2005

2004

An Ejection Chain Approach for the Generalized Assignment Problem.

Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover

INFORMS J. Comput., 2004

An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Size of the Union of Cartesian Products.

Susumu Suzuki, Toshihide Ibaraki

Informatica (Slovenia), 2004

A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem.

Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred W. Glover

Discret. Optim., 2004

On generalized greedy splitting algorithms for multiway partition problems.

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

Discret. Appl. Math., 2004

A decomposability index in logical analysis of data.

Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki

Discret. Appl. Math., 2004

Reasoning with ordered binary decision diagrams.

Takashi Horiyama, Toshihide Ibaraki

Discret. Appl. Math., 2004

An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions.

Susumu Suzuki, Toshihide Ibaraki

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Local search algorithms for the rectangle packing problem with general spatial costs.

Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki

Math. Program., 2003

A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem.

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

Inf. Process. Lett., 2003

Translation among CNFs, characteristic models and ordered binary decision diagrams.

Takashi Horiyama, Toshihide Ibaraki

Inf. Process. Lett., 2003

An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns.

Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Approximability of the Minimum Maximal Matching Problem in Planar Graphs.

Hiroshi Nagamochi, Yukihiro Nishida, Toshihide Ibaraki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Variations on extending partially defined Boolean functions with missing bits.

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

Inf. Comput., 2003

One-dimensional cutting stock problem to minimize the number of different patterns.

Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki

Eur. J. Oper. Res., 2003

A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

Discret. Appl. Math., 2003

Interior and exterior functions of positive Boolean functions.

Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki

Discret. Appl. Math., 2003

Inferring Minimal Functional Dependencies in Horn and q-Horn Theories.

Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino

Ann. Math. Artif. Intell., 2003

Finding Essential Attributes from Binary Data.

Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura

Ann. Math. Artif. Intell., 2003

2002

Logical analysis of data with decomposable structures.

Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki

Theor. Comput. Sci., 2002

Decision lists and related Boolean functions.

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino

Theor. Comput. Sci., 2002

Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks.

Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki

Networks, 2002

Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.

Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti

J. Algorithms, 2002

Recognition and dualization of disguised bidual Horn functions.

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino

Inf. Process. Lett., 2002

Graph connectivity and its augmentation: applications of MA orderings.

Hiroshi Nagamochi, Toshihide Ibaraki

Discret. Appl. Math., 2002

Convex Embeddings and Bisections of 3-Connected Graphs 1.

Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki

Comb., 2002

Ordered binary decision diagrams as knowledge-bases.

Takashi Horiyama, Toshihide Ibaraki

Artif. Intell., 2002

Minimum Edge Ranking Spanning Trees of Threshold Graphs.

Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Disjunctions of Horn Theories and Their Cores.

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino

SIAM J. Comput., 2001

On metaheuristic algorithms for combinatorial optimization problems.

Mutsunori Yagiura, Toshihide Ibaraki

Syst. Comput. Jpn., 2001

Multigraph augmentation under biconnectivity and general edge-connectivity requirements.

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki

Networks, 2001

Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

J. Comb. Optim., 2001

Augmenting a Submodular and Posi-modular Set Function by a Multigraph.

Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki

J. Comb. Optim., 2001

On Minimum Edge Ranking Spanning Trees.

Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki

J. Algorithms, 2001

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation.

Mutsunori Yagiura, Toshihide Ibaraki

J. Heuristics, 2001

Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products.

Susumu Suzuki, Toshihide Ibaraki

Electron. Notes Discret. Math., 2001

Preface.

Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven D. Noble, William R. Pulleyblank

Ann. Oper. Res., 2001

On functional dependencies in q-Horn theories.

Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino

Artif. Intell., 2001

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

Proceedings of the STACS 2001, 2001

A Unified Framework for Approximating Multiway Partition Problems.

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

An Index for the Data Size to Extract Decomposable Structures in LAD.

Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

An Implementation of Logical Analysis of Data.

Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya B. Muchnik

IEEE Trans. Knowl. Data Eng., 2000

Boolean Normal Forms, Shellability, and Reliability Computations.

Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan

SIAM J. Discret. Math., 2000

A fast algorithm for computing minimum 3-way and 4-way cuts.

Hiroshi Nagamochi, Toshihide Ibaraki

Math. Program., 2000

Totally balanced combinatorial optimization games.

Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi, Wenan Zang

Math. Program., 2000

Optimal Scheduling in Parallel and Serial Manufacturing Systems via the Maximum Principle.

Konstantin Kogan, Toshihide Ibaraki

J. Glob. Optim., 2000

On the Difference of Horn Theories.

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino

J. Comput. Syst. Sci., 2000

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.

Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki

J. Comb. Optim., 2000

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph.

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki

J. Comb. Optim., 2000

Polyhedral structure of submodular and posi-modular systems.

Hiroshi Nagamochi, Toshihide Ibaraki

Discret. Appl. Math., 2000

A Simplified <i>Õ</i>(<i>nm</i>) Time Edge-Splitting Algorithm in Undirected Graphs.

Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki

Algorithmica, 2000

Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits.

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

Proceedings of the Theoretical Computer Science, 2000

Finding Essential Attributes in Binary Data.

Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura

Proceedings of the Intelligent Data Engineering and Automated Learning, 2000

Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.

Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti

Proceedings of the Algorithms, 2000

1999

Horn Extensions of a Partially Defined Boolean Function.

Kazuhisa Makino, Ken'ichi Hatanaka, Toshihide Ibaraki

SIAM J. Comput., 1999

Algorithmic Aspects of the Core of Combinatorial Optimization Games.

Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi

Math. Oper. Res., 1999

Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT.

Mutsunori Yagiura, Toshihide Ibaraki

J. Comb. Optim., 1999

Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time.

Hiroshi Nagamochi, Toshihide Ibaraki

J. Algorithms, 1999

Inner-core and Outer-core Functions of Partially Defined Boolean Functions.

Kazuhisa Makino, Toshihide Ibaraki

Discret. Appl. Math., 1999

Bidual Horn Functions and Extensions.

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino

Discret. Appl. Math., 1999

Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions.

Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino

Discret. Appl. Math., 1999

Functional Dependencies in Horn Theories.

Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino

Artif. Intell., 1999

Computing Intersections of Horn Theories for Reasoning with Models.

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino

Artif. Intell., 1999

Logical Analysis of Binary Data with Missing Bits.

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

Artif. Intell., 1999

Bisecting Two Subsets in 3-Connected Graphs.

Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph.

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki

Proceedings of the Algorithms, 1999

An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree.

Hiroshi Nagamochi, Toshihide Ibaraki

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Two Arc-Disjoint Paths in Eulerian Digraphs.

András Frank, Toshihide Ibaraki, Hiroshi Nagamochi

SIAM J. Discret. Math., 1998

A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions.

Kazuhisa Makino, Toshihide Ibaraki

J. Algorithms, 1998

A Note on Minimizing Submodular Functions.

Hiroshi Nagamochi, Toshihide Ibaraki

Inf. Process. Lett., 1998

Double Horn Functions.

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino

Inf. Comput., 1998

Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions.

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

Inf. Comput., 1998

A tabu search approach to the constraint satisfaction problem as a general problem solver.

Koji Nonobe, Toshihide Ibaraki

Eur. J. Oper. Res., 1998

A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations.

Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi

Comb., 1998

Preface: Mathematics of Industrial Systems III.

Rainer E. Burkard, Toshihide Ibaraki, William R. Pulleyblank

Ann. Oper. Res., 1998

On Disguised Double Horn Functions and Extensions.

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino

Proceedings of the STACS 98, 1998

Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph.

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT.

Mutsunori Yagiura, Toshihide Ibaraki

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Computing All Small Cuts in an Undirected Network.

Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki

SIAM J. Discret. Math., 1997

The Maximum Latency and Identification of Positive Boolean Functions.

Kazuhisa Makino, Toshihide Ibaraki

SIAM J. Comput., 1997

Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle.

Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami

SIAM J. Comput., 1997

Logical analysis of numerical data.

Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan

Math. Program., 1997

Complexity of the Minimum Base Game on Matroids.

Hiroshi Nagamochi, Dao-Zhi Zeng, Naohisa Kabutoya, Toshihide Ibaraki

Math. Oper. Res., 1997

Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs.

Hiroshi Nagamochi, Toshihide Ibaraki

J. Comb. Optim., 1997

Positive and Horn Decomposability of Partially Defined Boolean Functions.

Kazuhisa Makino, Kojin Yano, Toshihide Ibaraki

Discret. Appl. Math., 1997

Vehicle scheduling on a tree with release and handling times.

Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki

Ann. Oper. Res., 1997

Hitting or avoiding balls in Euclidean space.

Yves Crama, Toshihide Ibaraki

Ann. Oper. Res., 1997

Preface.

Rainer E. Burkard, Toshihide Ibaraki, Maurice Queyranne

Ann. Oper. Res., 1997

Computing Edge-Connectivity Augmentation Function in Õ(nm) Time.

Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Combinatorial Optimization Games.

Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Augmenting Edge and Vertex Connectivities Simultaneously.

Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract).

Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Two-Face Horn Extensions.

Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited.

Toshihide Ibaraki, Tiko Kameda

Proceedings of the International Conference On Computer Communications and Networks (ICCCN 1997), 1997

Monotone Extensions of Boolean Data Sets.

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996

Interior and Exterior Functions of Boolean Functions.

Kazuhisa Makino, Toshihide Ibaraki

Discret. Appl. Math., 1996

Boolean Analysis of Incomplete Examples.

Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

Proceedings of the Algorithm Theory, 1996

Deterministic <i>Õ</i>(nm) Time Edge-Splitting in Undirected Graphs.

Hiroshi Nagamochi, Toshihide Ibaraki

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Metaheuristics as Robust and Simple Optimization Tools.

Mutsunori Yagiura, Toshihide Ibaraki

Proceedings of 1996 IEEE International Conference on Evolutionary Computation, 1996

Data Analysis by Positive Decision Trees.

Kazuhisa Makino, Takashi Suda, Kojin Yano, Toshihide Ibaraki

Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications, 1996

1995

Generating and Approximating Nondominated Coteries.

Jan C. Bioch, Toshihide Ibaraki

IEEE Trans. Parallel Distributed Syst., 1995

Complexity of Identification and Dualization of Positive Boolean Functions.

Jan C. Bioch, Toshihide Ibaraki

Inf. Comput., 1995

Decompositions of positive self-dual boolean functions.

Jan C. Bioch, Toshihide Ibaraki

Discret. Math., 1995

Optimal Coteries for Rings and Related Networks.

Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda

Distributed Comput., 1995

Preface.

Komei Fukuda, Toshihide Ibaraki

Discret. Appl. Math., 1995

Decomposability of Partially Defined Boolean Functions.

Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan

Discret. Appl. Math., 1995

Two Arc Disjoint Paths in Eulerian Diagraphs.

András Frank, Toshihide Ibaraki, Hiroshi Nagamochi

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem.

Hiroshi Nagamochi, Toshihide Ibaraki

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Logically Instantaneous Message Passing in Asynchronous Distributed Systems.

Terunao Soneoka, Toshihide Ibaraki

IEEE Trans. Computers, 1994

Implementing an efficient minimum capacity cut algorithm.

Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki

Math. Program., 1994

Computing All Small Cuts in Undirected Networks.

Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

A Theory of Coteries: Mutual Exclusion in Distributed Systems.

Toshihide Ibaraki, Tiko Kameda

IEEE Trans. Parallel Distributed Syst., 1993

A globally convergent Newton method for solving strongly monotone variational inequalities.

Kouichi Taji, Masao Fukushima, Toshihide Ibaraki

Math. Program., 1993

On sparse subgraphs preserving connectivity properties.

András Frank, Toshihide Ibaraki, Hiroshi Nagamochi

J. Graph Theory, 1993

1992

Computing Edge-Connectivity in Multigraphs and Capacitated Graphs.

Hiroshi Nagamochi, Toshihide Ibaraki

SIAM J. Discret. Math., 1992

On the average optimality of circular assignment policy.

Koichi Nakade, Masamitsu Ohnishi, Toshihide Ibaraki, Katsuhisa Ohno

Queueing Syst. Theory Appl., 1992

Optimal strategies for some team games.

Naoki Katoh, Junji Koyanagi, Masamitsu Ohnishi, Toshihide Ibaraki

Discret. Appl. Math., 1992

A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control.

Naoki Katoh, Toshihide Ibaraki, Tiko Kameda

Discret. Appl. Math., 1992

Primal-dual proximal point algorithm for linearly constrained convex programming problems.

Satoru Ibaraki, Masao Fukushima, Toshihide Ibaraki

Comput. Optim. Appl., 1992

A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph.

Hiroshi Nagamochi, Toshihide Ibaraki

Algorithmica, 1992

Optimal Coteries for Rings and Related Networks.

Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda

Proceedings of the 12th International Conference on Distributed Computing Systems, 1992

1991

Weak Three-Linking in Eulerian Digraphs.

Toshihide Ibaraki, Svatopluk Poljak

SIAM J. Discret. Math., 1991

Maximum flows in probabilistic networks.

Hiroshi Nagamochi, Toshihide Ibaraki

Networks, 1991

Chain Packing in Graphs.

Shigeru Masuyama, Toshihide Ibaraki

Algorithmica, 1991

Boolean theory of coteries.

Toshihide Ibaraki, Tiko Kameda

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time.

Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami

Proceedings of the ISA '91 Algorithms, 1991

Using Relaxation Techniques to Evaluate Queries in Deductive Databases.

Susumu Suzuki, Toshihide Ibaraki, Masahichi Kishi

Proceedings of the Proceedings of the International Conference on Database and Expert Systems Applications, 1991

1990

Multiversion Cautious Schedulers for Database Concurrency Control.

Toshihide Ibaraki, Tiko Kameda, Naoki Katoh

IEEE Trans. Software Eng., 1990

Distributed database concurrency control by cautious schedulers with a central clock site.

Jigui Li, Toshihide Ibaraki

Syst. Comput. Jpn., 1990

Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities.

Hiroshi Nagamochi, Masao Fukushima, Toshihide Ibaraki

Networks, 1990

Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices.

Yves Crama, Peter L. Hammer, Toshihide Ibaraki

Math. Oper. Res., 1990

Multicommodity flows in certain planar directed networks.

Hiroshi Nagamochi, Toshihide Ibaraki

Discret. Appl. Math., 1990

Preface.

Toshihide Ibaraki

Discret. Appl. Math., 1990

Searching Minimax Game Trees under Memory Space Constraint.

Toshihide Ibaraki, Naoki Katoh

Ann. Math. Artif. Intell., 1990

Computing Edge-Connectivity in Multiple and Capacitated Graphs.

Hiroshi Nagamochi, Toshihide Ibaraki

Proceedings of the Algorithms, 1990

1989

On the Efficiency of Cautious Schedulers for Database Concurrency Control - Why Insist on Two-Phase Locking?

Shojiro Nishio, Shinichi Taniguchi, Toshihide Ibaraki

Real Time Syst., 1989

On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks.

Hiroshi Nagamochi, Toshihide Ibaraki

Inf. Process. Lett., 1989

1988

Cautious Transaction Schedulers for Database Concurrency Control.

Toshihide Ibaraki, Tiko Kameda, Naoki Katoh

IEEE Trans. Software Eng., 1988

Computational complexity of the file allocation problem in distributed database systems.

Hiroshi Yamasaki, Tomio Hirata, Masaharu Imai, Toshihide Ibaraki

Syst. Comput. Jpn., 1988

Cautious Transaction Schedulers with k Versions.

Makoto Takeda, Shigeru Masuyama, Toshihide Ibaraki

Syst. Comput. Jpn., 1988

Reconfiguration of a fault-tolerant rectangular systolic array.

Yoshinao Suzuki, Tomio Hirata, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki

Syst. Comput. Jpn., 1988

Game Solving Procedure SSSR is Unsurpassed.

Yoshiroh Katoh, Toshihide Ibaraki

Syst. Comput. Jpn., 1988

Resource allocation problems - algorithmic approaches.

Toshihide Ibaraki, Naoki Katoh

MIT Press series in the foundations of computing, MIT Press, ISBN: 978-0-262-09027-8, 1988

1987

Shortest Semijoin Schedule for a Local Area Distributed Database System.

Shigeru Masuyama, Toshihide Ibaraki, Shojiro Nishio, Toshiharu Hasegawa

IEEE Trans. Software Eng., 1987

Serializability with Constraints.

Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura

ACM Trans. Database Syst., 1987

Parallel searches of game trees.

Hiromoto Usui, Masafumi Yamashita, Masaharu Imai, Toshihide Ibaraki

Syst. Comput. Jpn., 1987

A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy.

Tohru Naoi, Masafumi Yamashita, Toshihide Ibaraki, Namio Honda

Syst. Comput. Jpn., 1987

Approximation algorithms for combinatorial fractional programming problems.

Satoru Hashizume, Masao Fukushima, Naoki Katoh, Toshihide Ibaraki

Math. Program., 1987

A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program.

Naoki Katoh, Toshihide Ibaraki

Discret. Appl. Math., 1987

Preface.

Toshihide Ibaraki, Masao Iri

Discret. Appl. Math., 1987

A Cautious Scheduler for Multistep Transactions.

Naoki Katoh, Tiko Kameda, Toshihide Ibaraki

Algorithmica, 1987

1986

Lower bounds on time complexity for some subgraph detection problems.

Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda

Syst. Comput. Jpn., 1986

Distances defined by neighborhood sequences.

Masafumi Yamashita, Toshihide Ibaraki

Pattern Recognit., 1986

Strong unimodularity for matrices and hypergraphs.

Yves Crama, Peter L. Hammer, Toshihide Ibaraki

Discret. Appl. Math., 1986

Generalization of Alpha-Beta and SSS Search Procedures.

Toshihide Ibaraki

Artif. Intell., 1986

Implementation of Parallel Prolog on Tree Machines.

Hajime Miura, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki

Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986

1985

Evaluation of the File Redundancy in Distributed Database Systems.

Shojiro Muro, Toshihide Ibaraki, Hidehiro Miyajima, Toshiharu Hasegawa

IEEE Trans. Software Eng., 1985

Cautious Transaction Schedulers with Admission Control.

Naoki Katoh, Toshihide Ibaraki, Tiko Kameda

ACM Trans. Database Syst., 1985

An Algorithm for the Equipollent Resource Allocation Problem.

Naoki Katoh, Toshihide Ibaraki, Hisashi Mine

Math. Oper. Res., 1985

An efficient algorithm for the parametric resource allocation problem.

Naoki Katoh, Toshihide Ibaraki

Discret. Appl. Math., 1985

1984

On the Optimal Nesting Order for Computing N-Relational Joins.

Toshihide Ibaraki, Tiko Kameda

ACM Trans. Database Syst., 1984

1983

Design of Minimum-Cost Deadlock-Free Systems

Toshihide Ibaraki, Hussein M. Abdel-Wahab, Tiko Kameda

J. ACM, October, 1983

Parametric approaches to fractional programs.

Toshihide Ibaraki

Math. Program., 1983

Using branch-and-bound algorithms to obtain suboptimal solutions.

Toshihide Ibaraki, Shojiro Muro, T. Murakami, Toshiharu Hasegawa

Z. Oper. Research, 1983

On-Line Computation of Transitive Closures of Graphs.

Toshihide Ibaraki, Naoki Katoh

Inf. Process. Lett., 1983

File Redundancy Issues in Distributed Database Systems.

Shojiro Muro, Toshihide Ibaraki, Hidehiro Miyajima, Toshiharu Hasegawa

Proceedings of the 9th International Conference on Very Large Data Bases, October 31, 1983

Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract).

Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura

Proceedings of the 9th International Conference on Very Large Data Bases, October 31, 1983

1982

Deadlock-Free Systems for a Bounded Number of Processes.

Toshihide Ibaraki, Tsunehiko Kameda

IEEE Trans. Computers, 1982

An efficient algorithm for K shortest simple paths.

Naoki Katoh, Toshihide Ibaraki, Hisashi Mine

Networks, 1982

1981

On Minimal Test Sets for Locating Single Link Failures in Networks.

Toshihide Ibaraki, Tsunehiko Kameda, Shunichi Toida

IEEE Trans. Computers, 1981

An Algorithm for Finding K Minimum Spanning Trees.

Naoki Katoh, Toshihide Ibaraki, Hisashi Mine

SIAM J. Comput., 1981

An Algorithm for the K Best Solutions of the Resource Allocation Problem.

Naoki Katoh, Toshihide Ibaraki, Hisashi Mine

J. ACM, 1981

1980

The number of additional variables required for the integer programming formulation.

Toshihide Ibaraki

Discret. Appl. Math., 1980

1978

Finite Automata Having Cost Functions: Nondeterministic Models

Toshihide Ibaraki

Inf. Control., April, 1978

Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems

Toshihide Ibaraki

Inf. Control., January, 1978

A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times.

Hiroshi Kise, Toshihide Ibaraki, Hisashi Mine

Oper. Res., 1978

Depth-<i>m</i> search in branch-and-bound algorithms.

Toshihide Ibaraki

Int. J. Parallel Program., 1978

1977

Fractional knapsack problems.

Hiroaki Ishii, Toshihide Ibaraki, Hisashi Mine

Math. Program., 1977

The Power of Dominance Relations in Branch-and-Bound Algorithms.

Toshihide Ibaraki

J. ACM, 1977

1976

Finite Automata Having Cost Functions

Toshihide Ibaraki

Inf. Control., June, 1976

Computational Efficiency of Approximate Branch-and-Bound Algorithms.

Toshihide Ibaraki

Math. Oper. Res., 1976

Theoretical comparisons of search strategies in branch-and-bound algorithms.

Toshihide Ibaraki

Int. J. Parallel Program., 1976

1975

Minimal Representations of Some Classes of Dynamic Programming

Toshihide Ibaraki

Inf. Control., April, 1975

1974

Comments on "Monotone Functions in Sequential Circuits".

Toshihide Ibaraki

IEEE Trans. Computers, 1974

Classes of Discrete Optimization Problems and Their Decision Problems.

Toshihide Ibaraki

J. Comput. Syst. Sci., 1974

1973

Fail-Safe Realization of Sequential Machines

Tadao Takaoka, Toshihide Ibaraki

Inf. Control., February, 1973

Finite State Representations of Discrete Optimization Problems.

Toshihide Ibaraki

SIAM J. Comput., 1973

Technical Note - The Use of Cuts in Complementary Programming.

Toshihide Ibaraki

Oper. Res., 1973

1972

Representation Theorems for Equivalent Optimization Problems

Toshihide Ibaraki

Inf. Control., December, 1972

N-Fail-Safe Sequential Machines.

Tadao Takaoka, Toshihide Ibaraki

IEEE Trans. Computers, 1972

Design of Optimal Switching Networks by Integer Programming.

Saburo Muroga, Toshihide Ibaraki

IEEE Trans. Computers, 1972

An implicit enumeration program for zero-one integer programming.

Toshihide Ibaraki, Tso-Kai Liu, Charles R. Baugh, Saburo Muroga

Int. J. Parallel Program., 1972

1971

Synthesis of Networks with a Minimum Number of Negative Gates.

Toshihide Ibaraki, Saburo Muroga

IEEE Trans. Computers, 1971

Gate-Interconnection Minimization of Switching Networks Using Negative Gates.

Toshihide Ibaraki

IEEE Trans. Computers, 1971

Technical Note - Complementary Programming.

Toshihide Ibaraki

Oper. Res., 1971

Technical Note - Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks.

Charles R. Baugh, Toshihide Ibaraki, Saburo Muroga

Oper. Res., 1971

1970

Adaptive Linear Classifier by Linear Programming.

Toshihide Ibaraki, Saburo Muroga

IEEE Trans. Syst. Sci. Cybern., 1970

1968

On Autonomous Logic Nets of Threshold Elements.

Shuzo Yajima, Toshihide Ibaraki, I. Kawano

IEEE Trans. Computers, 1968

Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic.

Shuzo Yajima, Toshihide Ibaraki

IEEE Trans. Computers, 1968

A Theory of Completely Monotonic Functions and its Applications to Threshold Logic.

Shuzo Yajima, Toshihide Ibaraki

IEEE Trans. Computers, 1968

1965

A Lower Bound of the Number of Threshold Functions.

Shuzo Yajima, Toshihide Ibaraki

IEEE Trans. Electron. Comput., 1965