The following pages link to Ling-Ju Hung (Q306105):
Displaying 28 items.
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Block-graph width (Q534563) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Recognition of probe distance-hereditary graphs (Q1932454) (← links)
- Online node- and edge-deletion problems with advice (Q1979452) (← links)
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks (Q2151377) (← links)
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- The approximability of the \(p\)-hub center problem with parameterized triangle inequality (Q2412404) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs (Q2672567) (← links)
- Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs (Q2817864) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← links)
- (Q3295505) (← links)
- On Some Simple Widths (Q3404447) (← links)
- Classifying Rankwidth k-DH-Graphs (Q3569743) (← links)
- Block-Graph Width (Q3630199) (← links)
- Trivially-Perfect Width (Q3651555) (← links)
- Further Results on Online Node- and Edge-Deletion Problems with Advice (Q5041186) (← links)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364) (← links)
- (Q5414591) (← links)
- Hardness and approximation for the star \(\beta \)-hub routing cost problem in \(\varDelta_\beta \)-metric graphs (Q6591461) (← links)
