Tobias Friedrich

Karl Bringmann, Tobias Friedrich: Approximation quality of the hypervolume indicator. Artif. Intell. 195: 265-290 (2013)

Tobias Friedrich, Lionel Levine: Fast simulation of large-scale growth models. Random Struct. Algorithms 42(2): 185-213 (2013)

Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond: Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theor. Comput. Sci. 472: 81-89 (2013)

Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich: Why rumors spread so quickly in social networks. Commun. ACM 55(6): 70-75 (2012)

Tobias Friedrich, Martin Gairing, Thomas Sauerwald: Quasirandom Load Balancing. SIAM J. Comput. 41(4): 747-771 (2012)

Karl Bringmann, Tobias Friedrich: Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Theor. Comput. Sci. 425: 104-116 (2012)

Rudolf Berghammer, Tobias Friedrich, Frank Neumann: Convergence of set-based multi-objective optimization, indicators and deteriorative cycles. Theor. Comput. Sci. 456: 2-17 (2012)

Jan Baumbach, Tobias Friedrich, Timo Kötzing, Anton Krohmer, Joachim Müller, Josch Pauling: Efficient algorithms for extracting biological key pathways with global constraints. GECCO 2012: 169-176

Karl Bringmann, Tobias Friedrich: Convergence of hypervolume-based archiving algorithms ii: competitiveness. GECCO 2012: 457-464

Tobias Friedrich, Anton Krohmer: Parameterized Clique on Scale-Free Networks. ISAAC 2012: 659-668

Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich: Experimental Analysis of Rumor Spreading in Social Networks. MedAlg 2012: 159-173

Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich: Asynchronous Rumor Spreading in Preferential Attachment Graphs. SWAT 2012: 307-315

Tobias Friedrich, Nils Hebbinghaus: Average update times for fully-dynamic all-pairs shortest paths. Discrete Applied Mathematics 159(16): 1751-1758 (2011)

Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich: Social Networks Spread Rumors in Sublogarithmic Time. Electronic Notes in Discrete Mathematics 38: 303-308 (2011)

Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald: Quasirandom rumor spreading: An experimental analysis. ACM Journal of Experimental Algorithmics 16 (2011)

Gerald Schuller, Matthias Gruhne, Tobias Friedrich: Fast Audio Feature Extraction From Compressed Audio Data. J. Sel. Topics Signal Processing 5(6): 1262-1271 (2011)

Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik: Smoothed analysis of balancing networks. Random Struct. Algorithms 39(1): 115-138 (2011)

Tobias Friedrich, Christian Horoba, Frank Neumann: Illustration of fairness in evolutionary multi-objective optimization. Theor. Comput. Sci. 412(17): 1546-1556 (2011)

Stefan Friedemann, Christina Dehler, Tobias Friedrich, Alina Haack, Matthias Schumann: Diffusion of IS in companies using renewable resources and its impact on uncertainty. AMCIS 2011

Tobias Friedrich, Lionel Levine: Fast Simulation of Large-Scale Growth Models. APPROX-RANDOM 2011: 555-566

Tobias Friedrich, Trent Kroeger, Frank Neumann: Weighted Preferences in Evolutionary Multi-objective Optimization. Australasian Conference on Artificial Intelligence 2011: 291-300

Tobias Friedrich, Karl Bringmann, Thomas Voß, Christian Igel: The logarithmic hypervolume indicator. FOGA 2011: 81-92

Karl Bringmann, Tobias Friedrich: Convergence of hypervolume-based archiving algorithms I: effectiveness. GECCO 2011: 745-752

Tobias Friedrich, Frank Neumann: Foundations of evolutionary multi-objective optimization. GECCO (Companion) 2011: 1213-1232

Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond: Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI 2011: 522-527

Karl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner: Approximation-Guided Evolutionary Multi-Objective Optimization. IJCAI 2011: 1198-1203

Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer: Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. ISAAC 2011: 190-199

Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald: Randomized Diffusion for Indivisible Loads. SODA 2011: 429-439

Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich: Social networks spread rumors in sublogarithmic time. STOC 2011: 21-30

Katya Vladislavleva, Tobias Friedrich, Frank Neumann, Markus Wagner: Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation. CoRR abs/1109.1922 (2011)

