Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX record conf/stacs/Schlotter24
@inproceedings{DBLP:conf/stacs/Schlotter24, author = {Ildik{\'{o}} Schlotter}, editor = {Olaf Beyersdorff and Mamadou Moustapha Kant{\'{e}} and Orna Kupferman and Daniel Lokshtanov}, title = {Shortest Two Disjoint Paths in Conservative Graphs}, booktitle = {41st International Symposium on Theoretical Aspects of Computer Science, {STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France}, series = {LIPIcs}, volume = {289}, pages = {57:1--57:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2024}, url = {https://doi.org/10.4230/LIPIcs.STACS.2024.57}, doi = {10.4230/LIPICS.STACS.2024.57}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Schlotter24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.