Scalable Algorithms (ITI)

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
publist:all_byyear [2026/05/19 21:00] – automatic nightly update adminpublist:all_byyear [2026/05/22 21:00] (current) – automatic nightly update admin
Line 58: Line 58:
 <h3> 2026</h3> <h3> 2026</h3>
  
 +
 +<div class="pub_item pub_inproceedings">
 +<div class="pub_author">Kolja Kühn, Wendy Yi</div>
 +<div class="pub_title">Completing the Complexity Classification of 2-Solo Chess: Knights and Kings Are Hard.</div>
 +<div class="pub_venue">Fun with Algorithms (FUN) 2026</div>
 +<div class="pub_buttons"><a href="javascript:void(0)" class="pub_bibtex_toggle">bibtex</a><a href="https://doi.org/10.4230/LIPIcs.FUN.2026.27">url</a></div>
 +<div class="pub_bibtex" style="display: none">
 +<textarea class="pub_bibtex" rows="8" readonly style="white-space: pre;">
 +@inproceedings{Compl_Compl_Class_Solo_FUN2026,
 +  title     = {Completing the Complexity Classification of 2-Solo Chess: Knights and Kings Are Hard},
 +  author    = {Kolja Kühn and Wendy Yi},
 +  pages     = {27:1--27:21},
 +  year      = {2026},
 +  booktitle = {Fun with Algorithms (FUN)},
 +  doi       = {10.4230/LIPIcs.FUN.2026.27}
 +}
 +
 +</textarea>
 +</div>
 +</div>
  
 <div class="pub_item pub_preprint"> <div class="pub_item pub_preprint">