98F 98S 99 00 01 02 03 04 05 06 07
No Articles
98F 98S 99 00 01 02 03 04 05 06 07
Endre Boros, T. Ibaraki, Kazuhisa Makino
Error-free and best-fit extensions of partially defined Boolean functions
Information and Computation, 140, 254-283
T. Eiter, T. Ibaraki, K. Makino
Double Horn functions
Information and Computation, 144, 155-190
T. Ibaraki, A. V. Karzanov, H. Nagamochi
A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations
Combinatorica, 18, 61-83
K. Makino, T. Ibaraki
A fast and simple algorithm for identifying 2-monotnic positive Boolean functions
Journal of Algorithms, 26, 291-305
H. Nagamochi, T. Ibaraki
A note on minimizing submodular functions
Information Processing Letters, 67, 239-244
K. Nonobe, T. Ibaraki
A tabu search approach for the constraint satisfaction problem as a general problem solver
European Journal of Operational Research, 106, 599-623
Andras Frank, T. Ibaraki, Hiroshi Nagamochi
Two arc-disjoint paths in Eulerian digraphs
SIAM Journal on Discrete Mathematics, 11, 557-589
Yushi Uno, T. Ibaraki
Reachability problems of random digraphs
IEICE Transactions on Fundamentals, E81-A, 2694-2702
M. Yagiura, T. Yamaguchi, T. Ibaraki
A variable depth search algorithm with branching search for the generalized assignment problem
Optimization Methods and Software, 10, 419-441
S. Umetani, M. Yagiura, T. Ibaraki
A Local Search Approach to the Pattern Restricted One Dimensional Cutting Stock Problem,Metaheuristics: Computer Decision-Making
, ,
M. Yagiura, T. Ibaraki, F. Glover
An Ejection Chain Approach for the Generalized Assignment Problem,INFORMS Journal on Computing
, ,
M. Yagiura, S. Iwasaki, T. Ibaraki, F. Glover
A Very Large-Scale Neighborhood Search Algorithm for the Multi-Resource Generalized Assignment Problem,Discrete Optimization
, ,
H. Ono, M. Yagiura, T. Ibaraki
A Decomposability Index in Logical Analysis of Data,Discrete Applied Mathematics
, ,
T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, M. Yagiura
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints,Transportation Science
, ,
S. Imahori, M. Yagiura, S. Umetani, S. Adachi, T. Ibaraki
Local Search Algorithms for the Two-Dimensional Cutting Stock Problem with a Given Number of Different Patterns,Metaheuristics: Progress as Real Problem Solvers
, ,
E. Boros, T. Ibaraki, H. Ichikawa, K. Nonobe, T. Uno, M. Yagiura
Heuristic Approaches to the Capacitated Square Covering Problem,Pacific Journal of Optimization
, ,
S. Imahori, M. Yagiura, T. Ibaraki
Improved Local Search Algorithms for the Rectangle Packing Problem with General Spatial Costs,European Journal of Operational Research
, ,
阿瀬始, 茨木俊秀
給油施設操業スケジューリング
システム制御情報学会論文誌, 11, 223-232
永持仁, 牧野和久, 曽道智, 村田真紀, 茨木俊秀
初等的フローゲームの凸性について
電子情報通信学会論文誌, J81-D-I, 666-676
98 99F 99S 00 01 02 03 04 05 06 07
Endre Boros, T. Ibaraki, Kazuhisa Makino
Logical analysis of binary data with missing bits
Artificial Intelligence, 107, 219-264
Kazuhisa Makino, Takashi Suda, Hirotaka Ono, T. Ibaraki
Data analysis by positive decision trees
IEICE Transactions on Information and Systems, E82-D, 76-88
E. Boros, T. Ibaraki, K. Makino
Logical analysis of binary data with missing bits
Artificial Intelligence, 107, 219-263
Kazuhisa Makino, T. Ibaraki
Inner-core and outer-core functions of partially defined Boolean functions
Discrete Applied Mathematics, 96-97, 443-460
Jan C. Bioch, T. Ibaraki, Kazuhisa Makino
Minimum self-dual decompositions of positive dual-minor Boolean fucntions
Discrete Applied Mathematics, 96-97, 307-326
Thomas Eiter, T. Ibaraki, Kazuhisa Makino
Bidual Horn functions and extensions
Discrete Applied Mathematics, 96-97, 55-88
Thomas Eiter, T. Ibaraki, Kazuhisa Makino
Computing intersections of Horn theories for reasoning with models
Artificial Intelligence, 110, 57-101
Mutsunori Yagiura, Takashi Yamaguchi, T. Ibaraki
A variable depth search algorithm for the generalized assignment problem
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, , 459-471
98 99F 99S 00 01 02 03 04 05 06 07
P. Eades, Q. Feng, H. Nagamochi
Drawing clustered graphs on an orthogonal grid
Journal of Graph Algorithms and Application, 3, 3-29
K. Makino, K. Hatanaka, T. Ibaraki
Horn extensions of a partially defined Boolean function
SIAM Journal on Computing, 28, 2168-2186
T. Ibaraki, A. Kogan, K. Makino
Functional Dependencies in Horn Theories
Artificial Intelligence, 108, 1-30
H. Nagamochi, T. Ibaraki
Augmenting edge-connectivity over the entire range in $\tilde{O}(nm)$ time
Journal of Algorithms, 30, 253-301
H. Nagamochi, T. Ibaraki
An approximation of the minimum vertex cover in a graph
Japan Journal of Industrial and Applied Mathematics, 16, 369-375
H. Nagamochi, T. Ishii, T. Ibaraki
A simple proof of a minimum cut algorithm and its applications
IEICE Transactions on Fundamentals, E82-A, 2231-2236
X. Deng, T. Ibaraki, H. Nagamochi
Algorithmic aspects of the core of combinatorial optimization gemes
Mathematics of Operations Research, 24, 751-766
M. Yagiura, T. Ibaraki
Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
Journal of Combinatorial Optimization, 3, 95-114
阿瀬始, 茨木俊秀, 柳浦睦憲
機械式立体駐車場スケジューリング
システム制御情報学会論文誌, 12, 417-427
98 99 00F 00S 01 02 03 04 05 06 07
H. Nagamochi
Recent development of graph connectivity augmentation algorithms
IEICE Transactions on Fundamentals, E83-D, 372-383
Takeaki Uno, M. Yagiura
Fast Algorithms to Enumerate All Common Intervals of Two Permutations
Algorithmica, 26, 290-309
H. Nagamochi, S. Nakamuram, T. Ibaraki
A simplified $\tilde {O}(nm)$ time edge-splitting algorithm in undirected graphs
Algorithmica, 26, 50-67
T. Ishii, H. Nagamochi, T. Ibaraki
Optimal augmentation of a 2-vertex-connected multigraph to an $l$-edge-connected and 3-vertex-connected multigraph
Joutnal of Combinatorial Optimization, 4, 35-78
H. Nagamochi, S. Katayama, T. Ibaraki
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
Journal of Combinatorial Optimization, 4, 151-169
Konstantin Kogan, T. Ibaraki
Optimal scheduling in parallel and serial manufacturing via the maximum principle
Journal of Global Optimization, 16, 271-294
H. Nagamochi, T. Ibaraki
Polyhedral structure of submodular and posimodular systems
Discrete Applied Mathematics, 107, 165-189
98 99 00F 00S 01 02 03 04 05 06 07
Endre Boros, Peter L. Hammer, T. Ibaraki, Alexander Kogan, Eddy Mayoraz, Ian Muchnik
An implementation of logical analysis of data
IEEE Transactions on Knowledge and Data Engineering, 12, 292-306
Xiaotie Deng, T. Ibaraki, H. Nagamochi, W. Zang
Totally balanced combinatorial optimization games
Mathematical Programming, Series A, 87
H. Nagamochi, Y. Nakao, T. Ibaraki
A fast algorithm for cactus representations of minimum cuts
Japan Journal of Industrial and Applied Mathematics, 17, 245-264
H. Nagamochi, T. Ibaraki
A fast algorithm for computing minimum 3-way and 4-way cuts
Mathematical Programming, 88, 507-520
Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, T. Ibaraki, Alexander Kogan
Boolean normal forms
shellability and reliability computations, SIAM Journal on Discrete Mathematics, 13
T. Ibaraki
Partially defined Boolean functions with applications to data analysis: A survey
Mathematica Japonica, 51, 153-165
H. Nagamochi, K. Seki, T. Ibaraki
A 7/3 approximation for the minimum weight 3-Connected spanning subgraph problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E83-A
Thomas Eiter, T. Ibaraki, Kazuhisa Makino
On the difference of Horn theories
Journal of Computer and System Sciences, 61, 478-507
阿瀬始, 茨木俊秀, 柳浦睦憲
機械式立体駐車場入出庫スケジューリング
システム制御情報学会論文誌, 13, 494-503
98 99 00 01F 01S 02 03 04 05 06 07
H. Nagamochi, T. Shiraki, T. Ibaraki
Augmenting a submodular and posi-modular set function by a multigraph
Journal of Combinatorial Optimization, 5, 175-212
Thomas Eiter, T. Ibaraki, K. Makino
Disjunctions of Horn theories and their cores
SIAM Journal on Computing, 31, 269-288
T. Ibaraki, Alexander Kogan, K. Makino
On functional dependencies in q-Horn theories
Artificial Intelligence, 131, 171-187
鈴木晋, 茨木俊秀
演繹データベースにおける直積問題クラスとそのアルゴリズム
情報処理学会論文誌, 42, 48-58
98 99 00 01F 01S 02 03 04 05 06 07
Kazuhisa Makino, Yushi Uno, T. Ibaraki
On minimum edge ranking spanning trees
Journal of Algorithms, 38, 411-437
Liang Zhao, Hiroshi Nagamochi, T. Ibaraki
Approximating the minimum $k$-way cut in a graph via minimum 3-way cuts
Journal of Combinatorial Optimization, 5, 397-410
Mutsunori Yagiura, T. Ibaraki
Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: Experimental evaluation
Journal of Heuristics, 7, 423-442
Rentzen Enkhbat, T. Ibaraki
Global optimization algorithms for general quadratic programming
Journal of the Mongolian Mathematical Society, 5, 22-56
Toshimasa Ishii, Hiroshi Nagamochi, T. Ibaraki
Multigraph augmentation under biconnectivity and general edge-connectivity requirements
Networks, 37, 144-155
Koji Nonobe, T. Ibaraki
An improved tabu search method for the weighted constraint satisfaction problem
INFOR, 39, 131-151
Hiroshi Nagamochi, K. Mochizuki, T. Ibaraki
Solving the single-vehicle scheduling problem for all home locations under depth-first routing on a tree
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, E84-A
98 99 00 01 02F 02S 03 04 05 06 07
Liang Zhao, H. Nagamochi, T. Ibaraki
A Note on Approximating the Survivable Network Design Problem in Hypergraphs
IEICE Transactions on Information and Systems, E85-D, 322-326
Thomas Eiter, T. Ibaraki, K. Makino
Recognition and dualization of disguised bidual Horn functions
Information Processing Letters, 82, 283-291
Takashi Horiyama, T. Ibaraki
Ordered binary decision diagrams as knowkedge-bases
Artificial Intelligence, 136, 189-213
Yoshiyuki Karuno, H. Nagamochi, T. Ibaraki
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
Networks, 39, 203-209
Daya Ram Gaur, T. Ibaraki, Ramesh Krishnamurti
Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem
Journal of Algorithms, 43, 138-152
Liang Zhao, H. Nagamochi, T. Ibaraki
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Discrete Applied Mathematics, 126, 253-267
Koji Nonobe, T. Ibaraki
Formulation and tabu search algorithm for the resource constrained project scheduling problem
Essays and Surveys in Metaheuristics (MIC'99), , Kluwer Academic Publishers
98 99 00 01 02F 02S 03 04 05 06 07
Hiroshi Nagamochi, T. Ibaraki
Graph connectivity and its augmentation: Applications of MA orderings
Discrete Applied Mathematics, Vol. 123, pp. 447--472
T. Eiter, T. Ibaraki, Kazuhisa Makino
Decision lists and related Boolean functions
Theoretical Computer Science, Vol. 270, pp. 493--524
Hiroshi Nagamochi, Tibor Jordan, Y. Nakao, T. Ibaraki
Convex embeddings and bisections of 3-connected graphs
Combinatorica, Vol. 22, No. 4
H. Ono, Kazuhisa Makino, T. Ibaraki
Logical analysis of data with decomposable structures
Theoretical Computer Science, Vol. 289, pp. 977--995
Kazuhisa Makino, Yushi Uno, T. Ibaraki
Minimum edge ranking spanning trees of threshold graphs
Algorithms and Computation (ISAAC2002); edited by P. Bose and P. Morin, , Lecture Notes in Computer Science
98 99 00 01 02 03F 03S 04 05 06 07
L. Zhao, Hiroshi Nagamochi, T. Ibaraki
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Discrete Applied Mathematics, Vol. 126, pp. 275--289
98 99 00 01 02 03F 03S 04 05 06 07
S. Umetani, M. Yagiura, T. Ibaraki
One-dimensional cutting stock problem to minimize the number of different patterns
European Journal of Operational Research, Vol. 146, pp. 388--402
L. Zhao, Hiroshi Nagamochi, T. Ibaraki
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem
Information Processing Letters, Vol. 86/2, pp. 63--70
T. Ibaraki, A. Kogan, Kazuhisa Makino
Inferring minimal functional dependencies in Horn and q-Horn theories
Annals of Mathematics and Artificial Intelligence, Vol. 38, pp. 233--255
S. Imahori, M. Yagiura, T. Ibaraki
Local search algorithms for the rectangle packing problem with general spatial costs
Mathematical Programming, Vol. B97, pp. 543--569
S. Umetani, M. Yagiura, T. Ibaraki
An LP-based local search to the one dimensional cutting stock problem using a given number of cutting patterns
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, Vol. E86-A
Kazuhisa Makino, H. Ono, T. Ibaraki
Interior and exterior functions of positive Boolean functions
Discrete Applied Mathematics, Vol. 130, pp. 417--436
E. Boros, T. Horiyama, T. Ibaraki, K. Makino, M. Yagiura
Finding essential attributes from binary data
Annals of Mathematics and Artificial Intelligence, Vol. 39, pp. 223--257
E. Boros, T. Ibaraki, K. Makino
Variations on extending partially defined Boolean functions with missing bits
Information and Computation, Vol. 180, pp. 53--70
Hiroshi Nagamochi, Y. Nishida, T. Ibaraki
Approximability of the minimum maximal matching problem in planar graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, Vol. E86-A
Susumu Suzuki, T. Ibaraki
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products
Discrete Mathematics, Vol. 273, pp. 211--220
R. Enkhbat, T. Ibaraki
On the maximization and minimization of a quasiconvex function
Journal of Nonlinear and Convex Analysis, Vol. 4, No. 1
T. Horiyama, T. Ibaraki
Translation among CNFs
characteristic models and ordered binary decision diagrams, Information Processing Letters, Vol. 85/4
S. Umetani, M. Yagiura, T. Ibaraki
A local search approach to the pattern restricted one dimensional cutting stock problem
Metaheuristics: Computer Decision-Making, , edited by M.G.C. Resende and J.P. de Sousa
98 99 00 01 02 03 04F 04S 05 06 07
No Articles
98 99 00 01 02 03 04F 04S 05 06 07
H. Nagamochi, N. Yamada
Counting edge crossings in a 2-layered drawing
Information Processing Letters, 91, 221-225
L. Zhao, H. Nagamochi, T. Ibaraki
On generalized greedy splitting algorithms for multiway partition problems
Discrete Applied Mathematics, 143, 1, 130-143
H. Nagamochi
Graph algorithms for network connectivity problems
Journal of Operations Research Society of Japan, 47, 4, 199-223
S. Umetani, M. Yagiura, T. Ibaraki
A Local Search Approach to the Pattern Restricted One Dimensional Cutting Stock Problem
Metaheuristics: Computer Decision-Making, , 673-698
M. Yagiura, T. Ibaraki, F. Glover
An Ejection Chain Approach for the Generalized Assignment Problem
INFORMS Journal on Computing, 16, 133-151
M. Yagiura, S. Iwasaki, T. Ibaraki, F. Glover
A Very Large-Scale Neighborhood Search Algorithm for the Multi-Resource Generalized Assignment Problem
Discrete Optimization, 1, 87-98
H. Ono, M. Yagiura, T. Ibaraki
A Decomposability Index in Logical Analysis of Data
Discrete Applied Mathematics, 142, 165-180
T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, M. Yagiura
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints
Transportation Science, , 206-232
98 99 00 01 02 03 04 05F 05S 06 07
No Articles
98 99 00 01 02 03 04 05F 05S 06 07
Y. Karuno, H. Nagamochi
Scheduling vehicles on trees
Pacific Journal of Optimization, 1, 527-543
H. Nagamochi, K. Iwata, T. Ishii
A robust algorithm for bisecting a triconnected graph with two resource sets
Theoretical Computer Science, A,341, 364-378
H. Nagamochi
A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph
Journal of Algorithms, 56, 77-95
H. Nagamochi
Packing unit squares in a rectangle
The Electronic Journal of Combinatorics, R37, 12, 1,
H. Nagamochi
Approximating the minmax rooted-subtree cover problem
Electron. Inform. Comm. Eng. Trans. Fundamentals, E88-A, 5, 1335-1338
H. Nagamochi
An improved bound on the one-sided minimum crossing number in two-layered drawings
Discrete and Computational Geometry, 33, 569-591
H. Nagamochi
On the one-sided crossing minimization in a bipartite graph with large degrees
Theoretical Computer Science, A, 332, 417-446
H. Nagamochi
On computing minimum (s,t)-cuts in digraphs
Information Processing Letters, 93, 5, 231-237
L. Zhao, H. Nagamochi, T. Ibaraki
A greedy splitting algorithm for approximating multiway partition problems
Mathematical Programming, 102, 1, 67-183
H. Nagamochi
On 2-approximation to the vertex-connectivity in graphs
Inst. Electron. Inform. Comm. Eng. Trans. Information and Systems, E88-D,1, 12-16
S. Imahori, M. Yagiura, S. Umetani, S. Adachi, T. Ibaraki
Local Search Algorithms for the Two-Dimensional Cutting Stock Problem with a Given Number of Different Patterns
Metaheuristics: Progress as Real Problem Solvers, , 181-202
E. Boros, T. Ibaraki, H. Ichikawa, K. Nonobe, T. Uno, M. Yagiura
Heuristic Approaches to the Capacitated Square Covering Problem
Pacific Journal of Optimization, 1, 465-490
S. Imahori, M. Yagiura, T. Ibaraki
Improved Local Search Algorithms for the Rectangle Packing Problem with General Spatial Costs
European Journal of Operational Research, 167, 48-67
98 99 00 01 02 03 04 05 06F 06S 07
No Articles
98 99 00 01 02 03 04 05 06F 06S 07
Y. Kamidoi, N. Yoshida, H. Nagamochi
A deterministic algorithm for finding all minimum k-way cuts
SIAM Journal on Computing, 36,5, 1329-1341
H. Nagamochi
Packing soft rectangles,International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science, 17, 5, 1165-1178
H. Ito, H. Nagamochi
Two equivalent measures on weighted hypergraphs,Discrete Applied Mathematics
Discrete Applied Mathematics, 154, 2330-2334
H. Nagamochi
Sparse connectivity certificates via MA orderings in graphs,Discrete Applied Mathematics
Discrete Applied Mathematics, 154, 2411-2417
T. Ishii, S. Yamamoto, H. Nagamochi
Augmenting forests to meet odd diameter requirements,Discrete Optimization
Discrete Optimization, 3, 2, 154-164
H. Nagamochi
A fast edge-splitting algorithm in edge-weighted graphs,Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals
Inst. Electron. Inform. Comm. Eng. Trans. Fundamentals, E89-A, 5, 1263-1268
H. Nagamochi, T. Kawada
Minmax subtree cover problem on cacti,Discrete Applied Mathematics
Discrete Applied Mathematics, 154, 8, 1254-1263
T. Ishii, H. Nagamochi, T. Ibaraki
Augmenting a (k-1)-vertex-connected multigraph to an l-edge-connected and k-vertex-connected multigraph
Algorithmica, 44, 3, 257-280
H. Nagamochi
Increasing the edge-connectivity by contracting a vertex subset
IEICE Transactions on Information and Systems, E89-D,2, 744-750
P. Eades, Q. Feng, X. Lin, H. Nagamochi
Straight-line drawing algorithms for hierarchical graphs,and clustered graphs
Algorithmica, 44, 1, 1-32
H. Hashimoto, T. Ibaraki, S. Imahori, M. Yagiura
The Vehicle Routing Problem with Flexible Time Windows and Traveling Times,Discrete Applied Mathematics
Discrete Applied Mathematics, 154, 2271-2290
98 99 00 01 02 03 04 05 06 07F 07S
No Articles
98 99 00 01 02 03 04 05 06 07F 07S
No Articles