Junyu Huang

Orcid: 0009-0004-1817-8218

According to our database1, Junyu Huang authored at least 24 papers between 2020 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Learning-augmented approximation algorithms for group fair k-center clustering.
Frontiers Comput. Sci., October, 2026

Efficient coreset construction algorithm for fair k-median of lines.
Theor. Comput. Sci., 2026

Robust LLM-based Multi-Agent System with Action Negotiation and Sharing Redundancy Enhancement.
Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1, 2026

A More Efficient Reduction from Outlier-Aware to Outlier-Free k-Median.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

Linear Time Algorithms for Individually Fair k-means via Multi-Swap Local Search.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
DREAM: Dynamic Red-teaming across Environments for AI Models.
CoRR, December, 2025

CRE-YOLO: Efficient Jaboticaba Tree Detection on UAV Platforms.
IEEE Access, 2025

Parameterized Approximation Algorithm for Doubly Constrained Fair Clustering.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

New Algorithms for the Learning-Augmented k-means Problem.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Coresets for k-Median of Lines with Group Fairness Constraints.
Proceedings of the Computing and Combinatorics, 2025

Fully-Scalable Massively Parallel Algorithm for k-center with Outliers.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024
Parameterized Approximation Schemes for Fair-Range Clustering.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Faster Approximation Schemes for (Constrained) k-Means with Outliers.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Near-Linear Time Approximation Algorithms for k-means with Outliers.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

SEC: More Accurate Clustering Algorithm via Structural Entropy.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Improved approximation algorithms for solving the squared metric <i>k</i>-facility location problem.
Theor. Comput. Sci., 2023

Linear Time Algorithms for k-means with Multi-Swap Local Search.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Fast Algorithms for Distributed k-Clustering with Outliers.
Proceedings of the International Conference on Machine Learning, 2023

2022
An approximation algorithm for lower-bounded k-median with constant factor.
Sci. China Inf. Sci., 2022

FLS: A New Local Search Algorithm for K-means with Smaller Search Space.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Improved approximation for prize-collecting red-blue median.
Theor. Comput. Sci., 2021

A local search algorithm for <i>k</i>-means with outliers.
Neurocomputing, 2021

2020
An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem.
Proceedings of the Theory and Applications of Models of Computation, 2020

A Constant Factor Approximation for Lower-Bounded <i>k</i>-Median.
Proceedings of the Theory and Applications of Models of Computation, 2020


  Loading...