Hung-Lung Wang

activity

20142025

most citedCorrecting matrix products over the ring of integers

1 citations · 3 across the 8 of their papers we have counts for

collaborators

10 papers

cs.DS2025

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling

Yi-Ting Hsieh, Mong-Jen Kao, Jhong-Yun Liu +1

We are concerned with the problem of scheduling $n$ jobs onto $m$ identical machines. Each machine has to be in operation for a prescribed time, and the objective is to minimize th…

cs.DS2023★ 1 cited

Correcting matrix products over the ring of integers

Yu-Lun Wu, Hung-Lung Wang

Let $A$ , $B$ , and $C$ be three $n \times n$ matrices. We investigate the problem of verifying whether $A B = C$ over the ring of integers and finding the correct product $A B$ . Given th…

math.CO2022

A note on the Tuza constant $c_{k}$ for small $k$

Yun-Shan Lu, Hung-Lung Wang

For a hypergraph $H$ , the transversal is a subset of vertices whose intersection with every edge is nonempty. The cardinality of a minimum transversal is the transversal number of…

cs.DM2021

Complexity of Paired Domination in AT-free and Planar Graphs

Vikash Tripathi, Ton Kloks, Arti Pandey +2

For a graph $G = (V, E)$ , a subset $D$ of vertex set $V$ , is a dominating set of $G$ if every vertex not in $D$ is adjacent to atleast one vertex of $D$ . A dominating set $D$ of a gra…

cs.CC2019

The Complexity of Packing Edge-Disjoint Paths

Jan Dreier, Janosch Fuchs, Tim A. Hartmann +4

We introduce and study the complexity of Path Packing. Given a graph $G$ and a list of paths, the task is to embed the paths edge-disjoint in $G$ . This generalizes the well known H…

math.CO2017

Gray Codes for AT-Free Orders

Jou-Ming Chang, Ton Kloks, Hung-Lung Wang

AT-free graphs are characterized by vertex elimination orders. We show that these AT-free orders of a graph can be generated in constant amortized time.

cs.DM2015★ 1 cited

Flood-it on AT-Free Graphs

Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +2

Solitaire {\sc Flood-it}, or {\sc Honey-Bee}, is a game played on a colored graph. The player resides in a source vertex. Originally his territory is the maximal connected, monochr…

cs.DM2015

Convexities in Some Special Graph Classes ---New Results in AT-free Graphs and Beyond

Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu +2

We study convexity properties of graphs. In this paper we present a linear-time algorithm for the geodetic number in tree-cographs. Settling a 10-year-old conjecture, we prove that…

cs.DM2015★ 1 cited

Rainbow domination and related problems on some classes of perfect graphs

Wing-Kai Hon, Ton Kloks, Hsian-Hsuan Liu +1

Let $k \in N$ and let $G$ be a graph. A function $f : V (G) \to 2^{[k]}$ is a rainbow function if, for every vertex $x$ with $f (x) = \emptyset$ , $f (N (x)) = [k]$ . The ra…

cs.DS2014

An optimal algorithm for the weighted backup 2-center problem on a tree