Novel Algorithmic Techniques through the Lens of Combinatorics

Filter
Conference contribution

Search results

  • 2022

    Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver

    Chalermsook, P., Huang, C. C., Nanongkai, D., Saranurak, T., Sukprasert, P. & Yingchareonthawornchai, S., 1 Jul 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (eds.). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, p. 1-20 20 p. 37. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 229).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
    File
    2 Downloads (Pure)
  • 2021

    Coloring and maximum weight independent set of rectangles

    Chalermsook, P. & Walczak, B., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). ACM, p. 860-868 9 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
    8 Citations (Scopus)
  • Vertex Connectivity in Poly-Logarithmic Max-Flows

    Li, J., Nanongkai, D., Panigrahi, D., Saranurak, T. & Yingchareonthawornchai, S., 15 Jun 2021, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). New York, NY, USA: ACM, p. 317–329 13 p. (STOC 2021).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
    7 Citations (Scopus)
  • Vertex sparsification for edge connectivity

    Chalermsook, P., Das, S., Kook, Y., Laekhanukit, B., Liu, Y. P., Peng, R., Sellke, M. & Vaz, D., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). ACM, p. 1206-1225 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
    6 Citations (Scopus)
  • 2020

    A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs

    Beyer, S., Chimani, M. & Spoerhase, J., 1 Jan 2020, Computing and Combinatorics - 26th International Conference, COCOON 2020, Proceedings. Kim, D., Uma, R. N., Cai, Z. & Lee, D. H. (eds.). p. 347-359 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12273 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
  • Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting

    Yingchareonthawornchai, S., Roy, P. C., Laekhanukit, B., Torng, E. & Deb, K., 8 Jul 2020, GECCO 2020 Companion - Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion. ACM, p. 185-186 2 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Open Access
    File
    1 Citation (Scopus)
    110 Downloads (Pure)