Wing-Kai Hon

According to our database1, Wing-Kai Hon authored at least 127 papers between 1999 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 





Efficient meta-data structure in top-<i>k</i> queries of combinations and multi-item procurement auctions.
Theor. Comput. Sci., 2020

A linear-space data structure for range-LCP queries in poly-logarithmic time.
Theor. Comput. Sci., 2020

Historic Moments Discovery in Sequence Data.
ACM Trans. Database Syst., 2019

MetaSMC: a coalescent-based shotgun sequence simulator for evolving microbial populations.
Bioinform., 2019

Optimal File Dissemination Scheduling Under a General Binary Tree of Trust Relationship.
Proceedings of the 18th IEEE International Conference On Trust, 2019

Parameterized Text Indexing with One Wildcard.
Proceedings of the Data Compression Conference, 2019

Budget-constrained multi-battle contests: A new perspective and analysis.
Theor. Comput. Sci., 2018

Reconstructing One-Articulated Networks with Distance Matrices.
J. Comput. Biol., 2018

Dictionary Matching with a Bounded Gap in Pattern or in Text.
Algorithmica, 2018

Compact Encoding for Galled-Trees and Its Applications.
Proceedings of the 2018 Data Compression Conference, 2018

A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity.
Proceedings of the Approximation, 2018

In-place algorithms for exact and approximate shortest unique substring problems.
Theor. Comput. Sci., 2017

Space-time trade-offs for finding shortest unique substrings and maximal unique matches.
Theor. Comput. Sci., 2017

On Finding the Maximum and Minimum Density Axes-parallel Regions in IR<sup>d</sup>.
Fundam. Inform., 2017

On the Grundy number of Cameron graphs.
Electron. Notes Discret. Math., 2017

Partitions of n that avoid partitions of f, and an application to the tiny-pan coin weighing problem.
Discret. Math., 2017

Resource Allocation Schemes for Revenue Maximization in Multicast D2D Networks.
IEEE Access, 2017

User satisfaction based resource allocation schemes for multicast in D2D networks.
Proceedings of the 2017 European Conference on Networks and Communications, 2017

Stabbing Colors in One Dimension.
Proceedings of the 2017 Data Compression Conference, 2017

Non-shared Edges.
Encyclopedia of Algorithms, 2016

Scheduling for electricity cost in a smart grid.
J. Sched., 2016

On complexities of minus domination.
Discret. Optim., 2016

P_3-Games on Chordal Bipartite Graphs.
CoRR, 2016

CoRR, 2016

Efficient Generation of Top-k Procurements in a Multi-item Auction.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

A Framework for Dynamic Parameterized Dictionary Matching.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Space-Time Trade-Offs for the Shortest Unique Substring Problem.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Practical Index Framework for Efficient Time-Travel Phrase Queries on Versioned Documents.
Proceedings of the 2016 Data Compression Conference, 2016

Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

Convex Independence in Permutation Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016

On the <i>P</i><sub>3</sub>-convexity of some classes of graphs with few <i>P</i><sub>4</sub>s and permutation graphs.
Proceedings of the Australasian Computer Science Week Multiconference, 2016

Edge-clique covers of the tensor product.
Theor. Comput. Sci., 2015

On maximum independent set of categorical product and ultimate categorical ratios of graphs.
Theor. Comput. Sci., 2015

Novel Spare TSV Deployment for 3-D ICs Considering Yield and Timing Constraints.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2015

Convexities in Some Special Graph Classes - New Results in AT-free Graphs and Beyond.
CoRR, 2015

Flood-it on AT-Free Graphs.
CoRR, 2015

Compressing Dictionary Matching Index via Sparsification Technique.
Algorithmica, 2015

Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching.
Algorithmica, 2015

Rainbow Domination and Related Problems on Some Classes of Perfect Graphs.
Proceedings of the Topics in Theoretical Computer Science, 2015

Predicting RNA Secondary Structures: One-grammar-fits-all Solution.
Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

An In-place Framework for Exact and Approximate Shortest Unique Substring Queries.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Dictionary Matching with Uneven Gaps.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

MyBenchmark: generating databases for query workloads.
VLDB J., 2014

Space-Efficient Frameworks for Top-<i>k</i> String Retrieval.
J. ACM, 2014

Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Rendezvous for heterogeneous spectrum-agile devices.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Yield and timing constrained spare TSV assignment for three-dimensional integrated circuits.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2014

Top - K Query Retrieval of Combinations with Sum-of-Subsets Ranking.
Proceedings of the Combinatorial Optimization and Applications, 2014

Faster compressed dictionary matching.
Theor. Comput. Sci., 2013

Compressed text indexing with wildcards.
J. Discrete Algorithms, 2013

Compressed property suffix trees.
Inf. Comput., 2013

Independent set in categorical products of cographs and splitgraphs
CoRR, 2013

Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio.
CoRR, 2013

Compressed Persistent Index for Efficient Rank/Select Queries.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

A Local Structural Prediction Algorithm for RNA Triple Helix Structure.
Proceedings of the Pattern Recognition in Bioinformatics, 2013

Reconstructing <i>k</i>-Reticulated Phylogenetic Network from a Set of Gene Trees.
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

On Independence Domination.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Faster Compressed Top-k Document Retrieval.
Proceedings of the 2013 Data Compression Conference, 2013

Space-Efficient Construction Algorithm for the Circular Suffix Tree.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

