Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Publications of the Algorithm Engineering Group

You can view all publications of the current members of the Algorithm Engineering group. For other listings, please see:

All publications in 2015

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


Conference Publications

  • PixelAndVoxelRepresentationsOfGraphs.pdf
    Alam, Md. Jawaherul; Bläsius, Thomas; Rutter, Ignaz; Ueckerdt, Torsten; Wolff, Alexander Pixel and Voxel Representations of Graphs. Graph Drawing (GD) 2015: 472-486
     
  • OrthogonalGraphDrawingWithInflexibleEdges.pdf
    Bläsius, Thomas; Lehmann, Sebastian; Rutter, Ignaz Orthogonal Graph Drawing with Inflexible Edges. Conference on Algorithms and Complexity (CIAC) 2015: 61-73
     
  • 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
     
  • BringmannFK15.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
     
  • ParameterizedAnaloguesOfProbabilisticComputation.pdf
    Chauhan, Ankit; Rao, B. V. Raghavendra Parameterized Analogues of Probabilistic Computation. Conference on Algorithms and Discrete Applied Mathematics (CALDAM) 2015: 181-192
     
  • NetworkCreationGamesThinkGlobal-ActLocal.pdf
    Cord-Landwehr, Andreas; Lenzner, Pascal Network Creation Games: Think Global - Act Local. Mathematical Foundations of Computer Science (MFCS) 2015: 248-260
     
  • SolvingProblemsWithUnknownSolutionLengthAt(Almost)NoExtraCost.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Solving Problems with Unknown Solution Length at (Almost) No Extra Cost. Genetic and Evolutionary Computation Conference (GECCO) 2015: 831--838
     
  • ImprovedRuntimeBoundsForThe(1+1)EaOnRandom3-CnfFormulasBasedOnFitness-DistanceCorrelation.pdf
    Doerr, Benjamin; Neumann, Frank; Sutton, Andrew M. Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. Genetic and Evolutionary Computation Conference (GECCO) 2015: 1415-1422
     
  • 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
     
  • 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
     
  • RobustnessOfAntColonyOptimizationToNoise.pdf
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Robustness of Ant Colony Optimization to Noise. Genetic and Evolutionary Computation Conference (GECCO) 2015: 17-24
    Best Paper Award (ACO/SI Track)
     
  • OnTheDiameterOfHyperbolicRandomGraphs.pdf
    Friedrich, Tobias; Krohmer, Anton On the Diameter of Hyperbolic Random Graphs. International Colloquium on Automata, Languages and Programming (ICALP) 2015: 614-625
     
  • FriedrichK15.pdf
    Friedrich, Tobias; Krohmer, Anton Cliques in hyperbolic random graphs. International Conference on Computer Communications (INFOCOM) 2015: 1544-1552
     
  • CountingHomomorphismsToSquare-FreeGraphsModulo2.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David Counting Homomorphisms to Square-Free Graphs, Modulo 2. International Colloquium on Automata, Languages, and Programming (ICALP) 2015: 642-653
     
  • (1+1)EAOnGeneralizedDynamicOneMax.pdf
    Kötzing, Timo; Lissovoi, Andrei; Witt, Carsten (1+1) EA on Generalized Dynamic OneMax. Foundations of Genetic Algorithms (FOGA) 2015: 40-51
     
  • DominatingAnS-T-CutInANetwork.pdf
    Rothenberger, Ralf; Grau, Sascha; Rossberg, Michael Dominating an s-t-Cut in a Network. Conference on Current Trends in Theory and Practice of Informatics (SOFSEM) 2015: 401-411
     

Journal Publications

  • RandomizedDiffusionForIndivisibleLoadsJournal.pdf
    Berenbrink, Petra; Cooper, Colin; Friedetzky, Tom; Friedrich, Tobias; Sauerwald, Thomas Randomized diffusion for indivisible loads. Journal of Computer and System Sciences 2015: 159-185
     
  • DisconnectivityAndRelativePositionsInSimultaneousEmbeddingsJournal.pdf
    Bläsius, Thomas; Rutter, Ignaz Disconnectivity and relative positions in simultaneous embeddings. Computational Geometry 2015: 459-478
     
  • FitnessProbabilityDistributionOfBit-FlipMutation.pdf
    Chicano, Francisco; Sutton, Andrew M.; Whitley, L. Darrell; Alba, Enrique Fitness Probability Distribution of Bit-Flip Mutation. Evolutionary Computation 2015: 217-248
     
  • UnbiasedBlackBoxComplexitiesOfJumpFunctionsJournal.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Unbiased Black-Box Complexities of Jump Functions. Evolutionary Computation 2015: 641-670
     
  • FountoulakisFH15.pdf
    Fountoulakis, Nikolaos; Friedrich, Tobias; Hermelin, Danny On the average-case complexity of parameterized clique. Theoretical Computer Science 2015: 18-29
     
  • FastLearningOfRestrictedRegularExpressionsAndDTDsJournal.pdf
    Freydenberger, Dominik D.; Kötzing, Timo Fast Learning of Restricted Regular Expressions and DTDs. Theory of Computing Systems 2015: 1114-1158
     
  • GeneticAndEvolutionaryComputation2015Journal.pdf
    Friedrich, Tobias; He, Jun; Jansen, Thomas; Moraglio, Alberto Genetic and Evolutionary Computation. Theoretical Computer Science 2015: 1-2
     
  • 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
     
  • ParameterizedCliqueOnInhomogeneousRandomGraphsJournal.pdf
    Friedrich, Tobias; Krohmer, Anton Parameterized clique on inhomogeneous random graphs. Discrete Applied Mathematics 2015: 130-138
     
  • FriedrichN15.pdf
    Friedrich, Tobias; Neumann, Frank Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms. Evolutionary Computation 2015: 543-558
     
  • MultiplicativeApproximationsOptimalHypervolumeDistributionsAndTheChoiceOfTheReferencePointJournal.pdf
    Friedrich, Tobias; Neumann, Frank; Thyssen, Christian Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. Evolutionary Computation 2015: 131-159
     
  • SeedingTheInitialPopulationOfMultiObjectiveEvolutionaryAlgorithmsAComputationalStudyJournal.pdf
    Friedrich, Tobias; Wagner, Markus Seeding the initial population of multi-objective evolutionary algorithms: A computational study. Applied Soft Computing 2015: 223-230
     
  • Partitions.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki Counting List Matrix Partitions of Graphs. SIAM Journal on Computing 2015: 1089-1118
     
  • PopulationSizeMattersRigorousRuntimeResultsForMaximizingTheHypervolumeIndicatorJournal.pdf
    Nguyen, Anh Quang; Sutton, Andrew M.; Neumann, Frank Population size matters: Rigorous runtime results for maximizing the hypervolume indicator. Theoretical Computer Science 2015: 24-36
     
  • 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
     
  • 0007BFN15.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