Sun-Yuan Hsieh

Orcid: 0000-0003-4746-3179

According to our database1, Sun-Yuan Hsieh authored at least 255 papers between 1994 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Endogenous Security of $FQ_{n}$ Networks: Adaptive System-Level Fault Self-Diagnosis.
IEEE Trans. Reliab., September, 2024

Characterization of Cyclic Diagnosability of Regular Diagnosable Networks.
IEEE Trans. Reliab., March, 2024

Probabilistic Reliability via Subsystem Structures of Arrangement Graph Networks.
IEEE Trans. Reliab., March, 2024

On the d-Claw Vertex Deletion Problem.
Algorithmica, February, 2024

Automated detection of vertebral fractures from X-ray images: A novel machine learning model and survey of the field.
Neurocomputing, January, 2024

Monitoring the edges of a graph using distances with given girth.
J. Comput. Syst. Sci., 2024

The g-extra connectivity of graph products.
J. Comput. Syst. Sci., 2024

The complexity of strong conflict-free vertex-connection <i>k</i>-colorability.
CoRR, 2024

2023
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks.
J. Parallel Distributed Comput., November, 2023

A Niching Regression Adaptive Memetic Algorithm for Multimodal Optimization of the Euclidean Traveling Salesman Problem.
IEEE Trans. Evol. Comput., October, 2023

Neural Network Enabled Intermittent Fault Diagnosis Under Comparison Model.
IEEE Trans. Reliab., September, 2023

Improved IP lookup technology for trie-based data structures.
J. Comput. Syst. Sci., May, 2023

Intermittent Fault Diagnosis of Split-Star Networks and its Applications.
IEEE Trans. Parallel Distributed Syst., April, 2023

Fault Diagnosability of Networks With Fault-Free Block at Local Vertex Under MM* Model.
IEEE Trans. Reliab., March, 2023

Efficient survivable mapping algorithm for logical topology in IP-over-WDM optical networks against node failure.
J. Supercomput., March, 2023

A Weighted Optimal Scheduling Scheme for Congestion Control in Cloud Data Center Networks.
IEEE Trans. Serv. Comput., 2023

The High Faulty Tolerant Capability of the Alternating Group Graphs.
IEEE Trans. Parallel Distributed Syst., 2023

Component Fault Diagnosability of Hierarchical Cubic Networks.
ACM Trans. Design Autom. Electr. Syst., 2023

Dynamic Parallel Flow Algorithms With Centralized Scheduling for Load Balancing in Cloud Data Center Networks.
IEEE Trans. Cloud Comput., 2023

Pathogenicity Prediction of Single Amino Acid Variants With Machine Learning Model Based on Protein Structural Energies.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Slice-Fusion: Reducing False Positives in Liver Tumor Detection for Mask R-CNN.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Automated Pediatric Bone Age Assessment Using Convolutional Neural Networks.
Proceedings of the Technologies and Applications of Artificial Intelligence, 2023

On Min-Max Graph Balancing with Strict Negative Correlation Constraints.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Hardness and Approximation for the Star β-Hub Routing Cost Problem in $\varDelta _\beta $-Metric Graphs.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
An $O(\log _3N)$ Algorithm for Reliability Assessment of 3-Ary $n$-Cubes Based on $h$-Extra Edge Connectivity.
IEEE Trans. Reliab., 2022

Strong Reliability of Star Graphs Interconnection Networks.
IEEE Trans. Reliab., 2022

Robustness of Subsystem Reliability of $k$k-Ary $n$n-Cube Networks Under Probabilistic Fault Model.
IEEE Trans. Parallel Distributed Syst., 2022

A Pessimistic Fault Diagnosability of Large-Scale Connected Networks via Extra Connectivity.
IEEE Trans. Parallel Distributed Syst., 2022

FFNLFD: Fault Diagnosis of Multiprocessor Systems at Local Node With Fault-Free Neighbors Under PMC Model and MM* Model.
IEEE Trans. Parallel Distributed Syst., 2022

A Fast $f(r, k+1)/k$f(r, k+1)/k-Diagnosis for Interconnection Networks Under MM* Model.
IEEE Trans. Parallel Distributed Syst., 2022

Novel scheme for reducing communication data traffic in advanced metering infrastructure networks.
J. Supercomput., 2022

Hardness and approximation for the star <i>p</i>-Hub Routing Cost Problem in metric graphs.
Theor. Comput. Sci., 2022

Novel Algorithm for Improved Protein Classification Using Graph Similarity.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Better Adaptive Malicious Users Detection Algorithm in Human Contact Networks.
IEEE Trans. Computers, 2022

An improved algorithm for the Steiner tree problem with bounded edge-length.
J. Comput. Syst. Sci., 2022

Pancake graphs: Structural properties and conditional diagnosability.
J. Comb. Optim., 2022

Characterization of component diagnosability of regular networks.
Discret. Appl. Math., 2022

On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality.
Algorithmica, 2022

A Scalable Analytical Framework for Complex Event Episode Mining With Various Domains Applications.
IEEE Access, 2022

IP Lookup Technology for Internet Computing.
Proceedings of the Wireless Internet - 15th EAI International Conference, 2022

Automated Diagnosis of Vertebral Fractures Using Radiographs and Machine Learning.
Proceedings of the Intelligent Computing Theories and Application, 2022

2021
An Analysis on the Reliability of the Alternating Group Graph.
IEEE Trans. Reliab., 2021

A Complete Fault Tolerant Method for Extra Fault Diagnosability of Alternating Group Graphs.
IEEE Trans. Reliab., 2021

Real-time energy data compression strategy for reducing data traffic based on smart grid AMI networks.
J. Supercomput., 2021

A Novel Branch-and-Bound Algorithm for the Protein Folding Problem in the 3D HP Model.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

A Novel Measurement for Network Reliability.
IEEE Trans. Computers, 2021

Dynamic Flow Scheduling Technique for Load Balancing in Fat-Tree Data Center Networks.
Int. J. Perform. Eng., 2021

Matching Cut in Graphs with Large Minimum Degree.
Algorithmica, 2021

The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks.
IEEE Access, 2021

Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs.
IEEE Access, 2021

Distribution Key Scheme for Secure Group Management in VANET Using Polynomial Interpolation.
Proceedings of the Security and Privacy in Social Networks and Big Data, 2021

Strategies for Reducing Traffic Volume and Security on Smart Grid.
Proceedings of the 21st IEEE International Conference on Software Quality, 2021

On the d-Claw Vertex Deletion Problem.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

A Study for Conditional Diagnosability of Pancake Graphs.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020
A Personalized Music Recommender System Using User Contents, Music Contents and Preference Ratings.
Vietnam. J. Comput. Sci., 2020

Conditional Diagnosability of Alternating Group Networks Under the PMC Model.
IEEE/ACM Trans. Netw., 2020

On the <i>g</i>-good-neighbor connectivity of graphs.
Theor. Comput. Sci., 2020

Approximation algorithms for the <i>p</i>-hub center routing problem in parameterized metric graphs.
Theor. Comput. Sci., 2020

Heterogeneous Job Allocation Scheduler for Hadoop MapReduce Using Dynamic Grouping Integrated Neighboring Search.
IEEE Trans. Cloud Comput., 2020

Utilization-prediction-aware virtual machine consolidation approach for energy-efficient cloud data centers.
J. Parallel Distributed Comput., 2020

Multilevel length-based classified index table for IP lookups and updates.
J. Comput. Syst. Sci., 2020

Vulnerability of super extra edge-connected graphs.
J. Comput. Syst. Sci., 2020

Recursive and parallel constructions of independent spanning trees in alternating group networks.
Int. J. Comput. Math. Comput. Syst. Theory, 2020

R3-connectivity of folded hypercubes.
Discret. Appl. Math., 2020

