Yunhong Min

Orcid: 0000-0001-6451-1959

According to our database1, Yunhong Min authored at least 16 papers between 2011 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
Drifting Field Policy: A One-Step Generative Policy via Wasserstein Gradient Flow.
CoRR, May, 2026

2025
MatLat: Material Latent Space for PBR Texture Generation.
CoRR, December, 2025

BézierFlow: Learning Bézier Stochastic Interpolant Schedulers for Few-Step Generation.
CoRR, December, 2025

Psi-Sampler: Initial Particle Sampling for SMC-Based Inference-Time Reward Alignment in Score Models.
CoRR, June, 2025

Ψ-Sampler: Initial Particle Sampling for SMC-Based Inference-Time Reward Alignment in Score Models.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

ORIGEN: Zero-Shot 3D Orientation Grounding in Text-to-Image Generation.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

2024
DAFT-GAN: Dual Affine Transformation Generative Adversarial Network for Text-Guided Image Inpainting.
Proceedings of the 32nd ACM International Conference on Multimedia, MM 2024, Melbourne, VIC, Australia, 28 October 2024, 2024

2023
A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work.
4OR, September, 2023

2022
Scheduling with generalized and periodic due dates under single- and two-machine environments.
Optim. Lett., 2022

A single machine scheduling with generalized and periodic due dates to minimize total deviation.
Discret. Appl. Math., 2022

2021
A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work.
Asia Pac. J. Oper. Res., 2021

2020
Two-machine flow shops with an optimal permutation schedule under a storage constraint.
J. Sched., 2020

Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates.
Asia Pac. J. Oper. Res., 2020

2019
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates.
Oper. Res. Lett., 2019

2011
Approximation of a batch consolidation problem.
Networks, 2011

Dynamic execution planning for reliable collaborative business processes.
Inf. Sci., 2011


  Loading...