Ling-Ju Hung

From MaRDI portal
Person:306105

Available identifiers

zbMath Open hung.ling-juMaRDI QIDQ306105

List of research outcomes





PublicationDate of PublicationType
Hardness and approximation for the star \(\beta \)-hub routing cost problem in \(\varDelta_\beta \)-metric graphs2024-08-22Paper
Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms2023-08-03Paper
Further Results on Online Node- and Edge-Deletion Problems with Advice2022-10-13Paper
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks2022-07-01Paper
On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality2022-06-28Paper
Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs2022-06-13Paper
Online node- and edge-deletion problems with advice2021-09-02Paper
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem2020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q32955052020-07-10Paper
Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs2020-01-16Paper
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem2018-12-03Paper
Fixed-parameter algorithms for Vertex Cover \(P_3\)2018-05-24Paper
Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality2017-11-14Paper
The approximability of the \(p\)-hub center problem with parameterized triangle inequality2017-10-23Paper
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality2017-07-21Paper
Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs2016-09-02Paper
An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs2016-08-31Paper
Moderately exponential time algorithms for the maximum induced matching problem2015-07-22Paper
Finding large \(k\)-clubs in undirected graphs2015-01-26Paper
https://portal.mardi4nfdi.de/entity/Q54145912014-05-06Paper
Exact algorithms for problems related to the densest \(k\)-set problem2014-05-05Paper
Recognition of probe distance-hereditary graphs2013-01-18Paper
Recognition of Probe Ptolemaic Graphs2011-05-19Paper
Block-graph width2011-05-18Paper
Black-and-white threshold graphs2011-04-19Paper
Classifying Rankwidth k-DH-Graphs2010-06-22Paper
On Some Simple Widths2010-02-09Paper
Trivially-Perfect Width2009-12-11Paper
An improved algorithm for the maximum agreement subtree problem2009-12-04Paper
Block-Graph Width2009-06-03Paper

Research outcomes over time

This page was built for person: Ling-Ju Hung