Characterization of Diagnosabilities on the Bounded PMC Model.
Comput. J., 2020

Constructing Independent Spanning Trees on Transposition Networks.
IEEE Access, 2020

Top-Down Construction of Independent Spanning Trees in Alternating Group Networks.
IEEE Access, 2020

Two Algorithms for Constructing Independent Spanning Trees in (n, k)-Star Graphs.
IEEE Access, 2020

Constructing Independent Spanning Trees on Pancake Networks.
IEEE Access, 2020

Two Methods for Constructing Independent Spanning Trees in Alternating Group Networks.
Proceedings of the 20th IEEE International Conference on Software Quality, 2020

An Effective and Efficient Algorithm for Detecting Exact Deletion Breakpoints from Viral Next-Generation Sequencing Data.
Proceedings of the International Computer Symposium, 2020

A Novel Improved Algorithm for Protein Classification Through a Graph Similarity Approach.
Proceedings of the Intelligent Computing Theories and Application, 2020

Constructing Independent Spanning Trees in Alternating Group Networks.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

A Survey for Conditional Diagnosability of Alternating Group Networks.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

An Efficient Approximation Algorithm for the Steiner Tree Problem.
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020

2019
Efficiency Network Construction of Advanced Metering Infrastructure Using Zigbee.
IEEE Trans. Mob. Comput., 2019

Relating Extra Connectivity and Extra Conditional Diagnosability in Regular Networks.
IEEE Trans. Dependable Secur. Comput., 2019

Performance evaluation on hybrid fault diagnosability of regular networks.
Theor. Comput. Sci., 2019

A Survey of Hub Location Problems.
J. Interconnect. Networks, 2019

Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks.
J. Comb. Optim., 2019

Introduction.
Int. J. Comput. Math. Comput. Syst. Theory, 2019

A Novel Scheme for Improving the Reliability in Smart Grid Neighborhood Area Networks.
IEEE Access, 2019

A Swap-Based Heuristic Algorithm for the Maximum $k$ -Plex Problem.
IEEE Access, 2019

Matching Cut in Graphs with Large Minimum Degree.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018
The Relationship Between g-Restricted Connectivity and g-Good-Neighbor Fault Diagnosability of General Regular Networks.
IEEE Trans. Reliab., 2018

Conditional (t, k)-Diagnosis in Regular and Irregular Graphs Under the Comparison Diagnosis Model.
IEEE Trans. Dependable Secur. Comput., 2018

Conditional Diagnosability of (n, k)-Star Graphs Under the PMC Model.
IEEE Trans. Dependable Secur. Comput., 2018

Novel Scheduling Algorithms for Efficient Deployment of MapReduce Applications in Heterogeneous Computing Environments.
IEEE Trans. Cloud Comput., 2018

The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model.
J. Comput. Syst. Sci., 2018

Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality.
J. Comput. Syst. Sci., 2018

Classifying Protein Specific Residue Structures Based on Graph Mining.
IEEE Access, 2018

Effective Risk Assessment of Type 2 Diabetes Using Diagnostic Information Retrieval.
Proceedings of the 2018 Joint 10th International Conference on Soft Computing and Intelligent Systems (SCIS) and 19th International Symposium on Advanced Intelligent Systems (ISIS), 2018

Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

An Approximation Algorithm for Star p-Hub Routing Cost Problem.
Proceedings of the New Trends in Computer Technologies and Applications, 2018

Music Recommendation Based on Information of User Profiles, Music Genres and User Ratings.
Proceedings of the Intelligent Information and Database Systems - 10th Asian Conference, 2018

2017
Multi-Inherited Search Tree for Dynamic IP Router-Tables.
IEEE Trans. Computers, 2017

Construction independent spanning trees on locally twisted cubes in parallel.
J. Comb. Optim., 2017

h-restricted connectivity of locally twisted cubes.
Discret. Appl. Math., 2017

Random and Conditional (t, k)-Diagnosis of Hypercubes.
Algorithmica, 2017

