48 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- National Taipei UniversityTW5 papers
- National Tsing Hua UniversityTW4 papers
- National Taiwan UniversityTW2 papers
- National Taiwan University of Science and TechnologyTW2 papers
- Beijing Jiaotong UniversityCN1 paper
- City University of Hong KongHK1 paper
- Fuzhou UniversityCN1 paper
- Institute for Advanced StudyUS1 paper
- Lunghwa University of Science and TechnologyTW1 paper
- Ming Chi University of TechnologyTW1 paper
- Princeton UniversityUS1 paper
- Tunghai UniversityTW1 paper
11 papers
Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks with Heterogeneous Edge-Core Servers
Xiao-Yan Li, Wanling Lin, Jou-Ming Chang +1
The recently proposed RCube network is a cube-based server-centric data center network (DCN), including two types of heterogeneous servers, called core and edge servers. Remarkably…
The Component Connectivity of Alternating Group Graphs and Split-Stars
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
For an integer , the -component connectivity of a graph , denoted by , is the minimum number of vertices whose removal from results in a…
The 4-Component Connectivity of Alternating Group Networks
Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu +1
The -component connectivity (or -connectivity for short) of a graph , denoted by , is the minimum number of vertices whose removal from results in a d…
Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals: The No-Buffer Case
Yu-Pin Hsu, Eytan Modiano, Lingjie Duan
Age of information is a new network performance metric that captures the freshness of information at end-users. This paper studies the age of information from a scheduling perspect…
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…
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…
Lattice Index Codes from Algebraic Number Fields
Yu-Chih Huang
Broadcasting independent messages to multiple users where each user demands all the messages and has a subset of the messages as side information is studied. Recently, Nataraja…
Rainbow domination and related problems on some classes of perfect graphs
Wing-Kai Hon, Ton Kloks, Hsian-Hsuan Liu +1
Let and let be a graph. A function is a rainbow function if, for every vertex with , . The ra…
Anomalies without an action
Wei-Ming Chen, Yu-tin Huang, David A. McGady
Modern on-shell methods allow us to construct both the classical and quantum S-matrix for a large class of theories, without utilizing knowledge of the interacting Lagrangian. It w…
On Complexities of Minus Domination
Luérbio Faria, Wing-Kai Hon, Ton Kloks +3
A function f: V \rightarrow \{-1,0,1\} is a minus-domination function of a graph G=(V,E) if the values over the vertices in each closed neighborhood sum to a positive number. The w…
Increasing stability in an inverse problem for the acoustic equation
Sei Nagayasu, Gunther Uhlmann, Jenn-Nan Wang
In this work we study the inverse boundary value problem of determining the refractive index in the acoustic equation. It is known that this inverse problem is ill-posed. Nonethele…