Hasso-Plattner-Institut
  
Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Publications of Tobias Friedrich

The following listing contains all publications of Prof. Dr. Tobias Friedrich. Further publications of the research group can be found on the current list of publications and the complete list of publications. External individual listings are available on DBLP and Google Scholar.

[2017] [2016] [2015] [2014] [2013] [2012] [2011] [2010] [2009] [2008] [2007] [2006] [2005]

2017 [ to top ]

  • camera-ready-AAAI.pdf
    Friedrich, Tobias; Krohmer, Anton; Rothenberger, Ralf; Sutton, Andrew M. Phase Transitions for Scale-Free SAT Formulas. Conference on Artificial Intelligence (AAAI) 2017
     
  • 14809-64744-1-SM.pdf
    Friedrich, Tobias; Neumann, Frank What’s Hot in Evolutionary Computation. Conference on Artificial Intelligence (AAAI) 2017
     
  • Paper.pdf
    Friedrich, Tobias; Kötzing, Timo; Quinzan, Francesco; Sutton, Andrew Michael Resampling vs Recombination: a Statistical Run Time Estimation. Foundations of Genetic Algorithms (FOGA) 2017
     
  • restarts-aaai2017cameraReady.pdf
    Friedrich, Tobias; Kötzing, Timo; Wagner, Markus A Simple Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover. Conference on Artificial Intelligence (AAAI) 2017
     
  • paper13FOGA17.pdf
    Pourhassan, Mojgan; Friedrich, Tobias; Neumann, Frank On the Use of the Dual Formulation for Minimum Vertex Cover in Evolutionary Algorithms. Foundations of Genetic Algorithms (FOGA) 2017
     
  • submission.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. The Compact Genetic Algorithm is Efficient under Extreme Gaussian Noise. IEEE Transactions on Evolutionary Computation 2017
     
  • Friedrich_et_al_Subclasses_of_Linear_Functions.pdf
    Friedrich, Tobias; Kötzing, Timo; Lagodzinski, J. A. Gregor; Neumann, Frank; Schirneck, Martin Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. Foundations of Genetic Algorithms (FOGA) 2017
     

2016 [ to top ]

  • 2016GECCOcannot.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S. EDAs cannot be Balanced and Stable. Genetic and Evolutionary Computation Conference (GECCO) 2016: 1139-1146
     
  • 2016ESAparking.pdf
    Arndt, Tobias; Hafner, Danijar; Kellermeier, Thomas; Krogmann, Simon; Razmjou, Armin; Krejca, Martin S.; Rothernberger, Ralf; Friedrich, Tobias Probabilistic Routing for On-Street Parking Search. European Symposium on Algorithms (ESA) 2016: 6:1-6:13
     
  • HyperbolicRandomGraphsSeparatorsAndTreewidth.pdf
    Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton Hyperbolic Random Graphs: Separators and Treewidth. European Symposium on Algorithms (ESA) 2016: 15:1-15:16
     
  • LIPIcs-MFCS-2016-4.pdf
    Friedrich, Tobias Scale-Free Networks, Hyperbolic Geometry and Efficient Algorithms. Mathematical Foundations of Computer Science (MFCS) 2016: 4:1 - 4:3
     
  • TheBenefitOfRecombinationInNoisyEvolutionarySearchGecco.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. The Benefit of Recombination in Noisy Evolutionary Search. Genetic and Evolutionary Computation Conference (GECCO) 2016: 161-162
     
  • AntColonyOptimizationBeatsResamplingOnNoisyFunctions.pdf
    Friedrich, Tobias; Kötzing, Timo; Quinzan, Francesco; Sutton, Andrew M. Ant Colony Optimization Beats Resampling on Noisy Functions. Genetic and Evolutionary Computation Conference (GECCO) 2016: 3-4
     
  • GreedIsGoodForDeterministicScale-FreeNetworks.pdf
    Chauhan, Ankit; Friedrich, Tobias; Rothenberger, Ralf Greed is Good for Deterministic Scale-Free Networks. Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2016
     
  • EscapingLocalOptimaWithDiversityMechanismsAndCrossover.pdf
    Dang, Duc-Cuong; Friedrich, Tobias; Krejca, Martin S.; Kötzing, Timo; Lehre, Per Kristian; Oliveto, Pietro S.; Sudholt, Dirk; Sutton, Andrew Michael Escaping Local Optima with Diversity Mechanisms and Crossover. Genetic and Evolutionary Computation Conference (GECCO) 2016: 645-652
     
  • Bläsius_et_al_Parameterized_Complexity_of_Dependency_Detection.pdf
    Bläsius, Thomas; Friedrich, Tobias; Schirneck, Martin The Parameterized Complexity of Dependency Detection in Relational Databases. International Symposium on Parameterized and Exact Computation (IPEC) 2016
     
  • EmergenceOfDiversityAndItsBenefitsForCrossoverInGeneticAlgorithms.pdf
    Dang, Duc-Cuong; Lehre, Per Kristian; Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Oliveto, Pietro S.; Sudholt, Dirk; Sutton, Andrew M. Emergence of Diversity and its Benefits for Crossover in Genetic Algorithms. Parallel Problem Solving From Nature (PPSN) 2016: 890-900
     
  • OnTheRobustnessOfEvolvingPopulations.pdf
    Friedrich, Tobias; Kötzing, Timo; Sutton, Andrew M. On the Robustness of Evolving Populations. Parallel Problem Solving From Nature (PPSN) 2016: 771-781
     
  • 2016PPSNfixedparameter.pdf
    Gao, Wanru; Friedrich, Tobias; Neumann, Frank Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover. Parallel Problem Solving From Nature (PPSN) 2016: 740-750
     
  • FastBuildingBlockAssemblyByMajorityVoteCrossover.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Nallaperuma, Samadhi; Neumann, Frank; Schirneck, Martin Fast Building Block Assembly by Majority Vote Crossover. Genetic and Evolutionary Computation Conference (GECCO) 2016: 661-668
     
  • RobustnessOfAntColonyOptimizationToNoiseJournal.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Robustness of Ant Colony Optimization to Noise. Evolutionary Computation 2016: 237-254
     
  • EfficientEmbeddingOfScaleFreeGraphsInTheHyperbolicPlane.pdf
    Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton; Laue, Sören Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. European Symposium on Algorithms (ESA) 2016: 16:1-16:18
     
  • Graceful.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Graceful Scaling on Uniform versus Steep-Tailed Noise. Parallel Problem Solving From Nature (PPSN) 2016: 761-770
     

