Yuqing Lin

Orcid: 0000-0002-6693-0433

Affiliations:
  • University of Newcastle, Newcastle, Australia


According to our database1, Yuqing Lin authored at least 61 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Cross-Domain Fake News Detection Using a Prompt-Based Approach.
Future Internet, August, 2024

The Power of Context: A Novel Hybrid Context-Aware Fake News Detection Approach.
Inf., March, 2024

Enhancing hierarchical attention networks with CNN and stylistic features for fake news detection.
Expert Syst. Appl., 2024

2022
A Comparative Study of Machine Learning and Deep Learning Techniques for Fake News Detection.
Inf., 2022

Protecting Private Information for Two Classes of Aggregated Database Queries.
Informatics, 2022

A survey on enhanced power graphs of finite groups.
Electron. J. Graph Theory Appl., 2022

2021
Evaluating the robustness of source code plagiarism detection tools to pervasive plagiarism-hiding modifications.
Empir. Softw. Eng., 2021

Collusion-resistant protocols for private processing of aggregated queries in distributed databases.
Distributed Parallel Databases, 2021

Academic Source Code Plagiarism Detection by Measuring Program Behavioural Similarity.
CoRR, 2021

Academic Source Code Plagiarism Detection by Measuring Program Behavioral Similarity.
IEEE Access, 2021

2020
A multi-layer fuzzy model based on fuzzy-rule clustering for prediction tasks.
Neurocomputing, 2020

A Novel Graph-Based Program Representation for Java Code Plagiarism Detection.
Proceedings of the ICSIM '20: The 3rd International Conference on Software Engineering and Information Management, 2020

Detecting Pervasive Source Code Plagiarism through Dynamic Program Behaviours.
Proceedings of the ACE 2020, 2020

2019
Preface.
J. Interconnect. Networks, 2019

A two-layer Wang-Mendel fuzzy approach for predicting the residuary resistance of sailing yachts.
J. Intell. Fuzzy Syst., 2019

Malicious web domain identification using online credibility and performance data by considering the class imbalance issue.
Ind. Manag. Data Syst., 2019

Exploring a Comprehensive Approach for the Automated Assessment of UML.
Proceedings of the 8th International Congress on Advanced Applied Informatics, 2019

Automated Assessment of ER Model Using the Domain Knowledge.
Proceedings of the Computer and Information Science, 2019

2018
The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs.
Discret. Appl. Math., 2018

Sufficient conditions for graphs to be maximally 4-restricted edge connected.
Australas. J Comb., 2018

2017
A linear algorithm for a perfect matching in polyomino graphs.
Theor. Comput. Sci., 2017

The connectivity and nature diagnosability of expanded <i>k</i>-ary <i>n</i>-cubes.
RAIRO Theor. Informatics Appl., 2017

On the number of disjoint perfect matchings of regular graphs with given edge connectivity.
Discret. Math., 2017

2016
The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM<sup>⁎</sup> model.
Theor. Comput. Sci., 2016

NUClear: A Loosely Coupled Software Architecture for Humanoid Robot Systems.
Frontiers Robotics AI, 2016

RTCSS: a framework for developing real-time peer-to-peer web applications.
Proceedings of the Australasian Computer Science Week Multiconference, 2016

2015
Maximum spectral radius of graphs with given connectivity, minimum degree and independence number.
J. Discrete Algorithms, 2015

Using Aspect-Oriented Approach for Software Product Line Development.
Proceedings of the ICSOFT-EA 2015, 2015

An Aspect-Oriented Feature Modelling Framework for Software Product Line Engineering.
Proceedings of the 24th Australasian Software Engineering Conference, 2015

2014
Quality attribute modeling and quality aware product configuration in software product lines.
Softw. Qual. J., 2014

Software Development in the City Evolutions Project.
Proceedings of the 2014 Conference on Interactive Entertainment, 2014

A Survey on Workflow Management and Scheduling in Cloud Computing.
Proceedings of the 14th IEEE/ACM International Symposium on Cluster, 2014

Quality Ranking of Features in Software Product Line Engineering.
Proceedings of the 21st Asia-Pacific Software Engineering Conference, 2014

2013
On Superconnectivity of (4, g)-Cages.
Graphs Comb., 2013

Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2011
Using knowledge-based systems to manage quality attributes in software product lines.
Proceedings of the Software Product Lines - 15th International Conference, 2011

2010
On superconnectivity of (4, <i>g</i>)-cages with even girth.
Networks, 2010

New Results on EX Graphs.
Math. Comput. Sci., 2010

An Approach to Efficient Product Configuration in Software Product Lines.
Proceedings of the Software Product Lines: Going Beyond - 14th International Conference, 2010

Quality Attributes Assessment for Feature-Based Product Configuration in Software Product Line.
Proceedings of the 17th Asia Pacific Software Engineering Conference, 2010

2009
On Extremal Graphs with Bounded Girth.
Electron. Notes Discret. Math., 2009

Super-vertex-antimagic total labelings of disconnected graphs.
Discret. Math., 2009

Calculating the extremal number ex(v;{C<sub>3</sub>, C<sub>4</sub>, ..., C<sub>n</sub>}).
Discret. Appl. Math., 2009

On the number of components of (k, g)-cages after vertex deletion.
Discret. Appl. Math., 2009

Superconnectivity of regular graphs with small diameter.
Discret. Appl. Math., 2009

2008
HSAGA and its application for the construction of near-Moore digraphs.
J. Discrete Algorithms, 2008

On the connectivity of (k, g)-cages of even girth.
Discret. Math., 2008

Diameter-sufficient conditions for a graph to be super-restricted connected.
Discret. Appl. Math., 2008

Construction of Extremal Graphs.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2007
A lower bound on the order of regular graphs with given girth pair.
J. Graph Theory, 2007

Edge-antimagic graphs.
Discret. Math., 2007

An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connected.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006
All (<i>k</i>;<i>g</i>)-cages are edge-superconnected.
Networks, 2006

Calculating the extremal number ex(v;{C<sub>3</sub>, C<sub>4</sub>, ..., C<sub>n</sub>}).
Electron. Notes Discret. Math., 2006

Consecutive magic graphs.
Discret. Math., 2006

On the degrees of a strongly vertex-magic graph.
Discret. Math., 2006

Face antimagic labelings of plane graphs Pba.
Ars Comb., 2006

Antimagic labelings of Msbius grids.
Ars Comb., 2006

2005
All (<i>k</i>;<i>g</i>)-cages are <i>k</i>-edge-connected.
J. Graph Theory, 2005

Improved lower bound for the vertex connectivity of (<i>delta;</i>;<i>g</i>)-cages.
Discret. Math., 2005

2004
On d-antimagic labelings of prisms.
Ars Comb., 2004


  Loading...