![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Nicole Wein
Person information
- affiliation: University of Michigan, USA
- affiliation (former): Massachusetts Institute of Technology, Cambridge, MA, USA
- affiliation (former): Rutgers University, USA
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2021
- [b1]Nicole Wein:
Algorithms and Hardness for Approximating the Diameter of a Graph. Massachusetts Institute of Technology, USA, 2021
Journal Articles
- 2021
- [j4]Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein:
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities. SIAM J. Comput. 50(4): 1155-1199 (2021) - 2020
- [j3]Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein:
Finding Cliques in Social Networks: A New Distribution-Free Model. SIAM J. Comput. 49(2): 448-464 (2020) - [j2]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ACM Trans. Algorithms 16(2): 26:1-26:19 (2020) - [j1]Shay Solomon, Nicole Wein:
Improved Dynamic Graph Coloring. ACM Trans. Algorithms 16(3): 41:1-41:24 (2020)
Conference and Workshop Papers
- 2024
- [c22]Shyan Akmal
, Virginia Vassilevska Williams, Nicole Wein:
Detecting Disjoint Shortest Paths in Linear Time and More. ICALP 2024: 9:1-9:17 - [c21]Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu:
Additive Spanner Lower Bounds with Optimal Inner Graph Structure. ICALP 2024: 28:1-28:17 - [c20]Aaron Bernstein, Greg Bodwin, Nicole Wein:
Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights? ITCS 2024: 12:1-12:22 - 2023
- [c19]Shyan Akmal, Nicole Wein:
A Local-To-Global Theorem for Congested Shortest Paths. ESA 2023: 8:1-8:17 - [c18]Aaron Bernstein, Nicole Wein:
Closing the Gap Between Directed Hopsets and Shortcut Sets. SODA 2023: 163-182 - 2022
- [c17]Oswin Aichholzer
, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein:
Hardness of Token Swapping on Trees. ESA 2022: 3:1-3:15 - [c16]Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein:
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. FOCS 2022: 290-300 - [c15]Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós
, William Kuszmaul, Nicole Wein:
Online List Labeling: Breaking the log2n Barrier. FOCS 2022: 980-990 - [c14]Aaron Berger, William Kuszmaul, Adam Polak
, Jonathan Tidor
, Nicole Wein:
Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. ICALP 2022: 19:1-19:19 - [c13]Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu:
Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product. SODA 2022: 3311-3331 - 2021
- [c12]Thiago Bergamaschi, Monika Henzinger
, Maximilian Probst Gutenberg
, Virginia Vassilevska Williams, Nicole Wein:
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. SODA 2021: 1836-1855 - [c11]Mina Dalirrooyfard, Nicole Wein:
Tight conditional lower bounds for approximating diameter in directed graphs. STOC 2021: 1697-1710 - [c10]Adir Morgan, Shay Solomon, Nicole Wein:
Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial. DISC 2021: 33:1-33:19 - 2020
- [c9]Hsin-Hao Su, Nicole Wein:
Lower Bounds for Dynamic Distributed Task Allocation. ICALP 2020: 99:1-99:14 - [c8]Maximilian Probst Gutenberg
, Virginia Vassilevska Williams, Nicole Wein:
New algorithms and hardness for incremental single-source shortest paths in directed graphs. STOC 2020: 153-166 - 2019
- [c7]Bertie Ancona, Monika Henzinger
, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein:
Algorithms and Hardness for Diameter in Dynamic Graphs. ICALP 2019: 13:1-13:14 - [c6]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu:
Approximation Algorithms for Min-Distance Problems. ICALP 2019: 46:1-46:14 - [c5]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein:
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. ICALP 2019: 47:1-47:15 - 2018
- [c4]Shay Solomon, Nicole Wein:
Improved Dynamic Graph Coloring. ESA 2018: 72:1-72:16 - [c3]Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein:
Finding Cliques in Social Networks: A New Distribution-Free Model. ICALP 2018: 55:1-55:15 - [c2]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ICALP 2018: 92:1-92:14 - [c1]Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein:
Towards tight approximation bounds for graph diameter and eccentricities. STOC 2018: 267-280
Informal and Other Publications
- 2024
- [i24]Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein:
Detecting Disjoint Shortest Paths in Linear Time and More. CoRR abs/2404.15916 (2024) - [i23]Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu:
Additive Spanner Lower Bounds with Optimal Inner Graph Structure. CoRR abs/2404.18337 (2024) - [i22]Vikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng, Jie Gao, Nicole Wein:
Low Sensitivity Hopsets. CoRR abs/2407.10249 (2024) - 2023
- [i21]Aaron Bernstein, Greg Bodwin, Nicole Wein:
Are there graphs whose shortest path structure requires large edge weights? CoRR abs/2308.13054 (2023) - 2022
- [i20]Michael A. Bender, Alexander Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein:
Online List Labeling: Breaking the log2n Barrier. CoRR abs/2203.02763 (2022) - [i19]Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein:
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. CoRR abs/2204.03076 (2022) - [i18]Aaron Bernstein, Nicole Wein:
Closing the Gap Between Directed Hopsets and Shortcut Sets. CoRR abs/2207.04507 (2022) - [i17]Shyan Akmal, Nicole Wein:
A Local-to-Global Theorem for Congested Shortest Paths. CoRR abs/2211.07042 (2022) - [i16]Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein:
Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports 12(11): 45-65 (2022) - 2021
- [i15]Adir Morgan, Shay Solomon, Nicole Wein
:
Simple Combinatorial Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs. CoRR abs/2102.10077 (2021) - [i14]Oswin Aichholzer, Erik D. Demaine, Matias Korman, Jayson Lynch, Anna Lubiw, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
:
Hardness of Token Swapping on Trees. CoRR abs/2103.06707 (2021) - [i13]Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu:
Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product. CoRR abs/2110.15809 (2021) - 2020
- [i12]Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
:
New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs. CoRR abs/2001.10751 (2020) - [i11]Hsin-Hao Su, Nicole Wein
:
Lower Bounds for Dynamic Distributed Task Allocation. CoRR abs/2006.16898 (2020) - [i10]Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein
:
Algorithms and Lower Bounds for the Worker-Task Assignment Problem. CoRR abs/2008.10709 (2020) - [i9]Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
:
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. CoRR abs/2010.10134 (2020) - [i8]Mina Dalirrooyfard, Nicole Wein
:
Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs. CoRR abs/2011.03892 (2020) - 2019
- [i7]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein
:
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. CoRR abs/1904.11601 (2019) - [i6]Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein
, Yinzhan Xu, Yuancheng Yu:
Approximation Algorithms for Min-Distance Problems. CoRR abs/1904.11606 (2019) - [i5]Shay Solomon, Nicole Wein
:
Improved Dynamic Graph Coloring. CoRR abs/1904.12427 (2019) - 2018
- [i4]Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
:
Finding Cliques in Social Networks: A New Distribution-Free Model. CoRR abs/1804.07431 (2018) - [i3]Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
:
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities. CoRR abs/1808.08494 (2018) - [i2]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
:
Fully Dynamic MIS in Uniformly Sparse Graphs. CoRR abs/1808.10316 (2018) - [i1]Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
:
Algorithms and Hardness for Diameter in Dynamic Graphs. CoRR abs/1811.12527 (2018)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 19:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint