default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Mark Keil
Person information
- affiliation: University of Saskatchewan, Department of Computer Science, Saskatoon, SK, Canada
- affiliation (PhD 1983): University of Toronto, Department of Computer Science, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j41]Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Approximation algorithms for minimum ply covering of points with unit squares and unit disks. Theor. Comput. Sci. 1024: 114906 (2025)- 2024
- [i13]J. Mark Keil, Debajyoti Mondal:
The Maximum Clique Problem in a Disk Graph Made Easy. CoRR abs/2404.03751 (2024) - [i12]J. Mark Keil, Fraser McLeod, Debajyoti Mondal:
Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond. CoRR abs/2404.04535 (2024) - 2023
- [j40]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): 25-41 (2023) - [c25]Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Minimum Ply Covering of Points with Unit Disks. CCCG 2023: 19-25 - [c24]Jared Espenant, J. Mark Keil, Debajyoti Mondal:
Finding a Maximum Clique in a Disk Graph. SoCG 2023: 30:1-30:17 - [c23]Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Minimum Ply Covering of Points with Unit Squares. WALCOM 2023: 23-35 - [c22]Prashant Gokhale, J. Mark Keil, Debajyoti Mondal:
Improved and Generalized Algorithms for Burning a Planar Point Set. WALCOM 2023: 90-101 - [i11]Jared Espenant, J. Mark Keil, Debajyoti Mondal:
Finding a Maximum Clique in a Disk Graph. CoRR abs/2303.07645 (2023) - 2022
- [j39]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: 101852 (2022) - [j38]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): 553-575 (2022) - [c21]J. Mark Keil, Debajyoti Mondal, Ehsan Moradi:
Burning Number for the Points in the Plane. CCCG 2022: 205-211 - [i10]J. Mark Keil, Debajyoti Mondal, Ehsan Moradi:
Burning Number for the Points in the Plane. CoRR abs/2205.04643 (2022) - [i9]Stephane Durocher, J. Mark Keil, Debajyoti Mondal:
Minimum Ply Covering of Points with Unit Squares. CoRR abs/2208.06122 (2022) - [i8]Prashant Gokhale, J. Mark Keil, Debajyoti Mondal:
Improved and Generalized Algorithms for Burning a Planar Point Set. CoRR abs/2209.13024 (2022) - 2021
- [c20]Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. COCOON 2021: 203-214 - [i7]J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich:
Finding a Maximum Clique in a Grounded 1-Bend String Graph. CoRR abs/2107.05198 (2021) - [i6]Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. CoRR abs/2108.12464 (2021) - 2020
- [c19]J. Mark Keil, Debajyoti Mondal, Ehsan Moradi:
Finding a Maximum Clique in a Grounded 1-Bend String Graph. CCCG 2020: 160-166 - [e1]J. Mark Keil, Debajyoti Mondal:
Proceedings of the 32nd Canadian Conference on Computational Geometry, CCCG 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon, Saskatchewan, Canada. 2020 [contents]
2010 – 2019
- 2019
- [j37]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour:
Polygon simplification by minimizing convex corners. Theor. Comput. Sci. 791: 76-86 (2019) - [j36]S. Banerjee, J. Mark Keil, Dinabandhu Pradhan:
Perfect Roman domination in graphs. Theor. Comput. Sci. 796: 1-21 (2019) - [c18]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: 211-224 - [i5]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 abs/1903.07024 (2019) - 2018
- [j35]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: 1-10 (2018) - [c17]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. SWAT 2018: 12:1-12:14 - [i4]Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. CoRR abs/1803.06816 (2018) - [i3]Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. CoRR abs/1803.10812 (2018) - [i2]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi, Sahar Mehrpour:
Polygon Simplification by Minimizing Convex Corners. CoRR abs/1812.05656 (2018) - 2017
- [j34]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: 19-25 (2017) - 2016
- [c16]Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Debajyoti Mondal:
Polygon Simplification by Minimizing Convex Corners. COCOON 2016: 547-559 - 2015
- [c15]J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle:
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs. CCCG 2015 - 2013
- [j33]J. Mark Keil, Dinabandhu Pradhan:
Computing a minimum outer-connected dominating set for the class of chordal graphs. Inf. Process. Lett. 113(14-16): 552-561 (2013) - 2010
- [j32]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): 635-638 (2010) - [j31]J. Mark Keil, Jing Liu, Ian McQuillan:
Algorithmic properties of ciliate sequence alignment. Theor. Comput. Sci. 411(6): 919-925 (2010) - [c14]Jonathan Backer, J. Mark Keil:
The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions. LATIN 2010: 14-25
2000 – 2009
- 2009
- [c13]Jonathan Backer, J. Mark Keil:
The Bichromatic Rectangle Problem in High Dimensions. CCCG 2009: 157-160 - 2008
- [j30]J. Mark Keil, Tzvetalin S. Vassilev:
The relative neighbourhood graph is a part of every 30degree-triangulation. Inf. Process. Lett. 109(2): 93-97 (2008) - 2007
- [j29]Chris Worman, J. Mark Keil:
Polygon Decomposition and the Orthogonal Art Gallery Problem. Int. J. Comput. Geom. Appl. 17(2): 105-138 (2007) - 2006
- [j28]J. Mark Keil, Tzvetalin S. Vassilev:
Algorithms for optimal area triangulations of a convex polygon. Comput. Geom. 35(3): 173-187 (2006) - [j27]J. Mark Keil, Lorna Stewart:
Approximating the minimum clique cover and other hard problems in subtree filament graphs. Discret. Appl. Math. 154(14): 1983-1995 (2006) - [c12]Mark D. Watson, J. Mark Keil:
Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks. ICCSA (1) 2006: 121-130 - [c11]Prosenjit Bose, J. Mark Keil:
On the Stretch Factor of the Constrained Delaunay Triangulation. ISVD 2006: 25-31 - 2005
- [i1]J. Mark Keil, Tzvetalin S. Vassilev:
The relative neighbourhood graph is a part of every 30°-triangulation. EuroCG 2005: 9-12 - 2004
- [j26]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): 577-589 (2004) - [j25]J. Mark Keil, Patrice Belleville:
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs. Discret. Appl. Math. 140(1-3): 73-89 (2004) - 2003
- [c10]Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42 - [c9]J. Mark Keil, Tzvetalin S. Vassilev:
An algorithm for the MaxMin area triangulation of a convex polygon. CCCG 2003: 145-149 - 2002
- [j24]J. Mark Keil, Jack Snoeyink:
On the Time Bound for Convex Decomposition of Simple Polygons. Int. J. Comput. Geom. Appl. 12(3): 181-192 (2002) - [j23]Michael J. Spriggs, J. Mark Keil:
A new bound for map labeling with uniform circle pairs. Inf. Process. Lett. 81(1): 47-53 (2002) - [j22]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): 144-152 (2002) - 2000
- [j21]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): 535-552 (2000) - [c8]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: 100-111 - [p1]J. Mark Keil:
Polygon Decomposition. Handbook of Computational Geometry 2000: 491-518
1990 – 1999
- 1999
- [c7]Michael J. Spriggs, J. Mark Keil:
Minimum spanning trees on polyhedra. CCCG 1999 - 1998
- [c6]J. Mark Keil, Jack Snoeyink:
On the time bound for convex decomposition of simple polygons. CCCG 1998 - 1997
- [j20]Matthew Dickerson, J. Mark Keil, Mark H. Montague:
A Large Subgraph of the Minimum Weight Triangulation. Discret. Comput. Geom. 18(3): 289-304 (1997) - [j19]J. Mark Keil:
Covering Orthogonal Polygons with Non-Piercing Rectangles. Int. J. Comput. Geom. Appl. 7(5): 473-484 (1997) - [j18]Leizhen Cai, J. Mark Keil:
Computing Visibility Information in an Inaccurate Simple Polygon. Int. J. Comput. Geom. Appl. 7(6): 515-538 (1997) - 1996
- [j17]Peter Eades, J. Mark Keil, Paul D. Manuel, Mirka Miller:
Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. Nord. J. Comput. 3(3): 220-237 (1996) - [c5]Patrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink:
On Computing Edges That Are In All Minimum-Weight Triangulations. SCG 1996: V-7-V-8 - 1994
- [j16]J. Mark Keil:
Computing a Subgraph of the Minimum Weight Triangulation. Comput. Geom. 4: 18-26 (1994) - [j15]Leizhen Cai, J. Mark Keil:
Spanners in graphs of bounded degree. Networks 24(4): 233-249 (1994) - 1993
- [j14]J. Mark Keil:
The Complexity of Domination Problems in Circle Graphs. Discret. Appl. Math. 42(1): 51-63 (1993) - [j13]Leizhen Cai, J. Mark Keil:
Degree-Bounded Spanners. Parallel Process. Lett. 3: 457-468 (1993) - 1992
- [j12]J. Mark Keil, Doug Schaefer:
An optimal algorithm for finding dominating cycles in circular-arc graphs. Discret. Appl. Math. 36(1): 25-34 (1992) - [j11]J. Mark Keil, Carl A. Gutwin:
Classes of Graphs Which Approximate the Complete Euclidean Graph. Discret. Comput. Geom. 7: 13-28 (1992) - [j10]Hossam ElGindy, J. Mark Keil:
Efficient Algorithms for the Capacitated 1-Median Problem. INFORMS J. Comput. 4(4): 418-425 (1992) - [j9]Laxmi P. Gewali, J. Mark Keil, Simeon C. Ntafos:
On covering orthogonal polygons with star-shaped polygons. Inf. Sci. 65(1-2): 45-63 (1992) - [j8]J. Mark Keil:
On the complexity of scheduling tasks with discrete starting times. Oper. Res. Lett. 12(5): 293-295 (1992) - 1991
- [j7]J. Mark Keil:
A Simple Algorithm for Determining the Envelope of a Set of Lines. Inf. Process. Lett. 39(3): 121-124 (1991)
1980 – 1989
- 1989
- [j6]Larry Aupperle, J. Mark Keil:
Polynomial algorithms for restricted Euclidean p-centre problems. Discret. Appl. Math. 23(1): 25-31 (1989) - [c4]J. Mark Keil, Carl A. Gutwin:
The Delauney Triangulation Closely Approximates the Complete Euclidean Graph. WADS 1989: 47-56 - 1988
- [c3]Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao:
Clustering Algorithms Based on Minimum and Maximum Spanning Trees. SCG 1988: 252-257 - [c2]J. Mark Keil:
Approximating the Complete Euclidean Graph. SWAT 1988: 208-213 - 1986
- [j5]J. Mark Keil:
Total Domination in Interval Graphs. Inf. Process. Lett. 22(4): 171-174 (1986) - [c1]J. Mark Keil:
Minimally Covering a Horizontally Convex Orthogonal Polygon. SCG 1986: 43-51 - 1985
- [j4]J. Mark Keil:
Finding Hamiltonian Circuits in Interval Graphs. Inf. Process. Lett. 20(4): 201-206 (1985) - [j3]Martin Farber, J. Mark Keil:
Domination in Permutation Graphs. J. Algorithms 6(3): 309-321 (1985) - [j2]J. Mark Keil:
Decomposing a Polygon into Simpler Components. SIAM J. Comput. 14(4): 799-817 (1985) - 1983
- [b1]J. Mark Keil:
Decomposing polygons into simpler components. University of Toronto, Canada, 1983 - [j1]Derek G. Corneil, J. Mark Keil:
A note on a conjecture by Gavril on clique separable graphs. Discret. Math. 46(3): 317-318 (1983)
Coauthor Index
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-10-25 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
