Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Arun Ganesh, Bruce M. Maggs, and Debmalya Panigrahi. Universal Algorithms for Clustering Problems. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 70:1-70:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ganesh_et_al:LIPIcs.ICALP.2021.70, author = {Ganesh, Arun and Maggs, Bruce M. and Panigrahi, Debmalya}, title = {{Universal Algorithms for Clustering Problems}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {70:1--70: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.70}, URN = {urn:nbn:de:0030-drops-141397}, doi = {10.4230/LIPIcs.ICALP.2021.70}, annote = {Keywords: universal algorithms, clustering, k-median, k-means, k-center} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Arun Ganesh, Bruce M. Maggs, and Debmalya Panigrahi. Robust Algorithms for TSP and Steiner Tree. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 54:1-54:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ganesh_et_al:LIPIcs.ICALP.2020.54, author = {Ganesh, Arun and Maggs, Bruce M. and Panigrahi, Debmalya}, title = {{Robust Algorithms for TSP and Steiner Tree}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {54:1--54:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.54}, URN = {urn:nbn:de:0030-drops-124619}, doi = {10.4230/LIPIcs.ICALP.2020.54}, annote = {Keywords: Robust optimization, Steiner tree, traveling salesman problem} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Samuel Haney, Mehraneh Liaee, Bruce M. Maggs, Debmalya Panigrahi, Rajmohan Rajaraman, and Ravi Sundaram. Retracting Graphs to Cycles. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 70:1-70:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{haney_et_al:LIPIcs.ICALP.2019.70, author = {Haney, Samuel and Liaee, Mehraneh and Maggs, Bruce M. and Panigrahi, Debmalya and Rajaraman, Rajmohan and Sundaram, Ravi}, title = {{Retracting Graphs to Cycles}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {70:1--70:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.70}, URN = {urn:nbn:de:0030-drops-106462}, doi = {10.4230/LIPIcs.ICALP.2019.70}, annote = {Keywords: Graph algorithms, Graph embedding, Planar graphs, Approximation algorithms} }
Published in: Dagstuhl Reports, Volume 7, Issue 1 (2017)
David Hausheer, Oliver Hohlfeld, Diego R. López, Bruce MacDowell Maggs, and Costin Raiciu. Network Function Virtualization in Software Defined Infrastructures (Dagstuhl Seminar 17032). In Dagstuhl Reports, Volume 7, Issue 1, pp. 74-102, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@Article{hausheer_et_al:DagRep.7.1.74, author = {Hausheer, David and Hohlfeld, Oliver and López, Diego R. and Maggs, Bruce MacDowell and Raiciu, Costin}, title = {{Network Function Virtualization in Software Defined Infrastructures (Dagstuhl Seminar 17032)}}, pages = {74--102}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2017}, volume = {7}, number = {1}, editor = {Hausheer, David and Hohlfeld, Oliver and López, Diego R. and Maggs, Bruce MacDowell and Raiciu, Costin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.1.74}, URN = {urn:nbn:de:0030-drops-72464}, doi = {10.4230/DagRep.7.1.74}, annote = {Keywords: flexible network management, network function virtualization, software-defined networking} }
Published in: LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Samuel Haney, Bruce Maggs, Biswaroop Maiti, Debmalya Panigrahi, Rajmohan Rajaraman, and Ravi Sundaram. Symmetric Interdiction for Matching Problems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 81, pp. 9:1-9:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{haney_et_al:LIPIcs.APPROX-RANDOM.2017.9, author = {Haney, Samuel and Maggs, Bruce and Maiti, Biswaroop and Panigrahi, Debmalya and Rajaraman, Rajmohan and Sundaram, Ravi}, title = {{Symmetric Interdiction for Matching Problems}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {9:1--9:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-044-6}, ISSN = {1868-8969}, year = {2017}, volume = {81}, editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.9}, URN = {urn:nbn:de:0030-drops-75587}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.9}, annote = {Keywords: Approximation algorithms, matching, interdiction Digital Object} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Bruce Maggs, Friedhelm Meyer auf der Heide, and Ernst W. Mayr. Parallel and Distributed Algorithms (Dagstuhl Seminar 99291). Dagstuhl Seminar Report 246, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2000)
@TechReport{maggs_et_al:DagSemRep.246, author = {Maggs, Bruce and Meyer auf der Heide, Friedhelm and Mayr, Ernst W.}, title = {{Parallel and Distributed Algorithms (Dagstuhl Seminar 99291)}}, pages = {1--22}, ISSN = {1619-0203}, year = {2000}, type = {Dagstuhl Seminar Report}, number = {246}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.246}, URN = {urn:nbn:de:0030-drops-151326}, doi = {10.4230/DagSemRep.246}, }
Feedback for Dagstuhl Publishing