default search action
Da Wei Zheng
Person information
- affiliation: University of Illinois Urbana-Champaign, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Timothy M. Chan
, Da Wei Zheng
Hopcroft's Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees. ACM Trans. Algorithms 20(3): 24 (2024) - [c14]Timothy M. Chan, Pingan Cheng, Da Wei Zheng:
Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane. SoCG 2024: 33:1-33:15 - [c13]Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu:
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. ESA 2024: 42:1-42:19 - [c12]Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng:
Shortest Path Separators in Unit Disk Graphs. ESA 2024: 66:1-66:14 - [c11]Yi-Jun Chang, Da Wei Zheng
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs. SODA 2024: 4410-4450 - [c10]Timothy M. Chan, Pingan Cheng, Da Wei Zheng
An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism. SODA 2024: 4451-4463 - [i14]Timothy M. Chan, Pingan Cheng, Da Wei Zheng:
Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane. CoRR abs/2403.12303 (2024) - [i13]Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu:
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. CoRR abs/2407.01904 (2024) - [i12]Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng:
Shortest Path Separators in Unit Disk Graphs. CoRR abs/2407.15980 (2024) - [i11]Eliot W. Robson, Jack Spalding-Jamieson, Da Wei Zheng:
Carving Polytopes with Saws in 3D. CoRR abs/2407.15981 (2024) - [i10]Adam Karczmarz, Da Wei Zheng:
Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more. CoRR abs/2410.12003 (2024) - 2023
- [j3]Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. ACM J. Exp. Algorithmics 28: 1.2:1-1.2:13 (2023) - [c9]Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng:
Faster Submodular Maximization for Several Classes of Matroids. ICALP 2023: 74:1-74:18 - [c8]Da Wei Zheng
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching. IPCO 2023: 453-465 - [c7]Sariel Har-Peled
Halving by a Thousand Cuts or Punctures. SODA 2023: 1385-1397 - [c6]Timothy M. Chan, Da Wei Zheng
Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures. SODA 2023: 1493-1511 - [i9]Da Wei Zheng
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching. CoRR abs/2301.09217 (2023) - [i8]Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. CoRR abs/2303.09632 (2023) - [i7]Yi-Jun Chang, Da Wei Zheng:
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs. CoRR abs/2304.07441 (2023) - [i6]Monika Henzinger, Paul Liu, Jan Vondrák, Da Wei Zheng:
Faster Submodular Maximization for Several Classes of Matroids. CoRR abs/2305.00122 (2023) - [i5]Timothy M. Chan, Pingan Cheng, Da Wei Zheng:
An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism. CoRR abs/2310.15363 (2023) - 2022
- [j2]Paul Liu
Coordinated Motion Planning Through Randomized k-Opt. ACM J. Exp. Algorithmics 27: 3.4:1-3.4:9 (2022) - [c5]Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge). SoCG 2022: 72:1-72:6 - [c4]Timothy M. Chan, Da Wei Zheng
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees. SODA 2022: 190-210 - [i4]Sariel Har-Peled
Halving by a Thousand Cuts or Punctures. CoRR abs/2208.11275 (2022) - [i3]Timothy M. Chan, Da Wei Zheng:
Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures. CoRR abs/2210.10172 (2022) - 2021
- [c3]Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng
Coordinated Motion Planning Through Randomized k-Opt (CG Challenge). SoCG 2021: 64:1-64:8 - [i2]Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Coordinated Motion Planning Through Randomized k-Opt. CoRR abs/2103.15062 (2021) - [i1]Timothy M. Chan, Da Wei Zheng:
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees. CoRR abs/2111.03744 (2021) - 2020
- [c2]Da Wei Zheng
Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge). SoCG 2020: 83:1-83:7
2000 – 2009
- 2008
- [j1]Zhiwei Li
Least Squares-Based Filter for Remote SensingImage Noise Reduction. IEEE Trans. Geosci. Remote. Sens. 46(7): 2044-2049 (2008) - 2005
- [c1]Zhiwei Li, Xiaoli Ding
Modeling of atmospheric effects on InSAR by incorporating terrain elevation information. IGARSS 2005: 4240-4243
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-11-25 22:46 CET 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: