The following pages link to Tobias Friedrich (Q319122):
Displayed 50 items.
- Efficient optimization of many objectives by approximation-guided evolution (Q319124) (← links)
- Approximation quality of the hypervolume indicator (Q360122) (← links)
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions (Q378238) (← links)
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice (Q418034) (← links)
- Speeding up many-objective optimization by Monte Carlo approximations (Q490427) (← links)
- On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
- The cover time of deterministic random walks (Q612954) (← links)
- Illustration of fairness in evolutionary multi-objective optimization (Q633692) (← links)
- Average update times for fully-dynamic all-pairs shortest paths (Q643013) (← links)
- Efficient best response computation for strategic network formation under attack (Q681871) (← links)
- Convergence of set-based multi-objective optimization, indicators and deteriorative cycles (Q714857) (← links)
- Cliques in hyperbolic random graphs (Q724237) (← links)
- Toward a unifying framework for evolutionary processes (Q739408) (← links)
- Randomized diffusion for indivisible loads (Q743119) (← links)
- Convergence and hardness of strategic Schelling segregation (Q776259) (← links)
- Plateaus can be harder in multi-objective optimization (Q847662) (← links)
- Average-case analysis of incremental topological ordering (Q968137) (← links)
- When to use bit-wise neutrality (Q968377) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- Comparison of simple diversity mechanisms on plateau functions (Q1029353) (← links)
- Sharpness of the satisfiability threshold for non-uniform random \(k\)-SAT (Q1656585) (← links)
- Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints (Q1725656) (← links)
- Island models meet rumor spreading (Q1725662) (← links)
- De-anonymization of heterogeneous random graphs in quasilinear time (Q1755750) (← links)
- Constraint satisfaction problems: convexity makes AllDifferent constraints tractable (Q1939255) (← links)
- Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints'' (Q2006950) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- Pareto optimization for subset selection with dynamic cost constraints (Q2060721) (← links)
- The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
- The impact of geometry on monochrome regions in the flip Schelling process (Q2088882) (← links)
- Accelerated information dissemination on networks with local and global edges (Q2097337) (← links)
- Polymer dynamics via cliques: new conditions for approximations (Q2110377) (← links)
- Solving non-uniform planted and filtered random SAT formulas greedily (Q2118298) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints (Q2182714) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- Unbiasedness of estimation-of-distribution algorithms (Q2315013) (← links)
- Parameterized clique on inhomogeneous random graphs (Q2341758) (← links)
- On the average-case complexity of parameterized clique (Q2344729) (← links)
- Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066) (← links)
- Quasirandom Rumor Spreading on Expanders (Q2851470) (← links)
- (Q2857363) (← links)
- Asynchronous Rumor Spreading in Preferential Attachment Graphs (Q2904566) (← links)
- De-anonymization of Heterogeneous Random Graphs in Quasilinear Time (Q2921405) (← links)
- Deterministic random walks on regular trees (Q3055897) (← links)
- Fast Simulation of Large-Scale Growth Models (Q3088126) (← links)
- Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions (Q3104613) (← links)
- Quasirandom Load Balancing (Q3143292) (← links)
- Tight Bounds for the Approximation Ratio of the Hypervolume Indicator (Q3163417) (← links)