Tobias Friedrich

According to our database1, Tobias Friedrich authored at least 180 papers between 2005 and 2021.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Efficiency and Stability in Euclidean Network Design.
CoRR, 2021

The Complexity of Dependency Detection and Discovery in Relational Databases.
CoRR, 2021

The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs.
CoRR, 2021

Adaptive Sampling for Fast Constrained Maximization of Submodular Function.
CoRR, 2021

The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Adaptive Sampling for Fast Constrained Maximization of Submodular Functions.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints.
Theor. Comput. Sci., 2020

Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery.
Proc. VLDB Endow., 2020

Hyperbolic Embeddings for Near-Optimal Greedy Routing.
ACM J. Exp. Algorithmics, 2020

Selfish Creation of Social Networks.
CoRR, 2020

On Counting (Quantum-)Graph Homomorphisms in Finite Fields.
CoRR, 2020

Balanced Crown Decomposition for Connectivity Constraints.
CoRR, 2020

Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry.
CoRR, 2020

Efficiently Computing Maximum Flows in Scale-Free Networks.
CoRR, 2020

Polymer dynamics via cliques with applications to hard-sphere mixtures.
CoRR, 2020

timeXplain - A Framework for Explaining the Predictions of Time Series Classifiers.
CoRR, 2020

Shortest Distances as Enumeration Problem.
CoRR, 2020

Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints.
Algorithmica, 2020

Greed is Good for Deterministic Scale-Free Networks.
Algorithmica, 2020

Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Flow-Based Network Creation Games.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation.
Proceedings of the Neural Information Processing - 27th International Conference, 2020

Fair Tree Connection Games with Topology-Dependent Edge Cost.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

The Minimization of Random Hypergraphs.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

A Strategic Routing Framework and Algorithms for Computing Alternative Paths.
Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020

2019
Unbiasedness of estimation-of-distribution algorithms.
Theor. Comput. Sci., 2019

Theory of Randomized Optimization Heuristics (Dagstuhl Reports 19431).
Dagstuhl Reports, 2019

From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization.
CoRR, 2019

Zeros and approximations of Holant polynomials on the complex plane.
CoRR, 2019

A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints.
CoRR, 2019

Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints.
Algorithmica, 2019

Island Models Meet Rumor Spreading.
Algorithmica, 2019

Quasi-random Image Transition and Animation.
Aust. J. Intell. Inf. Process. Syst., 2019

Routing for on-street parking search using probabilistic data.
AI Commun., 2019

Convergence and Hardness of Strategic Schelling Segregation.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Understanding the Effectiveness of Data Reduction in Public Transportation Networks.
Proceedings of the Algorithms and Models for the Web Graph - 16th International Workshop, 2019

On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial).
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Geometric Network Creation Games.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

The Satisfiability Threshold for Non-Uniform Random 2-SAT.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Pareto Optimization for Subset Selection with Dynamic Cost Constraints.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane.
IEEE/ACM Trans. Netw., 2018

Escaping Local Optima Using Crossover With Emergent Diversity.
IEEE Trans. Evol. Comput., 2018

Unbounded Discrepancy of Deterministic Random Walks on Grids.
SIAM J. Discret. Math., 2018

On the Diameter of Hyperbolic Random Graphs.
SIAM J. Discret. Math., 2018

Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations
CoRR, 2018

On the Enumeration of Minimal Hitting Sets in Lexicographical Order.
CoRR, 2018

De-anonymization of Heterogeneous Random Graphs in Quasilinear Time.
Algorithmica, 2018

Cliques in Hyperbolic Random Graphs.
Algorithmica, 2018

Towards a Systematic Evaluation of Generative Network Models.
Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018

Memory-Restricted Routing with Tiled Map Data.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2018

Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization.
Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Randomized greedy algorithms for covering problems.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Escaping large deceptive basins of attraction with heavy-tailed mutation operators.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017
The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise.
IEEE Trans. Evol. Comput., 2017