2015 [ to top ]

  • OnTheKernelSizeOfCliqueCoverReductionsForRandomInteresectionGraphs.pdf
    Friedrich, Tobias; Hercher, Christian On the kernel size of clique cover reductions for random intersection graphs. Journal of Discrete Algorithms 2015: 128-136
     
  • EfficientOptimizationOfManyObjectivesByApproximation-GuidedEvolution.pdf
    Wagner, Markus; Bringmann, Karl; Friedrich, Tobias; Neumann, Frank Efficient optimization of many objectives by approximation-guided evolution. European Journal of Operational Research 2015: 465-479
     
  • TowardAUnifyingFrameworkForEvolutionaryProcesses.pdf
    Paixão, Tiago; Badkobeh, Golnaz; Barton, Nick H.; Çörüş, Doğan; Dang, Duc-Cuong; Friedrich, Tobias; Lehre, Per Kristian; Sudholt, Dirk; Sutton, Andrew; Trubenová, Barbora Toward a unifying framework for evolutionary processes. Journal of Theoretical Biology 2015: 28-43
     
  • MaximizingSubmodularFunctionsUnderMatroidConstraintsByEvolutionaryAlgorithms.pdf
    Friedrich, Tobias; Neumann, Frank Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms. Evolutionary Computation 2015: 543-558
     
  • TheBenefitOfRecombinationInNoisyEvolutionarySearch.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. The Benefit of Recombination in Noisy Evolutionary Search. International Symposium of Algorithms and Computation (ISAAC) 2015: 140-150
     
  • CliquesInHyperbolicRandomGraphs.pdf
    Friedrich, Tobias; Krohmer, Anton Cliques in hyperbolic random graphs. International Conference on Computer Communications (INFOCOM) 2015: 1544-1552
     
  • Ultra-FastLoadBalancingOnScale-FreeNetworks.pdf
    Bringmann, Karl; Friedrich, Tobias; Hoefer, Martin; Rothenberger, Ralf; Sauerwald, Thomas Ultra-Fast Load Balancing on Scale-Free Networks. International Colloquium on Automata, Languages and Programming (ICALP) 2015: 516-527
     
  • UnboundedDiscrepancyOfDeterministicRandomWalksOnGrids.pdf
    Friedrich, Tobias; Katzmann, Maximilian; Krohmer, Anton Unbounded Discrepancy of Deterministic Random Walks on Grids. International Symposium on Algorithms and Computation (ISAAC) 2015: 212-222
     
  • SeedingTheInitialPopulationOfMulti-ObjectiveEvolutionaryAlgorithmsAComputationalStudy.pdf
    Friedrich, Tobias; Wagner, Markus Seeding the initial population of multi-objective evolutionary algorithms: {A} computational study. Applied Soft Computing 2015: 223-230
     
  • EfficientComputationOfTwo-DimensionalSolutionSetsMaximizingTheEpsilon-Indicator.pdf
    Bringmann, Karl; Friedrich, Tobias; Klitzke, Patrick Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator. Congress on Evolutionary Computation (CEC) 2015: 970-977
     
  • OnTheAverage-CaseComplexityOfParameterizedClique.pdf
    Fountoulakis, Nikolaos; Friedrich, Tobias; Hermelin, Danny On the average-case complexity of parameterized clique. Theoretical Computer Science 2015: 18-29
     
  • ParameterizedCliqueOnInhomogeneousRandomGraphs.pdf
    Friedrich, Tobias; Krohmer, Anton Parameterized clique on inhomogeneous random graphs. Discrete Applied Mathematics 2015: 130-138
     
  • OnTheDiameterOfHyperbolicRandomGraphs.pdf
    Friedrich, Tobias; Krohmer, Anton On the Diameter of Hyperbolic Random Graphs. International Colloquium on Automata, Languages and Programming (ICALP) 2015: 614-625
     
  • MaximizingSubmodularFunctionsUnderMatroidConstraintsByMulti-ObjectiveEvolutionaryAlgorithms.pdf
    Friedrich, Tobias; Neumann, Frank Maximizing Submodular Functions under Matroid Constraints by Multi-Objective Evolutionary Algorithms. Evolutionary Computation 2015: 543-558
     
  • MultiplicativeApproximationsOptimalHypervolumeDistributionsAndTheChoiceOfTheReferencePoint.pdf
    Friedrich, Tobias; Neumann, Frank; Thyssen, Christian Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. Evolutionary Computation (ECJ) 2015: 131-159
     

2014 [ to top ]

  • QuasirandomRumorSpreading.pdf
    Doerr, Benjamin; Friedrich, Tobias; Sauerwald, Thomas Quasirandom Rumor Spreading. Transactions on Algorithms 2014: 9:1-9:35
     
  • ConvergenceOfHypervolume-BasedArchivingAlgorithms.pdf
    Bringmann, Karl; Friedrich, Tobias Convergence of Hypervolume-Based Archiving Algorithms. Transactions on Evolutionary Computation 2014: 643-657
     
  • GenericPostprocessingViaSubsetSelectionForHypervolumeAndEpsilon-Indicator.pdf
    Bringmann, Karl; Friedrich, Tobias; Klitzke, Patrick Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator. Parallel Problem Solving from Nature (PPSN) 2014: 518-527
     
  • De-AnonymizationOfHeterogeneousRandomGraphsInQuasilinearTime.pdf
    Bringmann, Karl; Friedrich, Tobias; Krohmer, Anton De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. European Symposium on Algorithms (ESA) 2014: 197-208
     
  • MaximizingSubmodularFunctionsUnderMatroidConstraintsByMulti-ObjectiveEvolutionaryAlgorithms.pdf
    Friedrich, Tobias; Neumann, Frank Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms. Parallel Problem Solving from Nature (PPSN) 2014: 922-931
     
  • Two-DimensionalSubsetSelectionForHypervolumeAndEpsilon-Indicator.pdf
    Bringmann, Karl; Friedrich, Tobias; Klitzke, Patrick Two-dimensional subset selection for hypervolume and epsilon-indicator. Genetic and Evolutionary Computation Conference (GECCO) 2014: 589-596
     

