Akira Saito

According to our database1, Akira Saito authored at least 114 papers between 1983 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Pairs and triples of forbidden subgraphs and the existence of a 2-factor.
Journal of Graph Theory, 2019

Motion Accuracy Enhancement of Five-Axis Machine Tools by Modified CL-Data.
IJAT, 2018

Cycles with a chord in dense graphs.
Discrete Mathematics, 2018

Classification of lung adenocarcinoma transcriptome subtypes from pathological images using deep convolutional networks.
Int. J. Computer Assisted Radiology and Surgery, 2018

Spanning Trails with Maximum Degree at Most 4 in 2K2 -Free Graphs.
Graphs and Combinatorics, 2017

Toughness, binding number and restricted matching extension in a graph.
Discrete Mathematics, 2017

Edge proximity and matching extension in punctured planar triangulations.
Discrete Mathematics, 2017

CMOS Biosensor IC Focusing on Dielectric Relaxations of Biological Water With 120 and 60 GHz Oscillator Arrays.
J. Solid-State Circuits, 2016

Integrated pathway-based transcription regulation network mining and visualization based on gene expression profiles.
Journal of Biomedical Informatics, 2016

The Ryjáček closure and a forbidden subgraph.
Discussiones Mathematicae Graph Theory, 2016

Spanning trees homeomorphic to a small tree.
Discrete Mathematics, 2016

Extendability of the complementary prism of bipartite graphs.
Australasian J. Combinatorics, 2016

28.3 CMOS biosensor IC focusing on dielectric relaxations of biological water with 120GHz and 60GHz oscillator arrays.
Proceedings of the 2016 IEEE International Solid-State Circuits Conference, 2016

A novel overlap FFT filter-bank using windowing and smoothing techniques to reduce adjacent channel interference for flexible spectrum access.
Proceedings of the International Conference on Information and Communication Technology Convergence, 2016

Graphs and Combinatorics, 2015

Perfect matchings avoiding prescribed edges in a star-free graph.
Discrete Mathematics, 2015

Forbidden Triples Generating a Finite set of 3-Connected Graphs.
Electr. J. Comb., 2015

Deformation Estimation of Elastic Bodies Using Multiple Silhouette Images for Endoscopic Image Augmentation.
Proceedings of the 2015 IEEE International Symposium on Mixed and Augmented Reality, 2015

Design Method of Class-F Power Amplifier With Output Power of -20 dBm and Efficient Dual Supply Voltage Transmitter.
IEEE Trans. on Circuits and Systems, 2014

A note on graphs contraction-critical with respect to independence number.
Discrete Mathematics, 2014

Precoloring extension involving pairs of vertices of small distance.
Discrete Applied Mathematics, 2014

The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal-Erdös Condition.
SIAM J. Discrete Math., 2013

Forbidden subgraphs generating a finite set.
Discrete Mathematics, 2013

Dawn of the digital diagnosis assisting system, can it open a new age for pathology?
Proceedings of the Medical Imaging 2013: Digital Pathology, 2013

Automatic classification of hepatocellular carcinoma images based on nuclear and structural features.
Proceedings of the Medical Imaging 2013: Digital Pathology, 2013

Automated gastric cancer diagnosis on H&E-stained sections; ltraining a classifier on a large scale with multiple instance machine learning.
Proceedings of the Medical Imaging 2013: Digital Pathology, 2013

315MHz OOK transceiver with 38-µW receiver and 36-µW transmitter in 40-nm CMOS.
Proceedings of the 18th Asia and South Pacific Design Automation Conference, 2013

Closures, cycles, and paths.
Journal of Graph Theory, 2012

Clique or hole in claw-free graphs.
J. Comb. Theory, Ser. B, 2012

Star-factors with large components.
Discrete Mathematics, 2012

Hamiltonian cycles with all small even chords.
Discrete Mathematics, 2012

Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs.
Discrete Mathematics, 2012

A Pair of Forbidden Subgraphs and 2-Factors.
Combinatorics, Probability & Computing, 2012

