default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZihan Tan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Ioannis Caragiannis, Aris Filos-Ratsikas
, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan:
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship. Math. Program. 203(1): 901-930 (2024)- [c18]Yu Chen, Zihan Tan:
Lower Bounds on 0-Extension with Steiner Nodes. ICALP 2024: 47:1-47:18 - [c17]Yu Chen, Zihan Tan:
An Ω~(√log|T|) Lower Bound for Steiner Point Removal. SODA 2024: 694-698 - [c16]Yu Chen, Zihan Tan:
On (1 + ɛ)-Approximate Flow Sparsifiers. SODA 2024: 1568-1605 - [i23]Yu Chen, Zihan Tan:
Lower Bounds on 0-Extension with Steiner Nodes. CoRR abs/2401.09585 (2024) - [i22]Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
New Structures and Algorithms for Length-Constrained Expander Decompositions. CoRR abs/2404.13446 (2024) - [i21]Yu Chen, Zihan Tan:
Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs. CoRR abs/2407.10852 (2024) - 2023
- [c15]Yu Chen, Sanjeev Khanna, Zihan Tan:
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. ICALP 2023: 37:1-37:16 - [c14]Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, Zihan Tan:
A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. ITCS 2023: 38:1-38:23 - [c13]Yu Chen, Sanjeev Khanna, Zihan Tan:
Query Complexity of the Metric Steiner Tree Problem. SODA 2023: 4893-4935 - [c12]Zihan Tan, Tianyi Zhang:
Almost-Optimal Sublinear Additive Spanners. STOC 2023: 281-294 - [c11]Zihan Tan, Yifeng Teng, Mingfei Zhao:
Worst-Case Welfare of Item Pricing in the Tollbooth Problem. WWW 2023: 3508-3518 - [i20]Zihan Tan, Tianyi Zhang:
Almost-Optimal Sublinear Additive Spanners. CoRR abs/2303.12768 (2023) - [i19]Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
Parallel Greedy Spanners. CoRR abs/2304.08892 (2023) - [i18]Yu Chen, Zihan Tan:
On (1+ε)-Approximate Flow Sparsifiers. CoRR abs/2310.07857 (2023) - [i17]Yu Chen, Zihan Tan:
An Ω̃(√(log |T|) Lower Bound for Steiner Point Removal. CoRR abs/2310.07862 (2023) - [i16]Yu Chen, Zihan Tan:
Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families. CoRR abs/2310.11367 (2023) - 2022
- [c10]Julia Chuzhoy, Zihan Tan:
A subpolynomial approximation algorithm for graph crossing number in low-degree graphs. STOC 2022: 303-316 - [c9]Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan:
Almost-linear ε-emulators for planar graphs. STOC 2022: 1311-1324 - [i15]Julia Chuzhoy, Zihan Tan:
A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs. CoRR abs/2202.06827 (2022) - [i14]Yu Chen, Sanjeev Khanna, Zihan Tan:
Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. CoRR abs/2203.14798 (2022) - [i13]Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan:
Near-Linear ε-Emulators for Planar Graphs. CoRR abs/2206.10681 (2022) - [i12]Yu Chen, Sanjeev Khanna, Zihan Tan:
Query Complexity of the Metric Steiner Tree Problem. CoRR abs/2211.03893 (2022) - [i11]Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, Zihan Tan:
A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. CoRR abs/2211.05906 (2022) - 2021
- [j5]Julia Chuzhoy, Zihan Tan:
Towards tight(er) bounds for the Excluded Grid Theorem. J. Comb. Theory B 146: 219-265 (2021) - [c8]Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan:
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. SODA 2021: 2212-2228 - [i10]Zihan Tan, Yifeng Teng, Mingfei Zhao:
Worst-Case Welfare of Item Pricing in the Tollbooth Problem. CoRR abs/2107.05690 (2021) - 2020
- [j4]Zihan Tan, Liwei Zeng:
Erratum for "On the Inequalities of Projected Volumes and the Constructible Region". SIAM J. Discret. Math. 34(1): 1000 (2020) - [c7]Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan:
Towards Better Approximation of Graph Crossing Number. FOCS 2020: 73-84 - [c6]Julia Chuzhoy, Merav Parter, Zihan Tan:
On Packing Low-Diameter Spanning Trees. ICALP 2020: 33:1-33:18 - [i9]Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, Zihan Tan:
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. CoRR abs/2005.02369 (2020) - [i8]Julia Chuzhoy, Merav Parter, Zihan Tan:
On Packing Low-Diameter Spanning Trees. CoRR abs/2006.07486 (2020) - [i7]Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan:
Towards Better Approximation of Graph Crossing Number. CoRR abs/2011.06545 (2020)
2010 – 2019
- 2019
- [j3]Zihan Tan, Liwei Zeng:
On the Inequalities of Projected Volumes and the Constructible Region. SIAM J. Discret. Math. 33(2): 694-711 (2019) - [c5]Julia Chuzhoy, Zihan Tan:
Towards Tight(er) Bounds for the Excluded Grid Theorem. SODA 2019: 1445-1464 - [c4]Zihan Tan, Anjia Zhou, Xiaojun Hei, Yayu Gao, Chengwei Zhang:
Towards Automatic Engagement Recognition of Autistic Children in a Machine Learning Approach. TALE 2019: 1-8 - [i6]Julia Chuzhoy, Zihan Tan:
Towards Tight(er) Bounds for the Excluded Grid Theorem. CoRR abs/1901.07944 (2019) - 2018
- [j2]Cupjin Huang, Zihan Tan, Shenghao Yang, Xuan Guang:
Comments on Cut-Set Bounds on Network Function Computation. IEEE Trans. Inf. Theory 64(9): 6454-6459 (2018) - 2016
- [j1]Zihan Tan:
On the computational complexity of bridgecard. J. Comb. Optim. 31(1): 196-217 (2016) - [c3]Wei Chen, Tian Lin, Zihan Tan, Mingfei Zhao, Xuren Zhou:
Robust Influence Maximization. KDD 2016: 795-804 - [c2]Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan:
Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship. WINE 2016: 236-250 - [i5]Wei Chen, Tian Lin, Zihan Tan, Mingfei Zhao, Xuren Zhou:
Robust Influence Maximization. CoRR abs/1601.06551 (2016) - [i4]Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan:
Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship. CoRR abs/1602.08023 (2016) - 2015
- [c1]Cupjin Huang, Zihan Tan, Shenghao Yang:
Upper bound on function computation in directed acyclic networks. ITW 2015: 1-5 - [i3]Cupjin Huang, Zihan Tan, Shenghao Yang:
Upper Bound on Function Computation in Directed Acyclic Networks. CoRR abs/1501.01084 (2015) - 2014
- [i2]Yizhen Zhang, Zihan Tan, Bhaskar Krishnamachari:
On the Meeting Time for Two Random Walks on a Regular Graph. CoRR abs/1408.2005 (2014) - [i1]Zihan Tan, Liwei Zeng, Jian Li:
On the Inequalities of Projected Volumes and the Constructible Region. CoRR abs/1410.8663 (2014)
Coauthor Index
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-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
