Danupon Nanongkai
Danupon Nanongkai

homepage
danuponatgmail.com

  Affiliation history
Bibliometrics: publication history
Average citations per article8.02
Citation Count329
Publication count41
Publication years2004-2018
Available for download25
Average downloads per article274.20
Downloads (cumulative)6,855
Downloads (12 Months)1,067
Downloads (6 Weeks)103
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


42 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 42
Result page: 1 2 3

Sort by:

1
January 2018 SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 11,   Downloads (12 Months): 11,   Downloads (Overall): 11

Full text available: PDFPDF
We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ − 1)-edge coloring in a graph with maximum degree Δ. It is natural ...

2 published by ACM
December 2017 ACM Transactions on Algorithms (TALG): Volume 13 Issue 4, December 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 12,   Downloads (12 Months): 12,   Downloads (Overall): 12

Full text available: PDFPDF
We study the problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We present deterministic (1+ε)-approximation algorithms whose amortized time (over some number of link changes) is sublinear in D , ...
Keywords: dynamic algorithms, Distributed algorithms

3 published by ACM
June 2017 STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 8,   Downloads (12 Months): 57,   Downloads (Overall): 57

Full text available: PDFPDF
We present two algorithms for dynamically maintaining a spanning forest of a graph undergoing edge insertions and deletions. Our algorithms guarantee worst-case update time and work against an adaptive adversary , meaning that an edge update can depend on previous outputs of the algorithms. We provide the first polynomial improvement ...
Keywords: Dynamic spanning forest, Sparse recovery, Local graph partitioning, Graph decomposition

4
January 2017 SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 17,   Downloads (Overall): 17

Full text available: PDFPDF
We consider the problem of maintaining an approximately maximum (fractional) matching and an approximately minimum vertex cover in a dynamic graph. Starting with the seminal paper by Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. There remains, however, a polynomial gap between the best ...

5 published by ACM
June 2016 STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 4,   Downloads (12 Months): 101,   Downloads (Overall): 204

Full text available: PDFPDF
We present a deterministic (1+ o (1))-approximation O ( n 1/2+ o (1) + D 1+ o (1) )-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model); here n is the number of nodes in the network and D is its (hop) diameter. ...
Keywords: shortest paths, derandomization, Distributed computing

6 published by ACM
June 2016 STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 10,   Downloads (12 Months): 90,   Downloads (Overall): 213

Full text available: PDFPDF
We present two deterministic dynamic algorithms for the maximum matching problem. (1) An algorithm that maintains a (2+є)-approximate maximum matching in general graphs with O ( poly (log n , 1/є)) update time. (2) An algorithm that maintains an α K approximation of the value of the maximum matching with ...
Keywords: Data Structures, Dynamic Graph Algorithms

7 published by ACM
June 2015 SIGMETRICS '15: Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 8,   Downloads (12 Months): 83,   Downloads (Overall): 202

Full text available: PDFPDF
Viral marketing is a powerful tool for online advertising and sales because it exploits the influence people have on one another. While this marketing technique has been beneficial for advertisers, it has not been shown how the social network providers such as Facebook and Twitter can benefit from it. In ...
Keywords: approximation algorithms, social networks
Also published in:
June 2015  ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review: Volume 43 Issue 1, June 2015

8 published by ACM
June 2015 STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 14
Downloads (6 Weeks): 3,   Downloads (12 Months): 84,   Downloads (Overall): 244

Full text available: PDFPDF
While in many graph mining applications it is crucial to handle a stream of updates efficiently in terms of both time and space, not much was known about achieving such type of algorithm. In this paper we study this issue for a problem which lies at the core of many ...
Keywords: streaming algorithms, dynamic graph algorithms

9 published by ACM
June 2015 STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 16
Downloads (6 Weeks): 5,   Downloads (12 Months): 58,   Downloads (Overall): 253

Full text available: PDFPDF
Consider the following Online Boolean Matrix-Vector Multiplication problem: We are given an n x n matrix M and will receive n column-vectors of size n, denoted by v 1 , ..., v n , one by one. After seeing each vector v i , we have to output the product ...
Keywords: dynamic graph algorithms, lower bounds

10
January 2015 SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 10
Downloads (6 Weeks): 5,   Downloads (12 Months): 60,   Downloads (Overall): 219

