I'm an Applied Scientist in Amazon, based in Luxembourg. I build and analyse optimisation models for the transportation network of the company.
I finished my doctorate at ETH Zürich, in the Theory of Combinatorial Algorithm Group of Prof. Bernd Gärtner and Prof. Emo Welzl. My supervisor was Prof. Bernd Gärtner. Before, I studied a master's programme in operational research at London School of Economics, where I wrote a thesis under the supervision of Prof. Gregory Sorkin.
My general research interests are algorithms, computational complexity, discrete structure, and optimisation. In particular, I am interested in algorithmic questions in many areas such as combinatorial optimisation, graph theory, operational research, and computational geometry.
E-mail: phuchung.hoang{at}gmail
Combinatorial generation via permutation languages. V. Acyclic orientations [arxiv]
(with Jean Cardinal,
Arturo Merino,
Ondřej Mička, and
Torsten Mütze)
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs [arxiv]
(with Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram,
I. Vinod Reddy
)
Assistance and Interdiction Problems on Interval Graphs [arxiv]
(with Stefan Lendl and Lasse Wulf)
in Discrete Applied Mathematics, to appear
Drawings of Complete Multipartite Graphs Up to Triangle Flips
(with Oswin Aichholzer,
Man-Kwun Chiu,
Michael Hoffmann,
Jan Kynčl,
Yannic Maus,
Birgit Vogtenhuber,
Alexandra Weinberger
)
in Proceedings of the 39th International Symposium on Computational Geometry (SoCG 2023), to appear
Zigzagging through acyclic orientations of graphs and hypergraphs
(with Jean Cardinal,
Arturo Merino,
Ondřej Mička, and
Torsten Mütze)
in Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA23)
A Subexponential Algorithm for ARRIVAL
(with Bernd Gärtner and Sebastian Haslebacher)
in Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Combinatorial generation via permutation languages: II. Lattice congruences [arxiv]
(with Torsten Mütze)
in Israel Journal of Mathematics, to appear
Combinatorial generation via permutation languages: I. Fundamentals [arxiv]
(with Elizabeth Hartung, Torsten Mütze, and Aaron Williams)
in Transactions of the AMS, to appear
Combinatorial generation via permutation languages [poster]
(with Elizabeth Hartung, Torsten Mütze, and Aaron Williams)
in Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA20)
Optimization in Data Science, Spring 2022
Algorithms Lab, Autumn 2021
Computer Science 1, Spring 2021
Algorithms Lab, Autumn 2020
Optimization in Data Science, Spring 2020 (Head Assistant)
Algorithms, Probability, and Computing, Autumn 2019
Optimization in Data Science, Spring 2019
Hardness of Approximating the Rank of a Graph Divisor Mittagsseminar, ETH Zürich, Switzerland, May 2022
Gioan's Theorem for complete bipartite graph Mittagsseminar, ETH Zürich, Switzerland, Dec 2021
A subexponential algorithm for ARRIVAL,
Assistance and interdiction problems on interval graphs Mittagsseminar, ETH Zürich, Switzerland, Nov 2020
Flip graph of combinatorial triangulations, Mittagsseminar, ETH Zürich, Switzerland, May 2020
ARRIVAL: A zero-player reachability switching game,
Combinatorial generation via permutation languages, ACM-SIAM Symposium on Discrete Algorithms 2020 (SODA20), Salt Lake City, UT, US, Jan 2020
Lattice quotients of the weak order, Mittagsseminar, ETH Zürich, Switzerland, Nov 2019
Exhaustive generation of pattern-avoiding permutations, Permutation Patterns 2019, Zurich, Switzerland, Jun 2019
Rank deficiency distribution of constrained random k-XORSAT matrix, ETH Zürich, Switzerland, Jul 2018
Lukas Hächler, Statistics for Tram Traffic Safety in Zurich, Master CS, Aug 2022, with Bernd Gärtner and Julia Hörrmann
Ferdinand Nussbaum, Minimal and Maximal Elements of Lattice Congruences, Bachelor CS, Sep 2022
Alain Bastian, Minimum partition into plane subgraphs, Master CS, Mar 2022, with Michael Hoffmann
Manuel Wiedmer, Reachability in the Hunger Game, Semester Thesis Maths, Sep 2021, with Bernd Gärtner
Chio Ge, The Multi-Run Procedure in ARRIVAL, Bachelor CS, Jul 2021, with Bernd Gärtner
Sebastian Haslebacher, Restrictions on ARRIVAL (part 2), Practical Work CS, Jan 2021, with Bernd Gärtner
Sebastian Haslebacher, Restrictions on ARRIVAL, Bachelor CS, Jul 2020, with Bernd Gärtner
Manuel Nowack, Minimum jump graph, Bachelor CS, Jul 2020, with Torsten Mütze
Janis Nertinger, One line and n points deterministically, Master Maths, Sep 2019, with Michael Hoffmann
Giovanni Compagnoni, Flip graphs of combinatorial triangulations, Master Maths, Sep 2019, with Michael Hoffmann
Jan Schilliger, Unique sink orientations and End of potential line, Bachelor CS, Jul 2019, with Bernd Gärtner
Jakob Roffler, Solving small unique sink orientations, Bachelor CS, Mar 2019, with Bernd Gärtner