Tobias Friedrich, Thomas Sauerwald: The Cover Time of Deterministic Random Walks. Electr. J. Comb. 17(1) (2010)

Karl Bringmann, Tobias Friedrich: Approximating the volume of unions and intersections of high-dimensional geometric objects. Comput. Geom. 43(6-7): 601-610 (2010)

Deepak Ajwani, Tobias Friedrich: Average-case analysis of incremental topological ordering. Discrete Applied Mathematics 158(4): 240-250 (2010)

Karl Bringmann, Tobias Friedrich: An Efficient Algorithm for Computing Hypervolume Contributions. Evolutionary Computation 18(3): 383-402 (2010)

Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Evolutionary Computation 18(4): 617-633 (2010)

Tobias Friedrich, Frank Neumann: When to use bit-wise neutrality. Natural Computing 9(1): 283-294 (2010)

Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic random walks on regular trees. Random Struct. Algorithms 37(3): 353-366 (2010)

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Plateaus can be harder in multi-objective optimization. Theor. Comput. Sci. 411(6): 854-864 (2010)

Tobias Friedrich, Thomas Sauerwald: The Cover Time of Deterministic Random Walks. COCOON 2010: 130-139

Rudolf Berghammer, Tobias Friedrich, Frank Neumann: Set-based multi-objective optimization, indicators, and deteriorative cycles. GECCO 2010: 495-502

Karl Bringmann, Tobias Friedrich: The maximum hypervolume set yields near-optimal approximation. GECCO 2010: 511-518

Thomas Voß, Tobias Friedrich, Karl Bringmann, Christian Igel: Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary study. GECCO (Companion) 2010: 1975-1978

Tobias Friedrich, Frank Neumann: Foundations of evolutionary multi-objective optimization. GECCO (Companion) 2010: 2557-2576

Karl Bringmann, Tobias Friedrich: Tight Bounds for the Approximation Ratio of the Hypervolume Indicator. PPSN (1) 2010: 607-616

Milan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer: Efficient Broadcast on Random Geometric Graphs. SODA 2010: 1412-1421

Tobias Friedrich, Martin Gairing, Thomas Sauerwald: Quasirandom Load Balancing. SODA 2010: 1620-1629

Tobias Friedrich, Lionel Levine: Fast simulation of large-scale growth models. CoRR abs/1006.1003 (2010)

Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic Random Walks on Regular Trees. CoRR abs/1006.1441 (2010)

Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik: Smoothed Analysis of Balancing Networks. CoRR abs/1006.1443 (2010)

Tobias Friedrich, Martin Gairing, Thomas Sauerwald: Quasirandom Load Balancing. CoRR abs/1006.3302 (2010)

Tobias Friedrich, Thomas Sauerwald: The Cover Time of Deterministic Random Walks. CoRR abs/1006.3430 (2010)

Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald: Quasirandom Rumor Spreading. CoRR abs/1012.5351 (2010)

Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald: Quasirandom Rumor Spreading: An Experimental Analysis. CoRR abs/1012.5357 (2010)

Benjamin Doerr, Tobias Friedrich: Deterministic Random Walks on the Two-Dimensional Grid. Combinatorics, Probability & Computing 18(1-2): 123-144 (2009)

Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evolutionary Computation 17(1): 3-19 (2009)

Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudholt, Carsten Witt: Analysis of Diversity-Preserving Mechanisms for Global Exploration. Evolutionary Computation 17(4): 455-476 (2009)

Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald: Quasirandom Rumor Spreading on Expanders. Electronic Notes in Discrete Mathematics 34: 243-247 (2009)

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Comparison of simple diversity mechanisms on plateau functions. Theor. Comput. Sci. 410(26): 2455-2462 (2009)

Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler: On the Effects of Adding Objectives to Plateau Functions. IEEE Trans. Evolutionary Computation 13(3): 591-603 (2009)

Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald: Quasirandom Rumor Spreading: An Experimental Analysis. ALENEX 2009: 145-153

Karl Bringmann, Tobias Friedrich: Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice. EMO 2009: 6-20

Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann: Computing single source shortest paths using single-objective fitness. FOGA 2009: 59-66

