<?xml version="1.0"?>
<dblpperson name="Jason Lewis 0002" pid="16/3949-2" n="1">
<person key="homepages/16/3949-2" mdate="2017-11-12">
<author pid="16/3949-2">Jason Lewis 0002</author>
<note type="affiliation">Clemson University, School of Computing, SC, USA</note>
</person>
<homonyms n="2">
<h f="l/Lewis:Jason"><name>Jason Lewis</name>
</h>
<h f="l/Lewis_0001:Jason"><person key="homepages/16/3949" mdate="2025-05-29">
<author pid="16/3949">Jason Lewis 0001</author>
<author pid="16/3949">Jason E. Lewis</author>
<author pid="16/3949">Jason Edward Lewis</author>
<url>https://orcid.org/0000-0003-0130-8544</url>
<note type="affiliation">Concordia University, Department of Design and Computation Arts, Montreal, Canada</note>
<url>http://hybrid.concordia.ca/lewis/</url>
<note type="affiliation">Concordia University, Montreal, QC, Canada</note>
</person>
</h>
</homonyms>
<r><article key="journals/dam/DeanHHLM11" mdate="2021-02-11">
<author pid="20/5979">Brian C. Dean</author>
<author pid="h/SMHedetniemi">Sandra Mitchell Hedetniemi</author>
<author pid="29/6752">Stephen T. Hedetniemi</author>
<author pid="16/3949-2">Jason Lewis 0002</author>
<author pid="19/422">Alice A. McRae</author>
<title>Matchability and k-maximal matchings.</title>
<pages>15-22</pages>
<year>2011</year>
<volume>159</volume>
<journal>Discret. Appl. Math.</journal>
<number>1</number>
<ee type="oa">https://doi.org/10.1016/j.dam.2010.09.006</ee>
<url>db/journals/dam/dam159.html#DeanHHLM11</url>
</article>
</r>
<coauthors n="4" nc="1">
<co c="0"><na f="d/Dean:Brian_C=" pid="20/5979">Brian C. Dean</na></co>
<co c="0"><na f="h/Hedetniemi:Sandra_Mitchell" pid="h/SMHedetniemi">Sandra Mitchell Hedetniemi</na></co>
<co c="0"><na f="h/Hedetniemi:Stephen_T=" pid="29/6752">Stephen T. Hedetniemi</na></co>
<co c="0"><na f="m/McRae:Alice_A=" pid="19/422">Alice A. McRae</na></co>
</coauthors>
</dblpperson>