Quasi-random Agents for Image Transition and Animation.
CoRR, 2017

Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines.
Algorithmica, 2017

Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Efficient Best Response Computation for Strategic Network Formation Under Attack.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Approximating optimization problems using EAs on scale-free networks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Analyzing search heuristics with differential equations.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms.
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

Resampling vs Recombination: a Statistical Run Time Estimation.
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints.
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017

Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Improving local search in a minimum vertex cover solver for classes of networks.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization.
Proceedings of the AI 2017: Advances in Artificial Intelligence, 2017

What's Hot in Evolutionary Computation.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Phase Transitions for Scale-Free SAT Formulas.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Robustness of Ant Colony Optimization to Noise.
Evol. Comput., 2016

A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover.
CoRR, 2016

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity.
CoRR, 2016

Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

On the Robustness of Evolving Populations.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Graceful Scaling on Uniform Versus Steep-Tailed Noise.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

The Parameterized Complexity of Dependency Detection in Relational Databases.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Ant Colony Optimization Beats Resampling on Noisy Functions.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

Fast Building Block Assembly by Majority Vote Crossover.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

EDAs cannot be Balanced and Stable.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Escaping Local Optima with Diversity Mechanisms and Crossover.
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Hyperbolic Random Graphs: Separators and Treewidth.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Probabilistic Routing for On-Street Parking Search.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Genetic and Evolutionary Computation.
Theor. Comput. Sci., 2015

On the average-case complexity of parameterized clique.
Theor. Comput. Sci., 2015

On the kernel size of clique cover reductions for random intersection graphs.
J. Discrete Algorithms, 2015

Randomized diffusion for indivisible loads.
J. Comput. Syst. Sci., 2015

Efficient optimization of many objectives by approximation-guided evolution.
Eur. J. Oper. Res., 2015

Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point.
Evol. Comput., 2015

Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.
Evol. Comput., 2015

Parameterized clique on inhomogeneous random graphs.
Discret. Appl. Math., 2015

The Benefit of Sex in Noisy Evolutionary Search.
CoRR, 2015

Seeding the initial population of multi-objective evolutionary algorithms: A computational study.
Appl. Soft Comput., 2015

The Benefit of Recombination in Noisy Evolutionary Search.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Cliques in hyperbolic random graphs.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Ultra-Fast Load Balancing on Scale-Free Networks.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator.
Proceedings of the IEEE Congress on Evolutionary Computation, 2015

2014
Convergence of Hypervolume-Based Archiving Algorithms.
IEEE Trans. Evol. Comput., 2014

Genetic and Evolutionary Computation.
Theor. Comput. Sci., 2014

Quasirandom Rumor Spreading.
ACM Trans. Algorithms, 2014

Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator.
Proceedings of the Parallel Problem Solving from Nature - PPSN XIII, 2014

Two-dimensional subset selection for hypervolume and epsilon-indicator.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable.
Theor. Comput. Sci., 2013

Fast simulation of large-scale growth models.
Random Struct. Algorithms, 2013

Weighted preferences in evolutionary multi-objective optimization.
Int. J. Mach. Learn. Cybern., 2013

Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions.
Algorithmica, 2013

Speeding up many-objective optimization by Monte Carlo approximations.
Artif. Intell., 2013

Approximation quality of the hypervolume indicator.
Artif. Intell., 2013

Exact and Efficient Generation of Geometric Random Variates and Random Graphs.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Parameterized average-case complexity of the hypervolume indicator.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Efficient parent selection for Approximation-Guided Evolutionary multi-objective optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice.
Theor. Comput. Sci., 2012

Convergence of set-based multi-objective optimization, indicators and deteriorative cycles.
Theor. Comput. Sci., 2012

Quasirandom Load Balancing.
SIAM J. Comput., 2012

Why rumors spread so quickly in social networks.
Commun. ACM, 2012

Asynchronous Rumor Spreading in Preferential Attachment Graphs.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

Experimental Analysis of Rumor Spreading in Social Networks.
Proceedings of the Design and Analysis of Algorithms, 2012

