| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil, Jing Liu, Ian McQuillan |
Algorithmic properties of ciliate sequence alignment. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Backer, J. Mark Keil |
The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Backer, J. Mark Keil |
The Bichromatic Rectangle Problem in High Dimensions. |
CCCG |
2009 |
DBLP BibTeX RDF |
|
| 1 | J. Mark Keil, Tzvetalin S. Vassilev |
The relative neighbourhood graph is a part of every 30degree-triangulation. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Worman, J. Mark Keil |
Polygon Decomposition and the Orthogonal Art Gallery Problem. |
Int. J. Comput. Geometry Appl. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil, Tzvetalin S. Vassilev |
Algorithms for optimal area triangulations of a convex polygon. |
Comput. Geom. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil, Lorna Stewart |
Approximating the minimum clique cover and other hard problems in subtree filament graphs. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, J. Mark Keil |
On the Stretch Factor of the Constrained Delaunay Triangulation. |
ISVD |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark D. Watson, J. Mark Keil |
Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks. |
ICCSA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil, Tzvetalin S. Vassilev |
The relative neighbourhood graph is a part of every 30°-triangulation. |
EuroCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink |
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Minimum diameter spanning tree, Approximation algorithm, Geometric graph |
| 1 | J. Mark Keil, Patrice Belleville |
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil, Tzvetalin S. Vassilev |
An algorithm for the MaxMin area triangulation of a convex polygon. |
CCCG |
2003 |
DBLP BibTeX RDF |
|
| 1 | Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink |
Approximating the geometric minimum-diameter spanning tree. |
CCCG |
2003 |
DBLP BibTeX RDF |
|
| 1 | Michael J. Spriggs, J. Mark Keil |
A new bound for map labeling with uniform circle pairs. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil, Jack Snoeyink |
On the Time Bound for Convex Decomposition of Simple Polygons. |
Int. J. Comput. Geometry Appl. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Spriggs, J. Mark Keil |
Minimum spanning trees on polyhedra. |
CCCG |
1999 |
DBLP BibTeX RDF |
|
| 1 | J. Mark Keil, Jack Snoeyink |
On the time bound for convex decomposition of simple polygons. |
CCCG |
1998 |
DBLP BibTeX RDF |
|
| 1 | Matthew Dickerson, J. Mark Keil, Mark H. Montague |
A Large Subgraph of the Minimum Weight Triangulation. |
Discrete & Computational Geometry |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil |
Covering Orthogonal Polygons with Non-Piercing Rectangles. |
Int. J. Comput. Geometry Appl. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Leizhen Cai, J. Mark Keil |
Computing Visibility Information in an Inaccurate Simple Polygon. |
Int. J. Comput. Geometry Appl. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Patrice Belleville, J. Mark Keil, Michael McAllister, Jack Snoeyink |
On Computing Edges That Are In All Minimum-Weight Triangulations. |
Symposium on Computational Geometry |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil |
Computing a Subgraph of the Minimum Weight Triangulation. |
Comput. Geom. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Leizhen Cai, J. Mark Keil |
Degree-Bounded Spanners. |
Parallel Processing Letters |
1993 |
DBLP BibTeX RDF |
|
| 1 | J. Mark Keil |
The Complexity of Domination Problems in Circle Graphs. |
Discrete Applied Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil, Carl A. Gutwin |
Classes of Graphs Which Approximate the Complete Euclidean Graph. |
Discrete & Computational Geometry |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil, Doug Schaefer |
An optimal algorithm for finding dominating cycles in circular-arc graphs. |
Discrete Applied Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Hossam ElGindy, J. Mark Keil |
Efficient Algorithms for the Capacitated 1-Median Problem. |
INFORMS Journal on Computing |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Larry Aupperle, J. Mark Keil |
Polynomial algorithms for restricted Euclidean p-centre problems. |
Discrete Applied Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil, Carl A. Gutwin |
The Delauney Triangulation Closely Approximates the Complete Euclidean Graph. |
WADS |
1989 |
DBLP BibTeX RDF |
|
| 1 | Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao |
Clustering Algorithms Based on Minimum and Maximum Spanning Trees. |
Symposium on Computational Geometry |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil |
Approximating the Complete Euclidean Graph. |
SWAT |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil |
Total Domination in Interval Graphs. |
Inf. Process. Lett. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil |
Minimally Covering a Horizontally Convex Orthogonal Polygon. |
Symposium on Computational Geometry |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil |
Finding Hamiltonian Circuits in Interval Graphs. |
Inf. Process. Lett. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farber, J. Mark Keil |
Domination in Permutation Graphs. |
J. Algorithms |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Mark Keil |
Decomposing a Polygon into Simpler Components. |
SIAM J. Comput. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek G. Corneil, J. Mark Keil |
A note on a conjecture by Gavril on clique separable graphs. |
Discrete Mathematics |
1983 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")