Mining Life Patterns from Wearable Sensors Data for Elderly Anomaly Detection.
Proceedings of the Conference on Technologies and Applications of Artificial Intelligence, 2017

An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
The Extra Connectivity, Extra Conditional Diagnosability, and t/m-Diagnosability of Arrangement Graphs.
IEEE Trans. Reliab., 2016

The Extra, Restricted Connectivity and Conditional Diagnosability of Split-Star Networks.
IEEE Trans. Parallel Distributed Syst., 2016

Guest Editorial: Special Section on Emerging Topics in the Design of High Performance Internet Routers.
IEEE Trans. Emerg. Top. Comput., 2016

{2, 3}-Restricted connectivity of locally twisted cubes.
Theor. Comput. Sci., 2016

A Faster cDNA Microarray Gene Expression Data Classifier for Diagnosing Diseases.
IEEE ACM Trans. Comput. Biol. Bioinform., 2016

The t/k-Diagnosability for Regular Networks.
IEEE Trans. Computers, 2016

Improved Precise Fault Diagnosis Algorithm for Hypercube-Like Systems Based on the Comparison Diagnosis Model.
J. Interconnect. Networks, 2016

Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges.
J. Comput. Syst. Sci., 2016

Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks.
Inf. Comput., 2016

Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Improved Precise Fault Diagnosis Algorithm for Hypercube-Like Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Conditional Diagnosability of (n, k)-Star Networks Under the Comparison Diagnosis Model.
IEEE Trans. Reliab., 2015

Fault-Tolerant Cycle Embedding in Cartesian Product Graphs: Edge-Pancyclicity and Edge-Bipancyclicity with Faulty Edges.
IEEE Trans. Parallel Distributed Syst., 2015

Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the PMC Model.
ACM Trans. Design Autom. Electr. Syst., 2015

An Improved Approximation Ratio to the Partial-Terminal Steiner Tree Problem.
IEEE Trans. Computers, 2015

Conditional (t, k)-Diagnosis in Graphs by Using the Comparison Diagnosis Model.
IEEE Trans. Computers, 2015

An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2.
J. Discrete Algorithms, 2015

Weight-constrained and density-constrained paths in a tree: Enumerating, counting, and k-maximum density paths.
Discret. Appl. Math., 2015

Improving the Search Mechanism for Unstructured Peer-to-Peer Networks Using the Statistical Matrix Form.
IEEE Access, 2015

An Enhanced Algorithm for Reconstructing a Phylogenetic Tree Based on the Tree Rearrangement and Maximum Likelihood Method.
Proceedings of the Intelligent Computing Theories and Methodologies, 2015

A Novel Algorithm for Classifying Protein Structure Familiar by Using the Graph Mining Approach.
Proceedings of the Intelligent Computing Theories and Methodologies, 2015

Bounds for the Super Extra Edge Connectivity of Graphs.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Transfer Learning on High Variety Domains for Activity Recognition.
Proceedings of the ASE BigData & SocialInformatics 2015, 2015

2014
A Multi-Index Hybrid Trie for Lookup and Updates.
IEEE Trans. Parallel Distributed Syst., 2014

Hamiltonicity of Product Networks with Faulty Elements.
IEEE Trans. Parallel Distributed Syst., 2014

Structural Properties and Conditional Diagnosability of Star Graphs by Using the PMC Model.
IEEE Trans. Parallel Distributed Syst., 2014

Diagnosability of Component-Composition Graphs in the MM* Model.
ACM Trans. Design Autom. Electr. Syst., 2014

On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes.
IEEE Trans. Computers, 2014

A Dynamic Data Placement Strategy for Hadoop in Heterogeneous Environments.
Big Data Res., 2014

IDP: An Innovative Data Placement Algorithm for Hadoop Systems.
Proceedings of the Intelligent Systems and Applications, 2014

2013
A Scalable Comparison-Based Diagnosis Algorithm for Hypercube-Like Networks.
IEEE Trans. Reliab., 2013

