Chao Liao

From MaRDI portal
Person:2166748

Available identifiers

zbMath Open liao.chaoMaRDI QIDQ2166748

List of research outcomes





PublicationDate of PublicationType
Almost tight approximation hardness for single-source directed \(k\)-edge-connectivity2024-06-24Paper
Counting Independent Sets and Colorings on Random Regular Bipartite Graphs2023-02-03Paper
An FPTAS for the hardcore model on random regular bipartite graphs2022-08-25Paper
Survivable Network Design Revisited: Group-Connectivity2022-04-28Paper
Zeros of Holant Problems2022-02-08Paper
Zeros of Holant problems: locations and algorithms2019-10-15Paper
Counting Hypergraph Colorings in the Local Lemma Regime2019-09-02Paper
Counting hypergraph colourings in the local lemma regime2019-08-22Paper
The Beachcombers’ Problem: Walking and Searching from an Inner Point of a Line2016-04-13Paper

Research outcomes over time

This page was built for person: Chao Liao

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2166748&oldid=6260152"
Powered by MediaWiki