Monika Henzinger
According to our database1,
Monika Henzinger
authored at least 184 papers
between 1990 and 2021.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2016, "For contributions to computer theory and its practical application".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:
-
on zbmath.org
-
on idref.fr
-
on acm.org
-
on viaf.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021
2020
Proceedings of the Protein-Protein Interaction Networks, Methods and Protocols., 2020
SIAM J. Discret. Math., 2020
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.
Proceedings of the 36th International Symposium on Computational Geometry, 2020
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020
2019
Theor. Comput. Sci., 2019
Proc. ACM Meas. Anal. Comput. Syst., 2019
Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing.
CoRR, 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Proceedings of the 30th International Conference on Concurrency Theory, 2019
2018
ACM Trans. Economics and Comput., 2018
ACM Trans. Algorithms, 2018
SIAM J. Comput., 2018
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time.
J. ACM, 2018
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018
2017
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.
ACM Trans. Algorithms, 2017
SIGIR Forum, 2017
Theory Comput. Syst., 2017
Log. Methods Comput. Sci., 2017
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log<sup>3</sup>n) Worst Case Update Time.
CoRR, 2017
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 34th International Conference on Machine Learning, 2017
Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk).
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017
2016
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization.
Encyclopedia of Algorithms, 2016
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization.
SIAM J. Comput., 2016
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
ACM Trans. Economics and Comput., 2015
ACM Trans. Economics and Comput., 2015
ACM Trans. Economics and Comput., 2015
CoRR, 2015
Proceedings of the Web and Internet Economics - 11th International Conference, 2015
Proceedings of the Web and Internet Economics - 11th International Conference, 2015
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015
2014
Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.
J. ACM, 2014
Algorithmica, 2014
Limiting Price Discrimination when Selling Products with Positive Network Externalities.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs.
Proceedings of the Symposium on Theory of Computing, 2014
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the Algorithms - ESA 2014, 2014
2013
ACM Trans. Web, 2013
Inf. Process. Lett., 2013
Inf. Comput., 2013
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives.
Formal Methods Syst. Des., 2013
Proceedings of the Proceedings Fourth International Symposium on Games, 2013
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012
2011
ACM Trans. Web, 2011
Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Proceedings of the Algorithms - ESA 2011, 2011
2010
Proceedings of the 19th International Conference on World Wide Web, 2010
Proceedings of the Algorithms, 2010
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
2009
Proceedings of the 18th International Conference on World Wide Web, 2009
Proceedings of the 18th International Conference on World Wide Web, 2009
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
2006
Proceedings of the SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2006
2005
An online throughput-competitive algorithm for multicast routing and admission control.
J. Algorithms, 2005
2004
Proceedings of the Handbook of Data Structures and Applications., 2004
Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
2003
J. Algorithms, 2003
2002
Proceedings of the 2002 IEEE International Conference on Cluster Computing (CLUSTER 2002), 2002
2001
Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001
2000
J. Am. Soc. Inf. Sci., 2000
Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, February 28, 2000
Proceedings of the Algorithms, 2000
1999
J. ACM, 1999
Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.
Algorithmica, 1999
1998
Comput. Networks, 1998
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
1997
Sampling to provide or to bound: With applications to fully dynamic graph algorithms.
Random Struct. Algorithms, 1997
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity.
J. Algorithms, 1997
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997
1996
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.
Proceedings of the Algorithm Theory, 1996
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996
1995
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
Proceedings of the Algorithms, 1995
1994
Theor. Comput. Sci., 1994
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
1993
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993
1992
SIAM J. Comput., 1992
Proceedings of the Algorithm Theory, 1992
1990