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 × Latvia
1 × United Kingdom
2 × Japan
4 × USA
Collaborated with:
S.Krinninger D.Nanongkai V.Loitzenbauer K.Chatterjee S.Bhattacharya G.F.Italiano P.Dütting I.Weber C.E.Tsourakakis T.Saranurak R.Colini-Baldeschi S.Leonardi M.Starnberger M.Joglekar N.Shah W.Dvorák S.Oraee V.Toman
Talks about:
algorithm (8) dynam (4) time (4) symbol (3) object (3) improv (3) graph (3) sublinear (2) decrement (2) reachabl (2)

Person: Monika Henzinger

DBLP DBLP: Henzinger:Monika

Facilitated 2 volumes:

ICALP (1) 2011Ed
ICALP (2) 2011Ed

Contributed to:

ICALP (1) 20152015
LICS 20152015
STOC 20152015
STOC 20142014
ICALP (2) 20132013
CIKM 20122012
ICALP (2) 20122012
CAV 20112011
CSL 20172017
CAV (2) 20182018

Wrote 13 papers:

ICALP-v1-2015-BhattacharyaHI #algorithm #design
Design of Dynamic Algorithms via Primal-Dual Method (SB, MH, GFI), pp. 206–218.
ICALP-v1-2015-HenzingerKL #component #polynomial
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (MH, SK, VL), pp. 713–724.
ICALP-v1-2015-HenzingerKN #algorithm #graph #reachability
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (MH, SK, DN), pp. 725–736.
LICS-2015-ChatterjeeHL #algorithm
Improved Algorithms for One-Pair and k-Pair Streett Objectives (KC, MH, VL), pp. 269–280.
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.
ICALP-v2-2013-HenzingerKN #maintenance #network
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (MH, SK, DN), pp. 607–619.
CIKM-2012-DuttingHW #recommendation #trust
Maximizing revenue from strategic recommendations under decaying trust (PD, MH, IW), pp. 2283–2286.
ICALP-v2-2012-BaldeschiHLS #keyword #multi #on the
On Multiple Keyword Sponsored Search Auctions with Budgets (RCB, MH, SL, MS), pp. 1–12.
CAV-2011-ChatterjeeHJS #algorithm #analysis #automaton #markov #process
Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives (KC, MH, MJ, NS), pp. 260–276.
CSL-2017-ChatterjeeDHL #algorithm #game studies
Improved Set-Based Symbolic Algorithms for Parity Games (KC, WD, MH, VL), p. 21.
CAV-2018-ChatterjeeHLOT #algorithm #graph #markov #process
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives (KC, MH, VL, SO, VT), pp. 178–197.
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.