2013 [ to top ]

  • EfficientParentSelectionForApproximation-GuidedEvolutionaryMulti-ObjectiveOptimization.pdf
    Wagner, Markus; Friedrich, Tobias Efficient parent selection for Approximation-Guided Evolutionary multi-objective optimization. Congress on Evolutionary Computation (CEC) 2013: 1846-1853
     
  • ConstraintSatisfactionProblemsConvexityMakesAllDifferentConstraintsTractable.pdf
    Fellows, Michael R.; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances A. Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theoretical Computer Science 2013: 81-89
     
  • ExactAndEfficientGenerationOfGeometricRandomVariatesAndRandomGraphs.pdf
    Bringmann, Karl; Friedrich, Tobias Exact and Efficient Generation of Geometric Random Variates and Random Graphs. International Colloquium on Automata, Languages, and Programming (ICALP) 2013: 267-278
     
  • ApproximationQualityOfTheHypervolumeIndicator.pdf
    Bringmann, Karl; Friedrich, Tobias Approximation quality of the hypervolume indicator. Artificial Intelligence 2013: 265-290
     
  • WeightedPreferencesInEvolutionaryMulti-ObjectiveOptimization.pdf
    Friedrich, Tobias; Kroeger, Trent; Neumann, Frank Weighted preferences in evolutionary multi-objective optimization. Machine Learning and Cybernetics 2013: 139-148
     
  • PredictingTheEnergyOutputOfWindFarmsBasedOnWeatherDataImportantVariablesAndTheirCorrelation.pdf
    Vladislavleva, Ekaterina; Friedrich, Tobias; Neumann, Frank; Wagner, Markus Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation. Renewable Energy 2013: 236-243
     
  • SpeedingUpMany-ObjectiveOptimizationByMonteCarloApproximations.pdf
    Bringmann, Karl; Friedrich, Tobias; Igel, Christian; Voß, Thomas Speeding up many-objective optimization by Monte Carlo approximations. Artificial Intelligence 2013: 22-29
     
  • MinimizingMaximum(Weighted)Flow-TimeOnRelatedAndUnrelatedMachines.pdf
    Anand, S.; Bringmann, Karl; Friedrich, Tobias; Garg, Naveen; Kumar, Amit Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. International Colloquium on Automata, Languages and Programming (ICALP) 2013: 13-24
     
  • ParameterizedAverage-CaseComplexityOfTheHypervolumeIndicator.pdf
    Bringmann, Karl; Friedrich, Tobias Parameterized average-case complexity of the hypervolume indicator. Genetic and Evolutionary Computation Conference (GECCO) 2013: 575-582
     

2012 [ to top ]

  • ConvergenceOfSet-BasedMulti-ObjectiveOptimization,IndicatorsAndDeteriorativeCycles.pdf
    Berghammer, Rudolf; Friedrich, Tobias; Neumann, Frank Convergence of Set-Based Multi-Objective Optimization, Indicators and Deteriorative Cycles. Theoretical Computer Science 2012: 2-17
     
  • ParameterizedCliqueOnScale-FreeNetworks.pdf
    Friedrich, Tobias; Krohmer, Anton Parameterized Clique on Scale-Free Networks. International Symposium on Algorithms and Computation (ISAAC) 2012: 659-668
     
  • 2012GECCO_Bio.pdf
    Baumbach, Jan; Friedrich, Tobias; Kötzing, Timo; Krohmer, Anton; Müller, Joachim; Pauling, Josch Efficient Algorithms for Extracting Biological Key Pathways with Global Constraints. Genetic and Evolutionary Computation Conference (GECCO) 2012: 169-176
     
  • ApproximatingTheLeastHypervolumeContributorNp-HardInGeneral,ButFastInPractice.pdf
    Bringmann, Karl; Friedrich, Tobias Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Theoretical Computer Science (TCS) 2012: 104-116
     
  • ExperimentalAnalysisOfRumorSpreadingInSocialNetworks.pdf
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Experimental Analysis of Rumor Spreading in Social Networks. Mediterranean Conference on Algorithms (MedAlg) 2012: 159-173
     
  • IB1.pdf
    Alcaraz, Nicolas; Friedrich, Tobias; Kötzing, Timo; Krohmer, Anton; Müller, Joachim; Pauling, Josch; Baumbach, Jan Efficient Key Pathway Mining: Combining Networks and OMICS Data. Integrative Biology 2012: 756-764
     
  • QuasirandomLoadBalancing.pdf
    Friedrich, Tobias; Gairing, Martin; Sauerwald, Thomas Quasirandom Load Balancing. SIAM Journal of Computing 2012: 747-771
     
  • AsynchronousRumorSpreadingInPreferentialAttachmentGraphs.pdf
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Asynchronous Rumor Spreading in Preferential Attachment Graphs. Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2012: 307-315
     
  • ConvergenceOfHypervolume-BasedArchivingAlgorithmsIiCompetitiveness.pdf
    Bringmann, Karl; Friedrich, Tobias Convergence of hypervolume-based archiving algorithms ii: competitiveness. Genetic and Evolutionary Computation Conference (GECCO) 2012: 457-464
     
  • WhyRumorsSpreadSoQuicklyInSocialNetworks.pdf
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Why rumors spread so quickly in social networks. Communications of the ACM 2012: 70-75
     

2011 [ to top ]

  • Approximation-GuidedEvolutionaryMulti-ObjectiveOptimization.pdf
    Bringmann, Karl; Friedrich, Tobias; Neumann, Frank; Wagner, Markus Approximation-Guided Evolutionary Multi-Objective Optimization. International Joint Conference on Artificial Intelligence (IJCAI) 2011: 1198-1203
     
  • IllustrationOfFairnessInEvolutionaryMulti-ObjectiveOptimization.pdf
    Friedrich, Tobias; Horoba, Christian; Neumann, Frank Illustration of Fairness in Evolutionary Multi-Objective Optimization. Theoretical Computer Science 2011: 1546-1556
     
  • TheLogarithmicHypervolumeIndicator.pdf
    Friedrich, Tobias; Bringmann, Karl; Voß, Thomas; Igel, Christian The logarithmic hypervolume indicator. Foundations of Genetic Algorithms (FOGA) 2011: 81-92
     
  • ConstraintSatisfactionProblemsConvexityMakesAllDifferentConstraintsTractable.pdf
    Fellows, Michael R.; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances A. Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. International Joint Conference on Artificial Intelligence (IJCAI) 2011: 522-527
     
  • SocialNetworksSpreadRumorsInSublogarithmicTime.pdf
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Social networks spread rumors in sublogarithmic time. Symposium on Theory of Computing (STOC) 2011: 21-30
     
  • FastSimulationOfLarge-ScaleGrowthModels.pdf
    Friedrich, Tobias; Levine, Lionel Fast Simulation of Large-Scale Growth Models. Approximation Algorithms for Combinatorial Optimization (APPROX) 2011: 555-566
     
  • DiameterAndBroadcastTimeOfRandomGeometricGraphsInArbitraryDimensions.pdf
    Friedrich, Tobias; Sauerwald, Thomas; Stauffer, Alexandre Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. International Symposium on Algorithms and Computation (ISAAC) 2011: 190-199
     
  • RandomizedDiffusionForIndivisibleLoads.pdf
    Berenbrink, Petra; Cooper, Colin; Friedetzky, Tom; Friedrich, Tobias; Sauerwald, Thomas Randomized Diffusion for Indivisible Loads. Symposium on Discrete Algorithms (SODA) 2011: 429-439
     
  • ConvergenceOfHypervolume-BasedArchivingAlgorithmsIEffectiveness.pdf
    Bringmann, Karl; Friedrich, Tobias Convergence of hypervolume-based archiving algorithms {I:} effectiveness. {GECCO} 2011: 745-752
     
  • WeightedPreferencesInEvolutionaryMulti-ObjectiveOptimization.pdf
    Friedrich, Tobias; Kroeger, Trent; Neumann, Frank Weighted Preferences in Evolutionary Multi-objective Optimization. Australasian Conference on Artificial Intelligence (AUSAI) 2011: 291-300
     
  • AverageUpdateTimesForFully-DynamicAll-PairsShortestPaths.pdf
    Friedrich, Tobias; Hebbinghaus, Nils Average update times for fully-dynamic all-pairs shortest paths. Discrete Applied Mathematics 2011: 1751-1758
     
  • SmoothedAnalysisOfBalancingNetworks.pdf
    Friedrich, Tobias; Sauerwald, Thomas; Vilenchik, Dan Smoothed analysis of balancing networks. Random Structures and Algorithms 2011: 115-138
     

