The following pages link to Maw-Shang Chang (Q233432):
Displaying 50 items.
- (Q189691) (redirect page) (← links)
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property (Q407573) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Block-graph width (Q534563) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- A property tester for tree-likeness of quartet topologies (Q649111) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- (Q916388) (redirect page) (← links)
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs (Q916391) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- On probe permutation graphs (Q967305) (← links)
- Signed and minus clique-transversal functions on graphs (Q976135) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341) (← links)
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs (Q1195486) (← links)
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488) (← links)
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- On minimum intersection of two minimum dominating sets of interval graphs (Q1377653) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs (Q1920227) (← links)
- Recognition of probe distance-hereditary graphs (Q1932454) (← links)
- New fixed-parameter algorithms for the minimum quartet inconsistency problem (Q1959377) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- Testing consistency of quartet topologies: a parameterized approach (Q2445322) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- Weighted irredundance of interval graphs. (Q2583539) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← links)
- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem (Q3503579) (← links)
- The 3-Steiner Root Problem (Q3508559) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- Partitioned Probe Comparability Graphs (Q3522955) (← links)
- Block-Graph Width (Q3630199) (← links)
- 20‐relative neighborhood graphs are hamiltonian (Q3984463) (← links)
- (Q4201930) (← links)
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs (Q4210127) (← links)
- (Q4232775) (← links)
- Deferred-query: An efficient approach for some problems on interval graphs (Q4262690) (← links)