Conditional Edge-Fault Hamiltonicity of Cartesian Product Graphs.
IEEE Trans. Parallel Distributed Syst., 2013

Efficient Gray-Code-Based Range Encoding Schemes for Packet Classification in TCAM.
IEEE/ACM Trans. Netw., 2013

<i>t/t</i>-Diagnosability of regular graphs under the PMC model.
ACM Trans. Design Autom. Electr. Syst., 2013

Fault-tolerant path embedding in folded hypercubes with both node and edge faults.
Theor. Comput. Sci., 2013

Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes.
IEEE Trans. Computers, 2013

The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model.
IEEE Trans. Computers, 2013

Component-Composition Graphs: (t, k)-Diagnosability and Its Application.
IEEE Trans. Computers, 2013

Extra edge connectivity of hypercube-like networks.
Int. J. Parallel Emergent Distributed Syst., 2013

{2,3}-Extraconnectivities of hypercube-like networks.
J. Comput. Syst. Sci., 2013

The internal Steiner tree problem: Hardness and approximations.
J. Complex., 2013

2012
Strong Diagnosability and Conditional Diagnosability of Augmented Cubes Under the Comparison Diagnosis Model.
IEEE Trans. Reliab., 2012

Embedding Cycles and Paths in Product Networks and Their Applications to Multiprocessor Systems.
IEEE Trans. Parallel Distributed Syst., 2012

Conditional Diagnosability of k-Ary n-Cubes under the PMC Model.
ACM Trans. Design Autom. Electr. Syst., 2012

Conditional Diagnosability of Augmented Cubes under the PMC Model.
IEEE Trans. Dependable Secur. Comput., 2012

Extraconnectivity of k-ary n-cube networks.
Theor. Comput. Sci., 2012

Pancyclicity of Matching Composition Networks under the Conditional Fault Model.
IEEE Trans. Computers, 2012

A Classified Multisuffix Trie for IP Lookup and Update.
IEEE Trans. Computers, 2012

2011
Determining the Diagnosability of (1, 2)-Matching Composition Networks and Its Applications.
IEEE Trans. Dependable Secur. Comput., 2011

Diagnosability of Two-Matching Composition Networks under the MM<sup>ast</sup> Model.
IEEE Trans. Dependable Secur. Comput., 2011

Edge-bipancyclicity of star graphs with faulty elements.
Theor. Comput. Sci., 2011

On parallel recognition of cographs.
Theor. Comput. Sci., 2011

Fault-Tolerant Bipancyclicity of Faulty Hypercubes Under the Generalized Conditional-Fault Model.
IEEE Trans. Commun., 2011

An Improved Heuristic Algorithm for Finding Motif Signals in DNA Sequences.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Multiprefix Trie: A New Data Structure for Designing Dynamic Router-Tables.
IEEE Trans. Computers, 2011

(t, k)-Diagnosis for Component-Composition Graphs under the MM* Model.
IEEE Trans. Computers, 2011

Determining the Conditional Diagnosability of <i>k</i>-Ary <i>n</i>-Cubes Under the MM* Model.
Proceedings of the Structural Information and Communication Complexity, 2011

2010
The weight-constrained maximum-density subtree problem and related problems in trees.
J. Supercomput., 2010

Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model.
SIAM J. Discret. Math., 2010

Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults.
J. Comb. Optim., 2010

Pancyclicity and bipancyclicity of conditional faulty folded hypercubes.
Inf. Sci., 2010

Conditional edge-fault Hamiltonicity of augmented cubes.
Inf. Sci., 2010

Path Embeddings and Related Properties in Cartesian Product Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2010

Super Fault-Tolerant Hamiltonicity of Product Networks.
Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2010

Computing the (<i>t</i>, <i>k</i>)-Diagnosability of Component-Composition Graphs and Its Application.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Extended Fault-Tolerant Cycle Embedding in Faulty Hypercubes.
IEEE Trans. Reliab., 2009

Conditional Edge-Fault Hamiltonicity of Matching Composition Networks.
IEEE Trans. Parallel Distributed Syst., 2009

The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model.
IEEE Trans. Parallel Distributed Syst., 2009

Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults.
J. Supercomput., 2009

Constructing edge-disjoint spanning trees in locally twisted cubes.
Theor. Comput. Sci., 2009

Panconnectivity and edge-pancyclicity of <i>k</i>-ary <i>n</i>-cubes.
Networks, 2009

Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults.
Theory Comput. Syst., 2009

Cycle and Path Embedding on 5-ary N-cubes.
RAIRO Theor. Informatics Appl., 2009

A further result on fault-free cycles in faulty folded hypercubes.
Inf. Process. Lett., 2009

1-vertex-fault-tolerant cycles embedding on folded hypercubes.
Discret. Appl. Math., 2009

Fault-Free Cycles in Conditional Faulty Folded Hypercubes.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2009

Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2009

2008
Strongly Diagnosable Systems under the Comparison Diagnosis Model.
IEEE Trans. Computers, 2008

Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model.
IEEE Trans. Computers, 2008

Some edge-fault-tolerant properties of the folded hypercube.
Networks, 2008

Finding a maximum-density path in a tree under the weight and length constraints.
Inf. Process. Lett., 2008

A note on cycle embedding in folded hypercubes with faulty elements.
Inf. Process. Lett., 2008

Edge-bipancyclicity of a hypercube with faulty vertices and edges.
Discret. Appl. Math., 2008

A DNA-based graph encoding scheme with its applications to graph isomorphism problems.
Appl. Math. Comput., 2008

A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers.
Appl. Math. Comput., 2008

Hamiltonicity of Matching Composition Networks with Conditional Edge Faults.
Proceedings of the Theory and Applications of Models of Computation, 2008

On the Partial-Terminal Steiner Tree Problem.
Proceedings of the 9th International Symposium on Parallel Architectures, 2008

Diagnosability of Two-Matching Composition Networks.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

A new approach for cycle embedding in faulty hypercubes.
Proceedings of the 13th Asia-Pacific Computer Systems Architecture Conference, 2008

2007
Panconnectivity and edge-pancyclicity of 3-ary <i>N</i> -cubes.
J. Supercomput., 2007

On the partial terminal Steiner tree problem.
J. Supercomput., 2007

An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs.
J. Supercomput., 2007

Approximating the selected-internal Steiner tree.
Theor. Comput. Sci., 2007

Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species.
Theor. Comput. Sci., 2007

Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges.
J. Comb. Optim., 2007

The interval-merging problem.
Inf. Sci., 2007

Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes.
Comput. Math. Appl., 2007

A faster parallel connectivity algorithm on cographs.
Appl. Math. Lett., 2007

Cycle embedding of augmented cubes.
Appl. Math. Comput., 2007

An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation.
Appl. Math. Comput., 2007

On the Internal Steiner Tree Problem.
Proceedings of the Theory and Applications of Models of Computation, 2007

Path Embedding on Folded Hypercubes.
Proceedings of the Theory and Applications of Models of Computation, 2007

Fault-free Hamiltonian cycles in locally twisted cubes under conditional edge faults.
Proceedings of the 13th International Conference on Parallel and Distributed Systems, 2007

Conditional edge-fault-tolerant Hamiltonian cycle embedding of star graphs.
Proceedings of the 13th International Conference on Parallel and Distributed Systems, 2007

Embedding cycles and paths in a k-ary n-cube.
Proceedings of the 13th International Conference on Parallel and Distributed Systems, 2007

Longest Fault-Free Paths in Hypercubes with both Faulty Nodes and Edges.
Proceedings of the Future Generation Communication and Networking, 2007

2006
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges.
IEEE Trans. Computers, 2006

Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges.
Parallel Comput., 2006

The <i>k</i>-degree Cayley graph and its topological properties.
Networks, 2006

