%0 Conference Paper %1 ackssuw-ecog-SWAT24 %A Agrawal, Akanksha %A Cabello, Sergio %A Kaufmann, Michael %A Saurabh, Saket %A Sharma, Roohani %A Uno, Yushi %A Wolff, Alexander %B Proc. 19th Scand. Symp. Algorithm Theory (SWAT'24) %D 2024 %E Bodlaender, Hans %I Schloss Dagstuhl -- Leibniz-Institut für Informatik %K %T Eliminating Crossings in Ordered Graphs

@inproceedings{ackssuw-ecog-SWAT24, added-at = {2024-04-27T23:03:21.000+0200}, arxiv = {https://arxiv.org/abs/2404.09771}, author = {Agrawal, Akanksha and Cabello, Sergio and Kaufmann, Michael and Saurabh, Saket and Sharma, Roohani and Uno, Yushi and Wolff, Alexander}, biburl = {https://www.bibsonomy.org/bibtex/22be16c64f888bbb3b986c92d6182a50b/awolff}, booktitle = {Proc. 19th Scand. Symp. Algorithm Theory (SWAT'24)}, editor = {Bodlaender, Hans}, interhash = {7a3ef5e709ce7183c73a04afa30e9940}, intrahash = {2be16c64f888bbb3b986c92d6182a50b}, keywords = {}, note = {To appear.}, publisher = {Schloss Dagstuhl -- Leibniz-Institut f{\"u}r Informatik}, series = {LIPIcs}, timestamp = {2024-04-27T23:03:21.000+0200}, title = {Eliminating Crossings in Ordered Graphs}, year = 2024 }