2010 [ to top ]

  • DeterministicRandomWalksOnRegularTrees.pdf
    Cooper, Joshua N.; Doerr, Benjamin; Friedrich, Tobias; Spencer, Joel Deterministic random walks on regular trees. Random Structures and Algorithms 2010: 353-366
     
  • Set-BasedMulti-ObjectiveOptimization,Indicators,AndDeteriorativeCycles.pdf
    Berghammer, Rudolf; Friedrich, Tobias; Neumann, Frank Set-based multi-objective optimization, indicators, and deteriorative cycles. Genetic and Evolutionary Computation Conference (GECCO) 2010: 495-502
     
  • TheCoverTimeOfDeterministicRandomWalks.pdf
    Friedrich, Tobias; Sauerwald, Thomas The Cover Time of Deterministic Random Walks. Electronic Journal of Combinatorics 2010
     
  • ApproximatingCoveringProblemsByRandomizedSearchHeuristicsUsingMulti-ObjectiveModels.pdf
    Friedrich, Tobias; He, Jun; Hebbinghaus, Nils; Neumann, Frank; Witt, Carsten Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Evolutionary Computation 2010: 617-633
     
  • PlateausCanBeHarderInMulti-ObjectiveOptimization.pdf
    Friedrich, Tobias; Hebbinghaus, Nils; Neumann, Frank Plateaus can be harder in Multi-Objective Optimization. Theoretical Computer Science 2010: 854-864
     
  • Average-CaseAnalysisOfIncrementalTopologicalOrdering.pdf
    Ajwani, Deepak; Friedrich, Tobias Average-case analysis of incremental topological ordering. Discrete Applied Mathematics 2010: 240-250
     
  • QuasirandomLoadBalancing.pdf
    Friedrich, Tobias; Gairing, Martin; Sauerwald, Thomas Quasirandom Load Balancing. Symposium on Discrete Algorithms (SODA) 2010: 1620-1629
     
  • AnEfficientAlgorithmForComputingHypervolumeContributions.pdf
    Bringmann, Karl; Friedrich, Tobias An Efficient Algorithm for Computing Hypervolume Contributions. Evolutionary Computation 2010: 383-402
     
  • TheMaximumHypervolumeSetYieldsNear-OptimalApproximation.pdf
    Bringmann, Karl; Friedrich, Tobias The maximum hypervolume set yields near-optimal approximation. Genetic and Evolutionary Computation Conference (GECCO) 2010: 511-518
     
  • ApproximatingTheVolumeOfUnionsAndIntersectionsOfHigh-DimensionalGeometricObjects.pdf
    Bringmann, Karl; Friedrich, Tobias Approximating the volume of unions and intersections of high-dimensional geometric objects. Computational Geometry 2010: 601-610
     
  • EfficientBroadcastOnRandomGeometricGraphs.pdf
    Bradonjic, Milan; Elsässer, Robert; Friedrich, Tobias; Sauerwald, Thomas; Stauffer, Alexandre Efficient Broadcast on Random Geometric Graphs. Symposium on Discrete Algorithms (SODA) 2010: 1412-1421
     
  • TightBoundsForTheApproximationRatioOfTheHypervolumeIndicator.pdf
    Bringmann, Karl; Friedrich, Tobias Tight Bounds for the Approximation Ratio of the Hypervolume Indicator. Parallel Problem Solving from Nature (PPSN) 2010: 607-616
     

