J. Mark Keil

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