BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
1 × Japan
1 × Latvia
4 × USA
Collaborated with:
M.Henzinger S.Krinninger A.D.Sarma A.Lall ∅ J.(.Xu J.Fakcharoenphol B.Laekhanukit S.Bhattacharya C.E.Tsourakakis T.Saranurak K.Makino R.J.Lipton S.Holzer L.Kor A.Korman G.Pandurangan D.Peleg R.Wattenhofer
Talks about:
algorithm (6) distribut (3) dynam (3) time (3) sublinear (2) decrement (2) shortest (2) reachabl (2) approxim (2) problem (2)

Person: Danupon Nanongkai

DBLP DBLP: Nanongkai:Danupon

Contributed to:

ICALP (1) 20152015
STOC 20152015
STOC 20142014
ICALP (2) 20132013
SIGMOD 20122012
STOC 20112011
ICALP (1) 20102010
VLDB 20102010
VLDB 20092009

Wrote 11 papers:

ICALP-v1-2015-HenzingerKN #algorithm #graph #reachability
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (MH, SK, DN), pp. 725–736.
STOC-2015-BhattacharyaHNT #algorithm #maintenance
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (SB, MH, DN, CET), pp. 173–182.
STOC-2015-HenzingerKNS #multi #online #problem
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture (MH, SK, DN, TS), pp. 21–30.
STOC-2014-HenzingerKN #algorithm #graph #reachability
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (MH, SK, DN), pp. 674–683.
STOC-2014-Nanongkai #algorithm #approximate #distributed
Distributed approximation algorithms for weighted shortest paths (DN), pp. 565–573.
ICALP-v2-2013-HenzingerKN #maintenance #network
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (MH, SK, DN), pp. 607–619.
SIGMOD-2012-NanongkaiLSM #interactive
Interactive regret minimization (DN, AL, ADS, KM), pp. 109–120.
STOC-2011-SarmaHKKNPPW #approximate #distributed #verification
Distributed verification and hardness of distributed approximation (ADS, SH, LK, AK, DN, GP, DP, RW), pp. 363–372.
ICALP-v1-2010-FakcharoenpholLN #algorithm #performance #problem
Faster Algorithms for Semi-matching Problems (JF, BL, DN), pp. 176–187.
VLDB-2010-NanongkaiSLLX #database
Regret-Minimizing Representative Databases (DN, ADS, AL, RJL, J(X), pp. 1114–1124.
VLDB-2009-SarmaLNX #algorithm #multi #random #streaming
Randomized Multi-pass Streaming Skyline Algorithms (ADS, AL, DN, J(X), pp. 85–96.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.