%0 Conference Paper %1 conf/mfcs/BeisegelKR0024 %A Beisegel, Jesse %A Köhler, Ekkehard %A Ratajczak, Fabienne %A Scheffler, Robert %A Strehler, Martin %B MFCS %D 2024 %E Královic, Rastislav %E Kucera, Antonín %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 22:1-22:18 %T Graph Search Trees and the Intermezzo Problem. %U http://dblp.uni-trier.de/db/conf/mfcs/mfcs2024.html#BeisegelKR0024 %V 306 %@ 978-3-95977-335-5

@inproceedings{conf/mfcs/BeisegelKR0024, added-at = {2024-10-06T00:00:00.000+0200}, author = {Beisegel, Jesse and Köhler, Ekkehard and Ratajczak, Fabienne and Scheffler, Robert and Strehler, Martin}, biburl = {https://www.bibsonomy.org/bibtex/26610accb2055a77126a26c05c9a31c13/dblp}, booktitle = {MFCS}, crossref = {conf/mfcs/2024}, editor = {Královic, Rastislav and Kucera, Antonín}, ee = {https://doi.org/10.4230/LIPIcs.MFCS.2024.22}, interhash = {f93d83aaf25d1c742f919590b557da00}, intrahash = {6610accb2055a77126a26c05c9a31c13}, isbn = {978-3-95977-335-5}, keywords = {dblp}, pages = {22:1-22:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-10-07T09:28:48.000+0200}, title = {Graph Search Trees and the Intermezzo Problem.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2024.html#BeisegelKR0024}, volume = 306, year = 2024 }