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

All Publications

The following listing contains all publications of the current members of the Algorithm Engineering group. Loading the page might take a few seconds depending on your connection. Alternatively, see the shorter list of current publications.

2017

  • 14809-64744-1-SM.pdf
    Friedrich, Tobias; Neumann, Frank What’s Hot in Evolutionary Computation. Conference on Artificial Intelligence (AAAI) 2017
     
  • 2017TECcGA.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
     
  • vc-ls.pdf
    Katzmann, Maximilian; Komusiewicz, Christian Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem. 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
     
  • 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
     
  • 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
     
  • MinimizingMaximumWeightedFlowTimeOnRelatedAndUnrelatedMachinesJournal.pdf
    Anand, S.; Bringmann, Karl; Friedrich, Tobias; Garg, Naveen; Kumar, Amit Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica 2017: 515-536
     
  • umdaInOne_final_submission.pdf
    Krejca, Martin S.; Witt, Carsten Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax. Foundations of Genetic Algorithms (FOGA) 2017
     
  • Bläsius, Thomas; Radermacher, Marcel; Rutter, Ignaz How to Draw a Planarization. Software Seminar (SOFSEM) 2017: 295-308
     
  • thesis_Goebel.pdf
    Göbel, Andreas Counting, Modular Counting and Graph Homomorphisms. 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
     
  • 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
     

2016

  • TowardsAnAtlasOfComputationalLearningTheory.pdf
    Kötzing, Timo; Schirneck, Martin Towards an Atlas of Computational Learning Theory. Symposium on Theoretical Aspects of Computer Science (STACS) 2016: 47:1-47:13
     
  • Case, John; Kötzing, Timo Topological Separations in Inductive Inference. Theoretical Computer Science 2016: 33-45
     
  • TheRightMutationStrengthForMulti-ValuedDecisionVariables.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo The Right Mutation Strength for Multi-Valued Decision Variables. Genetic and Evolutionary Computation Conference (GECCO) 2016: 1115-1122
     
  • 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
     
  • 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
     
  • SuperpolynomialLowerBoundsForThe(1+1)EaOnSomeEasyCombinatorialProblems.pdf
    Sutton, Andrew M. Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems. Algorithmica 2016: 507-528
     
  • StronglyNonUShapedLanguageLearningResultsByGeneralTechniquesJournal.pdf
    Case, John; Kötzing, Timo Strongly non-U-shaped language learning results by general techniques. Information and Computation 2016: 1-15
     
  • SimultaneousPq-OrderingWithApplicationsToConstrainedEmbeddingProblems.pdf
    Bläsius, Thomas; Rutter, Ignaz Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. Transactions on Algorithms 2016: 16
     
  • Friedrich, Tobias Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms. Symposium on Mathematical Foundations of Computer Science (MFCS) 2016: 4:1-4:3
     
  • 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
     
  • ScalableExactVisualizationOfIsocontoursInRoadNetworksViaMinimum-LinkPaths.pdf
    Baum, Moritz; Bläsius, Thomas; Gemsa, Andreas; Rutter, Ignaz; Wegner, Franziska Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. European Symposium on Algorithms (ESA) 2016: 7:1-7:18
     
  • RobustnessOfPopulationsInStochasticEnvironmentsJournal.pdf
    Gießen, Christian; Kötzing, Timo Robustness of Populations in Stochastic Environments. Algorithmica 2016: 462-489
     
  • 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
     
  • ProvablyOptimalSelf-AdjustingStepSizesForMulti-ValuedDecisionVariables.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Provably Optimal Self-Adjusting Step Sizes for Multi-Valued Decision Variables. Parallel Problem Solving From Nature (PPSN) 2016: 782-791
     
  • 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
     
  • OrthogonalGraphDrawingsWithInflexibleEdges.pdf
    Bläsius, Thomas; Lehmann, Sebastian; Rutter, Ignaz Orthogonal Graph Drawing with Inflexible Edges. Computational Geometry 2016: 26-40
     
  • OptimalOrthogonalGraphDrawingWithConvexBendCostsJournal.pdf
    Bläsius, Thomas; Rutter, Ignaz; Wagner, Dorothea Optimal Orthogonal Graph Drawing with Convex Bend Costs. Transactions on Algorithms 2016: 33
     
  • OnTheRoleOfUpdateConstraintsAndTextTypesInIterativeLearningJournal.pdf
    Jain, Sanjay; Kötzing, Timo; Ma, Junqi; Stephan, Frank On the Role of Update Constraints and Text-Types in Iterative Learning. Information and Computation 2016: 152-168
     
  • 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
     
  • OnSelfishCreationOfRobustNetworks.pdf
    Chauhan, Ankit; Lenzner, Pascal; Melnichenko, Anna; Münn, Martin On Selfish Creation of Robust Networks. Symposium on Algorithmic Game Theory (SAGT) 2016: 141-152
     
  • 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
     
  • 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
     
  • 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
     
  • 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
     
  • 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
     
  • EnlargingLearnableClassesJournal.pdf
    Jain, Sanjay; Kötzing, Timo; Stephan, Frank Enlarging learnable classes. Information and Computation 2016: 194-207
     
  • 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
     
  • 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
     
  • 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
     
  • a12-gobel.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David Counting Homomorphisms to Square-Free Graphs, Modulo 2. Transactions on Computation Theory 2016: 12:1-12:29
     
  • ConcentrationOfFirstHittingTimesUnderAdditiveDriftJournal.pdf
    Kötzing, Timo Concentration of First Hitting Times Under Additive Drift. Algorithmica 2016: 490-506
     
  • 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
     
  • LIPIcs-ICALP-2016-62.pdf
    Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie-Ann; Lapinskas, John; Richerby, David Amplifiers for the Moran Process. International Colloquium on Automata, Languages and Programming (ICALP) 2016: 62:1-62:13
     
  • new-perspective-on-clustered-planarity.pdf
    Bläsius, Thomas; Rutter, Ignaz A new perspective on clustered planarity as a combinatorial embedding problem. Theoretical Computer Science 2016: 306-315
     
  • AMapOfUpdateConstraintsInInductiveInferenceJournal.pdf
    Kötzing, Timo; Palenta, Raphaela A map of update constraints in inductive inference. Theoretical Computer Science 2016: 4-24
     

