The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Toshihide Ibaraki: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Toshihide Ibaraki, Tiko Kameda
    On the Optimal Nesting Order for Computing N-Relational Joins. [Citation Graph (29, 15)][DBLP]
    ACM Trans. Database Syst., 1984, v:9, n:3, pp:482-502 [Journal]
  2. Toshihide Ibaraki, Naoki Katoh
    On-Line Computation of Transitive Closures of Graphs. [Citation Graph (5, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:95-97 [Journal]
  3. Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
    Cautious Transaction Schedulers with Admission Control. [Citation Graph (3, 12)][DBLP]
    ACM Trans. Database Syst., 1985, v:10, n:2, pp:205-229 [Journal]
  4. Shojiro Muro, Toshihide Ibaraki, Hidehiro Miyajima, Toshiharu Hasegawa
    Evaluation of the File Redundancy in Distributed Database Systems. [Citation Graph (3, 0)][DBLP]
    IEEE Trans. Software Eng., 1985, v:11, n:2, pp:199-205 [Journal]
  5. Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura
    Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract). [Citation Graph (2, 9)][DBLP]
    VLDB, 1983, pp:89-91 [Conf]
  6. Naoki Katoh, Tiko Kameda, Toshihide Ibaraki
    A Cautious Scheduler for Multistep Transactions. [Citation Graph (2, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:1-26 [Journal]
  7. Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura
    Serializability with Constraints. [Citation Graph (2, 15)][DBLP]
    ACM Trans. Database Syst., 1987, v:12, n:3, pp:429-452 [Journal]
  8. Shigeru Masuyama, Toshihide Ibaraki, Shojiro Nishio, Toshiharu Hasegawa
    Shortest Semijoin Schedule for a Local Area Distributed Database System. [Citation Graph (2, 0)][DBLP]
    IEEE Trans. Software Eng., 1987, v:13, n:5, pp:602-606 [Journal]
  9. Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda
    Optimal Coteries for Rings and Related Networks. [Citation Graph (1, 0)][DBLP]
    Distributed Computing, 1995, v:8, n:4, pp:191-201 [Journal]
  10. Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
    Cautious Transaction Schedulers for Database Concurrency Control. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Software Eng., 1988, v:14, n:7, pp:997-1009 [Journal]
  11. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Computing Intersections of Horn Theories for Reasoning with Models. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:292-297 [Conf]
  12. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Monotone Extensions of Boolean Data Sets. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:161-175 [Conf]
  13. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:196-199 [Conf]
  14. Hiroshi Nagamochi, Toshihide Ibaraki
    An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:31-40 [Conf]
  15. Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
    A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:164-173 [Conf]
  16. Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
    Logical Analysis of Data with Decomposable Structures. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:396-406 [Conf]
  17. Mutsunori Yagiura, Toshihide Ibaraki
    Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:105-116 [Conf]
  18. Kazuhisa Makino, Takashi Suda, Kojin Yano, Toshihide Ibaraki
    Data Analysis by Positive Decision Trees. [Citation Graph (0, 0)][DBLP]
    CODAS, 1996, pp:257-264 [Conf]
  19. Susumu Suzuki, Toshihide Ibaraki, Masahichi Kishi
    Using Relaxation Techniques to Evaluate Queries in Deductive Databases. [Citation Graph (0, 0)][DBLP]
    DEXA, 1991, pp:67-72 [Conf]
  20. Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti
    Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:211-219 [Conf]
  21. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:414-425 [Conf]
  22. Hajime Miura, Masaharu Imai, Masafumi Yamashita, Toshihide Ibaraki
    Implementation of Parallel Prolog on Tree Machines. [Citation Graph (0, 0)][DBLP]
    FJCC, 1986, pp:287-296 [Conf]
  23. Toshihide Ibaraki, Kouji Nakamura
    Packing Problems with Soft Rectangles. [Citation Graph (0, 0)][DBLP]
    Hybrid Metaheuristics, 2006, pp:13-27 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    Hybrid Metaheuristics, 2004, pp:101-114 [Conf]
  25. Toshihide Ibaraki, Tiko Kameda
    Multi-frame Isochronous Service for ATM Networks: Stop-and-Go Revisited. [Citation Graph (0, 0)][DBLP]
    ICCCN, 1997, pp:4-10 [Conf]
  26. Toshihide Ibaraki, Hiroshi Nagamochi, Tiko Kameda
    Optimal Coteries for Rings and Related Networks. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1992, pp:650-656 [Conf]
  27. Mutsunori Yagiura, Toshihide Ibaraki
    Metaheuristics as Robust and Simple Optimization Tools. [Citation Graph (0, 0)][DBLP]
    International Conference on Evolutionary Computation, 1996, pp:541-546 [Conf]
  28. Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
    Finding Essential Attributes in Binary Data. [Citation Graph (0, 0)][DBLP]
    IDEAL, 2000, pp:133-138 [Conf]
  29. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:257-272 [Conf]
  30. Hiroshi Nagamochi, Toshihide Ibaraki
    A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:403-413 [Conf]
  31. Hiroshi Nagamochi, Toshihide Ibaraki
    A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:377-390 [Conf]
  32. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami
    Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:104-115 [Conf]
  33. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Two-Face Horn Extensions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:112-121 [Conf]
  34. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Disjunctions of Horn Theories and Their Cores. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:49-58 [Conf]
  35. András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
    Two Arc Disjoint Paths in Eulerian Diagraphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:92-101 [Conf]
  36. Takashi Horiyama, Toshihide Ibaraki
    Reasoning with Ordered Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:120-131 [Conf]
  37. Takashi Horiyama, Toshihide Ibaraki
    Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:231-243 [Conf]
  38. Takashi Horiyama, Toshihide Ibaraki
    Ordered Binary Decision Diagrams as Knowledge-Bases. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:83-92 [Conf]
  39. Toshihide Ibaraki
    Solving NP-hard Combinatorial Problems in the Practical Sense (Abstract). [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:1- [Conf]
  40. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Augmenting Edge and Vertex Connectivities Simultaneously. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:102-111 [Conf]
  41. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:159-168 [Conf]
  42. Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
    Vehicle Scheduling on a Tree with Release and Handling Times. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:486-495 [Conf]
  43. Kazuhisa Makino, Toshihide Ibaraki
    The Maximum Latency and Identification of Positive Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:324-332 [Conf]
  44. Kazuhisa Makino, Toshihide Ibaraki
    A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:291-300 [Conf]
  45. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
    Minimum Edge Ranking Spanning Trees of Threshold Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:428-440 [Conf]
  46. Hiroshi Nagamochi, Toshihide Ibaraki
    Polyhedral Structure of Submodular and Posi-modular Systems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:169-178 [Conf]
  47. Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
    Bisecting Two Subsets in 3-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:425-434 [Conf]
  48. Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki
    Computing All Small Cuts in Undirected Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:190-198 [Conf]
  49. Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
    An Index for the Data Size to Extract Decomposable Structures in LAD. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:279-290 [Conf]
  50. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    A Unified Framework for Approximating Multiway Partition Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:682-694 [Conf]
  51. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:373-382 [Conf]
  52. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
    On Minimum Edge Ranking Spanning Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:398-409 [Conf]
  53. Hiroshi Nagamochi, Toshihide Ibaraki
    Computing Edge-Connectivity in Multiple and Capacitated Graphs. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:12-20 [Conf]
  54. Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi
    Combinatorial Optimization Games. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:720-729 [Conf]
  55. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:280-289 [Conf]
  56. Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki
    Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:649-658 [Conf]
  57. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    On Disguised Double Horn Functions and Extensions. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:50-60 [Conf]
  58. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    On the Difference of Horn Theories. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:467-477 [Conf]
  59. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:478-489 [Conf]
  60. Hiroshi Nagamochi, Toshihide Ibaraki
    Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:64-73 [Conf]
  61. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Boolean Analysis of Incomplete Examples. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:440-451 [Conf]
  62. Shojiro Muro, Toshihide Ibaraki, Hidehiro Miyajima, Toshiharu Hasegawa
    File Redundancy Issues in Distributed Database Systems. [Citation Graph (0, 2)][DBLP]
    VLDB, 1983, pp:275-277 [Conf]
  63. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Logical Analysis of Binary Data with Missing Bits. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:107, n:2, pp:219-263 [Journal]
  64. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Computing Intersections of Horn Theories for Reasoning with Models. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:110, n:1, pp:57-101 [Journal]
  65. Takashi Horiyama, Toshihide Ibaraki
    Ordered binary decision diagrams as knowledge-bases. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:136, n:2, pp:189-213 [Journal]
  66. Toshihide Ibaraki
    Generalization of Alpha-Beta and SSS Search Procedures. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1986, v:29, n:1, pp:73-117 [Journal]
  67. Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
    On functional dependencies in q-Horn theories. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:131, n:1-2, pp:171-187 [Journal]
  68. Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
    Functional Dependencies in Horn Theories. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:108, n:1-2, pp:1-30 [Journal]
  69. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:3, pp:257-280 [Journal]
  70. Shigeru Masuyama, Toshihide Ibaraki
    Chain Packing in Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:6, pp:826-839 [Journal]
  71. Hiroshi Nagamochi, Toshihide Ibaraki
    A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:5&6, pp:583-596 [Journal]
  72. Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki
    A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:1, pp:50-67 [Journal]
  73. Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
    Finding Essential Attributes from Binary Data. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:39, n:3, pp:223-257 [Journal]
  74. Toshihide Ibaraki, Naoki Katoh
    Searching Minimax Game Trees under Memory Space Constraint. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:- [Journal]
  75. Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino
    Inferring Minimal Functional Dependencies in Horn and q-Horn Theories. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:38, n:4, pp:233-255 [Journal]
  76. Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi
    A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:1, pp:61-83 [Journal]
  77. Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
    Convex Embeddings and Bisections of 3-Connected Graphs 1. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:4, pp:537-554 [Journal]
  78. Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino
    Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:307-326 [Journal]
  79. Endre Boros, Vladimir Gurvich, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
    Decomposability of Partially Defined Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:51-75 [Journal]
  80. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Bidual Horn Functions and Extensions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:55-88 [Journal]
  81. Komei Fukuda, Toshihide Ibaraki
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:56, n:2-3, pp:99-100 [Journal]
  82. Takashi Horiyama, Toshihide Ibaraki
    Reasoning with ordered binary decision diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:151-163 [Journal]
  83. Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
    A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:4, pp:379-395 [Journal]
  84. Kazuhisa Makino, Toshihide Ibaraki
    Interior and Exterior Functions of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:69, n:3, pp:209-231 [Journal]
  85. Kazuhisa Makino, Toshihide Ibaraki
    Inner-core and Outer-core Functions of Partially Defined Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:443-460 [Journal]
  86. Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki
    Interior and exterior functions of positive Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:3, pp:417-436 [Journal]
  87. Kazuhisa Makino, Kojin Yano, Toshihide Ibaraki
    Positive and Horn Decomposability of Partially Defined Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:74, n:3, pp:251-274 [Journal]
  88. Hiroshi Nagamochi, Toshihide Ibaraki
    Polyhedral structure of submodular and posi-modular systems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:165-189 [Journal]
  89. Hiroshi Nagamochi, Toshihide Ibaraki
    Graph connectivity and its augmentation: applications of MA orderings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:447-472 [Journal]
  90. Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
    A decomposability index in logical analysis of data. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:165-180 [Journal]
  91. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
    Minimum edge ranking spanning trees of split graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2373-2386 [Journal]
  92. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:275-289 [Journal]
  93. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    On generalized greedy splitting algorithms for multiway partition problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:130-143 [Journal]
  94. Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura
    The vehicle routing problem with flexible time windows and traveling times. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2271-2290 [Journal]
  95. Susumu Suzuki, Toshihide Ibaraki
    Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:211-220 [Journal]
  96. Mutsunori Yagiura, Toshihide Ibaraki
    Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2001, v:7, n:5, pp:423-442 [Journal]
  97. Jan C. Bioch, Toshihide Ibaraki
    Complexity of Identification and Dualization of Positive Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:50-63 [Journal]
  98. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Variations on extending partially defined Boolean functions with missing bits. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:180, n:1, pp:53-70 [Journal]
  99. Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
    Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:140, n:2, pp:254-283 [Journal]
  100. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Double Horn Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:144, n:2, pp:155-190 [Journal]
  101. Toshihide Ibaraki
    Representation Theorems for Equivalent Optimization Problems [Citation Graph (0, 0)][DBLP]
    Information and Control, 1972, v:21, n:5, pp:397-435 [Journal]
  102. Toshihide Ibaraki
    Minimal Representations of Some Classes of Dynamic Programming [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:27, n:4, pp:289-328 [Journal]
  103. Toshihide Ibaraki
    Finite Automata Having Cost Functions [Citation Graph (0, 0)][DBLP]
    Information and Control, 1976, v:31, n:2, pp:153-176 [Journal]
  104. Toshihide Ibaraki
    Branch-and-Bound Procedure and State-Space Representation of Combinatorial Optimization Problems [Citation Graph (0, 0)][DBLP]
    Information and Control, 1978, v:36, n:1, pp:1-27 [Journal]
  105. Toshihide Ibaraki
    Finite Automata Having Cost Functions: Nondeterministic Models [Citation Graph (0, 0)][DBLP]
    Information and Control, 1978, v:37, n:1, pp:40-69 [Journal]
  106. Tadao Takaoka, Toshihide Ibaraki
    Fail-Safe Realization of Sequential Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1973, v:22, n:1, pp:31-55 [Journal]
  107. Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover
    An Ejection Chain Approach for the Generalized Assignment Problem. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2004, v:16, n:2, pp:133-151 [Journal]
  108. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Recognition and dualization of disguised bidual Horn functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:6, pp:283-291 [Journal]
  109. Takashi Horiyama, Toshihide Ibaraki
    Translation among CNFs, characteristic models and ordered binary decision diagrams. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:4, pp:191-198 [Journal]
  110. Hiroshi Nagamochi, Toshihide Ibaraki
    On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:6, pp:279-285 [Journal]
  111. Hiroshi Nagamochi, Toshihide Ibaraki
    A Note on Minimizing Submodular Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:5, pp:239-244 [Journal]
  112. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:2, pp:63-70 [Journal]
  113. Toshihide Ibaraki
    The Power of Dominance Relations in Branch-and-Bound Algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1977, v:24, n:2, pp:264-279 [Journal]
  114. Toshihide Ibaraki, Hussein M. Abdel-Wahab, Tiko Kameda
    Design of Minimum-Cost Deadlock-Free Systems [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:4, pp:736-751 [Journal]
  115. Naoki Katoh, Toshihide Ibaraki, H. Mine
    An Algorithm for the K Best Solutions of the Resource Allocation Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:752-764 [Journal]
  116. Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti
    Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:1, pp:138-152 [Journal]
  117. Kazuhisa Makino, Toshihide Ibaraki
    A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:2, pp:291-305 [Journal]
  118. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
    On Minimum Edge Ranking Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:2, pp:411-437 [Journal]
  119. Hiroshi Nagamochi, Toshihide Ibaraki
    Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:30, n:2, pp:253-301 [Journal]
  120. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:1, pp:35-77 [Journal]
  121. Mutsunori Yagiura, Toshihide Ibaraki
    Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:1, pp:95-114 [Journal]
  122. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:4, pp:397-410 [Journal]
  123. Hiroshi Nagamochi, Toshihide Ibaraki
    Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1997, v:1, n:1, pp:5-46 [Journal]
  124. Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
    A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:2, pp:151-169 [Journal]
  125. Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki
    Augmenting a Submodular and Posi-modular Set Function by a Multigraph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:2, pp:175-212 [Journal]
  126. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    On the Difference of Horn Theories. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:3, pp:478-507 [Journal]
  127. Toshihide Ibaraki
    Classes of Discrete Optimization Problems and Their Decision Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:8, n:1, pp:84-116 [Journal]
  128. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
    Logical analysis of numerical data. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:163-190 [Journal]
  129. Hiroshi Nagamochi, Tadashi Ono, Toshihide Ibaraki
    Implementing an efficient minimum capacity cut algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:67, n:, pp:325-341 [Journal]
  130. Kouichi Taji, Masao Fukushima, Toshihide Ibaraki
    A globally convergent Newton method for solving strongly monotone variational inequalities. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:58, n:, pp:369-383 [Journal]
  131. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki
    Greedy splitting algorithms for approximating multiway partition problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:1, pp:167-183 [Journal]
  132. Toshihide Ibaraki, Yann Vaxès, Xiao-guang Yang
    Lowering eccentricity of a tree by node upgrading. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:4, pp:232-239 [Journal]
  133. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Multigraph augmentation under biconnectivity and general edge-connectivity requirements. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:3, pp:144-155 [Journal]
  134. Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki
    Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:4, pp:203-209 [Journal]
  135. Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki
    Duality in option pricing based on prices of other derivatives. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:2, pp:165-171 [Journal]
  136. Masafumi Yamashita, Toshihide Ibaraki
    Distances defined by neighborhood sequences. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1986, v:19, n:3, pp:237-246 [Journal]
  137. Shojiro Nishio, Shinichi Taniguchi, Toshihide Ibaraki
    On the Efficiency of Cautious Schedulers for Database Concurrency Control - Why Insist on Two-Phase Locking? [Citation Graph (0, 0)][DBLP]
    Real-Time Systems, 1989, v:1, n:2, pp:177-195 [Journal]
  138. Mutsunori Yagiura, Toshihide Ibaraki
    On metaheuristic algorithms for combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
    Systems and Computers in Japan, 2001, v:32, n:3, pp:33-55 [Journal]
  139. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami
    Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:93-109 [Journal]
  140. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Disjunctions of Horn Theories and Their Cores. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:269-288 [Journal]
  141. Toshihide Ibaraki
    Finite State Representations of Discrete Optimization Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1973, v:2, n:3, pp:193-210 [Journal]
  142. Naoki Katoh, Toshihide Ibaraki, H. Mine
    An Algorithm for Finding K Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:247-255 [Journal]
  143. Kazuhisa Makino, Ken-ichi Hatanaka, Toshihide Ibaraki
    Horn Extensions of a Partially Defined Boolean Function. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2168-2186 [Journal]
  144. Kazuhisa Makino, Toshihide Ibaraki
    The Maximum Latency and Identification of Positive Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:5, pp:1363-1383 [Journal]
  145. Endre Boros, Yves Crama, Oya Ekin, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan
    Boolean Normal Forms, Shellability, and Reliability Computations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:2, pp:212-226 [Journal]
  146. András Frank, Toshihide Ibaraki, Hiroshi Nagamochi
    Two Arc-Disjoint Paths in Eulerian Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:4, pp:557-589 [Journal]
  147. Toshihide Ibaraki, Svatopluk Poljak
    Weak Three-Linking in Eulerian Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:84-98 [Journal]
  148. Hiroshi Nagamochi, Toshihide Ibaraki
    Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:1, pp:54-66 [Journal]
  149. Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki
    Computing All Small Cuts in an Undirected Network. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:3, pp:469-481 [Journal]
  150. Toshihide Ibaraki, Tsunehiko Kameda
    Deadlock-Free Systems for a Bounded Number of Processes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1982, v:31, n:3, pp:188-193 [Journal]
  151. Toshihide Ibaraki, Tsunehiko Kameda, Shunichi Toida
    On Minimal Test Sets for Locating Single Link Failures in Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:3, pp:182-190 [Journal]
  152. Terunao Soneoka, Toshihide Ibaraki
    Logically Instantaneous Message Passing in Asynchronous Distributed Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:5, pp:513-527 [Journal]
  153. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Decision lists and related Boolean functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:493-524 [Journal]
  154. Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
    Logical analysis of data with decomposable structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:977-995 [Journal]
  155. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya B. Muchnik
    An Implementation of Logical Analysis of Data. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2000, v:12, n:2, pp:292-306 [Journal]
  156. Jan C. Bioch, Toshihide Ibaraki
    Generating and Approximating Nondominated Coteries. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:9, pp:905-914 [Journal]
  157. Toshihide Ibaraki, Tiko Kameda
    A Theory of Coteries: Mutual Exclusion in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:7, pp:779-794 [Journal]
  158. Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
    Multiversion Cautious Schedulers for Database Concurrency Control. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1990, v:16, n:3, pp:302-315 [Journal]
  159. Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki
    A 3-flip neighborhood local search for the set covering problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:172, n:2, pp:472-499 [Journal]
  160. Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover
    A path relinking approach with ejection chains for the generalized assignment problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:169, n:2, pp:548-569 [Journal]
  161. Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki
    Improved local search algorithms for the rectangle packing problem with general spatial costs. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:167, n:1, pp:48-67 [Journal]
  162. Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
    One-dimensional cutting stock problem to minimize the number of different patterns. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:146, n:2, pp:388-402 [Journal]
  163. 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. [Citation Graph (0, 0)][DBLP]
    SLS, 2007, pp:192-196 [Conf]
  164. 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. [Citation Graph (0, 0)][DBLP]
    SLS, 2007, pp:121-135 [Conf]
  165. Jan C. Bioch, Toshihide Ibaraki
    Decompositions of positive self-dual boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:140, n:1-3, pp:23-46 [Journal]
  166. Susumu Suzuki, Toshihide Ibaraki
    The complexity of assigning genotypes to people in a pedigree consistently. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2122-2131 [Journal]

  167. Integer Programming Approaches to the Problem of Network Upgrading. [Citation Graph (, )][DBLP]


  168. Boolean theory of coteries. [Citation Graph (, )][DBLP]


  169. An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. [Citation Graph (, )][DBLP]


  170. Optimal strategies for some team games. [Citation Graph (, )][DBLP]


  171. Multicommodity flows in certain planar directed networks. [Citation Graph (, )][DBLP]


  172. Preface. [Citation Graph (, )][DBLP]


Search in 0.054secs, Finished in 0.063secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002