Parameterized Clique on Scale-Free Networks.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Convergence of hypervolume-based archiving algorithms ii: competitiveness.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Efficient algorithms for extracting biological key pathways with global constraints.
Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011
Illustration of fairness in evolutionary multi-objective optimization.
Theor. Comput. Sci., 2011

Smoothed analysis of balancing networks.
Random Struct. Algorithms, 2011

Quasirandom rumor spreading: An experimental analysis.
ACM J. Exp. Algorithmics, 2011

Social Networks Spread Rumors in Sublogarithmic Time.
Electron. Notes Discret. Math., 2011

Average update times for fully-dynamic all-pairs shortest paths.
Discret. Appl. Math., 2011

Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation
CoRR, 2011

Approximation-Guided Evolutionary Multi-Objective Optimization.
Proceedings of the IJCAI 2011, 2011

Foundations of evolutionary multi-objective optimization.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Convergence of hypervolume-based archiving algorithms I: effectiveness.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

The logarithmic hypervolume indicator.
Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

2010
Plateaus can be harder in multi-objective optimization.
Theor. Comput. Sci., 2010

When to use bit-wise neutrality.
Nat. Comput., 2010

Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models.
Evol. Comput., 2010

An Efficient Algorithm for Computing Hypervolume Contributions.
Evol. Comput., 2010

Average-case analysis of incremental topological ordering.
Discret. Appl. Math., 2010

Approximating the volume of unions and intersections of high-dimensional geometric objects.
Comput. Geom., 2010

The Cover Time of Deterministic Random Walks.
Electron. J. Comb., 2010

Efficient Broadcast on Random Geometric Graphs.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Tight Bounds for the Approximation Ratio of the Hypervolume Indicator.
Proceedings of the Parallel Problem Solving from Nature, 2010

Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary study.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

The maximum hypervolume set yields near-optimal approximation.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Set-based multi-objective optimization, indicators, and deteriorative cycles.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009
On the Effects of Adding Objectives to Plateau Functions.
IEEE Trans. Evol. Comput., 2009

Comparison of simple diversity mechanisms on plateau functions.
Theor. Comput. Sci., 2009

Quasirandom Rumor Spreading on Expanders.
Electron. Notes Discret. Math., 2009

Analysis of Diversity-Preserving Mechanisms for Global Exploration.
Evol. Comput., 2009

Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem.
Evol. Comput., 2009

Deterministic Random Walks on the Two-Dimensional Grid.
Comb. Probab. Comput., 2009

Near-perfect load balancing by randomized rounding.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Multiplicative approximations and the hypervolume indicator.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Don't be greedy when calculating hypervolume contributions.
Proceedings of the Foundations of Genetic Algorithms, 2009

Computing single source shortest paths using single-objective fitness.
Proceedings of the Foundations of Genetic Algorithms, 2009

2008
An <i>O</i>(<i>n</i><sup>2.75</sup>) algorithm for incremental topological ordering.
ACM Trans. Algorithms, 2008

Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization.
Proceedings of the Parallel Problem Solving from Nature, 2008

Analyzing Hypervolume Indicator Based Algorithms.
Proceedings of the Parallel Problem Solving from Nature, 2008

Theoretical analysis of diversity mechanisms for global exploration.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008

2007
Unbiased Matrix Rounding.
Electron. Notes Discret. Math., 2007

Deterministic Random Walks on Regular Trees.
Electron. Notes Discret. Math., 2007

Average-Case Analysis of Online Topological Ordering.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Use and Avoidance of Randomness.
Proceedings of the Ausgezeichnete Informatikdissertationen 2007, 2007

Rigorous analyses of simple diversity mechanisms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

Do additional objectives make a problem harder?
Proceedings of the Genetic and Evolutionary Computation Conference, 2007

On improving approximate solutions by evolutionary algorithms.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007

Use and avoidance of randomness.
PhD thesis, 2007

2006
Quasirandomness in Graphs.
Electron. Notes Discret. Math., 2006

An O(n<sup>2.75</sup>) algorithm for online topological ordering.
Electron. Notes Discret. Math., 2006

2005
Rounding of Sequences and Matrices, with Applications.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005


  Loading...