Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: J. Mark Keil
@article{DBLP:journals/ijcga/DurocherKMM23,
author = {Stephane Durocher and
J. Mark Keil and
Saeed Mehrabi and
Debajyoti Mondal},
title = {Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point
Set},
journal = {Int. J. Comput. Geom. Appl.},
volume = {33},
number = {1{\&}2},
pages = {25--41},
year = {2023},
url = {https://doi.org/10.1142/S0218195922410035},
doi = {10.1142/S0218195922410035},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/DurocherKMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EspenantKM23,
author = {Jared Espenant and
J. Mark Keil and
Debajyoti Mondal},
editor = {Erin W. Chambers and
Joachim Gudmundsson},
title = {Finding a Maximum Clique in a Disk Graph},
booktitle = {39th International Symposium on Computational Geometry, SoCG 2023,
June 12-15, 2023, Dallas, Texas, {USA}},
series = {LIPIcs},
volume = {258},
pages = {30:1--30:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2023.30},
doi = {10.4230/LIPICS.SOCG.2023.30},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EspenantKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/DurocherKM23,
author = {Stephane Durocher and
J. Mark Keil and
Debajyoti Mondal},
editor = {Chun{-}Cheng Lin and
Bertrand M. T. Lin and
Giuseppe Liotta},
title = {Minimum Ply Covering of Points with Unit Squares},
booktitle = {{WALCOM:} Algorithms and Computation - 17th International Conference
and Workshops, {WALCOM} 2023, Hsinchu, Taiwan, March 22-24, 2023,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13973},
pages = {23--35},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-27051-2\_3},
doi = {10.1007/978-3-031-27051-2\_3},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/DurocherKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/GokhaleKM23,
author = {Prashant Gokhale and
J. Mark Keil and
Debajyoti Mondal},
editor = {Chun{-}Cheng Lin and
Bertrand M. T. Lin and
Giuseppe Liotta},
title = {Improved and Generalized Algorithms for Burning a Planar Point Set},
booktitle = {{WALCOM:} Algorithms and Computation - 17th International Conference
and Workshops, {WALCOM} 2023, Hsinchu, Taiwan, March 22-24, 2023,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13973},
pages = {90--101},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-27051-2\_9},
doi = {10.1007/978-3-031-27051-2\_9},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/GokhaleKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-07645,
author = {Jared Espenant and
J. Mark Keil and
Debajyoti Mondal},
title = {Finding a Maximum Clique in a Disk Graph},
journal = {CoRR},
volume = {abs/2303.07645},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.07645},
doi = {10.48550/ARXIV.2303.07645},
eprinttype = {arXiv},
eprint = {2303.07645},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-07645.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BoseCKM0MS22,
author = {Prosenjit Bose and
Paz Carmi and
J. Mark Keil and
Anil Maheshwari and
Saeed Mehrabi and
Debajyoti Mondal and
Michiel Smid},
title = {Computing maximum independent set on outerstring graphs and their
relatives},
journal = {Comput. Geom.},
volume = {103},
pages = {101852},
year = {2022},
url = {https://doi.org/10.1016/j.comgeo.2021.101852},
doi = {10.1016/J.COMGEO.2021.101852},
timestamp = {Tue, 15 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BoseCKM0MS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KeilMMN22,
author = {J. Mark Keil and
Debajyoti Mondal and
Ehsan Moradi and
Yakov Nekrich},
title = {Finding a Maximum Clique in a Grounded 1-Bend String Graph},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {553--575},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00608},
doi = {10.7155/JGAA.00608},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/KeilMMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/KeilMM22,
author = {J. Mark Keil and
Debajyoti Mondal and
Ehsan Moradi},
editor = {Yeganeh Bahoo and
Konstantinos Georgiou},
title = {Burning Number for the Points in the Plane},
booktitle = {Proceedings of the 34th Canadian Conference on Computational Geometry,
{CCCG} 2022, Toronto Metropolitan University, Toronto, Ontario, Canada,
August 25-27, 2022},
pages = {205--211},
year = {2022},
timestamp = {Wed, 23 Nov 2022 15:41:57 +0100},
biburl = {https://dblp.org/rec/conf/cccg/KeilMM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-04643,
author = {J. Mark Keil and
Debajyoti Mondal and
Ehsan Moradi},
title = {Burning Number for the Points in the Plane},
journal = {CoRR},
volume = {abs/2205.04643},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.04643},
doi = {10.48550/ARXIV.2205.04643},
eprinttype = {arXiv},
eprint = {2205.04643},
timestamp = {Wed, 11 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-04643.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-06122,
author = {Stephane Durocher and
J. Mark Keil and
Debajyoti Mondal},
title = {Minimum Ply Covering of Points with Unit Squares},
journal = {CoRR},
volume = {abs/2208.06122},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.06122},
doi = {10.48550/ARXIV.2208.06122},
eprinttype = {arXiv},
eprint = {2208.06122},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-06122.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-13024,
author = {Prashant Gokhale and
J. Mark Keil and
Debajyoti Mondal},
title = {Improved and Generalized Algorithms for Burning a Planar Point Set},
journal = {CoRR},
volume = {abs/2209.13024},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.13024},
doi = {10.48550/ARXIV.2209.13024},
eprinttype = {arXiv},
eprint = {2209.13024},
timestamp = {Thu, 06 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-13024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/DurocherKMM21,
author = {Stephane Durocher and
J. Mark Keil and
Saeed Mehrabi and
Debajyoti Mondal},
editor = {Chi{-}Yeh Chen and
Wing{-}Kai Hon and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point
Set},
booktitle = {Computing and Combinatorics - 27th International Conference, {COCOON}
2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13025},
pages = {203--214},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-89543-3\_17},
doi = {10.1007/978-3-030-89543-3\_17},
timestamp = {Fri, 22 Oct 2021 15:23:41 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/DurocherKMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-05198,
author = {J. Mark Keil and
Debajyoti Mondal and
Ehsan Moradi and
Yakov Nekrich},
title = {Finding a Maximum Clique in a Grounded 1-Bend String Graph},
journal = {CoRR},
volume = {abs/2107.05198},
year = {2021},
url = {https://arxiv.org/abs/2107.05198},
eprinttype = {arXiv},
eprint = {2107.05198},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-05198.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-12464,
author = {Stephane Durocher and
J. Mark Keil and
Saeed Mehrabi and
Debajyoti Mondal},
title = {Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point
Set},
journal = {CoRR},
volume = {abs/2108.12464},
year = {2021},
url = {https://arxiv.org/abs/2108.12464},
eprinttype = {arXiv},
eprint = {2108.12464},
timestamp = {Thu, 02 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-12464.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/KeilMM20,
author = {J. Mark Keil and
Debajyoti Mondal and
Ehsan Moradi},
editor = {J. Mark Keil and
Debajyoti Mondal},
title = {Finding a Maximum Clique in a Grounded 1-Bend String Graph},
booktitle = {Proceedings of the 32nd Canadian Conference on Computational Geometry,
{CCCG} 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon,
Saskatchewan, Canada},
pages = {160--166},
year = {2020},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/KeilMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cccg/2020,
editor = {J. Mark Keil and
Debajyoti Mondal},
title = {Proceedings of the 32nd Canadian Conference on Computational Geometry,
{CCCG} 2020, August 5-7, 2020, University of Saskatchewan, Saskatoon,
Saskatchewan, Canada},
year = {2020},
url = {https://cccg.ca/proceedings/2020/proceedings.pdf},
timestamp = {Mon, 03 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BahooDKMMM19,
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 = {Theor. Comput. Sci.},
volume = {791},
pages = {76--86},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.05.016},
doi = {10.1016/J.TCS.2019.05.016},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BahooDKMMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BanerjeeKP19,
author = {S. Banerjee and
J. Mark Keil and
Dinabandhu Pradhan},
title = {Perfect Roman domination in graphs},
journal = {Theor. Comput. Sci.},
volume = {796},
pages = {1--21},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.08.017},
doi = {10.1016/J.TCS.2019.08.017},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BanerjeeKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoseCKM0MS19,
author = {Prosenjit Bose and
Paz Carmi and
J. Mark Keil and
Anil Maheshwari and
Saeed Mehrabi and
Debajyoti Mondal and
Michiel H. M. Smid},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Computing Maximum Independent Set on Outerstring Graphs and Their
Relatives},
booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
pages = {211--224},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_16},
doi = {10.1007/978-3-030-24766-9\_16},
timestamp = {Wed, 31 Jul 2019 11:02:16 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoseCKM0MS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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},
eprinttype = {arXiv},
eprint = {1903.07024},
timestamp = {Mon, 01 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-07024.bib},
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 = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YamanakaHKKOSUU18.bib},
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},
editor = {David Eppstein},
title = {Boundary Labeling for Rectangular Diagrams},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {12:1--12:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.12},
doi = {10.4230/LIPICS.SWAT.2018.12},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/BoseCK0M18.bib},
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},
eprinttype = {arXiv},
eprint = {1803.06816},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-06816.bib},
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},
eprinttype = {arXiv},
eprint = {1803.10812},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-10812.bib},
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},
eprinttype = {arXiv},
eprint = {1812.05656},
timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-05656.bib},
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 = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/KeilMPV17.bib},
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},
editor = {Thang N. Dinh and
My T. Thai},
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},
series = {Lecture Notes in Computer Science},
volume = {9797},
pages = {547--559},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-42634-1\_44},
doi = {10.1007/978-3-319-42634-1\_44},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BahooDK0MM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/KeilMPV15,
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 onOutersting
Graphs},
booktitle = {Proceedings of the 27th Canadian Conference on Computational Geometry,
{CCCG} 2015, Kingston, Ontario, Canada, August 10-12, 2015},
publisher = {Queen's University, Ontario, Canada},
year = {2015},
url = {http://research.cs.queensu.ca/cccg2015/CCCG15-papers/09.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/KeilMPV15.bib},
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/journals/ipl/KeilP13.bib},
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/journals/ipl/BackerK10.bib},
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 = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KeilLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BackerK10,
author = {Jonathan Backer and
J. Mark Keil},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
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},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {14--25},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_3},
doi = {10.1007/978-3-642-12200-2\_3},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BackerK10.bib},
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},
url = {http://cccg.ca/proceedings/2009/cccg09\_41.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/BackerK09.bib},
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/journals/ipl/KeilV08.bib},
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. Geom. Appl.},
volume = {17},
number = {2},
pages = {105--138},
year = {2007},
url = {https://doi.org/10.1142/S0218195907002264},
doi = {10.1142/S0218195907002264},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/WormanK07.bib},
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 = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/KeilV06.bib},
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 = {Discret. Appl. Math.},
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 = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KeilS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccsa/WatsonK06,
author = {Mark D. Watson and
J. Mark Keil},
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 = {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}},
series = {Lecture Notes in Computer Science},
volume = {3980},
pages = {121--130},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11751540\_14},
doi = {10.1007/11751540\_14},
timestamp = {Thu, 28 Apr 2022 16:17:38 +0200},
biburl = {https://dblp.org/rec/conf/iccsa/WatsonK06.bib},
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},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/ISVD.2006.28},
doi = {10.1109/ISVD.2006.28},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isvd/BoseK06.bib},
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},
publisher = {Technische Universiteit Eindhoven},
year = {2005},
url = {http://www.win.tue.nl/EWCG2005/Proceedings/3.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ewcg/KeilV05.bib},
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/journals/algorithmica/SpriggsKBSS04.bib},
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 = {Discret. Appl. Math.},
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 = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KeilB04.bib},
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},
url = {http://www.cccg.ca/proceedings/2003/16.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/SpriggsKBSS03.bib},
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},
url = {http://www.cccg.ca/proceedings/2003/19.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/KeilV03.bib},
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. Geom. Appl.},
volume = {12},
number = {3},
pages = {181--192},
year = {2002},
url = {https://doi.org/10.1142/S0218195902000803},
doi = {10.1142/S0218195902000803},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/KeilS02.bib},
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/journals/ipl/SpriggsK02.bib},
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/journals/networks/BespamyatnikhBKKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/KeilMW00,
author = {J. Mark Keil and
David M. Mount and
Stephen K. Wismath},
title = {Visibility Stabs and Depth-First Spiralling on Line Segments in Output
Sensitive Time},
journal = {Int. J. Comput. Geom. Appl.},
volume = {10},
number = {5},
pages = {535--552},
year = {2000},
url = {https://doi.org/10.1142/S0218195900000309},
doi = {10.1142/S0218195900000309},
timestamp = {Mon, 03 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/KeilMW00.bib},
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},
editor = {Mike Paterson},
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},
series = {Lecture Notes in Computer Science},
volume = {1879},
pages = {100--111},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45253-2\_10},
doi = {10.1007/3-540-45253-2\_10},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BespamyatnikhBKKS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/00/Keil00,
author = {J. Mark Keil},
editor = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
Jorge Urrutia},
title = {Polygon Decomposition},
booktitle = {Handbook of Computational Geometry},
pages = {491--518},
publisher = {North Holland / Elsevier},
year = {2000},
url = {https://doi.org/10.1016/b978-044482537-7/50012-7},
doi = {10.1016/B978-044482537-7/50012-7},
timestamp = {Fri, 28 Jun 2019 09:10:30 +0200},
biburl = {https://dblp.org/rec/books/el/00/Keil00.bib},
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},
url = {http://www.cccg.ca/proceedings/1999/fp34.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/SpriggsK99.bib},
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},
url = {http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-keil-time.ps.gz},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/KeilS98.bib},
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 = {Discret. Comput. Geom.},
volume = {18},
number = {3},
pages = {289--304},
year = {1997},
url = {https://doi.org/10.1007/PL00009320},
doi = {10.1007/PL00009320},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/DickersonKM97.bib},
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. Geom. Appl.},
volume = {7},
number = {5},
pages = {473--484},
year = {1997},
url = {https://doi.org/10.1142/S0218195997000284},
doi = {10.1142/S0218195997000284},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/Keil97.bib},
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. Geom. Appl.},
volume = {7},
number = {6},
pages = {515--538},
year = {1997},
url = {https://doi.org/10.1142/S0218195997000326},
doi = {10.1142/S0218195997000326},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/CaiK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/EadesKMM96,
author = {Peter Eades and
J. Mark Keil and
Paul D. Manuel and
Mirka Miller},
title = {Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs},
journal = {Nord. J. Comput.},
volume = {3},
number = {3},
pages = {220--237},
year = {1996},
timestamp = {Wed, 12 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/EadesKMM96.bib},
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},
editor = {Sue Whitesides},
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},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237218.237425},
doi = {10.1145/237218.237425},
timestamp = {Mon, 14 Jun 2021 16:25:18 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BellevilleKMS96.bib},
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 = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Keil94.bib},
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/journals/networks/CaiK94.bib},
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 = {Discret. Appl. Math.},
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 = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Keil93.bib},
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 Process. Lett.},
volume = {3},
pages = {457--468},
year = {1993},
url = {https://doi.org/10.1142/S0129626493000484},
doi = {10.1142/S0129626493000484},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/CaiK93.bib},
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 = {Discret. Appl. Math.},
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 = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KeilS92.bib},
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 = {Discret. Comput. Geom.},
volume = {7},
pages = {13--28},
year = {1992},
url = {https://doi.org/10.1007/BF02187821},
doi = {10.1007/BF02187821},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/KeilG92.bib},
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} J. Comput.},
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, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/ElGindyK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isci/GewaliKN92,
author = {Laxmi P. Gewali and
J. Mark Keil and
Simeon C. Ntafos},
title = {On covering orthogonal polygons with star-shaped polygons},
journal = {Inf. Sci.},
volume = {65},
number = {1-2},
pages = {45--63},
year = {1992},
url = {https://doi.org/10.1016/0020-0255(92)90077-L},
doi = {10.1016/0020-0255(92)90077-L},
timestamp = {Thu, 23 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/isci/GewaliKN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Keil92,
author = {J. Mark Keil},
title = {On the complexity of scheduling tasks with discrete starting times},
journal = {Oper. Res. Lett.},
volume = {12},
number = {5},
pages = {293--295},
year = {1992},
url = {https://doi.org/10.1016/0167-6377(92)90087-J},
doi = {10.1016/0167-6377(92)90087-J},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Keil92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Keil91,
author = {J. Mark Keil},
title = {A Simple Algorithm for Determining the Envelope of a Set of Lines},
journal = {Inf. Process. Lett.},
volume = {39},
number = {3},
pages = {121--124},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90106-R},
doi = {10.1016/0020-0190(91)90106-R},
timestamp = {Wed, 12 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Keil91.bib},
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 = {Discret. Appl. Math.},
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 = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AupperleK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KeilG89,
author = {J. Mark Keil and
Carl A. Gutwin},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
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},
series = {Lecture Notes in Computer Science},
volume = {382},
pages = {47--56},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51542-9\_6},
doi = {10.1007/3-540-51542-9\_6},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/wads/KeilG89.bib},
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},
editor = {Herbert Edelsbrunner},
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},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/73393.73419},
doi = {10.1145/73393.73419},
timestamp = {Mon, 14 Jun 2021 16:25:17 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AsanoBKY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Kei88,
author = {J. Mark Keil},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Approximating the Complete Euclidean Graph},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {208--213},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_23},
doi = {10.1007/3-540-19487-8\_23},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Kei88.bib},
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/journals/ipl/Keil86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Keil86,
author = {J. Mark Keil},
editor = {Alok Aggarwal},
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},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/10515.10520},
doi = {10.1145/10515.10520},
timestamp = {Mon, 14 Jun 2021 16:25:08 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Keil86.bib},
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/journals/ipl/Keil85.bib},
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/journals/jal/FarberK85.bib},
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/journals/siamcomp/Keil85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ca/Keil83,
author = {J. Mark Keil},
title = {Decomposing polygons into simpler components},
school = {University of Toronto, Canada},
year = {1983},
url = {https://librarysearch.library.utoronto.ca/permalink/01UTORONTO\_INST/14bjeso/alma991105899170006196},
timestamp = {Wed, 10 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ca/Keil83.bib},
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 = {Discret. Math.},
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 = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CorneilK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-29 23:55 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:
