Sheng-Lung Peng

Orcid: 0000-0002-9484-6677

According to our database1, Sheng-Lung Peng authored at least 79 papers between 1992 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

SAHA: An SDN Enabled Fog Architecture for Healthcare Applications.
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

2023
Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting.
J. Supercomput., March, 2023

Introduction to the special section on survivability analysis of wireless networks with performance evaluation (VSI-networks survivability).
Comput. Networks, 2023

2022
Smart and Future Applications of Internet of Multimedia Things (IoMT) Using Big Data Analytics.
Sensors, 2022

Adaptive Aggregate Stereo Matching Network with Depth Map Super-Resolution.
Sensors, 2022

Introduction to the special issue on big data analytics with internet of things-oriented infrastructures for future smart cities.
Expert Syst. J. Knowl. Eng., 2022

Parallel construction of multiple independent spanning trees on highly scalable datacenter networks.
Appl. Math. Comput., 2022

Fault Diagnosability of Multigraph Matching Composition Networks.
Proceedings of the New Trends in Computer Technologies and Applications, 2022

2021
Multi Barcode Scanning and Decoding Technology Based on AR Smart Glasses.
J. Inf. Hiding Multim. Signal Process., 2021

GUEST EDITORIAL: Internet of Things for e-Health Applications.
IEEE Internet Things Mag., 2021

A new task offloading algorithm in edge computing.
EURASIP J. Wirel. Commun. Netw., 2021

Reliability Assessment of Some Regular Networks.
Comput. J., 2021

Introduction to the special section on big data analytics and deep learning approaches for 5G and 6G communication networks (VSI-5g6g).
Comput. Electr. Eng., 2021

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

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

2020
Control of congestion and traffic light using intelligent approaches in smart city.
Int. J. Wirel. Mob. Comput., 2020

Call for Special Issue Papers: Big Data Analytics for Agricultural Disaster Management.
Big Data, 2020

2019
The Efficient Data Classification using SVMcW for IoT Data Monitoring and Sensing.
Proceedings of the IEEE International Conference on Consumer Electronics - Taiwan, 2019

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

2018
Enhancing multi-factor cheating prevention in visual cryptography based minimum (<i>k</i>, <i>n</i>)-connected graph.
J. Vis. Commun. Image Represent., 2018

On the complete width and edge clique cover problems.
J. Comb. Optim., 2018

2017
Good characterizations and linear time recognition for 2-probe block graphs.
Discret. Appl. Math., 2017

On the Cooperative Graph Searching Problem.
Proceedings of the Structured Object-Oriented Formal Language and Method, 2017

Exploiting a Cloud Framework for Automatically and Effectively Providing Data Analyzers.
Proceedings of the 2017 IEEE 7th International Symposium on Cloud and Service Computing, 2017

2016
An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs.
J. Interconnect. Networks, 2016

Gray-Code Ranking and Unranking on Left-Weight Sequences of Binary Trees.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Algorithmic Aspects of Disjunctive Total Domination in Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016

A Novel Method for Designing Information Technology Services.
Proceedings of the 2016 IEEE International Conference on Computer and Information Technology, 2016

2015
Characterizing and recognizing probe block graphs.
Theor. Comput. Sci., 2015

Reducing Code Length of Second-Order Spectral-Null Code.
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

An Energy-Aware Random Multi-path Routing Protocol for MANETs.
Proceedings of the 2015 IEEE International Conference on Smart City/SocialCom/SustainCom/DataCom/SC2 2015, 2015

2014
Adjusting protein graphs based on graph entropy.
BMC Bioinform., 2014

A Cloud Server Selection System - Recommendation, Modeling and Evaluation.
Proceedings of the Internet of Vehicles - Technologies and Services, 2014

A Cloud-based Mobile Healthcare System.
Proceedings of the Intelligent Systems and Applications, 2014

Green Computing: An SLA-based Energy-aware Methodology for Data Centers.
Proceedings of the Intelligent Systems and Applications, 2014

The End-to-end Longest Path Problem on a Mesh with a Missing Vertex.
Proceedings of the Intelligent Systems and Applications, 2014

On the Minimum Hub Set Problem.
Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

2013
Assessment of Protein-Graph Remodeling via Conformational Graph Entropy.
Proceedings of the Emerging Intelligent Computing Technology and Applications, 2013

Exploring Community Structures by Comparing Group Characteristics.
Proceedings of the Advanced Technologies, Embedded and Multimedia for Human-centric Computing, 2013

Emergency Broadcast in VANET by Considering Human Satisfaction.
Proceedings of the Advanced Technologies, Embedded and Multimedia for Human-centric Computing, 2013

Using bipartite matching in graph spectra for protein structural similarity.
Proceedings of the 6th International Conference on Biomedical Engineering and Informatics, 2013

2012
Bio-inspired computing for hybrid information technology.
Soft Comput., 2012

An efficient search mechanism for supporting partial filename queries in structured peer-to-peer overlay.
Peer-to-Peer Netw. Appl., 2012

Mining frequent maximal cliques efficiently by global view graph.
Proceedings of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012

On the gene team mining problem.
Proceedings of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012

2011
Block-graph width.
Theor. Comput. Sci., 2011

On the threshold-width of graphs.
J. Graph Algorithms Appl., 2011

Solving the Sensitive Itemset Hiding Problem Whilst Minimizing Side Effects on a Sanitized Database.
Proceedings of the Security-Enriched Urban Computing and Smart Grid, 2011

2010
Measuring Protein Structural Similarity by Maximum Common Edge Subgraphs.
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 2010

2009
Proportional fault-tolerant data mining with applications to bioinformatics.
Inf. Syst. Frontiers, 2009

On probe permutation graphs.
Discret. Appl. Math., 2009

Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

CAPS Genomic Subtyping on <i>Orthomyxoviridae</i>.
Proceedings of the Emerging Intelligent Computing Technology and Applications, 2009

Verification of Pathotyping by Quasispecies Model.
Proceedings of the Emerging Intelligent Computing Technology and Applications, 2009

2008
Partitioned probe comparability graphs.
Theor. Comput. Sci., 2008

Efficient algorithms for Roman domination on some classes of graphs.
Discret. Appl. Math., 2008

Probe Selection with Fault Tolerance.
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues, 2008

Protein Secondary Structure Prediction Based on Ramachandran Maps.
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues, 2008

Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs.
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 2008

Probe Ptolemaic Graphs.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Constructing a minimum height elimination tree of a tree in linear time.
Inf. Sci., 2007

On the Treewidth and Pathwidth of Biconvex Bipartite Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
On the interval completion of chordal graphs.
Discret. Appl. Math., 2006

The Maximum Interval Graphs on Distance Hereditary Graphs.
Proceedings of the 2006 Joint Conference on Information Sciences, 2006

Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Probe interval bigraphs.
Electron. Notes Discret. Math., 2005

Roman Domination over Some Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

The PIGs Full Monty - A Floor Show of Minimal Separators.
Proceedings of the STACS 2005, 2005

On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2003
Efficient minus and signed domination in graphs.
Theor. Comput. Sci., 2003

2000
Edge and node searching problems on trees.
Theor. Comput. Sci., 2000

Graph Searching on Some Subclasses of Chordal Graphs.
Algorithmica, 2000

1999
Deferred-query: An efficient approach for some problems on interval graphs.
Networks, 1999

1998
A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1996
Graph Searching on Chordal Graphs.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1993
Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract).
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992
A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs.
Inf. Process. Lett., 1992


  Loading...