Dr. Hung Tran

Photo
Institut für Informatik
Room 310
Robert-Mayer-Straße 11-15
60325 Frankfurt am Main
Germany
 
hung@ae.cs.uni-frankfurt.de
+49-69-798-28814

Publications

1
Ulrich Meyer, Hung Tran, and Konstantinos Tsakalidis. Certifying induced subgraphs in large graphs. Journal of Graph Algorithms and Applications (accepted), 2024. @article{JGAA24, author = "Meyer, Ulrich and Tran, Hung and Tsakalidis, Konstantinos", title = "Certifying Induced Subgraphs in Large Graphs", journal = "Journal of Graph Algorithms and Applications (accepted)", year = "2024" }
2
Vianney Brouard, Cornelia Pokalyuk, Marco Seiler, and Hung Tran. Spatial invasion of cooperative parasites. Theoretical Population Biology, 159:35–38, 2024. doi:10.1016/j.tpb.2024.07.001 @article{TPB24, author = "Brouard, Vianney and Pokalyuk, Cornelia and Seiler, Marco and Tran, Hung", title = "Spatial Invasion of Cooperative Parasites", journal = "Theoretical Population Biology", volume = "159", pages = "35--38", year = "2024", doi = "10.1016/j.tpb.2024.07.001" }
3
Ulrich Meyer, Hung Tran, and Konstantinos Tsakalidis. Certifying induced subgraphs in large graphs. In Chun-Cheng Lin, Bertrand M. T. Lin, and Giuseppe Liotta, editors, WALCOM: Algorithms and Computation - 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings, volume 13973 of Lecture Notes in Computer Science, 229–241. Springer, 2023. @inproceedings{DBLP:conf/walcom/MeyerTT23, author = "Meyer, Ulrich and Tran, Hung and Tsakalidis, Konstantinos", editor = "Lin, Chun{-}Cheng and Lin, Bertrand M. T. and Liotta, Giuseppe", title = "Certifying Induced Subgraphs in Large Graphs", booktitle = "{WALCOM:} Algorithms and Computation - 17th International Conference and Workshops, {WALCOM} 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings", series = "Lecture Notes in Computer Science", volume = "13973", pages = "229--241", publisher = "Springer", year = "2023" }
4
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, and Hung Tran. Parallel and I/O-efficient algorithms for non-linear preferential attachment. In Gonzalo Navarro and Julian Shun, editors, Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, 65–76. SIAM, 2023. View Online doi:10.1137/1.9781611977561.ch6 @inproceedings{DBLP:conf/alenex/Allendorf0PT23, author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung", editor = "Navarro, Gonzalo and Shun, Julian", title = "Parallel and {I/O}-Efficient Algorithms for Non-Linear Preferential Attachment", doi = "10.1137/1.9781611977561.ch6", url = "https://doi.org/10.1137/1.9781611977561.ch6", booktitle = "Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2023, Florence, Italy, January 22-23, 2023", pages = "65--76", publisher = "{SIAM}", year = "2023" }
5
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, and Hung Tran. Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees. J. Parallel Distributed Comput., 174:118–129, 2023. View Online doi:10.1016/j.jpdc.2022.12.010 @article{DBLP:journals/jpdc/AllendorfMPT23, author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung", title = "Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees", doi = "10.1016/j.jpdc.2022.12.010", url = "https://doi.org/10.1016/j.jpdc.2022.12.010", journal = "J. Parallel Distributed Comput.", volume = "174", pages = "118--129", year = "2023" }
6
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Nick Wormald. Engineering uniform sampling of graphs with a prescribed power-law degree sequence. In 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 27–40. SIAM, 2022. View Online doi:10.1137/1.9781611977042.3 @inproceedings{allendorf2022engineering, author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wormald, Nick", title = "Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence", booktitle = "2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)", pages = "27--40", year = "2022", organization = "SIAM", url = "https://doi.org/10.1137/1.9781611977042.3", doi = "10.1137/1.9781611977042.3" }
7
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, and Hung Tran. Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees. In 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), volume, 269–279. Los Alamitos, CA, USA, jun 2022. IEEE Computer Society. View Online doi:10.1109/IPDPS53621.2022.00034 @inproceedings{allendorf2022parallel, author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung", booktitle = "2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)", title = "Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees", year = "2022", volume = "", issn = "", pages = "269-279", keywords = "distributed processing;runtime;scalability;switches;markov processes;data structures;generators", doi = "10.1109/IPDPS53621.2022.00034", url = "https://doi.ieeecomputersociety.org/10.1109/IPDPS53621.2022.00034", publisher = "IEEE Computer Society", address = "Los Alamitos, CA, USA", month = "jun" }
8
Hung Tran. Uniform sampling of simple graphs with prescribed degrees and experimental algorithms for external memory. PhD thesis, Goethe University Frankfurt, Germany, 2022. @phdthesis{tran2022, author = "Tran, Hung", title = "Uniform sampling of simple graphs with prescribed degrees and experimental algorithms for external memory", type = "doctoralthesis", pages = "216", school = "Goethe University Frankfurt, Germany", year = "2022" }
9
Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, and Hung Tran. An experimental study of external memory algorithms for connected components. In David Coudert and Emanuele Natale, editors, 19th International Symposium on Experimental Algorithms (SEA 2021), volume 190 of Leibniz International Proceedings in Informatics (LIPIcs), 23:1–23:23. Dagstuhl, Germany, 2021. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. View Online doi:10.4230/LIPIcs.SEA.2021.23 @InProceedings{brodal_et_al:LIPIcs.SEA.2021.23, author = "Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Hammer, David and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung", editor = "Coudert, David and Natale, Emanuele", title = "An Experimental Study of External Memory Algorithms for Connected Components", booktitle = "19th International Symposium on Experimental Algorithms (SEA 2021)", pages = "23:1--23:23", series = "Leibniz International Proceedings in Informatics (LIPIcs)", ISBN = "978-3-95977-185-6", ISSN = "1868-8969", year = "2021", volume = "190", publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = "Dagstuhl, Germany", URL = "https://drops.dagstuhl.de/opus/volltexte/2021/13795", URN = "urn:nbn:de:0030-drops-137958", doi = "10.4230/LIPIcs.SEA.2021.23", annote = "Keywords: Connected Components, Experimental Evaluation, External Memory, Graph Algorithms, Randomization" }
10
Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, and Hung Tran. Simulating Population Protocols in Sub-Constant Time per Interaction. In Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, editors, 28th Annual European Symposium on Algorithms (ESA 2020), volume 173 of Leibniz International Proceedings in Informatics (LIPIcs), 16:1–16:22. Dagstuhl, Germany, 2020. Schloss Dagstuhl–Leibniz-Zentrum für Informatik. View Online doi:10.4230/LIPIcs.ESA.2020.16 @InProceedings{berenbrink_et_al:LIPIcs:2020:12882, author = "Berenbrink, Petra and Hammer, David and Kaaser, Dominik and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung", editor = "Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter", title = "{Simulating Population Protocols in Sub-Constant Time per Interaction}", booktitle = "28th Annual European Symposium on Algorithms (ESA 2020)", pages = "16:1--16:22", series = "Leibniz International Proceedings in Informatics (LIPIcs)", ISBN = "978-3-95977-162-7", ISSN = "1868-8969", year = "2020", volume = "173", publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, address = "Dagstuhl, Germany", URL = "https://drops.dagstuhl.de/opus/volltexte/2020/12882", URN = "urn:nbn:de:0030-drops-128827", doi = "10.4230/LIPIcs.ESA.2020.16", annote = "Keywords: Population Protocols, Simulation, Random Sampling, Dynamic Alias Table" }
11
Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner. Parallel and I/O-efficient randomisation of massive networks using global curveball trades. In Yossi Azar, Hannah Bast, and Grzegorz Herman, editors, 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, volume 112 of LIPIcs, 11:1–11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. View Online doi:10.4230/LIPIcs.ESA.2018.11 @inproceedings{DBLP:conf/esa/CarstensH0PTW18, author = "Carstens, Corrie Jacobien and Hamann, Michael and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wagner, Dorothea", editor = "Azar, Yossi and Bast, Hannah and Herman, Grzegorz", biburl = "https://dblp.org/rec/conf/esa/CarstensH0PTW18.bib", booktitle = "26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22, 2018, Helsinki, Finland", doi = "10.4230/LIPIcs.ESA.2018.11", pages = "11:1--11:15", publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, series = "LIPIcs", title = "Parallel and {I/O}-efficient Randomisation of Massive Networks using Global Curveball Trades", url = "https://doi.org/10.4230/LIPIcs.ESA.2018.11", volume = "112", year = "2018" }
12
Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner. I/O-efficient generation of massive graphs following the LFR benchmark. ACM Journal of Experimental Algorithmics, 2018. View Online doi:10.1145/3230743 @article{DBLP:journals/jea/HamannMPTW18, author = "Hamann, Michael and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wagner, Dorothea", biburl = "https://dblp.org/rec/journals/jea/HamannMPTW18.bib", doi = "10.1145/3230743", journal = "{ACM} Journal of Experimental Algorithmics", title = "{I/O}-Efficient Generation of Massive Graphs Following the {LFR} Benchmark", url = "https://doi.org/10.1145/3230743", volume = "23", year = "2018" }