Hung-Lung Wang

Orcid: 0000-0001-6156-2734

According to our database1, Hung-Lung Wang authored at least 32 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions.
J. Inf. Sci. Eng., March, 2024

A note on the Tuza constant <i>c</i><sub><i>k</i></sub> for small <i>k</i>.
Discret. Math., February, 2024

Correcting matrix products over the ring of integers.
Inf. Process. Lett., 2024

2023
Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022
Complexity of paired domination in AT-free and planar graphs.
Theor. Comput. Sci., 2022

A note on the Tuza constant c<sub>k</sub> for small k.
CoRR, 2022

2021
A note on the geodetic number and the Steiner number of AT-free graphs.
Theor. Comput. Sci., 2021

2019
The Complexity of Packing Edge-Disjoint Paths.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2017
Completely Independent Spanning Trees on 4-Regular Chordal Rings.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

An Optimal Algorithm for the Weighted Backup 2-Center Problem on a Tree.
Algorithmica, 2017

2016
Computing the Line-Constrained k-center in the Plane for Small k.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
The next-to-shortest path problem on directed graphs with positive edge weights.
Networks, 2015

On the Structure of Locally Outerplanar Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

A Note on the Degree Condition of Completely Independent Spanning Trees.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Maintaining centdians in a fully dynamic forest with top trees.
Discret. Appl. Math., 2015

Convexities in Some Special Graph Classes - New Results in AT-free Graphs and Beyond.
CoRR, 2015

Flood-it on AT-Free Graphs.
CoRR, 2015

Forming Plurality at Minimum Cost.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Rainbow Domination and Related Problems on Some Classes of Perfect Graphs.
Proceedings of the Topics in Theoretical Computer Science, 2015

Gray Codes for AT-Free Orders via Antimatroids.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
One-dimensional approximate point set pattern matching with L<sub>p</sub>-norm.
Theor. Comput. Sci., 2014

The Generalized Popular Condensation Problem.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013
An Optimal Algorithm for the Popular Condensation Problem.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Computing Plurality Points and Condorcet Points in Euclidean Space.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
The generalized k-coverage under probabilistic sensing model in sensor networks.
Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, 2012

2011
Finding all sorting tandem duplication random loss operations.
J. Discrete Algorithms, 2011

Approximate Point Set Pattern Matching with L p -Norm.
Proceedings of the String Processing and Information Retrieval, 2011

2010
A tight bound on the min-ratio edge-partitioning problem of a tree.
Discret. Appl. Math., 2010

2009
The backup 2-center and backup 2-median problems on trees.
Networks, 2009

Finding All Sorting Tandem Duplication Random Loss Operations.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
The 2-radius and 2-radiian problems on trees.
Theor. Comput. Sci., 2008

2007
On the uniform edge-partition of a tree.
Discret. Appl. Math., 2007


  Loading...