Spanning trees with a bounded number of leaves in a claw-free graph.
Ars Comb., 2012

An all 0.5V, 1Mbps, 315MHz OOK transceiver with 38-µW career-frequency-free intermittent sampling receiver and 52-µW class-F transmitter in 40-nm CMOS.
Proceedings of the Symposium on VLSI Circuits, 2012

0.35V, 4.1μW, 39MHz crystal oscillator in 40nm CMOS.
Proceedings of the International Symposium on Low Power Electronics and Design, 2012

Color Correction in Whole Slide Digital Pathology.
Proceedings of the 20th Color and Imaging Conference, CIC 2012, Los Angeles, 2012

2.1 Times increase of drain efficiency by dual supply voltage scheme in 315MHz class-F Power amplifier at output power of -20dBm.
Proceedings of the 38th European Solid-State Circuit conference, 2012

Forbidden triples for perfect matchings.
Journal of Graph Theory, 2011

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity.
Journal of Graph Theory, 2011

Simulation of Cylindrical Plunge Grinding Processes Considered Successive Change of Workpiece Shape.
IJAT, 2011

Closure for spanning trees and distant area.
Discussiones Mathematicae Graph Theory, 2011

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity.
Combinatorica, 2011

Forbidden subgraphs and the existence of a 2-factor.
Journal of Graph Theory, 2010

Small alliances in a weighted graph.
Discrete Applied Mathematics, 2010

Voice activity detection based on conditional random fields using multiple features.
Proceedings of the INTERSPEECH 2010, 2010

Closure, stability and iterated line graphs with a 2-factor.
Discrete Mathematics, 2009

Two forbidden subgraphs and the existence of a 2-factor in graphs.
Australasian J. Combinatorics, 2009

A note on the 2-domination number of a tree.
Australasian J. Combinatorics, 2008

Characterization of chromatin texture by contour complexity for cancer cell classification.
Proceedings of the 8th IEEE International Conference on Bioinformatics and Bioengineering, 2008

Reduction for 3-Connected Graphs of Minimum Degree at Least Four.
Graphs and Combinatorics, 2007

Chvátal Erdós condition and 2-factors with a specyfied number of components.
Discussiones Mathematicae Graph Theory, 2007

Graphs with small boundary.
Discrete Mathematics, 2007

Edge-dominating cycles in graphs.
Discrete Mathematics, 2007

Degree conditions for hamiltonicity: Counting the number of missing edges.
Discrete Mathematics, 2007

Chvátal-Erdős Theorem: Old Theorem with New Aspects.
Proceedings of the Computational Geometry and Graph Theory, 2007

A Digital TV Receiver RF and BB Chipset with Adaptive Bias-Current Control for Mobile Applications.
Proceedings of the 2007 IEEE International Solid-State Circuits Conference, 2007

Domination in a graph with a 2-factor.
Journal of Graph Theory, 2006

A pair of forbidden subgraphs and perfect matchings.
J. Comb. Theory, Ser. B, 2006

Sorting Out Deregulation: Protecting Free Speech and Internet Access in The United States, Germany, and Japan by Kim, Jae-Young, (LFB Scholarly Publishing LLC, 2002), pp 196.
I. J. Law and Information Technology, 2006

Contractible edges and removable edges in a graph with large minimum degree.
Australasian J. Combinatorics, 2006

Forbidden subgraphs and bounds on the size of a maximum matching.
Journal of Graph Theory, 2005

A note on internally disjoint alternating paths in bipartite graphs.
Discrete Mathematics, 2005

A note on 2-factors with two components.
Discrete Mathematics, 2005

Vertex-disjoint cycles containing specified vertices in a bipartite graph.
Journal of Graph Theory, 2004

Long cycles in triangle-free graphs with prescribed independence number and connectivity.
J. Comb. Theory, Ser. B, 2004

Cycles within specified distance from each vertex.
Discrete Mathematics, 2004

Toughness, degrees and 2-factors.
Discrete Mathematics, 2004