New Algorithms for Position Heaps.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Indexes for Document Retrieval with Relevance.
Proceedings of the Space-Efficient Data Structures, 2013

An Efficient Alignment Algorithm for Searching Simple Pseudoknots over Long Genomic Sequence.
IEEE/ACM Trans. Comput. Biology Bioinform., 2012

On position restricted substring searching in succinct space.
J. Discrete Algorithms, 2012

Memory-efficient pattern matching architectures using perfect hashing on graphic processing units.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Document Listing for Queries with Excluded Pattern.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Efficient Algorithm for Circular Burrows-Wheeler Transform.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Succinct data structures for Searchable Partial Sums with optimal worst-case performance.
Theor. Comput. Sci., 2011

Cache-oblivious index for approximate string matching.
Theor. Comput. Sci., 2011

Faster query algorithms for the text fingerprinting problem.
Inf. Comput., 2011

Improved data structures for the orthogonal range successor problem.
Comput. Geom., 2011

RNASAlign: RNA Structural Alignment System.
Bioinform., 2011

Inverted indexes for phrases and strings.
Proceedings of the Proceeding of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2011

Succinct Indexes for Circular Patterns.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Compressed Dictionary Matching with One Error.
Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

Algorithms for pseudoknot classification.
Proceedings of the ACM International Conference on Bioinformatics, 2011

A framework for testing DBMS features.
VLDB J., 2010

Detection of intelligent mobile target in a mobile sensor network.
IEEE/ACM Trans. Netw., 2010

Clock Skew Minimization in Multi-Voltage Mode Designs Using Adjustable Delay Buffers.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2010

Generating Databases for Query Workloads.
Proc. VLDB Endow., 2010

Efficient index for retrieving top-k most frequent documents.
J. Discrete Algorithms, 2010

String Retrieval for Multi-pattern Queries.
Proceedings of the String Processing and Information Retrieval, 2010

Optimizing Link Assignment to Enhance Service in Probabilistic Network.
Proceedings of the Seventh Annual IEEE Communications Society Conference on Sensor, 2010

Identifying Volatile Data from Multiple Memory Dumps in Live Forensics.
Proceedings of the Advances in Digital Forensics VI, 2010

Cryptographic and Physical Zero-Knowledge Proof: From Sudoku to Nonogram.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Compressed Indexes for Approximate Library Management.
Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

I/O-Efficient Compressed Text Indexes: From Theory to Practice.
Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

Compression, Indexing, and Retrieval for Massive String Data.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

PSI-RA: A parallel sparse index for read alignment on genomes.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment.
IEEE Trans. Mob. Comput., 2009

Breaking a Time-and-Space Barrier in Constructing Full-Text Indices.
SIAM J. Comput., 2009

Efficient Index for Retrieving Top-k Most Frequent Documents.
Proceedings of the String Processing and Information Retrieval, 2009

On Entropy-Compressed Text Indexing in External Memory.
Proceedings of the String Processing and Information Retrieval, 2009

Succinct Index for Dynamic Dictionary Matching.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Value assignment of adjustable delay buffers for clock skew minimization in multi-voltage mode designs.
Proceedings of the 2009 International Conference on Computer-Aided Design, 2009

Space-Efficient Framework for Top-k String Retrieval Problems.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Efficient Data Structures for the Orthogonal Range Successor Problem.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

Non-shared Edges.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Tight competitive ratios for parallel disk prefetching and caching.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

The SBC-tree: an index for run-length compressed sequences.
Proceedings of the EDBT 2008, 2008

Compressed Index for Dictionary Matching.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Compressed data structures: Dictionaries and data-aware measures.
Theor. Comput. Sci., 2007

Compressed indexes for dynamic text collections.
ACM Trans. Algorithms, 2007

A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays.
Algorithmica, 2007

On Intelligent Mobile Target Detection in a Mobile Sensor Network.
Proceedings of the IEEE 4th International Conference on Mobile Adhoc and Sensor Systems, 2007

On Area of Interest Coverage in Surveillance Mobile Sensor Networks.
Proceedings of the Fifteenth IEEE International Workshop on Quality of Service, 2007

A Framework for Dynamizing Succinct Data Structures.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

A Faster Query Algorithm for the Text Fingerprinting Problem.
Proceedings of the Algorithms, 2007

Approximate string matching using compressed suffix arrays.
Theor. Comput. Sci., 2006

Compressed Dictionaries: Space Measures, Data Sets, and Experiments.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

The Indiana Center for Database Systems at Purdue University.
SIGMOD Rec., 2005

Dynamic dictionary matching and compressed suffix trees.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Non-shared edges and nearest neighbor interchanges revisited.
Inf. Process. Lett., 2004

Subtree Transfer Distance For Degree-D Phylogenies.
Int. J. Found. Comput. Sci., 2004

Compressed Index for Dynamic Text.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

Compressed Index for a Dynamic Collection of Texts.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

Practical aspects of Compressed Suffix Arrays and FM-Index in Searching DNA Sequences.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

Succinct Data Structures for Searchable Partial Sums.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Constructing Compressed Suffix Arrays with Large Alphabets.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

On All-Substrings Alignment Problems.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers
CoRR, 2002

Space-Economical Algorithms for Finding Maximal Unique Matches.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Approximating the Nearest Neighbor Intercharge Distance for Non-Uniform-Degree Evolutionary Trees.
Int. J. Found. Comput. Sci., 2001

Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999