Ke Chen

Vinamratha Pattar

Proceedings of the 25th International Conference on Algorithms for Bioinformatics, 2025

An Exact and Fast SAT Formulation for the DCJ Distance.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2025

2024

Learning locality-sensitive bucketing functions.

[BibT_eX]

[DOI]

Bioinform., 2024

2023

Locality-sensitive bucketing functions for the edit distance.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., December, 2023

On the Maximal Independent Sets of k-mers with the Edit Distance.

[BibT_eX]

[DOI]

Leran Ma

CoRR, 2023

Seeding with minimized subsequence.

[BibT_eX]

[DOI]

Bioinform., 2023

On the Maximal Independent Sets of <i>k</i>-mers with the Edit Distance.

[BibT_eX]

[DOI]

Leran Ma

Proceedings of the 14th ACM International Conference on Bioinformatics, 2023

2021

On the Stretch Factor of Polygonal Chains.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

2020

Selection Algorithms with Small Groups.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

On the longest spanning tree with neighborhoods.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2020

On Wegner's inequality for axis-parallel rectangles.

[BibT_eX]

[DOI]

Discret. Math., 2020

Multiparty Selection.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2015

Nonconvex cases for carpenter's rulers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

A Map-Reduce based parallel approach for improving query performance in a geospatial semantic web for disaster response.

[BibT_eX]

[DOI]

Earth Sci. Informatics, 2015

A parallel approach for improving Geo-SPARQL query performance.

[BibT_eX]

[DOI]

Int. J. Digit. Earth, 2015

Select with Groups of 3 or 4.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014

Select with Groups of $3$ or $4$ Takes Linear Time.

[BibT_eX]

[DOI]

CoRR, 2014

2013

On Fence Patrolling by Mobile Agents.

[BibT_eX]

[DOI]