Full text available: PDFPDF
Motivated by the increasing need for fast distributed processing of large-scale graphs such as the Web graph and various social networks, we study a number of fundamental graph problems in the message-passing model, where we have k machines that jointly perform computation on an arbitrary n -node (typically, n ≫ ...

11
November 2014 Algorithmica: Volume 70 Issue 3, November 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP�co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem ...
Keywords: Graph algorithms, Mean-payoff games, Turn-based infinite duration games, Energy games, Polynomial-time algorithms

12
October 2014 FOCS '14: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

The study of graph products is a major research topic and typically concerns the term f(G * H), e.g., to show that f(G * H) = f(G)f(H). In this paper, we study graph products in a non-standard form f(R[G * H] where R is a "reduction", a transformation of any ...

13
October 2014 FOCS '14: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 7

The decremental single-source shortest paths (SSSP) problem concerns maintaining the distances between a given source node s to every node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be easily solved in near-linear time, this decremental problem is much more challenging even in the ...
Keywords: dynamic graph algorithms, single-source shortest paths

14 published by ACM
July 2014 PODC '14: Proceedings of the 2014 ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 16,   Downloads (Overall): 65

Full text available: PDFPDF
In this short paper, we present an improved algorithm for approximating the minimum cut on distributed (CONGEST) networks. Let λ be the minimum cut. Our algorithm can compute λ exactly in O((√n+D) poly(λ)) time, where n is the number of nodes (processors) in the network, D is the network diameter, ...
Keywords: congest model, graph algorithms, time complexity, distributed computing, minimum cut

15 published by ACM
July 2014 PODC '14: Proceedings of the 2014 ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 2,   Downloads (12 Months): 23,   Downloads (Overall): 210

Full text available: PDFPDF
The focus of this paper is on quantum distributed computation, where we investigate whether quantum communication can help in speeding up distributed network algorithms. Our main result is that for certain fundamental network problems such as minimum spanning tree, minimum cut, and shortest paths, quantum communication does not help in ...
Keywords: congest model, graph algorithms, quantum communication, time complexity, distributed computing, lower bound

16 published by ACM
May 2014 STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 25
Downloads (6 Weeks): 5,   Downloads (12 Months): 100,   Downloads (Overall): 401

Full text available: PDFPDF
A distributed network is modeled by a graph having n nodes (processors) and diameter D . We study the time complexity of approximating weighted (undirected) shortest paths on distributed networks with a O (log n ) bandwidth restriction on edges (the standard synchronous CONGEST model). The question whether approximation algorithms ...
Keywords: CONGEST model, distributed computing, single-source shortest paths, all-pairs shortest paths, lower bounds, graph algorithms, time complexity

17 published by ACM
May 2014 STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 7,   Downloads (12 Months): 67,   Downloads (Overall): 259

Full text available: PDFPDF
We consider dynamic algorithms for maintaining Single-Source Reachability (SSR) and approximate Single-Source Shortest Paths (SSSP) on n -node m -edge directed graphs under edge deletions ( decremental algorithms ). The previous fastest algorithm for SSR and SSSP goes back three decades to Even and Shiloach (JACM 1981); it has O ...
Keywords: shortest paths, dynamic graph algorithms, reachability

18 published by ACM
May 2014 ACM Transactions on Algorithms (TALG): Volume 10 Issue 3, June 2014
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 9,   Downloads (12 Months): 55,   Downloads (Overall): 372

Full text available: PDFPDF
We consider the problem of finding semi-matching in bipartite graphs, which is also extensively studied under various names in the scheduling literature. We give faster algorithms for both weighted and unweighted cases. For the weighted case, we give an O ( nm log n )-time algorithm, where n is the ...
Keywords: combinatorial optimization, scheduling, Semi-matching, design and analysis of algorithm

19
January 2014 SODA '14: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 1,   Downloads (12 Months): 18,   Downloads (Overall): 61

Full text available: PDFPDF
We study dynamic (1 + ε)-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n -node m -edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O ( n 2+ o (1) ) total update time and constant query time by ...

20
October 2013 FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3

We present a series of almost settled inapproximability results for three fundamental problems. The first in our series is the sub exponential-time inapproximability of the independent set problem, a question studied in the area of parameterized complexity. The second is the hardness of approximating the bipartite induced matching problem on ...
Keywords: Approximation Algorithms, Subexponential-Time Algorithms, Algorithmic Pricing



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us