Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Jan Kratochvíl, Tomáš Masařík, and Jana Novotná. U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 57:1-57:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kratochvil_et_al:LIPIcs.MFCS.2020.57, author = {Kratochv{\'\i}l, Jan and Masa\v{r}{\'\i}k, Tom\'{a}\v{s} and Novotn\'{a}, Jana}, title = {{U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {57:1--57:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.57}, URN = {urn:nbn:de:0030-drops-127247}, doi = {10.4230/LIPIcs.MFCS.2020.57}, annote = {Keywords: Interval Graphs, Mixed Unit Interval Graphs, MaxCut Problem, Clique Width, Subexponential Algorithm, Bubble Model} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Tomas Jelinek, Marcus Klaas, and Guido Schäfer. Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 433-444, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{jelinek_et_al:LIPIcs.STACS.2014.433, author = {Jelinek, Tomas and Klaas, Marcus and Sch\"{a}fer, Guido}, title = {{Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {433--444}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.433}, URN = {urn:nbn:de:0030-drops-44771}, doi = {10.4230/LIPIcs.STACS.2014.433}, annote = {Keywords: Network routing games, coordination mechanisms, network tolls, taxing subnetworks, heterogeneous players} }
Feedback for Dagstuhl Publishing