2009 [ to top ]

  • QuasirandomRumorSpreadingAnExperimentalAnalysis.pdf
    Doerr, Benjamin; Friedrich, Tobias; Künnemann, Marvin; Sauerwald, Thomas Quasirandom Rumor Spreading: An Experimental Analysis. Algorithm Engineering and Experiments (ALENEX) 2009: 145-153
     
  • OnTheEffectsOfAddingObjectivesToPlateauFunctions.pdf
    Brockhoff, Dimo; Friedrich, Tobias; Hebbinghaus, Nils; Klein, Christian; Neumann, Frank; Zitzler, Eckart On the Effects of Adding Objectives to Plateau Functions. Transactions on Evolutionary Computation 2009: 591-603
     
  • AnalysisOfDiversity-PreservingMechanismsForGlobalExploration.pdf
    Friedrich, Tobias; Oliveto, Pietro Simone; Sudholt, Dirk; Witt, Carsten Analysis of Diversity-Preserving Mechanisms for Global Exploration. Evolutionary Computation 2009: 455-476
     
  • QuasirandomRumorSpreadingOnExpanders.pdf
    Doerr, Benjamin; Friedrich, Tobias; Sauerwald, Thomas Quasirandom Rumor Spreading on Expanders. Electronic Notes in Discrete Mathematics 2009: 243-247
     
  • ApproximatingTheLeastHypervolumeContributorNp-HardInGeneral,ButFastInPractice.pdf
    Bringmann, Karl; Friedrich, Tobias Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice. Evolutionary Multi-Criterion Optimization (EMO) 2009: 6-20
     
  • ComputingSingleSourceShortestPathsUsingSingle-ObjectiveFitness.pdf
    Baswana, Surender; Biswas, Somenath; Doerr, Benjamin; Friedrich, Tobias; Kurur, Piyush P.; Neumann, Frank Computing Single Source Shortest Paths using Single-Objective Fitness Functions. Foundations of Genetic Algorithms (FOGA) 2009: 59-66
     
  • SmoothedAnalysisOfBalancingNetworks.pdf
    Friedrich, Tobias; Sauerwald, Thomas; Vilenchik, Dan Smoothed Analysis of Balancing Networks. International Colloquium on Automata, Languages, and Programming (ICALP) 2009: 472-483
     
  • AnalysesOfSimpleHybridAlgorithmsForTheVertexCoverProblem.pdf
    Friedrich, Tobias; He, Jun; Hebbinghaus, Nils; Neumann, Frank; Witt, Carsten Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evolutionary Computation 2009: 3-19
     
  • QuasirandomRumorSpreadingExpandersPushVsPullandRobustness.pdf
    Doerr, Benjamin; Friedrich, Tobias; Sauerwald, Thomas Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. International Colloquium on Automata, Languages and Programming (ICALP) 2009: 366-377
     
  • ComparisonOfSimpleDiversityMechanismsOnPlateauFunctions.pdf
    Friedrich, Tobias; Hebbinghaus, Nils; Neumann, Frank Comparison of simple diversity mechanisms on plateau functions. Theoretical Computer Science 2009: 2455-2462
     
  • Don'TBeGreedyWhenCalculatingHypervolumeContributions.pdf
    Bringmann, Karl; Friedrich, Tobias Don't be greedy when calculating hypervolume contributions. {FOGA} 2009: 103-112
     
  • MultiplicativeApproximationsAndTheHypervolumeIndicator.pdf
    Friedrich, Tobias; Horoba, Christian; Neumann, Frank Multiplicative approximations and the hypervolume indicator. Genetic and Evolutionary Computation Conference (GECCO) 2009: 571-578
     
  • Near-PerfectLoadBalancingByRandomizedRounding.pdf
    Friedrich, Tobias; Sauerwald, Thomas Near-perfect load balancing by randomized rounding. Symposium on Theory of Computing (STOC) 2009: 121-130
     

