Search Results1-20 of  24

  • 1 / 2
  • HONMA Hirotoshi ID: 9000251867649

    Articles in CiNii:1

    • An Optimal Algorithm for Finding Articulation Vertex of Circular Permutation Graphs (2013)
  • HONMA Hirotoshi ID: 9000291613117

    Articles in CiNii:1

    • An Algorithm for Identifying All Hinge Vertices on a Circular Permutation Graph (2015)
  • HONMA Hirotoshi ID: 9000004799555

    The author is with the Department of Information Engineering, Kushiro National College of Technology (2002 from CiNii)

    Articles in CiNii:1

    • A Parallel Algorithm for Finding All Hinge Vertices of a Trapezoid Graph (2002)
  • HONMA Hirotoshi ID: 9000004808475

    Department of Information Engineering, Kushiro National College of Technology (2001 from CiNii)

    Articles in CiNii:1

    • A Parallel Algorithm for Finding All Hinge Vertices of an Interval Graph (2001)
  • HONMA Hirotoshi ID: 9000006401344

    Articles in CiNii:31

    • A Case of Endobronchial Tuberculosis Associated with Bronchial Asthma Treated with High Doses of Inhaled Corticosteroid (2001)
    • Automatic Identification of Small Pulmonary Nodules on Follow-up CT scans Based on Non-rigid Image Registration (2010)
    • A Study on Extraction of Pulmonary Vascular with Discrimination of Nodules from Chest CT Image (2009)
  • HONMA Hirotoshi ID: 9000006929347

    Sapporo Medical University (2009 from CiNii)

    Articles in CiNii:1

    • Pulmonary Vessel Area Extraction with Application to Reduce False Positive of Nodule Detection in 3D Chest CT Data (2009)
  • HONMA Hirotoshi ID: 9000017682016

    Department of Information Engineering, Kushiro National College of Technology (2009 from CiNii)

    Articles in CiNii:1

    • An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs (2009)
  • HONMA Hirotoshi ID: 9000017688149

    Department of Information Engineering, Kushiro National College of Technology (2008 from CiNii)

    Articles in CiNii:1

    • An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph (2008)
  • HONMA Hirotoshi ID: 9000017688673

    Department of Information Engineering, Kushiro National College of Technology (2008 from CiNii)

    Articles in CiNii:1

    • An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs (2008)
  • HONMA Hirotoshi ID: 9000018820985

    Department of Information Engineering, Kushiro National College of Technology (2011 from CiNii)

    Articles in CiNii:1

    • An Algorithm for Minimum Feedback Vertex Set Problem on a Trapezoid Graph (2011)
  • HONMA Hirotoshi ID: 9000019937379

    Sapporo Medical University (2011 from CiNii)

    Articles in CiNii:1

    • Method for Matching Small Pulmonary Nodules That Is Robust to Temporal Changes on Follow-up Thoracic CT Images (2011)
  • HONMA Hirotoshi ID: 9000259337833

    the Department of Information Engineering, Kushiro National College of Technology (2013 from CiNii)

    Articles in CiNii:1

    • Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs (2013)
  • HONMA Hirotoshi ID: 9000263066613

    the Department of Information Engineering, Kushiro National College of Technology (2013 from CiNii)

    Articles in CiNii:1

    • A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs (2013)
  • HONMA Hirotoshi ID: 9000283209768

    Department of Information Engineering, Kushiro National College of Technology (2014 from CiNii)

    Articles in CiNii:1

    • Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs (2014)
  • HONMA Hirotoshi ID: 9000292181930

    Department of Information Engineering, National Institute of Technology, Kushiro College (2015 from CiNii)

    Articles in CiNii:1

    • Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph (2015)
  • HONMA Hirotoshi ID: 9000308386816

    National Institute of Technology (2014 from CiNii)

    Articles in CiNii:1

    • FAN-14-029 Extraction of Future Reference Expressions in Trend Information : (2014)
  • HONMA Hirotoshi ID: 9000308386824

    National Institute of Technology (2014 from CiNii)

    Articles in CiNii:1

    • FAN-14-032 An Algorithm for Minimum Feedback Vertex Set Problem on a Non-degenerate Circular-arc Graph : (2014)
  • HONMA Hirotoshi ID: 9000314380994

    Department of Information Engineering, National Institute of Technology, Kushiro College (2016 from CiNii)

    Articles in CiNii:1

    • A Method for Extraction of Future Reference Sentences Based on Semantic Role Labeling (2016)
  • HONMA Hirotoshi ID: 9000346992439

    Articles in CiNii:1

    • A Method for Extraction of Future Reference Sentences Based on Semantic Role Labeling (2016)
  • Hirotoshi HONMA ID: 9000018743947

    Department of Information Engineering, Kushiro National College of Technology (2011 from CiNii)

    Articles in CiNii:1

    • Efficient Algorithm for Minimum Feedback Vertex Set Problem on Trapezoid Graphs (2011)
  • 1 / 2
Page Top