Prof. Dr. Tobias Friedrich

All publications in 2012

The following listing contains all publications of the current members of the Algorithm Engineering group in 2012.

Conference Publications


  • AParameterizedRuntimeAnalysisOfSimpleEvolutionaryAlgorithmsForMakespanScheduling.pdf
    Sutton, Andrew M.; Neumann, Frank A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. Parallel Problem Solving from Nature (PPSN) 2012: 52-61
  • AcoBeatsEaOnADynamicPseudo-BooleanFunction.pdf
    Kötzing, Timo; Molter, Hendrik ACO Beats EA on a Dynamic Pseudo-Boolean Function. Parallel Problem Solving from Nature (PPSN) 2012: 113-122
  • DoerrFF12.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
  • ExperimentalAnalysisOfRumorSpreadingInSocialNetworks.pdf
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Experimental Analysis of Rumor Spreading in Social Networks. Mediterranean Conference on Algorithms (MedAlg) 2012: 159-173
  • AntsEasilySolveStochasticShortestPathProblems.pdf
    Doerr, Benjamin; Hota, Ashish; Kötzing, Timo Ants easily solve stochastic shortest path problems. Genetic and Evolutionary Computation Conference (GECCO) 2012: 17-24
  • BaumbachFKKMP12.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
  • AParameterizedRuntimeAnalysisOfEvolutionaryAlgorithmsForMAX-2-SAT.pdf
    Sutton, Andrew M.; Day, Jareth; Neumann, Frank A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. Genetic and Evolutionary Computation Conference (GECCO) 2012: 433-440
  • BringmannF12.pdf
    Bringmann, Karl; Friedrich, Tobias Convergence of hypervolume-based archiving algorithms ii: competitiveness. Genetic and Evolutionary Computation Conference (GECCO) 2012: 457-464
  • TheMaxProblemRevisitedTheImportanceOfMutationInGeneticProgramming.pdf
    Kötzing, Timo; Sutton, Andrew M.; Neumann, Frank; O'Reilly, Una-May The max problem revisited: the importance of mutation in genetic programming. Genetic and Evolutionary Computation Conference (GECCO) 2012: 1333-1340
  • EnlargingLearnableClasses.pdf
    Jain, Sanjay; Kötzing, Timo; Stephan, Frank Enlarging Learnable Classes. Algorithmic Learning Theory (ALT) 2012: 36-50
  • ParameterizedCliqueOnScale-FreeNetworks.pdf
    Friedrich, Tobias; Krohmer, Anton Parameterized Clique on Scale-Free Networks. International Symposium on Algorithms and Computation (ISAAC) 2012: 659-668
  • GreedySelfishNetworkCreation.pdf
    Lenzner, Pascal Greedy Selfish Network Creation. Conference on Web and Internet Economics (WINE) 2012: 142-155
  • DisconnectivityAndRelativePositionsInSimultaneousEmbeddings.pdf
    Bläsius, Thomas; Rutter, Ignaz Disconnectivity and Relative Positions in Simultaneous Embeddings. Graph Drawing (GD) 2012: 31-42
  • DeliberativeAcceptabilityOfArguments.pdf
    Croitoru, Cosmina; Kötzing, Timo Deliberative Acceptability of Arguments. Starting AI Researcher Symposium (STAIRS) 2012: 71-82
  • AParameterizedRuntimeAnalysisOfEvolutionaryAlgorithmsForTheEuclideanTravelingSalespersonProblem.pdf
    Sutton, Andrew M.; Neumann, Frank A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. Conference on Artificial Intelligence (AAAI) 2012

Journal Publications

  • EfficientKeyPathwayMiningCombiningNetworksAndOMICSDataJournal.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
  • ConverenceOfSetBasedMultiObjectiveOptimizationIndicatorsAndDeteriorativeCyclesJournal.pdf
    Berghammer, Rudolf; Friedrich, Tobias; Neumann, Frank Convergence of Set-Based Multi-Objective Optimization, Indicators and Deteriorative Cycles. Theoretical Computer Science 2012: 2-17
  • ApproximatingTheLeastHypervolumeContributorNPHardInGeneralButFastInPracticeJournal.pdf
    Bringmann, Karl; Friedrich, Tobias Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Theoretical Computer Science 2012: 104-116
  • Computability-TheoreticLearningComplexity.pdf
    Case, John; Kötzing, Timo Computability-Theoretic Learning Complexity. Philosophical Transactions of the Royal Society A 2012: 3570-3596
  • LearningSecretsInteractivelyDynamicModelingInInductiveInference.pdf
    Case, John; Kötzing, Timo Learning secrets interactively. Dynamic modeling in inductive inference. Information and Computation 2012: 60-73
  • WhyRumorsSpreadSoQuicklyInSocialNetworks.pdf
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Why rumors spread so quickly in social networks. Communications of the ACM 2012: 70-75
  • QuasirandomLoadBalancing.pdf
    Friedrich, Tobias; Gairing, Martin; Sauerwald, Thomas Quasirandom Load Balancing. SIAM Journal of Computing 2012: 747-771
  • LearningInTheLimitWithLattice-StructuredHypothesisSpaces.pdf
    Heinz, Jeffrey; Kasprzik, Anna; Kötzing, Timo Learning in the limit with lattice-structured hypothesis spaces. Theoretical Computer Science 2012: 111--127
  • TheoreticalAnalysisOfTwoACOApproachesForTheTravelingSalesmanProblem.pdf
    Kötzing, Timo; Neumann, Frank; Röglin, Heiko; Witt, Carsten Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intelligence 2012: 1-21
  • ComputingTheMomentsOfK-BoundedPseudo-BooleanFunctionsOverHammingSpheresOfArbitraryRadiusInPolynomialTime.pdf
    Sutton, Andrew M.; Whitley, L. Darrell; Howe, Adele E. Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time. Theoretical Computer Science 2012: 58-74