2008 [ to top ]

  • AnalyzingHypervolumeIndicatorBasedAlgorithms.pdf
    Brockhoff, Dimo; Friedrich, Tobias; Neumann, Frank Analyzing Hypervolume Indicator Based Algorithms. International Conference on Parallel Problem Solving from Nature (PPSN) 2008: 651-660
     
  • WhenToUseBit-WiseNeutrality.pdf
    Friedrich, Tobias; Neumann, Frank When to use bit-wise neutrality. Congress on Evolutionary Computation (CEC) 2008: 997-1003
     
  • ApproximatingTheVolumeOfUnionsAndIntersectionsOfHigh-DimensionalGeometricObjects.pdf
    Bringmann, Karl; Friedrich, Tobias Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. International Symposium on Algorithms and Computation (ISAAC) 2008: 436-447
     
  • RuntimeAnalysesForUsingFairnessInEvolutionaryMulti-ObjectiveOptimization.pdf
    Friedrich, Tobias; Horoba, Christian; Neumann, Frank Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. Parallel Problem Solving from Nature (PPSN) 2008: 671-680
     
  • AnO(N2.75)algorithmForOnlineTopologicalOrdering.pdf
    Ajwani, Deepak; Friedrich, Tobias; Meyer, Ulrich An \(O(n^{2.75})\) algorithm for incremental topological ordering. Transactions on Algorithms 2008
     
  • TheoreticalAnalysisOfDiversityMechanismsForGlobalExploration.pdf
    Friedrich, Tobias; Oliveto, Pietro Simone; Sudholt, Dirk; Witt, Carsten Theoretical analysis of diversity mechanisms for global exploration. Genetic and Evolutionary Computation Conference (GECCO) 2008: 945-952
     

2007 [ to top ]

  • Average-CaseAnalysisOfOnlineTopologicalOrdering.pdf
    Ajwani, Deepak; Friedrich, Tobias Average-Case Analysis of Online Topological Ordering. International Symposium on Algorithms and Computation (ISAAC) 2007: 464-475
     
  • DoAdditionalObjectivesMakeAProblemHarder?.pdf
    Brockhoff, Dimo; Friedrich, Tobias; Hebbinghaus, Nils; Klein, Christian; Neumann, Frank; Zitzler, Eckart Do additional objectives make a problem harder?. Genetic and Evolutionary Computation Conference (GECCO) 2007: 765-772
     
  • UnbiasedMatrixRounding.pdf
    Friedrich, Tobias; Doerr, Benjamin; Klein, Christian; Osbild, Ralf Unbiased Matrix Rounding. Electronic Notes in Discrete Mathematics 2007: 41-46
     
  • OnImprovingApproximateSolutionsByEvolutionaryAlgorithms.pdf
    Friedrich, Tobias; He, Jun; Hebbinghaus, Nils; Neumann, Frank; Witt, Carsten On improving approximate solutions by evolutionary algorithms. Congress on Evolutionary Computation (CEC) 2007: 2614-2621
     
  • RigorousAnalysesOfSimpleDiversityMechanisms.pdf
    Friedrich, Tobias; Hebbinghaus, Nils; Neumann, Frank Rigorous analyses of simple diversity mechanisms. Genetic and Evolutionary Computation Conference (GECCO) 2007: 1219-1225
     

2006 [ to top ]

  • DeterministicRandomWalksOnTheTwo-DimensionalGrid.pdf
    Doerr, Benjamin; Friedrich, Tobias Deterministic Random Walks on the Two-Dimensional Grid. International Symposium on Algorithms and Computation (ISAAC) 2006: 474-483
     
  • QuasirandomnessInGraphs.pdf
    Doerr, Benjamin; Friedrich, Tobias Quasirandomness in Graphs. Electronic Notes in Discrete Mathematics 2006: 61-64
     
  • UnbiasedMatrixRounding.pdf
    Doerr, Benjamin; Friedrich, Tobias; Klein, Christian; Osbild, Ralf Unbiased Matrix Rounding. Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2006: 102-112
     

2005 [ to top ]

  • RoundingOfSequencesAndMatrices,WithApplications.pdf
    Doerr, Benjamin; Friedrich, Tobias; Klein, Christian; Osbild, Ralf Rounding of Sequences and Matrices, with Applications. Workshop on Approximation and Online Algorithms (WAOA) 2005: 96-109