Da Wei Zheng

Orcid: 0000-0002-0844-9457

Affiliations:
  • University of Illinois Urbana-Champaign, IL, USA


According to our database1, Da Wei Zheng authored at least 16 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane.
CoRR, 2024

Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring.
ACM J. Exp. Algorithmics, December, 2023

Halving by a Thousand Cuts or Punctures.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Simplex Range Searching Revisited: How to Shave Logs in Multi-Level Data Structures.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Faster Submodular Maximization for Several Classes of Matroids.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Coordinated Motion Planning Through Randomized <i>k</i>-Opt.
ACM J. Exp. Algorithmics, 2022

Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge).
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Coordinated Motion Planning Through Randomized k-Opt.
CoRR, 2021

Coordinated Motion Planning Through Randomized k-Opt (CG Challenge).
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2008
Least Squares-Based Filter for Remote SensingImage Noise Reduction.
IEEE Trans. Geosci. Remote. Sens., 2008

2005
Modeling of atmospheric effects on InSAR by incorporating terrain elevation information.
Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, 2005


  Loading...