Hung Hoang

About

I am a doctoral student at ETH Zürich, in the Theory of Combinatorial Algorithm Group of Prof. Bernd Gärtner and Prof. Emo Welzl. My supervisor is 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 in combinatorial algorithms, 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.

Contact

Institute of Theoretical Computer Science Department of Computer Science
ETH Zürich, CAB G19.2
Universitätstrasse 6
8092 Zürich
Switzerland

Phone: +41 44 632 69 86
E-mail: firstname.lastname{at}inf.ethz.ch

Publications

A Subexponential Algorithm for ARRIVAL [arxiv]
(with Bernd Gärtner and Sebastian Haslebacher)
in Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), to appear

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)

Teaching

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

Talks

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

Supervised Theses

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

(Potentially) Fun Facts