Person:217890: Difference between revisions

From MaRDI portal
Person:217890
Created automatically from import230922100944
 
m AuthorDisambiguator moved page Ming-Tat Ko to Ming-Tat Ko: Duplicate
 
(No difference)

Latest revision as of 09:25, 9 December 2023

Available identifiers

zbMath Open ko.ming-tatMaRDI QIDQ217890

List of research outcomes





PublicationDate of PublicationType
Equitable and \(m\)-bounded coloring of split graphs2024-07-05Paper
Budget-constrained cost-covering job assignment for a total contribution-maximizing platform2023-12-22Paper
Graph searching on chordal graphs2023-01-25Paper
A New Subclass of Integer Linear Programming Problems and Its Applications2017-07-12Paper
Bounded fan-out \(m\)-center problem2016-05-26Paper
Resequencing a set of strings based on a target string2015-07-10Paper
Linear-time algorithms for tree root problems2015-05-26Paper
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy2009-12-18Paper
The 3-Steiner Root Problem2008-07-01Paper
Node-searching problem on block graphs2007-11-30Paper
Linear-Time Algorithms for Tree Root Problems2007-09-07Paper
The Hamiltonian problem on distance-hereditary graphs2006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q54633502005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q48086242004-08-12Paper
Schedulable region for VBR media transmission with optimal resource allocation and utilization2003-06-25Paper
Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs2003-01-05Paper
Perfect edge domination and efficient edge domination in graphs2002-08-29Paper
Control of Feature-point-driven Facial Animation Using a Hypothetical Face2002-05-14Paper
Online traffic smoothing for delivery of variable bit rate media streams2002-05-14Paper
https://portal.mardi4nfdi.de/entity/Q42698192002-02-25Paper
https://portal.mardi4nfdi.de/entity/Q45112232001-08-12Paper
A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs2000-10-04Paper
https://portal.mardi4nfdi.de/entity/Q42495311999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42467501999-06-15Paper
https://portal.mardi4nfdi.de/entity/Q42184311998-11-11Paper
https://portal.mardi4nfdi.de/entity/Q46975761995-08-27Paper
Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance1993-05-16Paper
On weighted rectilinear 2-center and 3-center problems1991-01-01Paper

Research outcomes over time

This page was built for person: Ming-Tat Ko