<?xml version="1.0"?>
<dblpperson name="Marcus K&#252;hn" pid="328/1871" n="4">
<person key="homepages/328/1871" mdate="2022-09-05">
<author pid="328/1871">Marcus K&#252;hn</author>
</person>
<r><inproceedings key="conf/stoc/JoosK25" mdate="2025-11-02">
<author orcid="0000-0002-8539-9641" pid="130/9015">Felix Joos</author>
<author orcid="0009-0001-3919-2519" pid="328/1871">Marcus K&#252;hn</author>
<title>The Hypergraph Removal Process.</title>
<pages>301-309</pages>
<year>2025</year>
<booktitle>STOC</booktitle>
<ee>https://doi.org/10.1145/3717823.3718110</ee>
<ee>https://www.wikidata.org/entity/Q135685318</ee>
<crossref>conf/stoc/2025</crossref>
<url>db/conf/stoc/stoc2025.html#JoosK25</url>
</inproceedings>
</r>
<r><article key="journals/jctb/JoosKS23" mdate="2024-06-07">
<author orcid="0000-0002-8539-9641" pid="130/9015">Felix Joos</author>
<author pid="328/1871">Marcus K&#252;hn</author>
<author orcid="0000-0003-1621-4030" pid="278/6162">Bjarne Sch&#252;lke</author>
<title>Decomposing hypergraphs into cycle factors.</title>
<pages>136-175</pages>
<year>2023</year>
<volume>158</volume>
<journal>J. Comb. Theory B</journal>
<number>Part</number>
<ee>https://doi.org/10.1016/j.jctb.2022.09.004</ee>
<url>db/journals/jctb/jctb158.html#JoosKS23</url>
</article>
</r>
<r><inproceedings key="conf/soda/GlockJKKL23" mdate="2023-02-17">
<author pid="84/7271">Stefan Glock</author>
<author pid="130/9015">Felix Joos</author>
<author pid="52/4972">Jaehoon Kim</author>
<author pid="328/1871">Marcus K&#252;hn</author>
<author pid="293/8993">Lyuben Lichev</author>
<title>Conflict-free hypergraph matchings.</title>
<pages>2991-3005</pages>
<year>2023</year>
<booktitle>SODA</booktitle>
<ee>https://doi.org/10.1137/1.9781611977554.ch115</ee>
<crossref>conf/soda/2023</crossref>
<url>db/conf/soda/soda2023.html#GlockJKKL23</url>
</inproceedings>
</r>
<r><article key="journals/rsa/JoosK22" mdate="2023-09-12">
<author pid="130/9015">Felix Joos</author>
<author pid="328/1871">Marcus K&#252;hn</author>
<title>Fractional cycle decompositions in hypergraphs.</title>
<pages>425-443</pages>
<year>2022</year>
<volume>61</volume>
<journal>Random Struct. Algorithms</journal>
<number>3</number>
<ee type="oa">https://doi.org/10.1002/rsa.21070</ee>
<url>db/journals/rsa/rsa61.html#JoosK22</url>
</article>
</r>
<coauthors n="5" nc="1">
<co c="0"><na f="g/Glock:Stefan" pid="84/7271">Stefan Glock</na></co>
<co c="0"><na f="j/Joos:Felix" pid="130/9015">Felix Joos</na></co>
<co c="0" n="2"><na f="k/Kim:Jae=Hoon" pid="52/4972">Jae-Hoon Kim</na><na>Jaehoon Kim</na></co>
<co c="0"><na f="l/Lichev:Lyuben" pid="293/8993">Lyuben Lichev</na></co>
<co c="0"><na f="s/Sch=uuml=lke:Bjarne" pid="278/6162">Bjarne Sch&#252;lke</na></co>
</coauthors>
</dblpperson>

