E-LIB Suche - Ergebnisse für: Yingchareonthawornchai, Sorrachai

1

An FPTAS for Connectivity Interdiction:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,

Huang, Chien-Chung ; Obscura Acosta, Nidia ; Yingchareonthawornchai, Sorrachai - p. 210-223 , 2024

Link: https://doi.org/10.1007/..

2

Deterministic Small Vertex Connectivity in Almost Linear Ti..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Saranurak, Thatchaphol ; Yingchareonthawornchai, Sorrachai - p. 789-800 , 2022

Link: https://doi.org/10.1109/..

3

Engineering Nearly Linear-time Algorithms for Small Vertex ..:

Franck, Max ; Yingchareonthawornchai, Sorrachai
ACM Journal of Experimental Algorithmics. 27 (2022) - p. 1-29 , 2022

Link: https://doi.org/10.1145/..

4

Vertex connectivity in poly-logarithmic max-flows:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,

Li, Jason ; Nanongkai, Danupon ; Panigrahi, Debmalya.. - p. 317-329 , 2021

Link: https://dl.acm.org/doi/1..

5

Precision, recall, and sensitivity of monitoring partially ..:

Nguyen, Duong ; Yingchareonthawornchai, Sorrachai ; Tekken Valapil, Vidhya..
Distributed Computing. 34 (2021) 5 - p. 319-348 , 2021

Link: https://doi.org/10.1007/..

6

Worst-case conditional hardness and fast algorithms with ra..:

, In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion,

Yingchareonthawornchai, Sorrachai ; Roy, Proteek Chandan ; Laekhanukit, Bundit.. - p. 185-186 , 2020

Link: https://dl.acm.org/doi/1..

7

Computing and testing small connectivity in near-linear tim..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,

Forster, Sebastian ; Nanongkai, Danupon ; Yang, Liu.. - p. 2046-2065 , 2020

Link: https://dl.acm.org/doi/1..

8

Breaking quadratic time for small vertex connectivity and a..:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,

Nanongkai, Danupon ; Saranurak, Thatchaphol ; Yingchareonthawornchai, Sorrachai - p. 241-252 , 2019

Link: https://dl.acm.org/doi/1..

9

A Sorted-Partitioning Approach to Fast and Scalable Dynamic..:

Yingchareonthawornchai, Sorrachai ; Daly, James ; Liu, Alex X..
IEEE/ACM Transactions on Networking. 26 (2018) 4 - p. 1907-1920 , 2018

Link: https://doi.org/10.1109/..

10

Analysis of Bounds on Hybrid Vector Clocks:

Yingchareonthawornchai, Sorrachai ; Nguyen, Duong N. ; Kulkarni, Sandeep S..
IEEE Transactions on Parallel and Distributed Systems. 29 (2018) 9 - p. 1947-1960 , 2018

Link: https://doi.org/10.1109/..

11

A Sorted-Partitioning Approach to Fast and Scalable Dynamic..:

Yingchareonthawornchai, Sorrachai ; Daly, James ; Liu, Alex X..
IEEE/ACM Transactions on Networking (TON). 26 (2018) 4 - p. 1907-1920 , 2018

Link: https://dl.acm.org/doi/1..

12

Efficient Algorithms for Predicate Detection using Hybrid L..:

, In: Proceedings of the 18th International Conference on Distributed Computing and Networking,

Yingchareonthawornchai, Sorrachai ; Valapil, Vidhya Tekken ; Kulkarni, Sandeep.. - p. 1-10 , 2017

Link: https://dl.acm.org/doi/1..

13

Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forb..:

Chalermsook, Parinya ; Pettie, Seth ; Yingchareonthawornchai, Sorrachai
http://arxiv.org/abs/2307.02294. , 2023

Link: http://arxiv.org/abs/230..

14

Deterministic $k$-Vertex Connectivity in $k^2$ Max-flows:

Nalam, Chaitanya ; Saranurak, Thatchaphol ; Yingchareonthawornchai, Sorrachai
http://arxiv.org/abs/2308.04695. , 2023

Link: http://arxiv.org/abs/230..

15

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matri..:

Chalermsook, Parinya ; Gupta, Manoj ; Jiamjitrak, Wanchote...
info:eu-repo/grantAgreement/EC/H2020/759557/EU//ALGOCom. , 2023

Link: https://aaltodoc.aalto.f..