J Mark Keil

J Mark Keil

University of Saskatchewan

H-index: 29

North America-Canada

About J Mark Keil

J Mark Keil, With an exceptional h-index of 29 and a recent h-index of 15 (since 2020), a distinguished researcher at University of Saskatchewan, specializes in the field of algorithms, computational geometry, graph algorithms.

His recent articles reflect a diverse array of research interests and contributions to the field:

Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond

The Maximum Clique Problem in a Disk Graph Made Easy

Minimum ply covering of points with unit squares

Bottleneck Convex Subsets: Finding Large Convex Sets in a Point Set

Finding a maximum clique in a disk graph

Improved and generalized algorithms for burning a planar point set

Burning number for the points in the plane

Computing maximum independent set on outerstring graphs and their relatives

J Mark Keil Information

University

Position

Professor of Computer Science

Citations(all)

3315

Citations(since 2020)

612

Cited By

2927

hIndex(all)

29

hIndex(since 2020)

15

i10Index(all)

45

i10Index(since 2020)

21

Email

University Profile Page

University of Saskatchewan

Google Scholar

View Google Scholar Profile

J Mark Keil Skills & Research Interests

algorithms

computational geometry

graph algorithms

Top articles of J Mark Keil

Title

Journal

Author(s)

Publication Date

Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond

arXiv preprint arXiv:2404.04535

J Mark Keil

Fraser McLeod

Debajyoti Mondal

2024/4/6

The Maximum Clique Problem in a Disk Graph Made Easy

arXiv preprint arXiv:2404.03751

J Mark Keil

Debajyoti Mondal

2024/4/4

Minimum ply covering of points with unit squares

Stephane Durocher

J Mark Keil

Debajyoti Mondal

2023/3/13

Bottleneck Convex Subsets: Finding Large Convex Sets in a Point Set

International Journal of Computational Geometry & Applications

Stephane Durocher

J Mark Keil

Saeed Mehrabi

Debajyoti Mondal

2023/3/1

Finding a maximum clique in a disk graph

arXiv preprint arXiv:2303.07645

Jared Espenant

J Mark Keil

Debajyoti Mondal

2023/3/14

Improved and generalized algorithms for burning a planar point set

Prashant Gokhale

J Mark Keil

Debajyoti Mondal

2023/3/13

Burning number for the points in the plane

arXiv preprint arXiv:2205.04643

J Mark Keil

Debajyoti Mondal

Ehsan Moradi

2022/5/10

Computing maximum independent set on outerstring graphs and their relatives

Computational Geometry

Prosenjit Bose

Paz Carmi

J Mark Keil

Anil Maheshwari

Saeed Mehrabi

...

2022/4/1

Finding a maximum clique in a grounded 1-bend string graph

arXiv preprint arXiv:2107.05198

J Mark Keil

Debajyoti Mondal

Ehsan Moradi

Yakov Nekrich

2021/7/12

See List of Professors in J Mark Keil University(University of Saskatchewan)