| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino |
Logical analysis of data: classification with justification.  |
Annals OR  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura |
Efficient branch-and-bound algorithms for weighted MAX-2-SAT. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki |
Recent progress of local search in handling the time window constraints of the vehicle routing problem. |
4OR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki |
Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options. |
APJOR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuki Matsumoto, Hiroyoshi Miwa, Toshihide Ibaraki |
Scheduling of corrugated paper production. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideki Hashimoto, Mutsunori Yagiura, Toshihide Ibaraki |
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki |
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns. |
IEICE Transactions |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura |
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura |
Hybrid Metaheuristics for Packing Problems. |
Hybrid Metaheuristics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Toshihide Nomura, Masahiro Sasaki |
Integer Programming Approaches to the Problem of Network Upgrading. |
SAINT |
2008 |
DBLP DOI BibTeX RDF |
network upgrading, integer programming, heuristic algorithm |
| 1 | Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki |
Duality in option pricing based on prices of other derivatives. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Susumu Suzuki, Toshihide Ibaraki |
The complexity of assigning genotypes to people in a pedigree consistently. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe, Toshihide Ibaraki, Arne Løkketangen |
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route. |
SLS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover |
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. |
SLS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki |
One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming. |
J. Math. Model. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Undirected multigraph, Graph augmentation, Deterministic algorithm, Edge-connectivity, Vertex-connectivity, Polynomial time approximation algorithm |
| 1 | Kazuya Haraguchi, Toshihide Ibaraki |
Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge. |
IEICE Transactions |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki |
A 3-flip neighborhood local search for the set covering problem. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover |
A path relinking approach with ejection chains for the generalized assignment problem. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura |
The vehicle routing problem with flexible time windows and traveling times. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki |
Minimum edge ranking spanning trees of split graphs. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Kouji Nakamura |
Packing Problems with Soft Rectangles. |
Hybrid Metaheuristics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Yann Vaxès, Xiao-guang Yang |
Lowering eccentricity of a tree by node upgrading. |
Networks |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki |
Improved local search algorithms for the rectangle packing problem with general spatial costs. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Shinji Imahori, Mikio Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura |
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. |
Transportation Science |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
Greedy splitting algorithms for approximating multiway partition problems. |
Math. Program. |
2005 |
DBLP DOI BibTeX RDF |
k-way cut, Multiterminal cut, Multiway partition problem, Approximation algorithm, Submodular function, Hypergraph partition |
| 1 | Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred Glover |
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. |
Discrete Optimization |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Horiyama, Toshihide Ibaraki |
Reasoning with ordered binary decision diagrams. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
On generalized greedy splitting algorithms for multiway partition problems. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki |
A decomposability index in logical analysis of data. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover |
An Ejection Chain Approach for the Generalized Assignment Problem. |
INFORMS Journal on Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Susumu Suzuki, Toshihide Ibaraki |
An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions. |
CCCG |
2004 |
DBLP BibTeX RDF |
|
| 1 | Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki |
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming. |
Hybrid Metaheuristics |
2004 |
DBLP BibTeX RDF |
|
| 1 | Takashi Horiyama, Toshihide Ibaraki |
Translation among CNFs, characteristic models and ordered binary decision diagrams. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Susumu Suzuki, Toshihide Ibaraki |
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Toshihide Ibaraki, Kazuhisa Makino |
Variations on extending partially defined Boolean functions with missing bits. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki |
One-dimensional cutting stock problem to minimize the number of different patterns. |
European Journal of Operational Research |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki |
Interior and exterior functions of positive Boolean functions. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki |
Local search algorithms for the rectangle packing problem with general spatial costs. |
Math. Program. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino |
Inferring Minimal Functional Dependencies in Horn and q-Horn Theories. |
Ann. Math. Artif. Intell. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura |
Finding Essential Attributes from Binary Data. |
Ann. Math. Artif. Intell. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono (eds.) |
Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings |
ISAAC |
2003 |
DBLP BibTeX RDF |
|
| 1 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
Recognition and dualization of disguised bidual Horn functions. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
Decision lists and related Boolean functions. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki |
Logical analysis of data with decomposable structures. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki |
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. |
Networks |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti |
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki |
Convex Embeddings and Bisections of 3-Connected Graphs 1. |
Combinatorica |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 05C40, 05C35 |
| 1 | Takashi Horiyama, Toshihide Ibaraki |
Ordered binary decision diagrams as knowledge-bases. |
Artif. Intell. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Toshihide Ibaraki |
Graph connectivity and its augmentation: applications of MA orderings. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki |
Minimum Edge Ranking Spanning Trees of Threshold Graphs. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Susumu Suzuki, Toshihide Ibaraki |
Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. |
J. Comb. Optim. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki |
Augmenting a Submodular and Posi-modular Set Function by a Multigraph. |
J. Comb. Optim. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
Multigraph augmentation under biconnectivity and general edge-connectivity requirements. |
Networks |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki |
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. |
J. Heuristics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki |
On Minimum Edge Ranking Spanning Trees. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven Noble, William R. Pulleyblank |
Preface. |
Annals OR |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki |
On metaheuristic algorithms for combinatorial optimization problems. |
Systems and Computers in Japan |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino |
On functional dependencies in q-Horn theories. |
Artif. Intell. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
Disjunctions of Horn Theories and Their Cores. |
SIAM J. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
A Unified Framework for Approximating Multiway Partition Problems. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki |
An Index for the Data Size to Extract Decomposable Structures in LAD. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
logical analysis of data, decomposable functions, Boolean functions, random graphs, probabilistic analysis, computational learning theory |
| 1 | Takashi Horiyama, Toshihide Ibaraki |
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya B. Muchnik |
An Implementation of Logical Analysis of Data. |
IEEE Trans. Knowl. Data Eng. |
2000 |
DBLP DOI BibTeX RDF |
Data mining, machine learning, classification, knowledge discovery, Boolean functions, patterns, decision support |
| 1 | Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki |
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. |
J. Comb. Optim. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. |
J. Comb. Optim. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki |
A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs. |
Algorithmica |
2000 |
DBLP DOI BibTeX RDF |
Edge splitting, Deterministic algorithm, Undirected graph, Polynomial algorithm, Minimum cut, Edge-connectivity, Multigraph |
| 1 | Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan |
Boolean Normal Forms, Shellability, and Reliability Computations. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Toshihide Ibaraki |
Polyhedral structure of submodular and posi-modular systems. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
On the Difference of Horn Theories. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti |
Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. |
ESA |
2000 |
DBLP DOI BibTeX RDF |
Rectangle Stabbing, Rectilinear Partitioning, Approximation Algorithms, Combinatorial Optimization |
| 1 | Endre Boros, Toshihide Ibaraki, Kazuhisa Makino |
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. |
IFIP TCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura |
Finding Essential Attributes in Binary Data. |
IDEAL |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki |
Logical Analysis of Data with Decomposable Structures. |
COCOON |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Horiyama, Toshihide Ibaraki |
Reasoning with Ordered Binary Decision Diagrams. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki |
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. |
J. Comb. Optim. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Toshihide Ibaraki |
Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
Computing Intersections of Horn Theories for Reasoning with Models. |
Artif. Intell. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino |
Functional Dependencies in Horn Theories. |
Artif. Intell. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Toshihide Ibaraki, Kazuhisa Makino |
Logical Analysis of Binary Data with Missing Bits. |
Artif. Intell. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
Bidual Horn Functions and Extensions. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Toshihide Ibaraki |
Inner-core and Outer-core Functions of Partially Defined Boolean Functions. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino |
Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Ken'ichi Hatanaka, Toshihide Ibaraki |
Horn Extensions of a Partially Defined Boolean Function. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. |
ESA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki |
On Minimum Edge Ranking Spanning Trees. |
MFCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
On the Difference of Horn Theories. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Toshihide Ibaraki |
A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. |
IPCO |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Toshihide Ibaraki |
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki |
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki |
Bisecting Two Subsets in 3-Connected Graphs. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Horiyama, Toshihide Ibaraki |
Ordered Binary Decision Diagrams as Knowledge-Bases. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Toshihide Ibaraki |
A Note on Minimizing Submodular Functions. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
Double Horn Functions. |
Inf. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Toshihide Ibaraki, Kazuhisa Makino |
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. |
Inf. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")