Karl Bringmann, Tobias Friedrich: Don't be greedy when calculating hypervolume contributions. FOGA 2009: 103-112

Tobias Friedrich, Christian Horoba, Frank Neumann: Multiplicative approximations and the hypervolume indicator. GECCO 2009: 571-578

Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald: Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. ICALP (1) 2009: 366-377

Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik: Smoothed Analysis of Balancing Networks. ICALP (2) 2009: 472-483

Tobias Friedrich, Thomas Sauerwald: Near-perfect load balancing by randomized rounding. STOC 2009: 121-130

Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n^2.75) algorithm for incremental topological ordering. ACM Transactions on Algorithms 4(4) (2008)

Tobias Friedrich, Frank Neumann: When to use bit-wise neutrality. IEEE Congress on Evolutionary Computation 2008: 997-1003

Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudholt, Carsten Witt: Theoretical analysis of diversity mechanisms for global exploration. GECCO 2008: 945-952

Tobias Friedrich, Matthias Gruhne, Gerald Schuller: Subband conversion for feature extraction from compressed audio. ICASSP 2008: 217-220

Karl Bringmann, Tobias Friedrich: Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. ISAAC 2008: 436-447

Tobias Friedrich, Nils Hebbinghaus: Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. ISAAC 2008: 692-703

Dimo Brockhoff, Tobias Friedrich, Frank Neumann: Analyzing Hypervolume Indicator Based Algorithms. PPSN 2008: 651-660

Tobias Friedrich, Christian Horoba, Frank Neumann: Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. PPSN 2008: 671-680

Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic random walks on regular trees. SODA 2008: 766-772

Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald: Quasirandom rumor spreading. SODA 2008: 773-781

Deepak Ajwani, Tobias Friedrich: Average-Case Analysis of Online Topological Ordering. CoRR abs/0802.1059 (2008)

Karl Bringmann, Tobias Friedrich: Approximating the volume of unions and intersections of high-dimensional geometric objects. CoRR abs/0809.0835 (2008)

Karl Bringmann, Tobias Friedrich: Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. CoRR abs/0812.2636 (2008)

Tobias Friedrich: Use and avoidance of randomness. Universität Saarbrücken 2007, pp. I-VIII, 1-120

Tobias Friedrich, Benjamin Doerr, Christian Klein, Ralf Osbild: Unbiased Matrix Rounding. Electronic Notes in Discrete Mathematics 28: 41-46 (2007)

Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer: Deterministic Random Walks on Regular Trees. Electronic Notes in Discrete Mathematics 29: 509-513 (2007)

Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: On improving approximate solutions by evolutionary algorithms. IEEE Congress on Evolutionary Computation 2007: 2614-2621

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Plateaus can be harder in multi-objective optimization. IEEE Congress on Evolutionary Computation 2007: 2622-2629

Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler: Do additional objectives make a problem harder? GECCO 2007: 765-772

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt: Approximating covering problems by randomized search heuristics using multi-objective models. GECCO 2007: 797-804

Tobias Friedrich, Nils Hebbinghaus, Frank Neumann: Rigorous analyses of simple diversity mechanisms. GECCO 2007: 1219-1225

Deepak Ajwani, Tobias Friedrich: Average-Case Analysis of Online Topological Ordering. ISAAC 2007: 464-475

Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt: Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Electronic Colloquium on Computational Complexity (ECCC) 14(027) (2007)

Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n^2.75) algorithm for online topological ordering. Electronic Notes in Discrete Mathematics 25: 7-12 (2006)

Benjamin Doerr, Tobias Friedrich: Quasirandomness in Graphs. Electronic Notes in Discrete Mathematics 25: 61-64 (2006)

Benjamin Doerr, Tobias Friedrich: Deterministic Random Walks on the Two-Dimensional Grid. ISAAC 2006: 474-483

Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n^2.75) Algorithm for Online Topological Ordering. SWAT 2006: 53-64

Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild: Unbiased Matrix Rounding. SWAT 2006: 102-112

Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n^2.75) algorithm for online topological ordering. CoRR abs/cs/0602073 (2006)

Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild: Unbiased Matrix Rounding. CoRR abs/cs/0604068 (2006)

Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild: Rounding of Sequences and Matrices, with Applications. WAOA 2005: 96-109