Transient analysis of bar-type ultrasonic motors.
Proceedings of the 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems, Sendai, Japan, September 28, 2004

Degree conditions for k-ordered hamiltonian graphs.
Journal of Graph Theory, 2003

Splitting and contractible edges in 4-connected graphs.
J. Comb. Theory, Ser. B, 2003

On two equimatchable graph classes.
Discrete Mathematics, 2003

Cycles having the same modularity and removable edges in 2-connected graphs.
Discrete Mathematics, 2003

Factor criticality and complete closure of graphs.
Discrete Mathematics, 2003

M-alternating paths in n-extendable bipartite graphs.
Discrete Mathematics, 2003

A Note on Dominating Cycles in Tough Graphs.
Ars Comb., 2003

To Determine 1-Extendable Graphs and its Algorithm.
Ars Comb., 2003

Hamiltonian cycles in n-extendable graphs.
Journal of Graph Theory, 2002

The hamiltonicity of bipartite graphs involving neighborhood unions.
Discrete Mathematics, 2002

Relative length of longest paths and cycles in 3-connected graphs.
Journal of Graph Theory, 2001

Claw-free graphs with complete closure.
Discrete Mathematics, 2001

Hamiltonian cycles in n-factor-critical graphs.
Discrete Mathematics, 2001

Vertex-disjoint cycles containing specified edges in a bipartite graph.
Australasian J. Combinatorics, 2001

2-factors in claw-free graphs.
Discussiones Mathematicae Graph Theory, 2000

Closure and factor-critical graphs.
Discrete Mathematics, 2000

Long paths, long cycles, and their relative length.
Journal of Graph Theory, 1999

Degree sums and graphs that are not covered by two cycles.
Journal of Graph Theory, 1999

Closure, 2-factors, and cycle coverings in claw-free graphs.
Journal of Graph Theory, 1999

Neighborhood unions and factor critical graphs.
Discrete Mathematics, 1999

Closure and Hamiltonian-connectivity of claw-free graphs.
Discrete Mathematics, 1999

Essential independent sets and Hamiltonian cycles.
Journal of Graph Theory, 1996

Two recursive theorems on n-extendibility.
Discrete Mathematics, 1996

Fan-Type Theorem for Path-Connectivity.
Combinatorica, 1996

Relative length of long paths and cycles in graphs with large degree sums.
Journal of Graph Theory, 1995

Non-Contractible Edges in A 3-Connected Graph.
Combinatorica, 1995

Graphs with a Cycle of Length Divisible by Three.
J. Comb. Theory, Ser. B, 1994

Cycles of length 0 modulo 4 in graphs.
Discrete Mathematics, 1993

Cycles of length 2 modulo 3 in graphs.
Discrete Mathematics, 1992

Cycles intersecting a prescribed vertex set.
Journal of Graph Theory, 1991

Partitioning regular graphs into equicardinal linear forests.
Discrete Mathematics, 1991

Contractible edges in non-separating cycles.
Combinatorica, 1991

Covering contractible edges in 3-connected graphs. I: Covers of size three are cutsets.
Journal of Graph Theory, 1990

Removable edges in 3-connected graphs.
Journal of Graph Theory, 1990

One-factors and k-factors.
Discrete Mathematics, 1990

Long cycles through specified vertices in a graph.
J. Comb. Theory, Ser. B, 1989

Factors and induced subgraphs.
Discrete Mathematics, 1988

Contractible edges in 3-connected graphs.
J. Comb. Theory, Ser. B, 1987

On component factors.
Graphs and Combinatorics, 1986

Contracible edges in triangle-free graphs.
Combinatorica, 1986

Toughness and the existence of k-factors.
Journal of Graph Theory, 1985

Regular factors of regular graphs.
Journal of Graph Theory, 1985

The binding number of line graphs and total graphs.
Graphs and Combinatorics, 1985

Disjoint shortest paths in graphs.
Combinatorica, 1984

[a, b]-factors of graphs.
Discrete Mathematics, 1983