Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Tom C. van der Zanden
A Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs
Related publications
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
Approximation Algorithms for Intersection Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
Tight Bounds for Testing Bipartiteness in General Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Tight Approximation Bounds for Greedy Frugal Coverage Algorithms
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
SIAM Journal on Computing
Mathematics
Computer Science
Tight RMR Lower Bounds for Mutual Exclusion and Other Problems
Lower Bounds for Gaussian Estrada Index of Graphs
Symmetry
Mathematics
Chemistry
Physics
Computer Science
Astronomy
Efficient Algorithms and Lower Bounds for Robust Linear Regression
