Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Anastasios Sidiropoulos, Kritika Singhal, and Vijay Sridhar. Fractal Dimension and Lower Bounds for Geometric Problems. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 70:1-70:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{sidiropoulos_et_al:LIPIcs.SoCG.2018.70, author = {Sidiropoulos, Anastasios and Singhal, Kritika and Sridhar, Vijay}, title = {{Fractal Dimension and Lower Bounds for Geometric Problems}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {70:1--70:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.70}, URN = {urn:nbn:de:0030-drops-87831}, doi = {10.4230/LIPIcs.SoCG.2018.70}, annote = {Keywords: fractal dimension, treewidth, spanners, lower bounds, exponential time hypothesis} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Anastasios Sidiropoulos and Vijay Sridhar. Algorithmic Interpretations of Fractal Dimension. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 58:1-58:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{sidiropoulos_et_al:LIPIcs.SoCG.2017.58, author = {Sidiropoulos, Anastasios and Sridhar, Vijay}, title = {{Algorithmic Interpretations of Fractal Dimension}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {58:1--58:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.58}, URN = {urn:nbn:de:0030-drops-72126}, doi = {10.4230/LIPIcs.SoCG.2017.58}, annote = {Keywords: fractal dimension, exact algorithms, fixed parameter tractability, approximation schemes, spanners} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Facundo Mémoli, Anastasios Sidiropoulos, and Vijay Sridhar. Quasimetric Embeddings and Their Applications. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 85:1-85:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{memoli_et_al:LIPIcs.ICALP.2016.85, author = {M\'{e}moli, Facundo and Sidiropoulos, Anastasios and Sridhar, Vijay}, title = {{Quasimetric Embeddings and Their Applications}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {85:1--85:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.85}, URN = {urn:nbn:de:0030-drops-62007}, doi = {10.4230/LIPIcs.ICALP.2016.85}, annote = {Keywords: metric embeddings, quasimetrics, outliers, random embeddings, treewidth, Directed Sparsest-Cut, Directed Multicut} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Venkatesan Guruswami and Euiwoong Lee. Inapproximability of H-Transversal/Packing. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 284-304, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{guruswami_et_al:LIPIcs.APPROX-RANDOM.2015.284, author = {Guruswami, Venkatesan and Lee, Euiwoong}, title = {{Inapproximability of H-Transversal/Packing}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {284--304}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.284}, URN = {urn:nbn:de:0030-drops-53085}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.284}, annote = {Keywords: Constraint Satisfaction Problems, Approximation resistance} }
Feedback for Dagstuhl Publishing