Остановите войну!
for scientists:
default search action
Hing-Fung Ting
- > Home > Persons > Hing-Fung Ting
Publications
- 2023
- [j60]Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin, Yong Zhang:
A linear-time certifying algorithm for recognizing generalized series-parallel graphs. Discret. Appl. Math. 325: 152-171 (2023) - 2020
- [j54]Yong Zhang, Francis Y. L. Chin, Sheung-Hung Poon, Hing-Fung Ting, Dachuan Xu, Dongxiao Yu:
Offline and online algorithms for single-minded selling problem. Theor. Comput. Sci. 821: 15-22 (2020) - 2018
- [j50]Yong Zhang, Francis Y. L. Chin, Francis C. M. Lau, Haisheng Tan, Hing-Fung Ting:
Constant competitive algorithms for unbounded one-Way trading under monotone hazard rate. Math. Found. Comput. 1(4): 383-392 (2018) - [c74]Francis Y. L. Chin, Sheung-Hung Poon, Hing-Fung Ting, Dachuan Xu, Dongxiao Yu, Yong Zhang:
Approximation and Competitive Algorithms for Single-Minded Selling Problem. AAIM 2018: 98-110 - 2017
- [c72]Francis Y. L. Chin, Francis C. M. Lau, Haisheng Tan, Hing-Fung Ting, Yong Zhang:
Unbounded One-Way Trading on Distributions with Monotone Hazard Rate. COCOA (1) 2017: 439-449 - 2016
- [j45]Yong Zhang, Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Deshi Ye, Feng Zhang, Jianyu Shi:
Constrained pairwise and center-star sequences alignment problems. J. Comb. Optim. 32(1): 79-94 (2016) - 2015
- [j40]Francis Y. L. Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang, Diwei Zhou:
Competitive algorithms for unbounded one-way trading. Theor. Comput. Sci. 607: 35-48 (2015) - 2014
- [j38]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
Online pricing for bundles of multiple items. J. Glob. Optim. 58(2): 377-387 (2014) - [j37]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
Constant-competitive tree node assignment. Theor. Comput. Sci. 518: 10-21 (2014) - [j36]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Chung Keung Poon, Yung H. Tsin, Deshi Ye:
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing. Theor. Comput. Sci. 554: 135-149 (2014) - [c65]Francis Y. L. Chin, Bin Fu, Minghui Jiang, Hing-Fung Ting, Yong Zhang:
Competitive Algorithms for Unbounded One-Way Trading. AAIM 2014: 32-43 - [c63]Yong Zhang, Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Deshi Ye, Feng Zhang, Jianyu Shi:
On the Complexity of Constrained Sequences Alignment Problems. FAW 2014: 309-319 - 2013
- [j35]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han:
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing. J. Comb. Optim. 26(2): 223-236 (2013) - [c60]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Chung Keung Poon, Yung H. Tsin, Deshi Ye:
Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing. COCOON 2013: 506-517 - 2012
- [j32]Yong Zhang, Yuxin Wang, Francis Y. L. Chin, Hing-Fung Ting:
Competitive Algorithms for Online Pricing. Discret. Math. Algorithms Appl. 4(2) (2012) - [j31]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Joseph Wun-Tat Chan, Xin Han, Ka-Cheong Lam:
Online call control in cellular networks revisited. Inf. Process. Lett. 112(1-2): 21-25 (2012) - [c58]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
Online Pricing for Multi-type of Items. FAW-AAIM 2012: 82-92 - 2011
- [j28]Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin:
Uniformly inserting points on square grid. Inf. Process. Lett. 111(16): 773-779 (2011) - [j27]Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
Online tree node assignment with resource augmentation. J. Comb. Optim. 22(3): 359-377 (2011) - [j26]Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang, Yong Zhang:
A new upper bound 2.5545 on 2D Online Bin Packing. ACM Trans. Algorithms 7(4): 50:1-50:18 (2011) - [c54]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Zhuo Chang:
Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing. FAW-AAIM 2011: 308-318 - [c53]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
Competitive Algorithms for Online Pricing. COCOON 2011: 391-401 - 2010
- [j25]Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
A Constant-Competitive Algorithm for Online OVSF Code Assignment. Algorithmica 56(1): 89-104 (2010) - [j23]Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
One-Space Bounded Algorithms for Two-Dimensional Bin Packing. Int. J. Found. Comput. Sci. 21(6): 875-891 (2010) - [c50]Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin:
Online Uniformly Inserting Points on Grid. AAIM 2010: 281-292 - [c48]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs. COCOON 2010: 100-109 - [c46]Joseph Wun-Tat Chan, Francis Y. L. Chin, Xin Han, Ka-Cheong Lam, Hing-Fung Ting, Yong Zhang:
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. FAW 2010: 222-233 - [c45]Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin Han, Hing-Fung Ting, Yung H. Tsin:
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing. ISAAC (2) 2010: 242-253 - [i6]Joseph Wun-Tat Chan, Francis Y. L. Chin, Xin Han, Ka-Cheong Lam, Hing-Fung Ting, Yong Zhang:
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. CoRR abs/1009.2322 (2010) - 2009
- [c42]Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
Variable-Size Rectangle Covering. COCOA 2009: 145-154 - [c41]Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
Online Tree Node Assignment with Resource Augmentation. COCOON 2009: 358-367 - [c39]Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
1-Bounded Space Algorithms for 2-Dimensional Bin Packing. ISAAC 2009: 321-330 - [i5]Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang:
A New Upper Bound on 2D Online Bin Packing. CoRR abs/0906.0409 (2009) - 2008
- [c35]Joseph Wun-Tat Chan, Francis Y. L. Chin, Xiangyu Hong, Hing-Fung Ting:
Dynamic Offline Conflict-Free Coloring for Unit Disks. WAOA 2008: 241-252 - 2007
- [c32]Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
A Constant-Competitive Algorithm for Online OVSF Code Assignment. ISAAC 2007: 452-463 - 2003
- [j13]Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
Escaping a Grid by Edge-Disjoint Paths. Algorithmica 36(4): 343-359 (2003) - 2000
- [c12]Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
Escaping a grid by edge-disjoint paths. SODA 2000: 726-734 - 1999
- [c8]Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
A Faster Algorithm for Finding Disjoint Paths in Grids. ISAAC 1999: 393-402 - 1990
- [j2]Francis Y. L. Chin, H. F. Ting:
Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees. SIAM J. Comput. 19(4): 612-626 (1990) - 1987
- [j1]Francis Y. L. Chin, H. F. Ting:
An Improved Algorithm for Finding the Median Distributively. Algorithmica 2: 235-249 (1987) - 1985
- [c2]Francis Y. L. Chin, H. F. Ting:
An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees. FOCS 1985: 257-266 - [c1]Francis Y. L. Chin, H. F. Ting:
A Near-optimal Algorithm for Finding the Median Distributively. ICDCS 1985: 459-465
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint