researcher

Mingyu Xiao

University of Electronic Science and Technology of China

37 papers hereh-index 211.7k citations132 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author5
first author13
middle author6
last author13

Across the 37 of 37 papers where every author was matched, so the position is known.

fields

affiliations

University of Electronic Science and Technology of China

Homepage

same name

Mingyu Xiao — 14 papers, h 4
Mingyu Xiao — 10 papers, h 1
Mingyu Xiao — 4 papers, h 2
Mingyu Xiao — 3 papers, h 1
Mingyu Xiao — 2 papers, h 1
Mingyu Xiao — 2 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

20082023

most citedExact Algorithms for Maximum Independent Set

143 citations · 330 across the 36 of their papers we have counts for

collaborators

Showing 2020Show all

4 papers · 1 filter

cs.DS2020

Bounded-Degree Cut is Fixed-Parameter Tractable

Mingyu Xiao, Hiroshi Nagamochi

In the bounded-degree cut problem, we are given a multigraph $G = (V, E)$ , two disjoint vertex subsets $A, B \subseteq V$ , two functions $\mathrm{u}_A, \mathrm{u}_B:V\to \{0,1,\ldots,|E…

cs.DS2020

Enhancing Balanced Graph Edge Partition with Effective Local Search

Zhenyu Guo, Mingyu Xiao, Yi Zhou +2

Graph partition is a key component to achieve workload balance and reduce job completion time in parallel graph processing systems. Among the various partition strategies, edge par…

cs.DS2020

The Complexity of the Partition Coloring Problem

Zhenyu Guo, Mingyu Xiao, Yi Zhou

Given a simple undirected graph $G = (V, E)$ and a partition of the vertex set $V$ into $p$ parts, the \textsc{Partition Coloring Problem} asks if we can select one vertex from each p…

cs.DS2020

An Improved Upper Bound for SAT

Huairui Chu, Mingyu Xiao, Zhe Zhang

We show that the CNF satisfiability problem can be solved $O^{*} (1.222 6^{m})$ time, where $m$ is the number of clauses in the formula, improving the known upper bounds $O^{*} (1.23 4^{m})$ g…