![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Hung P. Hoang 0001
Person information
- affiliation: TU Wien, Austria
- affiliation (former): ETH Zürich, Switzerland
Other persons with the same name
- Hung P. Hoang 0002 — University of Arkansas, Fayetteville, AR, USA
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy:
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs. Algorithmica 86(7): 2250-2288 (2024) - [c5]Sophia Heimann, Hung P. Hoang, Stefan Hougardy:
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5. ICALP 2024: 84:1-84:18 - [i8]Sophia Heimann, Hung P. Hoang, Stefan Hougardy:
The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k≥5. CoRR abs/2402.07061 (2024) - [i7]Robert Ganian, Hung P. Hoang, Simon Wietheger:
Parameterized Complexity of Efficient Sortation. CoRR abs/2404.16741 (2024) - 2023
- [j3]Hung P. Hoang
, Stefan Lendl
, Lasse Wulf
:
Assistance and interdiction problems on interval graphs. Discret. Appl. Math. 340: 153-170 (2023) - [j2]Kristóf Bérczi
, Hung P. Hoang, Lilla Tóthmérész:
On approximating the rank of graph divisors. Discret. Math. 346(9): 113528 (2023) - [j1]Jean Cardinal, Hung Phuc Hoang, Arturo Merino
, Ondrej Micka
, Torsten Mütze:
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations. SIAM J. Discret. Math. 37(3): 1509-1547 (2023) - [c4]Oswin Aichholzer
, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl
, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger
:
Drawings of Complete Multipartite Graphs up to Triangle Flips. SoCG 2023: 6:1-6:16 - [c3]Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Torsten Mütze:
Zigzagging through acyclic orientations of chordal graphs and hypergraphs. SODA 2023: 3029-3042 - [i6]Oswin Aichholzer
, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger:
Drawings of Complete Multipartite Graphs Up to Triangle Flips. CoRR abs/2303.07401 (2023) - 2022
- [b1]Hung Phuc Hoang:
On Two Combinatorial Reconfiguration Problems: Reachability and Hamiltonicity. ETH Zurich, Zürich, Switzerland, 2022 - [i5]Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész:
On approximating the rank of graph divisors. CoRR abs/2206.09662 (2022) - [i4]Jean Cardinal, Hung Phuc Hoang, Arturo Merino, Ondrej Micka
, Torsten Mütze:
Combinatorial generation via permutation languages. V. Acyclic orientations. CoRR abs/2212.03915 (2022) - 2021
- [c2]Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang
:
A Subexponential Algorithm for ARRIVAL. ICALP 2021: 69:1-69:14 - [i3]Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang:
A Subexponential Algorithm for ARRIVAL. CoRR abs/2102.06427 (2021) - [i2]Hung P. Hoang, Stefan Lendl, Lasse Wulf:
Assistance and Interdiction Problems on Interval Graphs. CoRR abs/2107.14550 (2021) - 2020
- [c1]Elizabeth Hartung
, Hung Phuc Hoang, Torsten Mütze, Aaron Williams:
Combinatorial generation via permutation languages. SODA 2020: 1214-1225
2010 – 2019
- 2019
- [i1]Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams:
Combinatorial generation via permutation languages. I. Fundamentals. CoRR abs/1906.06069 (2019)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint