The following pages link to Tobias Friedrich (Q319122):
Displayed 50 items.
- An algorithm for online topological ordering (Q3439455) (← links)
- Quasirandomness in Graphs (Q3439469) (← links)
- Unbiased Matrix Rounding (Q3439563) (← links)
- Ultra-Fast Load Balancing on Scale-Free Networks (Q3449501) (← links)
- On the Diameter of Hyperbolic Random Graphs (Q3449510) (← links)
- The Benefit of Recombination in Noisy Evolutionary Search (Q3459857) (← links)
- Unbounded Discrepancy of Deterministic Random Walks on Grids (Q3459862) (← links)
- Deterministic Random Walks on Regular Trees (Q3503512) (← links)
- Deterministic Random Walks on the Two-Dimensional Grid (Q3557507) (← links)
- (Q3579453) (← links)
- (Q3579495) (← links)
- Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects (Q3596739) (← links)
- Average Update Times for Fully-Dynamic All-Pairs Shortest Paths (Q3596762) (← links)
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness (Q3638048) (← links)
- On the Diameter of Hyperbolic Random Graphs (Q4568067) (← links)
- (Q4606276) (← links)
- Hyperbolic Random Graphs: Separators and Treewidth (Q4606284) (← links)
- Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane (Q4606285) (← links)
- (Q4634389) (← links)
- Greed is Good for Deterministic Scale-Free Networks. (Q4636581) (← links)
- Unbounded Discrepancy of Deterministic Random Walks on Grids (Q4691168) (← links)
- Parameterized Clique on Scale-Free Networks (Q4909582) (← links)
- Quasirandom Rumor Spreading (Q4962167) (← links)
- An <i>O</i> ( <i>n</i> <sup>2.75</sup> ) algorithm for incremental topological ordering (Q4962744) (← links)
- Non-monotone submodular maximization with multiple knapsacks in static and dynamic settings (Q4999249) (← links)
- (Q5002689) (← links)
- A Spectral Independence View on Hard Spheres via Block Dynamics (Q5043635) (← links)
- Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. (Q5075758) (← links)
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) (Q5090451) (← links)
- (Q5091218) (← links)
- (Q5111724) (← links)
- Near-perfect load balancing by randomized rounding (Q5172705) (← links)
- Smoothed analysis of balancing networks (Q5198673) (← links)
- Hyperbolic Embeddings for Near-Optimal Greedy Routing (Q5232738) (← links)
- Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling (Q5232759) (← links)
- Quasirandom Rumor Spreading: An Experimental Analysis (Q5233573) (← links)
- Computing single source shortest paths using single-objective fitness (Q5276063) (← links)
- Don't be greedy when calculating hypervolume contributions (Q5276068) (← links)
- The logarithmic hypervolume indicator (Q5276087) (← links)
- Exact and Efficient Generation of Geometric Random Variates and Random Graphs (Q5326567) (← links)
- (Q5365053) (← links)
- Average-Case Analysis of Online Topological Ordering (Q5387779) (← links)
- Quasirandom rumor spreading (Q5406249) (← links)
- (Q5417718) (← links)
- (Q5417736) (← links)
- Social networks spread rumors in sublogarithmic time (Q5419071) (← links)
- Deterministic Random Walks on the Two-Dimensional Grid (Q5459142) (← links)
- Resampling vs Recombination (Q5738853) (← links)
- On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms (Q5738854) (← links)
- Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints (Q5738856) (← links)