J. Mark Keil
Affiliations:- University of Saskatchewan, Department of Computer Science, Saskatoon, SK, Canada
- University of Toronto, Department of Computer Science, ON, Canada (PhD 1983)
According to our database1,
J. Mark Keil
authored at least 65 papers
between 1983 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on cs.usask.ca
On csauthors.net:
Bibliography
2024
2023
Int. J. Comput. Geom. Appl., 2023
Proceedings of the WALCOM: Algorithms and Computation, 2023
Proceedings of the WALCOM: Algorithms and Computation, 2023
Proceedings of the 39th International Symposium on Computational Geometry, 2023
Minimum Ply Covering of Points with Unit Disks.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023
2022
J. Graph Algorithms Appl., 2022
Comput. Geom., 2022
Burning Number for the Points in the Plane.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022
2020
Finding a Maximum Clique in a Grounded 1-Bend String Graph.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
2019
2018
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018
2017
Comput. Geom., 2017
2015
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
2013
Inf. Process. Lett., 2013
2010
Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs.
Inf. Process. Lett., 2010
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
2009
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009
2008
Inf. Process. Lett., 2008
2007
Int. J. Comput. Geom. Appl., 2007
2006
Approximating the minimum clique cover and other hard problems in subtree filament graphs.
Discret. Appl. Math., 2006
Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006
Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks.
Proceedings of the Computational Science and Its Applications, 2006
2005
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
2004
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs.
Discret. Appl. Math., 2004
Algorithmica, 2004
2003
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
2002
Networks, 2002
Int. J. Comput. Geom. Appl., 2002
2000
Visibility Stabs and Depth-First Spiralling on Line Segments in Output Sensitive Time.
Int. J. Comput. Geom. Appl., 2000
1999
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999
1997
Int. J. Comput. Geom. Appl., 1997
Int. J. Comput. Geom. Appl., 1997
1996
Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs.
Nord. J. Comput., 1996
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
1994
1993
1992
Oper. Res. Lett., 1992
Discret. Comput. Geom., 1992
Discret. Appl. Math., 1992
1991
Inf. Process. Lett., 1991
1989
Discret. Appl. Math., 1989
Proceedings of the Algorithms and Data Structures, 1989
1988
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988
1986
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986
1985
1983