Search Results1-20 of  85

  • 1 / 5
  • NAGAMOCHI HIROSHI ID: 9000241892109

    Articles in CiNii:1

    • Enumerating Colored and Rooted Outerplanar Graphs (アルゴリズム(AL) Vol.2010-AL-129) (2010)
  • NAGAMOCHI HIROSHI ID: 9000241954793

    Articles in CiNii:1

    • Accelerating A* algorithms by sweeping out small-degree nodes (アルゴリズム(AL) Vol.2011-AL-134) (2011)
  • Hiroshi Nagamochi ID: 9000018788961

    Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University (2012 from CiNii)

    Articles in CiNii:1

    • Protein complex prediction via improved verification methods using constrained domain-domain matching (2012)
  • Hiroshi Nagamochi ID: 9000363176791

    Articles in CiNii:1

    • An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs (2017)
  • Hiroshi Nagamochi ID: 9000363176795

    Articles in CiNii:1

    • Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route (2017)
  • Hiroshi Nagamochi ID: 9000394054531

    Articles in CiNii:1

    • Two Comments on the Subtour Exchange Crossover Operator (1995)
  • Hiroshi Nakashima ID: 9000006505412

    Articles in CiNii:13

    • Orthogonal Drawings for Plane Graphs with Specified Face Areas (2007)
    • A Memory-Efficient Algorithm and Its Implementation of Variable-Size All-to-All Communication (2009)
    • An Efficient Vector Transfer for Sparse Matrix-Vector Multiplication on Distributed Memory Systems (2010)
  • NAGAMOCHI HIROSHI ID: 9000006713379

    Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University (2008 from CiNii)

    Articles in CiNii:1

    • A Clustering Method for Analysis of Sequence Similarity Networks of Proteins Using Maximal Components of Graphs (2008)
  • NAGAMOCHI HIROSHI ID: 9000254841472

    Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University (2008 from CiNii)

    Articles in CiNii:1

    • IMPROVED ALGORITHMS FOR ENUMERATING TREE-LIKE CHEMICAL GRAPHS WITH GIVEN PATH FREQUENCY (2008)
  • NAGAMOCHI Hiroshi ID: 1000070202231

    Kyoto University (2012 from CiNii)

    Articles in CiNii:129

    • A Routing Algorithm on a Storage Tank System (2005)
    • A Deterministic Algorithm for Finding All Minimum κ-Way Cuts (2005)
    • Optical Path Assignment Problem for Torus Lightwave Networks (1997)
  • NAGAMOCHI Hiroshi ID: 9000000969820

    Department of Applied Mathematics and Physics, Kyoto University (1999 from CiNii)

    Articles in CiNii:1

    • An Approximation of the Minimum Vertex Cover in a Graph (1999)
  • NAGAMOCHI Hiroshi ID: 9000000969859

    Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University (2000 from CiNii)

    Articles in CiNii:1

    • A Fast Algorithm for Cactus Representations of Minimum Cuts (2000)
  • NAGAMOCHI Hiroshi ID: 9000002764153

    Articles in CiNii:2

    • 最近のアルゴリズムから (1995)
    • 矩形パッキング問題に対する厳密解法(学生論文賞受賞論文要約) (2005)
  • NAGAMOCHI Hiroshi ID: 9000004796064

    The authors are with the Department of Applied Mathematics and Physics, Faculty of Informatics, Kyoto University (2000 from CiNii)

    Articles in CiNii:1

    • A 7/3-Approximation for the Minimum Weight 3-Connected Spanning Subgraph Problem (2000)
  • NAGAMOCHI Hiroshi ID: 9000004798281

    Department of Information and Computer Sciences, Toyohashi University of Technology (2001 from CiNii)

    Articles in CiNii:1

    • Solving the Single-Vehicle Scheduling Problem for All Home Locations under Depth-First Routing on a Tree (2001)
  • NAGAMOCHI Hiroshi ID: 9000004806824

    The Graduate School of Informatics, Kyoto University (2000 from CiNii)

    Articles in CiNii:1

    • Recent Development of Graph Connectivity Augmentation Algorithms (2000)
  • NAGAMOCHI Hiroshi ID: 9000004827426

    Department of Information and Computer Sciences, Toyohashi University of Technology (2003 from CiNii)

    Articles in CiNii:1

    • Approximability of the Minimum Maximal Matching Problem in Planar Graphs (2003)
  • NAGAMOCHI Hiroshi ID: 9000004833335

    Department of Information and Computer Sciences, Toyohashi University of Technology (2003 from CiNii)

    Articles in CiNii:1

    • Constructing a Cactus for Minimum Cuts of a Graph in O(mn + n^2log n) Time and O(m) Space (2003)
  • NAGAMOCHI Hiroshi ID: 9000004835883

    the Department of Applied Mathematics and Physics, Kyoto University (2005 from CiNii)

    Articles in CiNii:1

    • On 2-Approximation to the Vertex-Connectivity in Graphs (2005)
  • NAGAMOCHI Hiroshi ID: 9000004870181

    Department of Information and Computer Sciences, Toyohashi University of Technology (2002 from CiNii)

    Articles in CiNii:1

    • A Note on Approximating the Survivable Network Design Problem in Hypergraphs^* (2002)
  • 1 / 5
Page Top