J. Mark Keil

Publication Activity (10 Years)

Years Active: 1983-2024
Publications (10 Years): 29

Top Topics

Top Venues

Theor. Comput. Sci.

Publications

J. Mark Keil, Debajyoti Mondal
The Maximum Clique Problem in a Disk Graph Made Easy. CoRR (2024)
J. Mark Keil, Fraser McLeod, Debajyoti Mondal
Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond. CoRR (2024)
Stephane Durocher, J. Mark Keil, Debajyoti Mondal
Minimum Ply Covering of Points with Unit Squares. WALCOM (2023)
Prashant Gokhale, J. Mark Keil, Debajyoti Mondal
Improved and Generalized Algorithms for Burning a Planar Point Set. WALCOM (2023)
Stephane Durocher, J. Mark Keil, Debajyoti Mondal
Minimum Ply Covering of Points with Unit Disks. CCCG (2023)
Jared Espenant, J. Mark Keil, Debajyoti Mondal
Finding a Maximum Clique in a Disk Graph. SoCG (2023)
Jared Espenant, J. Mark Keil, Debajyoti Mondal
Finding a Maximum Clique in a Disk Graph. CoRR (2023)
Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. Int. J. Comput. Geom. Appl. 33 (1&2) (2023)
J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich
Finding a Maximum Clique in a Grounded 1-Bend String Graph. J. Graph Algorithms Appl. 26 (1) (2022)
J. Mark Keil, Debajyoti Mondal, Ehsan Moradi
Burning Number for the Points in the Plane. CoRR (2022)
J. Mark Keil, Debajyoti Mondal, Ehsan Moradi
Burning Number for the Points in the Plane. CCCG (2022)
Prashant Gokhale, J. Mark Keil, Debajyoti Mondal
Improved and Generalized Algorithms for Burning a Planar Point Set. CoRR (2022)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel Smid
Computing maximum independent set on outerstring graphs and their relatives. Comput. Geom. 103 (2022)
Stephane Durocher, J. Mark Keil, Debajyoti Mondal
Minimum Ply Covering of Points with Unit Squares. CoRR (2022)
Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. CoRR (2021)
Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. COCOON (2021)
J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich
Finding a Maximum Clique in a Grounded 1-Bend String Graph. CoRR (2021)
J. Mark Keil, Debajyoti Mondal, Ehsan Moradi
Finding a Maximum Clique in a Grounded 1-Bend String Graph. CCCG (2020)
S. Banerjee, J. Mark Keil, Dinabandhu Pradhan
Perfect Roman domination in graphs. Theor. Comput. Sci. 796 (2019)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. WADS (2019)
Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour
Polygon simplification by minimizing convex corners. Theor. Comput. Sci. 791 (2019)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Anil Maheshwari, Saeed Mehrabi, Debajyoti Mondal, Michiel H. M. Smid
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives. CoRR (2019)
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping colored tokens on graphs. Theor. Comput. Sci. 729 (2018)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal
Boundary Labeling for Rectangular Diagrams. SWAT (2018)
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping Colored Tokens on Graphs. CoRR (2018)
Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour
Polygon Simplification by Minimizing Convex Corners. CoRR (2018)
Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal
Boundary Labeling for Rectangular Diagrams. CoRR (2018)
J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle
An algorithm for the maximum weight independent set problem on outerstring graphs. Comput. Geom. 60 (2017)
Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Debajyoti Mondal
Polygon Simplification by Minimizing Convex Corners. COCOON (2016)
J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs. CCCG (2015)
J. Mark Keil, Dinabandhu Pradhan
Computing a minimum outer-connected dominating set for the class of chordal graphs. Inf. Process. Lett. 113 (14-16) (2013)
Jonathan Backer, J. Mark Keil
The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions. LATIN (2010)
Jonathan Backer, J. Mark Keil
Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs. Inf. Process. Lett. 110 (16) (2010)
J. Mark Keil, Jing Liu, Ian McQuillan
Algorithmic properties of ciliate sequence alignment. Theor. Comput. Sci. 411 (6) (2010)
Jonathan Backer, J. Mark Keil
The Bichromatic Rectangle Problem in High Dimensions. CCCG (2009)
J. Mark Keil, Tzvetalin S. Vassilev
The relative neighbourhood graph is a part of every 30degree-triangulation. Inf. Process. Lett. 109 (2) (2008)
Chris Worman, J. Mark Keil
Polygon Decomposition and the Orthogonal Art Gallery Problem. Int. J. Comput. Geom. Appl. 17 (2) (2007)
Mark D. Watson, J. Mark Keil
Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks. ICCSA (1) (2006)
J. Mark Keil, Tzvetalin S. Vassilev
Algorithms for optimal area triangulations of a convex polygon. Comput. Geom. 35 (3) (2006)
J. Mark Keil, Lorna Stewart
Approximating the minimum clique cover and other hard problems in subtree filament graphs. Discret. Appl. Math. 154 (14) (2006)
Prosenjit Bose, J. Mark Keil
On the Stretch Factor of the Constrained Delaunay Triangulation. ISVD (2006)
J. Mark Keil, Tzvetalin S. Vassilev
The relative neighbourhood graph is a part of every 30°-triangulation. EuroCG (2005)
Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica 38 (4) (2004)
J. Mark Keil, Patrice Belleville
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs. Discret. Appl. Math. 140 (1-3) (2004)
J. Mark Keil, Tzvetalin S. Vassilev
An algorithm for the MaxMin area triangulation of a convex polygon. CCCG (2003)
Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
Approximating the geometric minimum-diameter spanning tree. CCCG (2003)
Michael J. Spriggs, J. Mark Keil
A new bound for map labeling with uniform circle pairs. Inf. Process. Lett. 81 (1) (2002)
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal
Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39 (3) (2002)
J. Mark Keil, Jack Snoeyink
On the Time Bound for Convex Decomposition of Simple Polygons. Int. J. Comput. Geom. Appl. 12 (3) (2002)
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA (2000)
J. Mark Keil, David M. Mount, Stephen K. Wismath
Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time. Int. J. Comput. Geom. Appl. 10 (5) (2000)
Michael J. Spriggs, J. Mark Keil
Minimum spanning trees on polyhedra. CCCG (1999)
J. Mark Keil, Jack Snoeyink
On the time bound for convex decomposition of simple polygons. CCCG (1998)
Matthew Dickerson, J. Mark Keil, Mark H. Montague
A Large Subgraph of the Minimum Weight Triangulation. Discret. Comput. Geom. 18 (3) (1997)
J. Mark Keil
Covering Orthogonal Polygons with Non-Piercing Rectangles. Int. J. Comput. Geom. Appl. 7 (5) (1997)
Leizhen Cai, J. Mark Keil
Computing Visibility Information in an Inaccurate Simple Polygon. Int. J. Comput. Geom. Appl. 7 (6) (1997)
Patrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink
On Computing Edges That Are In All Minimum-Weight Triangulations. SCG (1996)
J. Mark Keil
Computing a Subgraph of the Minimum Weight Triangulation. Comput. Geom. 4 (1994)
Leizhen Cai, J. Mark Keil
Spanners in graphs of bounded degree. Networks 24 (4) (1994)
J. Mark Keil
The Complexity of Domination Problems in Circle Graphs. Discret. Appl. Math. 42 (1) (1993)
Leizhen Cai, J. Mark Keil
Degree-Bounded Spanners. Parallel Process. Lett. 3 (1993)
Hossam ElGindy, J. Mark Keil
Efficient Algorithms for the Capacitated 1-Median Problem. INFORMS J. Comput. 4 (4) (1992)
Laxmi P. Gewali, J. Mark Keil, Simeon C. Ntafos
On covering orthogonal polygons with star-shaped polygons. Inf. Sci. 65 (1-2) (1992)
J. Mark Keil, Carl A. Gutwin
Classes of Graphs Which Approximate the Complete Euclidean Graph. Discret. Comput. Geom. 7 (1992)
J. Mark Keil
On the complexity of scheduling tasks with discrete starting times. Oper. Res. Lett. 12 (5) (1992)
J. Mark Keil, Doug Schaefer
An optimal algorithm for finding dominating cycles in circular-arc graphs. Discret. Appl. Math. 36 (1) (1992)
J. Mark Keil, Carl A. Gutwin
The Delauney Triangulation Closely Approximates the Complete Euclidean Graph. WADS (1989)
Larry Aupperle, J. Mark Keil
Polynomial algorithms for restricted Euclidean p-centre problems. Discret. Appl. Math. 23 (1) (1989)
J. Mark Keil
Approximating the Complete Euclidean Graph. SWAT (1988)
Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao
Clustering Algorithms Based on Minimum and Maximum Spanning Trees. SCG (1988)
J. Mark Keil
Minimally Covering a Horizontally Convex Orthogonal Polygon. SCG (1986)
J. Mark Keil
Total Domination in Interval Graphs. Inf. Process. Lett. 22 (4) (1986)
Martin Farber, J. Mark Keil
Domination in Permutation Graphs. J. Algorithms 6 (3) (1985)
J. Mark Keil
Finding Hamiltonian Circuits in Interval Graphs. Inf. Process. Lett. 20 (4) (1985)
J. Mark Keil
Decomposing a Polygon into Simpler Components. SIAM J. Comput. 14 (4) (1985)
Derek G. Corneil, J. Mark Keil
A note on a conjecture by Gavril on clique separable graphs. Discret. Math. 46 (3) (1983)