<?xml version="1.0"?>
<dblpperson name="See Woo Lee" pid="308/6677" n="2">
<person key="homepages/308/6677" mdate="2021-12-14">
<author pid="308/6677">See Woo Lee</author>
</person>
<r><inproceedings key="conf/aaai/HanakaKKLO22" mdate="2023-09-04">
<author pid="157/1043">Tesshu Hanaka</author>
<author pid="58/8821">Yasuaki Kobayashi</author>
<author pid="203/8082">Kazuhiro Kurita</author>
<author pid="308/6677">See Woo Lee</author>
<author pid="41/4592">Yota Otachi</author>
<title>Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study.</title>
<pages>3758-3766</pages>
<year>2022</year>
<booktitle>AAAI</booktitle>
<ee type="oa">https://doi.org/10.1609/aaai.v36i4.20290</ee>
<crossref>conf/aaai/2022</crossref>
<url>db/conf/aaai/aaai2022.html#HanakaKKLO22</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2112-05403" mdate="2021-12-14">
<author pid="157/1043">Tesshu Hanaka</author>
<author pid="58/8821">Yasuaki Kobayashi</author>
<author pid="203/8082">Kazuhiro Kurita</author>
<author pid="308/6677">See Woo Lee</author>
<author pid="41/4592">Yota Otachi</author>
<title>Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study.</title>
<year>2021</year>
<volume>abs/2112.05403</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2112.05403</ee>
<url>db/journals/corr/corr2112.html#abs-2112-05403</url>
</article>
</r>
<coauthors n="4" nc="1">
<co c="0"><na f="h/Hanaka:Tesshu" pid="157/1043">Tesshu Hanaka</na></co>
<co c="0"><na f="k/Kobayashi:Yasuaki" pid="58/8821">Yasuaki Kobayashi</na></co>
<co c="0"><na f="k/Kurita:Kazuhiro" pid="203/8082">Kazuhiro Kurita</na></co>
<co c="0"><na f="o/Otachi:Yota" pid="41/4592">Yota Otachi</na></co>
</coauthors>
</dblpperson>

