BibTeX records: J. Mark Keil

download as .bib file

@article{DBLP:journals/corr/abs-1903-07024,
  author    = {Prosenjit Bose and
               Paz Carmi and
               J. Mark Keil and
               Anil Maheshwari and
               Saeed Mehrabi and
               Debajyoti Mondal and
               Michiel H. M. Smid},
  title     = {Computing Maximum Independent Set on Outerstring Graphs and Their
               Relatives},
  journal   = {CoRR},
  volume    = {abs/1903.07024},
  year      = {2019},
  url       = {http://arxiv.org/abs/1903.07024},
  archivePrefix = {arXiv},
  eprint    = {1903.07024},
  timestamp = {Mon, 01 Apr 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1903-07024},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YamanakaHKKOSUU18,
  author    = {Katsuhisa Yamanaka and
               Takashi Horiyama and
               J. Mark Keil and
               David G. Kirkpatrick and
               Yota Otachi and
               Toshiki Saitoh and
               Ryuhei Uehara and
               Yushi Uno},
  title     = {Swapping colored tokens on graphs},
  journal   = {Theor. Comput. Sci.},
  volume    = {729},
  pages     = {1--10},
  year      = {2018},
  url       = {https://doi.org/10.1016/j.tcs.2018.03.016},
  doi       = {10.1016/j.tcs.2018.03.016},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/YamanakaHKKOSUU18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseCK0M18,
  author    = {Prosenjit Bose and
               Paz Carmi and
               J. Mark Keil and
               Saeed Mehrabi and
               Debajyoti Mondal},
  title     = {Boundary Labeling for Rectangular Diagrams},
  booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
               2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
  pages     = {12:1--12:14},
  year      = {2018},
  crossref  = {DBLP:conf/swat/2018},
  url       = {https://doi.org/10.4230/LIPIcs.SWAT.2018.12},
  doi       = {10.4230/LIPIcs.SWAT.2018.12},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/BoseCK0M18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-06816,
  author    = {Katsuhisa Yamanaka and
               Takashi Horiyama and
               J. Mark Keil and
               David G. Kirkpatrick and
               Yota Otachi and
               Toshiki Saitoh and
               Ryuhei Uehara and
               Yushi Uno},
  title     = {Swapping Colored Tokens on Graphs},
  journal   = {CoRR},
  volume    = {abs/1803.06816},
  year      = {2018},
  url       = {http://arxiv.org/abs/1803.06816},
  archivePrefix = {arXiv},
  eprint    = {1803.06816},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1803-06816},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-10812,
  author    = {Prosenjit Bose and
               Paz Carmi and
               J. Mark Keil and
               Saeed Mehrabi and
               Debajyoti Mondal},
  title     = {Boundary Labeling for Rectangular Diagrams},
  journal   = {CoRR},
  volume    = {abs/1803.10812},
  year      = {2018},
  url       = {http://arxiv.org/abs/1803.10812},
  archivePrefix = {arXiv},
  eprint    = {1803.10812},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1803-10812},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-05656,
  author    = {Yeganeh Bahoo and
               Stephane Durocher and
               J. Mark Keil and
               Debajyoti Mondal and
               Saeed Mehrabi and
               Sahar Mehrpour},
  title     = {Polygon Simplification by Minimizing Convex Corners},
  journal   = {CoRR},
  volume    = {abs/1812.05656},
  year      = {2018},
  url       = {http://arxiv.org/abs/1812.05656},
  archivePrefix = {arXiv},
  eprint    = {1812.05656},
  timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1812-05656},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KeilMPV17,
  author    = {J. Mark Keil and
               Joseph S. B. Mitchell and
               Dinabandhu Pradhan and
               Martin Vatshelle},
  title     = {An algorithm for the maximum weight independent set problem on outerstring
               graphs},
  journal   = {Comput. Geom.},
  volume    = {60},
  pages     = {19--25},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.comgeo.2016.05.001},
  doi       = {10.1016/j.comgeo.2016.05.001},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/comgeo/KeilMPV17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BahooDK0MM16,
  author    = {Yeganeh Bahoo and
               Stephane Durocher and
               J. Mark Keil and
               Saeed Mehrabi and
               Sahar Mehrpour and
               Debajyoti Mondal},
  title     = {Polygon Simplification by Minimizing Convex Corners},
  booktitle = {Computing and Combinatorics - 22nd International Conference, {COCOON}
               2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},
  pages     = {547--559},
  year      = {2016},
  crossref  = {DBLP:conf/cocoon/2016},
  url       = {https://doi.org/10.1007/978-3-319-42634-1\_44},
  doi       = {10.1007/978-3-319-42634-1\_44},
  timestamp = {Tue, 23 May 2017 01:10:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/BahooDK0MM16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KeilP13,
  author    = {J. Mark Keil and
               Dinabandhu Pradhan},
  title     = {Computing a minimum outer-connected dominating set for the class of
               chordal graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {113},
  number    = {14-16},
  pages     = {552--561},
  year      = {2013},
  url       = {https://doi.org/10.1016/j.ipl.2013.05.001},
  doi       = {10.1016/j.ipl.2013.05.001},
  timestamp = {Mon, 25 Mar 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/KeilP13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BackerK10,
  author    = {Jonathan Backer and
               J. Mark Keil},
  title     = {Constant factor approximation algorithms for the densest k-subgraph
               problem on proper interval graphs and bipartite permutation graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {110},
  number    = {16},
  pages     = {635--638},
  year      = {2010},
  url       = {https://doi.org/10.1016/j.ipl.2010.05.011},
  doi       = {10.1016/j.ipl.2010.05.011},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/BackerK10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KeilLM10,
  author    = {J. Mark Keil and
               Jing Liu and
               Ian McQuillan},
  title     = {Algorithmic properties of ciliate sequence alignment},
  journal   = {Theor. Comput. Sci.},
  volume    = {411},
  number    = {6},
  pages     = {919--925},
  year      = {2010},
  url       = {https://doi.org/10.1016/j.tcs.2009.12.006},
  doi       = {10.1016/j.tcs.2009.12.006},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/KeilLM10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BackerK10,
  author    = {Jonathan Backer and
               J. Mark Keil},
  title     = {The Mono- and Bichromatic Empty Rectangle and Square Problems in All
               Dimensions},
  booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
               Oaxaca, Mexico, April 19-23, 2010. Proceedings},
  pages     = {14--25},
  year      = {2010},
  crossref  = {DBLP:conf/latin/2010},
  url       = {https://doi.org/10.1007/978-3-642-12200-2\_3},
  doi       = {10.1007/978-3-642-12200-2\_3},
  timestamp = {Tue, 23 May 2017 01:11:27 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/BackerK10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BackerK09,
  author    = {Jonathan Backer and
               J. Mark Keil},
  title     = {The Bichromatic Rectangle Problem in High Dimensions},
  booktitle = {Proceedings of the 21st Annual Canadian Conference on Computational
               Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009},
  pages     = {157--160},
  year      = {2009},
  crossref  = {DBLP:conf/cccg/2009},
  url       = {http://cccg.ca/proceedings/2009/cccg09\_41.pdf},
  timestamp = {Fri, 03 Sep 2010 08:48:18 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/BackerK09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KeilV08,
  author    = {J. Mark Keil and
               Tzvetalin S. Vassilev},
  title     = {The relative neighbourhood graph is a part of every 30degree-triangulation},
  journal   = {Inf. Process. Lett.},
  volume    = {109},
  number    = {2},
  pages     = {93--97},
  year      = {2008},
  url       = {https://doi.org/10.1016/j.ipl.2008.09.006},
  doi       = {10.1016/j.ipl.2008.09.006},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/KeilV08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/WormanK07,
  author    = {Chris Worman and
               J. Mark Keil},
  title     = {Polygon Decomposition and the Orthogonal Art Gallery Problem},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {17},
  number    = {2},
  pages     = {105--138},
  year      = {2007},
  url       = {https://doi.org/10.1142/S0218195907002264},
  doi       = {10.1142/S0218195907002264},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijcga/WormanK07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KeilV06,
  author    = {J. Mark Keil and
               Tzvetalin S. Vassilev},
  title     = {Algorithms for optimal area triangulations of a convex polygon},
  journal   = {Comput. Geom.},
  volume    = {35},
  number    = {3},
  pages     = {173--187},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.comgeo.2006.03.004},
  doi       = {10.1016/j.comgeo.2006.03.004},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/comgeo/KeilV06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KeilS06,
  author    = {J. Mark Keil and
               Lorna Stewart},
  title     = {Approximating the minimum clique cover and other hard problems in
               subtree filament graphs},
  journal   = {Discrete Applied Mathematics},
  volume    = {154},
  number    = {14},
  pages     = {1983--1995},
  year      = {2006},
  url       = {https://doi.org/10.1016/j.dam.2006.03.003},
  doi       = {10.1016/j.dam.2006.03.003},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/KeilS06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccsa/WatsonK06,
  author    = {Mark D. Watson and
               J. Mark Keil},
  title     = {Routing Properties of the Localized Delaunay Triangulation over Heterogeneous
               Ad-Hoc Wireless Networks},
  booktitle = {Computational Science and Its Applications - {ICCSA} 2006, International
               Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part {I}},
  pages     = {121--130},
  year      = {2006},
  crossref  = {DBLP:conf/iccsa/2006-1},
  url       = {https://doi.org/10.1007/11751540\_14},
  doi       = {10.1007/11751540\_14},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/iccsa/WatsonK06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isvd/BoseK06,
  author    = {Prosenjit Bose and
               J. Mark Keil},
  title     = {On the Stretch Factor of the Constrained Delaunay Triangulation},
  booktitle = {3rd International Symposium on Voronoi Diagrams in Science and Engineering,
               {ISVD} 2006, Banff, Alberta, Canada, July 2-5, 2006},
  pages     = {25--31},
  year      = {2006},
  crossref  = {DBLP:conf/isvd/2006},
  url       = {https://doi.org/10.1109/ISVD.2006.28},
  doi       = {10.1109/ISVD.2006.28},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/isvd/BoseK06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ewcg/KeilV05,
  author    = {J. Mark Keil and
               Tzvetalin S. Vassilev},
  title     = {The relative neighbourhood graph is a part of every 30{\textdegree}-triangulation},
  booktitle = {(Informal) Proceedings of the 21st European Workshop on Computational
               Geometry, Eindhoven, The Netherlands, March 9-11, 2005},
  pages     = {9--12},
  year      = {2005},
  crossref  = {DBLP:conf/ewcg/2005},
  url       = {http://www.win.tue.nl/EWCG2005/Proceedings/3.pdf},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/ewcg/KeilV05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SpriggsKBSS04,
  author    = {Michael J. Spriggs and
               J. Mark Keil and
               Sergei Bespamyatnikh and
               Michael Segal and
               Jack Snoeyink},
  title     = {Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning
               Tree},
  journal   = {Algorithmica},
  volume    = {38},
  number    = {4},
  pages     = {577--589},
  year      = {2004},
  url       = {https://doi.org/10.1007/s00453-003-1056-z},
  doi       = {10.1007/s00453-003-1056-z},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/SpriggsKBSS04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KeilB04,
  author    = {J. Mark Keil and
               Patrice Belleville},
  title     = {Dominating the complements of bounded tolerance graphs and the complements
               of trapezoid graphs},
  journal   = {Discrete Applied Mathematics},
  volume    = {140},
  number    = {1-3},
  pages     = {73--89},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.dam.2003.04.004},
  doi       = {10.1016/j.dam.2003.04.004},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/KeilB04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/SpriggsKBSS03,
  author    = {Michael J. Spriggs and
               J. Mark Keil and
               Sergei Bespamyatnikh and
               Michael Segal and
               Jack Snoeyink},
  title     = {Approximating the geometric minimum-diameter spanning tree},
  booktitle = {Proceedings of the 15th Canadian Conference on Computational Geometry,
               CCCG'03, Halifax, Canada, August 11-13, 2003},
  pages     = {39--42},
  year      = {2003},
  crossref  = {DBLP:conf/cccg/2003},
  url       = {http://www.cccg.ca/proceedings/2003/16.pdf},
  timestamp = {Mon, 26 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/SpriggsKBSS03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/KeilV03,
  author    = {J. Mark Keil and
               Tzvetalin S. Vassilev},
  title     = {An algorithm for the MaxMin area triangulation of a convex polygon},
  booktitle = {Proceedings of the 15th Canadian Conference on Computational Geometry,
               CCCG'03, Halifax, Canada, August 11-13, 2003},
  pages     = {145--149},
  year      = {2003},
  crossref  = {DBLP:conf/cccg/2003},
  url       = {http://www.cccg.ca/proceedings/2003/19.pdf},
  timestamp = {Fri, 22 Nov 2013 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/KeilV03},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/KeilS02,
  author    = {J. Mark Keil and
               Jack Snoeyink},
  title     = {On the Time Bound for Convex Decomposition of Simple Polygons},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {12},
  number    = {3},
  pages     = {181--192},
  year      = {2002},
  url       = {https://doi.org/10.1142/S0218195902000803},
  doi       = {10.1142/S0218195902000803},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/ijcga/KeilS02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/SpriggsK02,
  author    = {Michael J. Spriggs and
               J. Mark Keil},
  title     = {A new bound for map labeling with uniform circle pairs},
  journal   = {Inf. Process. Lett.},
  volume    = {81},
  number    = {1},
  pages     = {47--53},
  year      = {2002},
  url       = {https://doi.org/10.1016/S0020-0190(01)00184-3},
  doi       = {10.1016/S0020-0190(01)00184-3},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/SpriggsK02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BespamyatnikhBKKS02,
  author    = {Sergei Bespamyatnikh and
               Binay K. Bhattacharya and
               J. Mark Keil and
               David G. Kirkpatrick and
               Michael Segal},
  title     = {Efficient algorithms for centers and medians in interval and circular-arc
               graphs},
  journal   = {Networks},
  volume    = {39},
  number    = {3},
  pages     = {144--152},
  year      = {2002},
  url       = {https://doi.org/10.1002/net.10023},
  doi       = {10.1002/net.10023},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/networks/BespamyatnikhBKKS02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BespamyatnikhBKKS00,
  author    = {Sergei Bespamyatnikh and
               Binay K. Bhattacharya and
               J. Mark Keil and
               David G. Kirkpatrick and
               Michael Segal},
  title     = {Efficient Algorithms for Centers and Medians in Interval and Circular-Arc
               Graphs},
  booktitle = {Algorithms - {ESA} 2000, 8th Annual European Symposium, Saarbr{\"{u}}cken,
               Germany, September 5-8, 2000, Proceedings},
  pages     = {100--111},
  year      = {2000},
  crossref  = {DBLP:conf/esa/2000},
  url       = {https://doi.org/10.1007/3-540-45253-2\_10},
  doi       = {10.1007/3-540-45253-2\_10},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/esa/BespamyatnikhBKKS00},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/SpriggsK99,
  author    = {Michael J. Spriggs and
               J. Mark Keil},
  title     = {Minimum spanning trees on polyhedra},
  booktitle = {Proceedings of the 11th Canadian Conference on Computational Geometry,
               UBC, Vancouver, British Columbia, Canada, August 15-18, 1999},
  year      = {1999},
  crossref  = {DBLP:conf/cccg/1999},
  url       = {http://www.cccg.ca/proceedings/1999/fp34.pdf},
  timestamp = {Thu, 14 Nov 2013 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/SpriggsK99},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/KeilS98,
  author    = {J. Mark Keil and
               Jack Snoeyink},
  title     = {On the time bound for convex decomposition of simple polygons},
  booktitle = {Proceedings of the 10th Canadian Conference on Computational Geometry,
               McGill University, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
               August 10-12, 1998},
  year      = {1998},
  crossref  = {DBLP:conf/cccg/1998},
  url       = {http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-keil-time.ps.gz},
  timestamp = {Wed, 26 Sep 2012 12:22:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/KeilS98},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/DickersonKM97,
  author    = {Matthew Dickerson and
               J. Mark Keil and
               Mark H. Montague},
  title     = {A Large Subgraph of the Minimum Weight Triangulation},
  journal   = {Discrete {\&} Computational Geometry},
  volume    = {18},
  number    = {3},
  pages     = {289--304},
  year      = {1997},
  url       = {https://doi.org/10.1007/PL00009320},
  doi       = {10.1007/PL00009320},
  timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dcg/DickersonKM97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/Keil97,
  author    = {J. Mark Keil},
  title     = {Covering Orthogonal Polygons with Non-Piercing Rectangles},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {7},
  number    = {5},
  pages     = {473--484},
  year      = {1997},
  url       = {https://doi.org/10.1142/S0218195997000284},
  doi       = {10.1142/S0218195997000284},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijcga/Keil97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/CaiK97,
  author    = {Leizhen Cai and
               J. Mark Keil},
  title     = {Computing Visibility Information in an Inaccurate Simple Polygon},
  journal   = {Int. J. Comput. Geometry Appl.},
  volume    = {7},
  number    = {6},
  pages     = {515--538},
  year      = {1997},
  url       = {https://doi.org/10.1142/S0218195997000326},
  doi       = {10.1142/S0218195997000326},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ijcga/CaiK97},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BellevilleKMS96,
  author    = {Patrice Belleville and
               J. Mark Keil and
               Michael McAllister and
               Jack Snoeyink},
  title     = {On Computing Edges That Are In All Minimum-Weight Triangulations},
  booktitle = {Proceedings of the Twelfth Annual Symposium on Computational Geometry,
               Philadelphia, PA, USA, May 24-26, 1996},
  pages     = {V--7--V--8},
  year      = {1996},
  crossref  = {DBLP:conf/compgeom/1996},
  url       = {https://doi.org/10.1145/237218.237425},
  doi       = {10.1145/237218.237425},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/BellevilleKMS96},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Keil94,
  author    = {J. Mark Keil},
  title     = {Computing a Subgraph of the Minimum Weight Triangulation},
  journal   = {Comput. Geom.},
  volume    = {4},
  pages     = {18--26},
  year      = {1994},
  url       = {https://doi.org/10.1016/0925-7721(94)90014-0},
  doi       = {10.1016/0925-7721(94)90014-0},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/comgeo/Keil94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CaiK94,
  author    = {Leizhen Cai and
               J. Mark Keil},
  title     = {Spanners in graphs of bounded degree},
  journal   = {Networks},
  volume    = {24},
  number    = {4},
  pages     = {233--249},
  year      = {1994},
  url       = {https://doi.org/10.1002/net.3230240406},
  doi       = {10.1002/net.3230240406},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/networks/CaiK94},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Keil93,
  author    = {J. Mark Keil},
  title     = {The Complexity of Domination Problems in Circle Graphs},
  journal   = {Discrete Applied Mathematics},
  volume    = {42},
  number    = {1},
  pages     = {51--63},
  year      = {1993},
  url       = {https://doi.org/10.1016/0166-218X(93)90178-Q},
  doi       = {10.1016/0166-218X(93)90178-Q},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dam/Keil93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/CaiK93,
  author    = {Leizhen Cai and
               J. Mark Keil},
  title     = {Degree-Bounded Spanners},
  journal   = {Parallel Processing Letters},
  volume    = {3},
  pages     = {457--468},
  year      = {1993},
  url       = {https://doi.org/10.1142/S0129626493000484},
  doi       = {10.1142/S0129626493000484},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ppl/CaiK93},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KeilS92,
  author    = {J. Mark Keil and
               Doug Schaefer},
  title     = {An optimal algorithm for finding dominating cycles in circular-arc
               graphs},
  journal   = {Discrete Applied Mathematics},
  volume    = {36},
  number    = {1},
  pages     = {25--34},
  year      = {1992},
  url       = {https://doi.org/10.1016/0166-218X(92)90201-K},
  doi       = {10.1016/0166-218X(92)90201-K},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/KeilS92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KeilG92,
  author    = {J. Mark Keil and
               Carl A. Gutwin},
  title     = {Classes of Graphs Which Approximate the Complete Euclidean Graph},
  journal   = {Discrete {\&} Computational Geometry},
  volume    = {7},
  pages     = {13--28},
  year      = {1992},
  url       = {https://doi.org/10.1007/BF02187821},
  doi       = {10.1007/BF02187821},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dcg/KeilG92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/ElGindyK92,
  author    = {Hossam ElGindy and
               J. Mark Keil},
  title     = {Efficient Algorithms for the Capacitated 1-Median Problem},
  journal   = {{INFORMS} Journal on Computing},
  volume    = {4},
  number    = {4},
  pages     = {418--425},
  year      = {1992},
  url       = {https://doi.org/10.1287/ijoc.4.4.418},
  doi       = {10.1287/ijoc.4.4.418},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/informs/ElGindyK92},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AupperleK89,
  author    = {Larry Aupperle and
               J. Mark Keil},
  title     = {Polynomial algorithms for restricted Euclidean p-centre problems},
  journal   = {Discrete Applied Mathematics},
  volume    = {23},
  number    = {1},
  pages     = {25--31},
  year      = {1989},
  url       = {https://doi.org/10.1016/0166-218X(89)90032-2},
  doi       = {10.1016/0166-218X(89)90032-2},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dam/AupperleK89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KeilG89,
  author    = {J. Mark Keil and
               Carl A. Gutwin},
  title     = {The Delauney Triangulation Closely Approximates the Complete Euclidean
               Graph},
  booktitle = {Algorithms and Data Structures, Workshop {WADS} '89, Ottawa, Canada,
               August 17-19, 1989, Proceedings},
  pages     = {47--56},
  year      = {1989},
  crossref  = {DBLP:conf/wads/1989},
  url       = {https://doi.org/10.1007/3-540-51542-9\_6},
  doi       = {10.1007/3-540-51542-9\_6},
  timestamp = {Fri, 19 May 2017 13:10:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/KeilG89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AsanoBKY89,
  author    = {Tetsuo Asano and
               Binay K. Bhattacharya and
               J. Mark Keil and
               F. Frances Yao},
  title     = {Clustering Algorithms Based on Minimum and Maximum Spanning Trees},
  booktitle = {Proceedings of the Fourth Annual Symposium on Computational Geometry,
               Urbana-Champaign, IL, USA, June 6-8, 1988},
  pages     = {252--257},
  year      = {1988},
  crossref  = {DBLP:conf/compgeom/1988},
  url       = {https://doi.org/10.1145/73393.73419},
  doi       = {10.1145/73393.73419},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/AsanoBKY89},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Kei88,
  author    = {J. Mark Keil},
  title     = {Approximating the Complete Euclidean Graph},
  booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
               Sweden, July 5-8, 1988, Proceedings},
  pages     = {208--213},
  year      = {1988},
  crossref  = {DBLP:conf/swat/1988},
  url       = {https://doi.org/10.1007/3-540-19487-8\_23},
  doi       = {10.1007/3-540-19487-8\_23},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/Kei88},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Keil86,
  author    = {J. Mark Keil},
  title     = {Total Domination in Interval Graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {22},
  number    = {4},
  pages     = {171--174},
  year      = {1986},
  url       = {https://doi.org/10.1016/0020-0190(86)90022-0},
  doi       = {10.1016/0020-0190(86)90022-0},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/Keil86},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Keil86,
  author    = {J. Mark Keil},
  title     = {Minimally Covering a Horizontally Convex Orthogonal Polygon},
  booktitle = {Proceedings of the Second Annual {ACM} {SIGACT/SIGGRAPH} Symposium
               on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986},
  pages     = {43--51},
  year      = {1986},
  crossref  = {DBLP:conf/compgeom/1986},
  url       = {https://doi.org/10.1145/10515.10520},
  doi       = {10.1145/10515.10520},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/Keil86},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Keil85,
  author    = {J. Mark Keil},
  title     = {Finding Hamiltonian Circuits in Interval Graphs},
  journal   = {Inf. Process. Lett.},
  volume    = {20},
  number    = {4},
  pages     = {201--206},
  year      = {1985},
  url       = {https://doi.org/10.1016/0020-0190(85)90050-X},
  doi       = {10.1016/0020-0190(85)90050-X},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/ipl/Keil85},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FarberK85,
  author    = {Martin Farber and
               J. Mark Keil},
  title     = {Domination in Permutation Graphs},
  journal   = {J. Algorithms},
  volume    = {6},
  number    = {3},
  pages     = {309--321},
  year      = {1985},
  url       = {https://doi.org/10.1016/0196-6774(85)90001-X},
  doi       = {10.1016/0196-6774(85)90001-X},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jal/FarberK85},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Keil85,
  author    = {J. Mark Keil},
  title     = {Decomposing a Polygon into Simpler Components},
  journal   = {{SIAM} J. Comput.},
  volume    = {14},
  number    = {4},
  pages     = {799--817},
  year      = {1985},
  url       = {https://doi.org/10.1137/0214056},
  doi       = {10.1137/0214056},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/Keil85},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CorneilK83,
  author    = {Derek G. Corneil and
               J. Mark Keil},
  title     = {A note on a conjecture by Gavril on clique separable graphs},
  journal   = {Discrete Mathematics},
  volume    = {46},
  number    = {3},
  pages     = {317--318},
  year      = {1983},
  url       = {https://doi.org/10.1016/0012-365X(83)90127-9},
  doi       = {10.1016/0012-365X(83)90127-9},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/dm/CorneilK83},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2018,
  editor    = {David Eppstein},
  title     = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
               2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
  series    = {LIPIcs},
  volume    = {101},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-068-2},
  isbn      = {978-3-95977-068-2},
  timestamp = {Wed, 25 Jul 2018 18:08:27 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cocoon/2016,
  editor    = {Thang N. Dinh and
               My T. Thai},
  title     = {Computing and Combinatorics - 22nd International Conference, {COCOON}
               2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9797},
  publisher = {Springer},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-3-319-42634-1},
  doi       = {10.1007/978-3-319-42634-1},
  isbn      = {978-3-319-42633-4},
  timestamp = {Tue, 23 May 2017 01:10:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/latin/2010,
  editor    = {Alejandro L{\'{o}}pez{-}Ortiz},
  title     = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
               Oaxaca, Mexico, April 19-23, 2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6034},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-12200-2},
  doi       = {10.1007/978-3-642-12200-2},
  isbn      = {978-3-642-12199-9},
  timestamp = {Tue, 23 May 2017 01:11:27 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/latin/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cccg/2009,
  title     = {Proceedings of the 21st Annual Canadian Conference on Computational
               Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009},
  year      = {2009},
  timestamp = {Fri, 03 Sep 2010 08:48:18 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iccsa/2006-1,
  editor    = {Marina L. Gavrilova and
               Osvaldo Gervasi and
               Vipin Kumar and
               Chih Jeng Kenneth Tan and
               David Taniar and
               Antonio Lagan{\`{a}} and
               Youngsong Mun and
               Hyunseung Choo},
  title     = {Computational Science and Its Applications - {ICCSA} 2006, International
               Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {3980},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11751540},
  doi       = {10.1007/11751540},
  isbn      = {3-540-34070-X},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/iccsa/2006-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isvd/2006,
  title     = {3rd International Symposium on Voronoi Diagrams in Science and Engineering,
               {ISVD} 2006, Banff, Alberta, Canada, July 2-5, 2006},
  publisher = {{IEEE} Computer Society},
  year      = {2006},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4124786},
  isbn      = {0-7695-2630-6},
  timestamp = {Wed, 08 Oct 2014 17:36:07 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isvd/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ewcg/2005,
  title     = {(Informal) Proceedings of the 21st European Workshop on Computational
               Geometry, Eindhoven, The Netherlands, March 9-11, 2005},
  publisher = {Technische Universiteit Eindhoven},
  year      = {2005},
  timestamp = {Wed, 14 Jan 2015 15:36:16 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/ewcg/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cccg/2003,
  title     = {Proceedings of the 15th Canadian Conference on Computational Geometry,
               CCCG'03, Halifax, Canada, August 11-13, 2003},
  year      = {2003},
  timestamp = {Wed, 26 Sep 2012 12:22:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/2003},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2000,
  editor    = {Mike Paterson},
  title     = {Algorithms - {ESA} 2000, 8th Annual European Symposium, Saarbr{\"{u}}cken,
               Germany, September 5-8, 2000, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1879},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-45253-2},
  doi       = {10.1007/3-540-45253-2},
  isbn      = {3-540-41004-X},
  timestamp = {Wed, 24 May 2017 15:40:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/esa/2000},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cccg/1999,
  title     = {Proceedings of the 11th Canadian Conference on Computational Geometry,
               UBC, Vancouver, British Columbia, Canada, August 15-18, 1999},
  year      = {1999},
  timestamp = {Wed, 26 Sep 2012 12:22:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/1999},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cccg/1998,
  title     = {Proceedings of the 10th Canadian Conference on Computational Geometry,
               McGill University, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
               August 10-12, 1998},
  year      = {1998},
  timestamp = {Wed, 26 Sep 2012 12:22:14 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/1998},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/1996,
  editor    = {Sue Whitesides},
  title     = {Proceedings of the Twelfth Annual Symposium on Computational Geometry,
               Philadelphia, PA, USA, May 24-26, 1996},
  publisher = {{ACM}},
  year      = {1996},
  url       = {https://doi.org/10.1145/237218},
  doi       = {10.1145/237218},
  isbn      = {0-89791-804-5},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/1996},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/1989,
  editor    = {Frank K. H. A. Dehne and
               J{\"{o}}rg{-}R{\"{u}}diger Sack and
               Nicola Santoro},
  title     = {Algorithms and Data Structures, Workshop {WADS} '89, Ottawa, Canada,
               August 17-19, 1989, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {382},
  publisher = {Springer},
  year      = {1989},
  url       = {https://doi.org/10.1007/3-540-51542-9},
  doi       = {10.1007/3-540-51542-9},
  isbn      = {3-540-51542-9},
  timestamp = {Fri, 19 May 2017 13:10:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wads/1989},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/1988,
  editor    = {Herbert Edelsbrunner},
  title     = {Proceedings of the Fourth Annual Symposium on Computational Geometry,
               Urbana-Champaign, IL, USA, June 6-8, 1988},
  publisher = {{ACM}},
  year      = {1988},
  url       = {https://doi.org/10.1145/73393},
  doi       = {10.1145/73393},
  isbn      = {0-89791-270-5},
  timestamp = {Tue, 06 Nov 2018 16:57:03 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/1988},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/1988,
  editor    = {Rolf G. Karlsson and
               Andrzej Lingas},
  title     = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
               Sweden, July 5-8, 1988, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {318},
  publisher = {Springer},
  year      = {1988},
  url       = {https://doi.org/10.1007/3-540-19487-8},
  doi       = {10.1007/3-540-19487-8},
  isbn      = {3-540-19487-8},
  timestamp = {Fri, 19 May 2017 13:10:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/swat/1988},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/1986,
  editor    = {Alok Aggarwal},
  title     = {Proceedings of the Second Annual {ACM} {SIGACT/SIGGRAPH} Symposium
               on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986},
  publisher = {{ACM}},
  year      = {1986},
  url       = {https://doi.org/10.1145/10515},
  doi       = {10.1145/10515},
  isbn      = {0-89791-194-6},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/1986},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier