Published in: LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024)
Alkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, and Mikaël Rabie. Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{balliu_et_al:LIPIcs.DISC.2024.5, author = {Balliu, Alkida and Fraigniaud, Pierre and Lambein-Monette, Patrick and Olivetti, Dennis and Rabie, Mika\"{e}l}, title = {{Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {5:1--5:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.5}, URN = {urn:nbn:de:0030-drops-212328}, doi = {10.4230/LIPIcs.DISC.2024.5}, annote = {Keywords: LOCAL model, Graph Coloring, Renaming, Weak Symmetry-Breaking, Fault-Tolerance, Wait-Free Computing} }
Published in: LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024)
Maxime Flin, Magnús M. Halldórsson, and Alexandre Nolin. Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 24:1-24:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{flin_et_al:LIPIcs.DISC.2024.24, author = {Flin, Maxime and Halld\'{o}rsson, Magn\'{u}s M. and Nolin, Alexandre}, title = {{Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {24:1--24:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.24}, URN = {urn:nbn:de:0030-drops-212502}, doi = {10.4230/LIPIcs.DISC.2024.24}, annote = {Keywords: Graph Coloring, Distributed Algorithms, Virtual Graphs, Congestion, Dilation} }
Published in: LIPIcs, Volume 319, 38th International Symposium on Distributed Computing (DISC 2024)
Magnús M. Halldórsson and Yannic Maus. Distributed Delta-Coloring Under Bandwidth Limitations. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 31:1-31:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{halldorsson_et_al:LIPIcs.DISC.2024.31, author = {Halld\'{o}rsson, Magn\'{u}s M. and Maus, Yannic}, title = {{Distributed Delta-Coloring Under Bandwidth Limitations}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {31:1--31:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.31}, URN = {urn:nbn:de:0030-drops-212572}, doi = {10.4230/LIPIcs.DISC.2024.31}, annote = {Keywords: Graph problems, Graph coloring, Lov\'{a}sz local lemma, LOCAL model, CONGEST model, Distributed computing} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Keren Censor-Hillel, Yannic Maus, Shahar Romem-Peled, and Tigran Tonoyan. Distributed Vertex Cover Reconfiguration. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 36:1-36:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{censorhillel_et_al:LIPIcs.ITCS.2022.36, author = {Censor-Hillel, Keren and Maus, Yannic and Romem-Peled, Shahar and Tonoyan, Tigran}, title = {{Distributed Vertex Cover Reconfiguration}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {36:1--36:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.36}, URN = {urn:nbn:de:0030-drops-156327}, doi = {10.4230/LIPIcs.ITCS.2022.36}, annote = {Keywords: reconfiguration, vertex cover, network decomposition} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Keren Censor-Hillel, Noa Marelly, Roy Schwartz, and Tigran Tonoyan. Fault Tolerant Max-Cut. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 46:1-46:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{censorhillel_et_al:LIPIcs.ICALP.2021.46, author = {Censor-Hillel, Keren and Marelly, Noa and Schwartz, Roy and Tonoyan, Tigran}, title = {{Fault Tolerant Max-Cut}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {46:1--46:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.46}, URN = {urn:nbn:de:0030-drops-141158}, doi = {10.4230/LIPIcs.ICALP.2021.46}, annote = {Keywords: fault-tolerance, max-cut, approximation} }
Published in: LIPIcs, Volume 179, 34th International Symposium on Distributed Computing (DISC 2020)
Yannic Maus and Tigran Tonoyan. Local Conflict Coloring Revisited: Linial for Lists. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{maus_et_al:LIPIcs.DISC.2020.16, author = {Maus, Yannic and Tonoyan, Tigran}, title = {{Local Conflict Coloring Revisited: Linial for Lists}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.16}, URN = {urn:nbn:de:0030-drops-130944}, doi = {10.4230/LIPIcs.DISC.2020.16}, annote = {Keywords: distributed graph coloring, list coloring, low intersecting set families} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Magnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, and Tigran Tonoyan. Spanning Trees With Edge Conflicts and Wireless Connectivity. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 158:1-158:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{halldorsson_et_al:LIPIcs.ICALP.2018.158, author = {Halld\'{o}rsson, Magn\'{u}s M. and Kortsarz, Guy and Mitra, Pradipta and Tonoyan, Tigran}, title = {{Spanning Trees With Edge Conflicts and Wireless Connectivity}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {158:1--158:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.158}, URN = {urn:nbn:de:0030-drops-91627}, doi = {10.4230/LIPIcs.ICALP.2018.158}, annote = {Keywords: spanning trees, wireless capacity, aggregation, approximation algorithms} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Eyjólfur I. Ásgeirsson, Magnús M. Halldórsson, and Tigran Tonoyan. Universal Framework for Wireless Scheduling Problems. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 129:1-129:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{asgeirsson_et_al:LIPIcs.ICALP.2017.129, author = {\'{A}sgeirsson, Eyj\'{o}lfur I. and Halld\'{o}rsson, Magn\'{u}s M. and Tonoyan, Tigran}, title = {{Universal Framework for Wireless Scheduling Problems}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {129:1--129:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.129}, URN = {urn:nbn:de:0030-drops-74228}, doi = {10.4230/LIPIcs.ICALP.2017.129}, annote = {Keywords: Wireless, Scheduling, Physical Model, Approximation framework} }
Published in: LIPIcs, Volume 45, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
Magnús M. Halldórsson and Tigran Tonoyan. The Price of Local Power Control in Wireless Scheduling. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 529-542, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{halldorsson_et_al:LIPIcs.FSTTCS.2015.529, author = {Halld\'{o}rsson, Magn\'{u}s M. and Tonoyan, Tigran}, title = {{The Price of Local Power Control in Wireless Scheduling}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {529--542}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.529}, URN = {urn:nbn:de:0030-drops-56243}, doi = {10.4230/LIPIcs.FSTTCS.2015.529}, annote = {Keywords: Wireless Scheduling, Physical Model, Oblivious Power} }
Feedback for Dagstuhl Publishing