Published in: LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
Lap Chi Lau, Robert Wang, and Hong Zhou. Experimental Design for Any p-Norm. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 4:1-4:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{lau_et_al:LIPIcs.APPROX/RANDOM.2023.4, author = {Lau, Lap Chi and Wang, Robert and Zhou, Hong}, title = {{Experimental Design for Any p-Norm}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {4:1--4:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-296-9}, ISSN = {1868-8969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.4}, URN = {urn:nbn:de:0030-drops-188292}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.4}, annote = {Keywords: Approximation Algorithm, Optimal Experimental Design, Randomized Local Search} }
Published in: LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
Roy Gotlib and Tali Kaufman. Fine Grained Analysis of High Dimensional Random Walks. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 49:1-49:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{gotlib_et_al:LIPIcs.APPROX/RANDOM.2023.49, author = {Gotlib, Roy and Kaufman, Tali}, title = {{Fine Grained Analysis of High Dimensional Random Walks}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {49:1--49:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-296-9}, ISSN = {1868-8969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.49}, URN = {urn:nbn:de:0030-drops-188740}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.49}, annote = {Keywords: High Dimensional Expanders, High Dimensional Random Walks, Local Spectral Expansion, Local to Global, Trickling Down} }
Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)
Eric Blais and Abhinav Bommireddi. On Testing and Robust Characterizations of Convexity. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 18:1-18:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{blais_et_al:LIPIcs.APPROX/RANDOM.2020.18, author = {Blais, Eric and Bommireddi, Abhinav}, title = {{On Testing and Robust Characterizations of Convexity}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {18:1--18:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Byrka, Jaros{\l}aw and Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.18}, URN = {urn:nbn:de:0030-drops-126214}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.18}, annote = {Keywords: Convexity, Line segment test, Convex hull test, Intersecting cones} }
Published in: LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Vedat Levi Alev, Nima Anari, Lap Chi Lau, and Shayan Oveis Gharan. Graph Clustering using Effective Resistance. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 41:1-41:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{alev_et_al:LIPIcs.ITCS.2018.41, author = {Alev, Vedat Levi and Anari, Nima and Lau, Lap Chi and Oveis Gharan, Shayan}, title = {{Graph Clustering using Effective Resistance}}, booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)}, pages = {41:1--41:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-060-6}, ISSN = {1868-8969}, year = {2018}, volume = {94}, editor = {Karlin, Anna R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.41}, URN = {urn:nbn:de:0030-drops-83696}, doi = {10.4230/LIPIcs.ITCS.2018.41}, annote = {Keywords: Electrical Flows, Effective Resistance, Conductance, Graph Partitioning} }
Published in: LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Vedat Levi Alev and Lap Chi Lau. Approximating Unique Games Using Low Diameter Graph Decomposition. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 81, pp. 18:1-18:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{levialev_et_al:LIPIcs.APPROX-RANDOM.2017.18, author = {Levi Alev, Vedat and Lau, Lap Chi}, title = {{Approximating Unique Games Using Low Diameter Graph Decomposition}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {18:1--18:15}, 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.18}, URN = {urn:nbn:de:0030-drops-75676}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.18}, annote = {Keywords: Unique Games, Low Diameter Graph Decomposition, Bounded Genus Graphs, Fixed Minor Free Graphs, Approximation Algorithms, Linear Programming} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Tsz Chiu Kwok and Lap Chi Lau. Lower Bounds on Expansions of Graph Powers. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 313-324, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{kwok_et_al:LIPIcs.APPROX-RANDOM.2014.313, author = {Kwok, Tsz Chiu and Lau, Lap Chi}, title = {{Lower Bounds on Expansions of Graph Powers}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {313--324}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.313}, URN = {urn:nbn:de:0030-drops-47057}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.313}, annote = {Keywords: Conductance, Expansion, Graph power, Random walk} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
R. Ravi. Iterative Methods in Combinatorial Optimization (Invited Talk). In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, p. 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)
@InProceedings{ravi:LIPIcs.STACS.2012.24, author = {Ravi, R.}, title = {{Iterative Methods in Combinatorial Optimization}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {24--24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.24}, URN = {urn:nbn:de:0030-drops-33876}, doi = {10.4230/LIPIcs.STACS.2012.24}, annote = {Keywords: combinatorial optimization, linear programming, matroid} }
Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Babak Farzad, Lap Chi Lau, Van Bang Le, and Nguyen Ngoc Tuy. Computing Graph Roots Without Short Cycles. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 397-408, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{farzad_et_al:LIPIcs.STACS.2009.1827, author = {Farzad, Babak and Lau, Lap Chi and Le, Van Bang and Tuy, Nguyen Ngoc}, title = {{Computing Graph Roots Without Short Cycles}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {397--408}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1827}, URN = {urn:nbn:de:0030-drops-18279}, doi = {10.4230/LIPIcs.STACS.2009.1827}, annote = {Keywords: Graph roots, Graph powers, Recognition algorithms, NP-completeness} }
Feedback for Dagstuhl Publishing