The Hamiltonian problem on distance-hereditary graphs.
Discret. Appl. Math., 2006

Cycle Embedding on Twisted Cubes.
Proceedings of the Seventh International Conference on Parallel and Distributed Computing, 2006

Hardness and Approximation of the Selected-Leaf-Terminal Steiner Tree Problem.
Proceedings of the Seventh International Conference on Parallel and Distributed Computing, 2006

Fault-Tolerant Mutually Independent Hamiltonian Cycles Embedding on Hypercubes.
Proceedings of the First International Conference on Innovative Computing, Information and Control (ICICIC 2006), 30 August, 2006

Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Hamiltonian-Connectivity and Related Property on Folded Hypercubes.
Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Fault-Free Pairwise Independent Hamiltonian Paths on Faulty Hypercubes.
Proceedings of the Advances in Computer Systems Architecture, 11th Asia-Pacific Conference, 2006

2005
Embedding longest fault-free paths onto star graphs with more vertex faults.
Theor. Comput. Sci., 2005

1-vertex-hamiltonian-laceability of Hypercubes with Maximal Edge Faults.
J. Interconnect. Networks, 2005

Efficiently parallelizable problems on a class of decomposable graphs.
J. Comput. Syst. Sci., 2005

Finding a Weight-Constrained Maximum-Density Subtree in a Tree.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Cycle Embedding on the Möbius Cube with Both Faulty Nodes and Faulty Edges.
Proceedings of the 11th International Conference on Parallel and Distributed Systems, 2005

Embedding of Cycles in the Faulty Hypercube.
Proceedings of the Advances in Computer Systems Architecture, 10th Asia-Pacific Conference, 2005

2004
Pancyclicity on Möbius cubes with maximal edge faults.
Parallel Comput., 2004

An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs .
J. Parallel Distributed Comput., 2004

Strongly Hyper-Hamiltonian-Laceability of Hypercubes.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

Pancyclicity on Möbius Cubes with Edge Faults.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

The k-valent Graph: A New Family of Cayley Graphs for Interconnection.
Proceedings of the 33rd International Conference on Parallel Processing (ICPP 2004), 2004

Characterization of Efficiently Parallel Solvable Problems on a Class of Decomposable Graphs.
Proceedings of the Computational Science, 2004

2003
A simple and fast parallel coloring for distance-hereditary graphs.
IEEE Trans. Parallel Distributed Syst., 2003

2002
An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs.
IEEE Trans. Parallel Distributed Syst., 2002

Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs.
SIAM J. Discret. Math., 2002

On vertex ranking of a starlike graph.
Inf. Process. Lett., 2002

Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Longest fault-free paths in star graphs with vertex faults.
Theor. Comput. Sci., 2001

Longest Fault-Free Paths in Star Graphs with Edge Faults.
IEEE Trans. Computers, 2001

2000
Hamiltonian-laceability of star graphs.
Networks, 2000

A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs.
J. Algorithms, 2000

1999
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs.
IEEE Trans. Parallel Distributed Syst., 1999

Efficient Parallel Algorithms on Distance Hereditary Graphs.
Parallel Process. Lett., 1999

Parallel Decomposition of Generalized Series-Parallel Graphs.
J. Inf. Sci. Eng., 1999

Parallel Decomposition of Distance-Hereditary Graphs.
Proceedings of the Parallel Computation, 1999

1998
An Efficient Parallel Strategy for Computing K-Terminal Reliability and Finding Most Vital Edges in 2-Trees and Partial 2-Trees.
J. Parallel Distributed Comput., 1998

Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

A New Simple Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998

Embed Longest Rings onto Star Graphs with Vertex Faults.
Proceedings of the 1998 International Conference on Parallel Processing (ICPP '98), 1998

An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs.
Proceedings of the Advances in Computing Science, 1998

1997
Dynamic Programming on Distance-Hereditary Graphs.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-trees.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Fault-Tolerant Ring Embedding in Faulty Arrangement Graphs.
Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

1994
An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994


  Loading...