Hsin-Hao Su

From MaRDI portal
Person:848943

Available identifiers

zbMath Open su.hsin-haoMaRDI QIDQ848943

List of research outcomes





PublicationDate of PublicationType
Breaking 3-factor approximation for correlation clustering in polylogarithmic rounds2024-11-28Paper
https://portal.mardi4nfdi.de/entity/Q61263242024-04-09Paper
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition2024-03-26Paper
Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions2024-03-26Paper
(1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings2024-03-26Paper
Distributed dense subgraph detection and low outdegree orientation2023-11-02Paper
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition2023-06-14Paper
Distributed data summarization in well-connected networks2023-02-03Paper
Ant-Inspired Dynamic Task Allocation via Gossiping2022-11-04Paper
On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs2022-10-22Paper
Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds2022-07-21Paper
Towards the locality of Vizing’s theorem2020-01-30Paper
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations2019-09-19Paper
https://portal.mardi4nfdi.de/entity/Q52247312019-07-24Paper
https://portal.mardi4nfdi.de/entity/Q52247302019-07-24Paper
https://portal.mardi4nfdi.de/entity/Q57434862019-05-10Paper
Ant-inspired density estimation via random walks2019-01-11Paper
https://portal.mardi4nfdi.de/entity/Q45598822018-12-04Paper
Scaling Algorithms for Weighted Matching in General Graphs2018-11-12Paper
Distributed Degree Splitting, Edge Coloring, and Orientations2018-07-16Paper
Scaling Algorithms for Weighted Matching in General Graphs2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q46361972018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46361652018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46361872018-04-23Paper
Distributed MST and Routing in Almost Mixing Time2017-10-11Paper
(2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting2017-10-05Paper
Ant-Inspired Density Estimation via Random Walks2017-09-29Paper
Distributed algorithms for the Lovász local lemma and graph coloring2017-09-04Paper
https://portal.mardi4nfdi.de/entity/Q31787962016-12-20Paper
https://portal.mardi4nfdi.de/entity/Q31787932016-12-20Paper
Clairvoyant Mechanisms for Online Auctions2016-09-02Paper
On edge balance index sets of the irregular prisms2016-04-13Paper
On the edge-balance index sets of broken wheels2016-04-13Paper
On edge-balance index sets of the finite \(L\)-product of cycles2016-04-13Paper
Distributed algorithms for the Lovász local lemma and graph coloring2015-09-03Paper
Distributed coloring algorithms for triangle-free graphs2015-06-09Paper
https://portal.mardi4nfdi.de/entity/Q52520242015-05-21Paper
https://portal.mardi4nfdi.de/entity/Q52520362015-05-21Paper
Almost-Tight Distributed Minimum Cut Algorithms2015-02-10Paper
https://portal.mardi4nfdi.de/entity/Q54032732014-03-25Paper
Edge-magic indices of stars2014-01-03Paper
An algorithm to calculate the balance index set of a graph2014-01-03Paper
Fast Distributed Coloring Algorithms for Triangle-Free Graphs2013-08-07Paper
https://portal.mardi4nfdi.de/entity/Q31456012012-12-21Paper
https://portal.mardi4nfdi.de/entity/Q31659892012-10-21Paper
https://portal.mardi4nfdi.de/entity/Q31659832012-10-21Paper
https://portal.mardi4nfdi.de/entity/Q31660002012-10-21Paper
On uniformly balanced graphs2012-09-05Paper
https://portal.mardi4nfdi.de/entity/Q30962282011-11-08Paper
https://portal.mardi4nfdi.de/entity/Q30891872011-08-24Paper
https://portal.mardi4nfdi.de/entity/Q30892002011-08-24Paper
On \(k\)-edge-magic Halin graphs2011-07-13Paper
https://portal.mardi4nfdi.de/entity/Q35819242010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35819162010-09-02Paper
On the balance index sets of generalized friendship graphs, envelope graphs of cycles and cubic trees2010-09-02Paper
On edge-balance index sets of fans and broken fans2010-09-02Paper
On balance index sets of \(L\)-products with cycles and complete graphs2010-06-17Paper
An improved algorithm for finding a length-constrained maximum-density subtree in a tree2010-06-09Paper
Efficient algorithms for the problems of enumerating cuts by non-decreasing weights2010-02-23Paper
On the integer-magic spectra of honeycomb graphs2009-03-24Paper

Research outcomes over time

This page was built for person: Hsin-Hao Su