2015

  • 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
     
  • UnbiasedBlack-BoxComplexitiesOfJumpFunctions.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Unbiased Black-Box Complexities of Jump Functions. Evolutionary Computation 2015: 641-670
     
  • 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
     
  • 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
     
  • 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
     
  • 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
     
  • 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
     
  • 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
     
  • Berenbrink, Petra; Cooper, Colin; Friedetzky, Tom; Friedrich, Tobias; Sauerwald, Thomas Randomized diffusion for indivisible loads. Journal of Computer and System Sciences 2015: 159-185
     
  • PopulationSizeMattersRigorousRuntimeResultsForMaximizingTheHypervolumeIndicator.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
     
  • 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
     
  • ParameterizedCliqueOnInhomogeneousRandomGraphs.pdf
    Friedrich, Tobias; Krohmer, Anton Parameterized clique on inhomogeneous random graphs. Discrete Applied Mathematics 2015: 130-138
     
  • ParameterizedAnaloguesOfProbabilisticComputation.pdf
    Chauhan, Ankit; Rao, B. V. Raghavendra Parameterized Analogues of Probabilistic Computation. Conference on Algorithms and Discrete Applied Mathematics (CALDAM) 2015: 181-192
     
  • OrthogonalGraphDrawingWithInflexibleEdges.pdf
    Bläsius, Thomas; Lehmann, Sebastian; Rutter, Ignaz Orthogonal Graph Drawing with Inflexible Edges. Conference on Algorithms and Complexity (CIAC) 2015: 61-73
     
  • 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
     
  • OnTheDiameterOfHyperbolicRandomGraphs.pdf
    Friedrich, Tobias; Krohmer, Anton On the Diameter of Hyperbolic Random Graphs. International Colloquium on Automata, Languages and Programming (ICALP) 2015: 614-625
     
  • OnTheAverage-CaseComplexityOfParameterizedClique.pdf
    Fountoulakis, Nikolaos; Friedrich, Tobias; Hermelin, Danny On the average-case complexity of parameterized clique. Theoretical Computer Science 2015: 18-29
     
  • OnRestrictionsInComputationalLanguageLearning.pdf
    Schirneck, Martin On Restrictions in Computational Language Learning. 2015
     
  • Blaesius_Thomas_diss.pdf
    Bläsius, Thomas New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity. 2015
     
  • NetworkCreationGamesThinkGlobal-ActLocal.pdf
    Cord-Landwehr, Andreas; Lenzner, Pascal Network Creation Games: Think Global - Act Local. Mathematical Foundations of Computer Science (MFCS) 2015: 248-260
     
  • MultiplicativeApproximationsOptimalHypervolumeDistributionsAndTheChoiceOfTheReferencePoint.pdf
    Friedrich, Tobias; Neumann, Frank; Thyssen, Christian Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. Evolutionary Computation 2015: 131-159
     
  • MaximizingSubmodularFunctionsUnderMatroidConstraintsByEvolutionaryAlgorithms.pdf
    Friedrich, Tobias; Neumann, Frank Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms. Evolutionary Computation 2015: 543-558
     
  • 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
     
  • Friedrich, Tobias; He, Jun; Jansen, Thomas; Moraglio, Alberto Genetic and Evolutionary Computation. Theoretical Computer Science 2015: 1-2
     
  • 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
     
  • FastLearningOfRestrictedRegularExpressionsAndDTDsJournal.pdf
    Freydenberger, Dominik D.; Kötzing, Timo Fast Learning of Restricted Regular Expressions and DTDs. Theory of Computing Systems 2015: 1114-1158
     
  • 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
     
  • 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
     
  • 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
     
  • DisconnectivityAndRelativePositionsInSimultaneousEmbeddingsJournal.pdf
    Bläsius, Thomas; Rutter, Ignaz Disconnectivity and relative positions in simultaneous embeddings. Computational Geometry 2015: 459-478
     
  • Partitions.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki Counting List Matrix Partitions of Graphs. SIAM J. Comput. 2015: 1089-1118
     
  • Counting+Homomorphisms+to+Square-Free+Graphs,+Modulo+2.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
     
  • CliquesInHyperbolicRandomGraphs.pdf
    Friedrich, Tobias; Krohmer, Anton Cliques in hyperbolic random graphs. International Conference on Computer Communications (INFOCOM) 2015: 1544-1552
     
  • (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
     

2014

  • UnbiasedBlack-BoxComplexitiesOfJumpFunctionsHowToCrossLargePlateaus.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Unbiased black-box complexities of jump functions: how to cross large plateaus. Genetic and Evolutionary Computation Conference (GECCO) 2014: 769-776
     
  • 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
     
  • TheUnbiasedBlack-BoxComplexityOfPartitionIsPolynomial.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo The unbiased black-box complexity of partition is polynomial. Artificial Intelligence 2014: 275-286
     
  • TheMaxProblemRevisitedTheImportanceOfMutationInGeneticProgrammingJournal.pdf
    Kötzing, Timo; Sutton, Andrew M.; Neumann, Frank; O'Reilly, Una-May The Max problem revisited: The importance of mutation in genetic programming. Theoretical Computer Science (TCS) 2014: 94-107
     
  • TheComponentModelForElementaryLandscapesAndPartialNeighborhoods.pdf
    Whitley, Darrell; Sutton, Andrew M.; Ochoa, Gabriela; Chicano, Francisco The component model for elementary landscapes and partial neighborhoods. Theoretical Computer Science 2014: 59-75
     
  • TheComplexityOfCountingHomomorphismsToCactusGraphsModulo2.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David The complexity of counting homomorphisms to cactus graphs modulo 2. Transactions on Computation Theory 2014: 17:1-17:29
     
  • TestingMutualDualityOfPlanarGraphsJournal.pdf
    Angelini, Patrizio; Bläsius, Thomas; Rutter, Ignaz Testing Mutual duality of Planar graphs. Computational Geometry and Applications 2014: 325-346
     
  • RuntimeAnalysisOfEvolutionaryAlgorithmsOnRandomlyConstructedHigh-DensitySatisfiable3-CnfFormulas.pdf
    Sutton, Andrew M.; Neumann, Frank Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. Parallel Problem Solving from Nature (PPSN) 2014: 942-951
     
  • RobustnessOfPopulationsInStochasticEnvironments1.pdf
    Gießen, Christian; Kötzing, Timo Robustness of populations in stochastic environments. Genetic and Evolutionary Computation Conference (GECCO) 2014: 1383-1390
     
  • QuasirandomRumorSpreading.pdf
    Doerr, Benjamin; Friedrich, Tobias; Sauerwald, Thomas Quasirandom Rumor Spreading. Transactions on Algorithms 2014: 9:1-9:35
     
  • ParameterizedRuntimeAnalysesOfEvolutionaryAlgorithmsForThePlanarEuclideanTravelingSalespersonProblem.pdf
    Sutton, Andrew M.; Neumann, Frank; Nallaperuma, Samadhi Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem. Evolutionary Computation 2014: 595-628
     
  • OrthogonalGraphDrawingWithFlexibilityConstraints.pdf
    Bläsius, Thomas; Krug, Marcus; Rutter, Ignaz; Wagner, Dorothea Orthogonal Graph Drawing with Flexibility Constraints. Algorithmica 2014: 859-885
     
  • OnTheRoleOfUpdateConstraintsAndText-TypesInIterativeLearning.pdf
    Jain, Sanjay; Kötzing, Timo; Ma, Junqi; Stephan, Frank On the Role of Update Constraints and Text-Types in Iterative Learning. International Conference on Algorithmic Learning Theory (ALT) 2014: 55--69
     
  • 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
     
  • IterativeLearningFromPositiveDataAndCountersJournal.pdf
    Kötzing, Timo Iterative learning from positive data and counters. Theoretical Computer Science (TCS) 2014: 155-169
     
  • Friedrich, Tobias; Rowe, Jonathan E. Genetic and Evolutionary Computation. Theoretical Computer Science 2014: 1
     
  • 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
     
  • EfficientIdentificationOfImprovingMovesInABallForPseudo-BooleanProblems.pdf
    Chicano, Francisco; Whitley, Darrell; Sutton, Andrew M. Efficient identification of improving moves in a ball for pseudo-boolean problems. Genetic and Evolutionary Computation Conference (GECCO) 2014: 437-444
     
  • 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
     
  • CountingListMatrixPartitionsOfGraphs.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki Counting List Matrix Partitions of Graphs. Conference on Computational Complexity (CCC) 2014: 56-65
     
  • Counting+Homomorphisms+to+Cactus+Graphs+Modulo+2.pdf
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David Counting Homomorphisms to Cactus Graphs Modulo 2. Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 350-361
     
  • ConvergenceOfHypervolume-BasedArchivingAlgorithms.pdf
    Bringmann, Karl; Friedrich, Tobias Convergence of Hypervolume-Based Archiving Algorithms. Transactions on Evolutionary Computation 2014: 643-657
     
  • ConcentrationOfFirstHittingTimesUnderAdditiveDrift.pdf
    Kötzing, Timo Concentration of first hitting times under additive drift. Genetic and Evolutionary Computation Conference (GECCO) 2014: 1391-1398
     
  • ComplexityOfHigher-DegreeOrthogonalGraphEmbeddingInTheKandinskyModel.pdf
    Bläsius, Thomas; Brückner, Guido; Rutter, Ignaz Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. European Symposium on Algorithms (ESA) 2014: 161-172
     
  • ASolutionToWiehagensThesis.pdf
    Kötzing, Timo A Solution to Wiehagen's Thesis. Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 494--505
     
  • ANewPerspectiveOnClusteredPlanarityAsACombinatorialEmbeddingProblem.pdf
    Bläsius, Thomas; Rutter, Ignaz A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. Graph Drawing (GD) 2014: 440-451
     
  • AMapOfUpdateConstraintsInInductiveInference.pdf
    Kötzing, Timo; Palenta, Raphaela A Map of Update Constraints in Inductive Inference. International Conference on Algorithmic Learning Theory (ALT) 2014: 40-54
     

2013

  • WeightedPreferencesInEvolutionaryMulti-ObjectiveOptimization.pdf
    Friedrich, Tobias; Kroeger, Trent; Neumann, Frank Weighted preferences in evolutionary multi-objective optimization. Machine Learning and Cybernetics 2013: 139-148
     
  • UsingIlp:SatToDeterminePathwidth,VisibilityRepresentations,AndOtherGrid-BasedGraphDrawings.pdf
    Biedl, Therese C.; Bläsius, Thomas; Niedermann, Benjamin; Nöllenburg, Martin; Prutkin, Roman; Rutter, Ignaz Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. Graph Drawing (GD) 2013: 460-471
     
  • TopologicalSeparationsInInductiveInference.pdf
    Case, John; Kötzing, Timo Topological Separations in Inductive Inference. International Conference on Algorithmic Learning Theory (ALT) 2013: 128-142
     
  • TestingMutualDualityOfPlanarGraphs.pdf
    Angelini, Patrizio; Bläsius, Thomas; Rutter, Ignaz Testing Mutual Duality of Planar Graphs. International Symposium on Algorithms and Computation (ISAAC) 2013: 350-360
     
  • 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
     
  • SimultaneousPQOrderingWithApplicationsToConstrainedEmbeddingProblems.pdf
    Bläsius, Thomas; Rutter, Ignaz Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. Symposium on Discrete Algorithms 2013: 1030-1043
     
  • SimultaneousEmbeddingEdgeOrderingsRelativePositionsCutvertices.pdf
    Bläsius, Thomas; Karrer, Annette; Rutter, Ignaz Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. Graph Drawing (GD) 2013: 220-231
     
  • SimultaneousEmbeddingOfPlanarGraphs.pdf