Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
János Pach, Gábor Tardos, and Géza Tóth. Disjointness Graphs of Short Polygonal Chains. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 56:1-56:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{pach_et_al:LIPIcs.SoCG.2022.56, author = {Pach, J\'{a}nos and Tardos, G\'{a}bor and T\'{o}th, G\'{e}za}, title = {{Disjointness Graphs of Short Polygonal Chains}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {56:1--56:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.56}, URN = {urn:nbn:de:0030-drops-160645}, doi = {10.4230/LIPIcs.SoCG.2022.56}, annote = {Keywords: chi-bounded, disjointness graph} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
David G. Harris, Fotis Iliopoulos, and Vladimir Kolmogorov. A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 31:1-31:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{harris_et_al:LIPIcs.APPROX/RANDOM.2021.31, author = {Harris, David G. and Iliopoulos, Fotis and Kolmogorov, Vladimir}, title = {{A New Notion of Commutativity for the Algorithmic Lov\'{a}sz Local Lemma}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {31:1--31:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.31}, URN = {urn:nbn:de:0030-drops-147244}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.31}, annote = {Keywords: Lov\'{a}sz Local Lemma, Resampling, Moser-Tardos algorithm, latin transversal, commutativity} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Roy Schwartz and Ran Yeheskel. Graph Balancing with Orientation Costs. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 82:1-82:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{schwartz_et_al:LIPIcs.ESA.2019.82, author = {Schwartz, Roy and Yeheskel, Ran}, title = {{Graph Balancing with Orientation Costs}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {82:1--82:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.82}, URN = {urn:nbn:de:0030-drops-112034}, doi = {10.4230/LIPIcs.ESA.2019.82}, annote = {Keywords: Graph Balancing, Generalized Assignment Problem} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
János Pach and István Tomon. On the Chromatic Number of Disjointness Graphs of Curves. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 54:1-54:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{pach_et_al:LIPIcs.SoCG.2019.54, author = {Pach, J\'{a}nos and Tomon, Istv\'{a}n}, title = {{On the Chromatic Number of Disjointness Graphs of Curves}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {54:1--54:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.54}, URN = {urn:nbn:de:0030-drops-104582}, doi = {10.4230/LIPIcs.SoCG.2019.54}, annote = {Keywords: string graph, chromatic number, intersection graph} }
Published in: LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
Mika Göös, Pritish Kamath, Robert Robere, and Dmitry Sokolov. Adventures in Monotone Complexity and TFNP. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 38:1-38:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{goos_et_al:LIPIcs.ITCS.2019.38, author = {G\"{o}\"{o}s, Mika and Kamath, Pritish and Robere, Robert and Sokolov, Dmitry}, title = {{Adventures in Monotone Complexity and TFNP}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {38:1--38:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.38}, URN = {urn:nbn:de:0030-drops-101316}, doi = {10.4230/LIPIcs.ITCS.2019.38}, annote = {Keywords: TFNP, Monotone Complexity, Communication Complexity, Proof Complexity} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
János Pach, Gábor Tardos, and Géza Tóth. Disjointness Graphs of Segments. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 59:1-59:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{pach_et_al:LIPIcs.SoCG.2017.59, author = {Pach, J\'{a}nos and Tardos, G\'{a}bor and T\'{o}th, G\'{e}za}, title = {{Disjointness Graphs of Segments}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {59:1--59:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-038-5}, ISSN = {1868-8969}, year = {2017}, volume = {77}, editor = {Aronov, Boris and Katz, Matthew J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.59}, URN = {urn:nbn:de:0030-drops-71960}, doi = {10.4230/LIPIcs.SoCG.2017.59}, annote = {Keywords: disjointness graph, chromatic number, clique number, chi-bounded} }
Published in: LIPIcs, Volume 18, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)
Dimitris Achlioptas and Themis Gouleakis. Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 18, pp. 16-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{achlioptas_et_al:LIPIcs.FSTTCS.2012.16, author = {Achlioptas, Dimitris and Gouleakis, Themis}, title = {{Algorithmic Improvements of the Lov\'{a}sz Local Lemma via Cluster Expansion}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)}, pages = {16--23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-47-7}, ISSN = {1868-8969}, year = {2012}, volume = {18}, editor = {D'Souza, Deepak and Radhakrishnan, Jaikumar and Telikepalli, Kavitha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2012.16}, URN = {urn:nbn:de:0030-drops-38440}, doi = {10.4230/LIPIcs.FSTTCS.2012.16}, annote = {Keywords: Probabilistic Method, Lov\'{a}sz Local Lemma, Algorithms} }
Feedback for Dagstuhl Publishing