Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Publications of all Postdocs

2018

  • UnboundedDiscrepancyOfDeterministicRandomWalksOnGrids.pdf
    Tobias Friedrich, Katzmann, Maximilian, Krohmer, Anton Unbounded Discrepancy of Deterministic Random Walks on Grids. SIAM Journal on Discrete Mathematics 2018
     
  • TowardsASystematicEvaluationOfGenerativeNetworkModels.pdf
    Thomas Bläsius, Friedrich, Tobias, Katzmann, Maximilian, Krohmer, Anton, Striebel, Jonathan Towards a Systematic Evaluation of Generative Network Models. Workshop on Algorithms and Models for the Web Graph (WAW) 2018
     
  • Cristina Bazgan, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning, Jansen, Klaus, Klein, Kim-Manuel, Lampis, Michael, Liedloff, Mathieu, Monnot, Jérôme, Paschos, Vangelis Th. The many facets of upper domination. Theoretical Computer Science 2018: 2-25
     
  • 10.1007-s00453-017-0341-1.pdf
    Benjamin Doerr, Doerr, Carola, Kötzing, Timo Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables. Algorithmica 2018: 1732-1768
     
  • SE-EO-RP-C.pdf
    Thomas Bläsius, Karrer, Annette, Rutter, Ignaz Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. Algorithmica 2018: 1214--1277
     
  • AdaptiveEDAs.pdf
    Benjamin Doerr, Krejca, Martin S. Significance-based Estimation-of-Distribution Algorithms. Genetic and Evolutionary Computation Conference (GECCO) 2018
     
  • sharp_SAT_final.pdf
    Tobias Friedrich, Rothenberger, Ralf Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. The 21st International Conference on Theory and Applications of Satisfiability Testing (SAT) 2018
     
  • 313-1470-1-PB.pdf
    Moritz Baum, Bläsius, Thomas, Gemsa, Andreas, Rutter, Ignaz, Wegner, Franziska Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths. Journal of Computational Geometry 2018: 24-70
     
  • Clemens Frahnow, Kötzing, Timo Ring Migration Topology Helps Bypassing Local Optima. Parallel Problem Solving From Nature (PPSN) 2018
     
  • Reoptimization_Algorithmica.pdf
    Feng Shi, Schirneck, Martin, Friedrich, Tobias, Kötzing, Timo, Neumann, Frank Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 2018
     
  • RandGreedy.pdf
    Wanru Gao, Friedrich, Tobias, Neumann, Frank, Hercher, Christian Randomized Greedy Algorithms for Covering Problems. Genetic and Evolutionary Computation Conference (GECCO) 2018
     
  • 10.1007-s00453-017-0379-0.pdf
    Timo Kötzing, Sudholt, Dirk Preface to the Special Issue on Theory of Genetic and Evolutionary Computation. Algorithmica 2018: 1575-1578
     
  • LIPIcs-STACS-2018-14.pdf
    Davide Bilò, Lenzner, Pascal On the Tree Conjecture for the Network Creation Game. Symposium on the Theoretical Aspects of Computer Science (STACS) 2018: 14:1--14:15
     
  • philipp_fischbeck_masters_thesis.pdf
    Philipp Fischbeck On the Effectiveness of Data Reduction for Covering Problems in Real-World Transit Networks. 2018
     
  • hypdiam.pdf
    Tobias Friedrich, Krohmer, Anton On the diameter of hyperbolic random graphs. SIAM Journal on Discrete Mathematics 2018
     
  • boxicity.pdf
    Thomas Bläsius, Stumpf, Peter, Ueckerdt, Torsten Local and Union Boxicity. Discrete Mathematics 2018: 1307 - 1315
     
  • Algorithmica_Island_Models_Meet_Rumor_Spreading.pdf
    Benjamin Doerr, Fischbeck, Philipp, Frahnow, Clemens, Friedrich, Tobias, Kötzing, Timo, Schirneck, Martin Island Models Meet Rumor Spreading. Algorithmica 2018
     
  • restarts.pdf
    Tobias Friedrich, Kötzing, Timo, Quinzan, Francesco, Sutton, Andrew M. Improving the Run Time of the (1+1) Evolutionary Algorithm with Luby Sequences. Genetic and Evolutionary Computation Conference (GECCO) 2018
     
  • HyperbolicEmbeddingsForNearOptimalGreedyRouting.pdf
    Thomas Bläsius, Friedrich, Tobias, Katzmann, Maximilian, Krohmer, Anton Hyperbolic Embeddings for Near-Optimal Greedy Routing. Algorithm Engineering and Experiments (ALENEX) 2018: 199-208
     
  • Tobias Friedrich, Göbel, Andreas, Quinzan, Francesco, Wagner, Markus Heavy-tailed Mutation Operators in Single-Objective Combinatorial Optimization. Parallel Problem Solving From Nature (PPSN) 2018
     
  • Timo Kötzing, Krejca, Martin S. First-Hitting Times Under Additive Drift. Parallel Problem Solving From Nature (PPSN) 2018
     
  • Timo Kötzing, Krejca, Martin S. First-Hitting Times for Finite State Spaces. Parallel Problem Solving From Nature (PPSN) 2018
     
  • paper.pdf
    Duc-Cuong Dang, Friedrich, Tobias, Kötzing, Timo, Krejca, Martin S., Lehre, Per Kristian, Oliveto, Pietro S., Sudholt, Dirk, Sutton, Andrew M. Escaping Local Optima Using Crossover with Emergent Diversity. IEEE Transactions on Evolutionary Computation 2018
     
  • escaping-large-deceptive.pdf
    Tobias Friedrich, Quinzan, Francesco, Wagner, Markus Escaping Large Deceptive Basins of Attraction with Heavy Mutation Operators. Genetic and Evolutionary Computation Conference (GECCO) 2018
     
  • EfficientShortestPathInScaleFreeNetworksWithUnderlyingHyperbolicGeometry.pdf
    Thomas Bläsius, Freiberger, Cedric, Friedrich, Tobias, Katzmann, Maximilian, Montenegro-Retana, Felix, Thieffry, Marianne Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. International Colloquium on Automata, Languages, and Programming (ICALP) 2018
     
  • Efficient Embedding of ScaleFree Graphs in the Hyperbolic Plane.pdf
    Thomas Bläsius, Friedrich, Tobias, Krohmer, Anton, Laue, Sören Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. IEEE/ACM Transactions on Networking 2018: 920-933
     
  • Timo Kötzing, Lagodzinski, J. A. Gregor, Lengler, Johannes, Melnichenko, Anna Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming. Parallel Problem Solving From Nature (PPSN) 2018
     
  • De-AnonymizationOfHeterogeneousRandomGraphsInQuasilinearTime.pdf
    Karl Bringmann, Friedrich, Tobias, Krohmer, Anton De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. Algorithmica 2018: 1-31
     
  • 1802.06103.pdf
    Andreas Göbel, Lagodzinski, J. A. Gregor, Seidel, Karen Counting Homomorphisms to Trees Modulo a Prime. arXiv 2018
     
  • s00453-017-0323-3.pdf
    Thomas Bläsius, Friedrich, Tobias, Krohmer, Anton Cliques in Hyperbolic Random Graphs. Algorithmica 2018: 2324-2344
     
  • constEC_journal.pdf
    Tobias Friedrich, 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. Theoretical Computer Science 2018
     

2017

  • WhatsHotInEvolutionaryComputation.pdf
    Tobias Friedrich, Neumann, Frank What's Hot in Evolutionary Computation. Association for the Advancement of Artificial Intelligence (AAAI) 2017: 5064-5066
     
  • p1367-doerr_proc.pdf
    Benjamin Doerr, Doerr, Carola, Kötzing, Timo Unknown Solution Length Problems With No Asymptotically Optimal Run Time. Genetic and Evolutionary Computation Conference (GECCO) 2017: 1367-1374
     
  • p2606-kovacs.pdf
    Robert Kovacs, Seufert, Anna, Wall, Ludwig, Chen, Hsiang-Ting, Meinel, Florian, Müller, Willi, You, Sijing, Brehm, Maximilian, Striebel, Jonathan, Kommana, Yannis, Popiak, Alexander, Bläsius, Thomas, Baudisch, Patrick TrussFab: Fabricating Sturdy Large-Scale Structures on Desktop 3D Printers. Human Factors in Computing Systems (CHI) 2017: 2606-2616
     
  • TimeComplexityAnalysisOfEvolutionaryAlgorithmsOnRandomSatisfiableK-CNFFormulas.pdf
    Benjamin Doerr, Neumann, Frank, Sutton, Andrew M. Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. Algorithmica 2017: 561-586
     
  • cGA_with_noise.pdf
    Tobias Friedrich, 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: 477-490
     
  • KatzmannK17.pdf
    Maximilian Katzmann, Komusiewicz, Christian Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem. Association for the Advancement of Artificial Intelligence (AAAI) 2017: 846-852
     
  • SelfishNetworkCreationWithNon-UniformEdgeCost.pdf
    Ankit Chauhan, Lenzner, Pascal, Melnichenko, Anna, Molitor, Louise Selfish Network Creation with Non-Uniform Edge Cost. Symposium on Algorithmic Game Theory (SAGT) 2017: 160-172
     
  • ScalingUpLocalSearchForMinimumVertexCoverInLargeGraphsByParallelKernelization.pdf
    Wanru Gao, Friedrich, Tobias, Kötzing, Timo, Neumann, Frank Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. Australasian Conference on Artificial Intelligence (AUSAI) 2017: 131-143
     
  • p25-friedrich_foga17.pdf
    Tobias Friedrich, Kötzing, Timo, Quinzan, Francesco, Sutton, Andrew Michael Resampling vs Recombination: a Statistical Run Time Estimation. Foundations of Genetic Algorithms (FOGA) 2017: 25-35
     
  • p1407-shi_proc.pdf
    Feng Shi, Schirneck, Martin, Friedrich, Tobias, Kötzing, Timo, Neumann, Frank Reoptimization Times of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Genetic and Evolutionary Computation Conference (GECCO) 2017: 1407-1414
     
  • 0001KRS17.pdf
    Tobias Friedrich, Krohmer, Anton, Rothenberger, Ralf, Sutton, Andrew M. Phase Transitions for Scale-Free SAT Formulas. Association for the Advancement of Artificial Intelligence (AAAI) 2017: 3893-3899
     
  • p37-pourhassan_foga17.pdf
    Mojgan Pourhassan, Friedrich, Tobias, Neumann, Frank On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. Foundations of Genetic Algorithms (FOGA) 2017: 37-44
     
  • OnTheConnectionBetweenIntervalSizeFunctionsAndPathCounting.pdf
    Evangelos Bampas, Göbel, Andreas-Nikolas, Pagourtzis, Aris, Tentes, Aris On the connection between interval size functions and path counting. Computational Complexity 2017: 421-467
     
  • KoetzingSchirneckSeidel-2017-NormalFormsInSemanticLanguageLearning.pdf
    Timo Kötzing, Schirneck, Martin, Seidel, Karen Normal Forms in Semantic Language Identification. International Conference on Algorithmic Learning Theory (ALT) 2017: 493-516
     
  • MinimizingMaximumWeightedFlowTimeOnRelatedAndUnrelatedMachinesJournal.pdf
    S. Anand, Bringmann, Karl, Friedrich, Tobias, Garg, Naveen, Kumar, Amit Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica 2017: 515-536
     
  • p65-krejca_foga17.pdf
    Martin S. Krejca, Witt, Carsten Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax. Foundations of Genetic Algorithms (FOGA) 2017: 65-79
     
  • p1359-doerr_proc.pdf
    Benjamin Doerr, Fischbeck, Philipp, Frahnow, Clemens, Friedrich, Tobias, Kötzing, Timo, Schirneck, Martin Island Models Meet Rumor Spreading. Genetic and Evolutionary Computation Conference (GECCO) 2017: 1359-1366
     
  • 2017cec-mvcportfolio.pdf
    Markus Wagner, Friedrich, Tobias, Lindauer, Marius Improving local search in a minimum vertex cover solver for classes of networks. Congress on Evolutionary Computation (CEC) 2017
     
  • how_to_draw_planarization.pdf
    Thomas Bläsius, Radermacher, Marcel, Rutter, Ignaz How to Draw a Planarization. Software Seminar (SOFSEM) 2017: 295-308
     
  • leseprobe_rheinwerk_fit_fuers_studium_informatik.pdf
    Arne Boockmeyer, Fischbeck, Philipp, Neubert, Stefan Fit fürs Studium - Informatik. 2017Rheinwerk Computing.
     
  • EfficientBestResponseComputationEfficientBestResponseComputationForStrategicNetworkFormationUnderAttack.pdf
    Tobias Friedrich, Ihde, Sven, Keßler, Christoph, Lenzner, Pascal, Neubert, Stefan, Schumann, David Efficient Best Response Computation for Strategic Network Formation under Attack. Symposium on Algorithmic Game Theory (SAGT) 2017: 199-211
     
  • thesis_Goebel.pdf
    Andreas Göbel Counting, Modular Counting and Graph Homomorphisms. 2017
     
  • 978-3-319-29221-2_6.pdf
    Katrin Casel, Fernau, Henning, Grigoriev, Alexander, Schmid, Markus L., Whitesides, Sue Combinatorial Properties and Recognition of Unit Square Visibility Graphs. International Symposium on Mathematical Foundations of Computer Science (MFCS) 2017: 30:1-30:15
     
  • p321-friedrich.pdf
    Tobias Friedrich, Ihde, Sven, Keßler, Christoph, Lenzner, Pascal, Neubert, Stefan, Schumann, David Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack. Symposium on Parallelism in Algorithms and Architectures (SPAA) 2017: 321-323
     
  • BoundsOnTheSatisfiabilityThresholdForPowerLawDistributedRandomSAT.pdf
    Tobias Friedrich, Krohmer, Anton, Rothenberger, Ralf, Sauerwald, Thomas, Sutton, Andrew M. Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. European Symposium on Algorithms (ESA) 2017: 37:1-37:15
     
  • p921-doerr_proc.pdf
    Benjamin Doerr, Kötzing, Timo, Lagodzinski, J. A. Gregor, Lengler, Johannes Bounding Bloat in Genetic Programming. Genetic and Evolutionary Computation Conference (GECCO) 2017: 921-928
     
  • AutomaticLearningFromRepetitiveText.pdf
    Rupert Hölzl, Jain, Sanjay, Schlicht, Philipp, Seidel, Karen, Stephan, Frank Automatic Learning from Repetitive Texts. International Conference on Algorithmic Learning Theory (ALT) 2017: 129-150
     
  • p235-chauhan_proc.pdf
    Ankit Chauhan, Friedrich, Tobias, Quinzan, Francesco Approximating Optimization Problems using EAs on Scale-Free Networks. Genetic and Evolutionary Computation Conference (GECCO) 2017: 235-242
     
  • p313-friedrich_poster.pdf
    Tobias Friedrich, Kötzing, Timo, Melnichenko, Anna Analyzing Search Heuristics with Differential Equations. Genetic and Evolutionary Computation Conference (GECCO) 2017: 313-314
     
  • p45-friedrich_foga17.pdf
    Tobias Friedrich, 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: 45-54
     
  • a5-galanis.pdf
    Andreas Galanis, Göbel, Andreas, Goldberg, Leslie Ann, Lapinskas, John, Richerby, David Amplifiers for the Moran Process. Journal of the ACM 2017: 5:1-5:90
     
  • 0001K017.pdf
    Tobias Friedrich, Kötzing, Timo, Wagner, Markus A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. Association for the Advancement of Artificial Intelligence (AAAI) 2017: 801-807
     

2016

  • weak_total_resolvability_in_graphs.pdf
    Katrin Casel, Estrada-Moreno, Alejandro, Fernau, Henning, Rodríguez-Velázquez, Juan Alberto Weak total resolvability in graphs. Discussiones Mathematicae Graph Theory 2016: 185-210
     
  • 978-3-319-44543-4_19.pdf
    Cristina Bazgan, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning, Jansen, Klaus, Klein, Kim-Manuel, Lampis, Michael, Liedloff, Mathieu, Monnot, Jérôme, Paschos, Vangelis Th. Upper Domination: Complexity and Approximation. Combinatorial Algorithms (IWOCA) 2016: 241-252
     
  • Kötzing_Schirneck_Towards_an_Atlas_of_Computational_Learning.pdf
    Timo Kötzing, Schirneck, Martin Towards an Atlas of Computational Learning Theory. Symposium on Theoretical Aspects of Computer Science (STACS) 2016: 47:1-47:13
     
  • TopologicalSeparationsInInductiveInferenceJournal.pdf
    John Case, Kötzing, Timo Topological Separations in Inductive Inference. Theoretical Computer Science 2016: 33-45
     
  • TheRightMutationStrengthForMulti-ValuedDecisionVariables.pdf
    Benjamin Doerr, 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
    Thomas Bläsius, Friedrich, Tobias, Schirneck, Martin The Parameterized Complexity of Dependency Detection in Relational Databases. International Symposium on Parameterized and Exact Computation (IPEC) 2016: 6:1-6:13
     
  • TheBenefitOfRecombinationInNoisyEvolutionarySearchGecco.pdf
    Tobias Friedrich, 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
    Andrew M. Sutton Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems. Algorithmica 2016: 507-528
     
  • StronglyNonUShapedLanguageLearningResultsByGeneralTechniquesJournal.pdf
    John Case, Kötzing, Timo Strongly non-U-shaped language learning results by general techniques. Information and Computation 2016: 1-15
     
  • SimultaneousPq-OrderingWithApplicationsToConstrainedEmbeddingProblems.pdf
    Thomas Bläsius, Rutter, Ignaz Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems. Transactions on Algorithms 2016: 16
     
  • ScaleFreeNetworksHyperbolicGeometryAndEfficientAlgorithms.pdf
    Tobias Friedrich Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms. Symposium on Mathematical Foundations of Computer Science (MFCS) 2016: 4:1-4:3
     
  • ScalableExactVisualizationOfIsocontoursInRoadNetworksViaMinimum-LinkPaths.pdf
    Moritz Baum, 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
    Christian Gießen, Kötzing, Timo Robustness of Populations in Stochastic Environments. Algorithmica 2016: 462-489
     
  • RobustnessOfAntColonyOptimizationToNoiseJournal.pdf
    Tobias Friedrich, 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
    Benjamin Doerr, 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
    Tobias Arndt, Hafner, Danijar, Kellermeier, Thomas, Krogmann, Simon, Razmjou, Armin, Krejca, Martin S., Rothenberger, Ralf, Friedrich, Tobias Probabilistic Routing for On-Street Parking Search. European Symposium on Algorithms (ESA) 2016: 6:1-6:13
     
  • OrthogonalGraphDrawingsWithInflexibleEdges.pdf
    Thomas Bläsius, Lehmann, Sebastian, Rutter, Ignaz Orthogonal Graph Drawing with Inflexible Edges. Computational Geometry 2016: 26-40
     
  • OptimalOrthogonalGraphDrawingWithConvexBendCostsJournal.pdf
    Thomas Bläsius, Rutter, Ignaz, Wagner, Dorothea Optimal Orthogonal Graph Drawing with Convex Bend Costs. Transactions on Algorithms 2016: 33
     
  • OnTheRoleOfUpdateConstraintsAndTextTypesInIterativeLearningJournal.pdf
    Sanjay Jain, 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
    Tobias Friedrich, Kötzing, Timo, Sutton, Andrew M. On the Robustness of Evolving Populations. Parallel Problem Solving From Nature (PPSN) 2016: 771-781
     
  • 978-3-319-29221-2_6.pdf
    Katrin Casel, Fernau, Henning, Gaspers, Serge, Gras, Benjamin, Schmid, Markus L. On the Complexity of Grammar-Based Compression over Fixed Alphabets. International Colloquium on Automata, Languages, and Programming (ICALP) 2016: 122:1-122:14
     
  • 978-3-319-29221-2_6.pdf
    Cristina Bazgan, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning On the Complexity Landscape of the Domination Chain. Algorithms and Discrete Applied Mathematics (CALDAM) 2016: 61-72
     
  • OnSelfishCreationOfRobustNetworks.pdf
    Ankit Chauhan, Lenzner, Pascal, Melnichenko, Anna, Münn, Martin On Selfish Creation of Robust Networks. Symposium on Algorithmic Game Theory (SAGT) 2016: 141-152
     
  • HyperbolicRandomGraphsSeparatorsAndTreewidth.pdf
    Thomas Bläsius, Friedrich, Tobias, Krohmer, Anton Hyperbolic Random Graphs: Separators and Treewidth. European Symposium on Algorithms (ESA) 2016: 15:1-15:16
     
  • Chauhan0R16.pdf
    Ankit Chauhan, Friedrich, Tobias, Rothenberger, Ralf Greed is Good for Deterministic Scale-Free Networks. Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2016: 33:1-33:15
     
  • Graceful.pdf
    Tobias Friedrich, 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
    Wanru Gao, 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
    Tobias Friedrich, 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
    Duc-Cuong Dang, 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
    Sanjay Jain, Kötzing, Timo, Stephan, Frank Enlarging learnable classes. Information and Computation 2016: 194-207
     
  • EmergenceOfDiversityAndItsBenefitsForCrossoverInGeneticAlgorithms.pdf
    Duc-Cuong Dang, 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
    Thomas Bläsius, 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
     
  • FriedrichKK16.pdf
    Tobias Friedrich, Kötzing, Timo, Krejca, Martin S. EDAs cannot be Balanced and Stable. Genetic and Evolutionary Computation Conference (GECCO) 2016: 1139-1146
     
  • a12-gobel.pdf
    Andreas Göbel, Goldberg, Leslie Ann, Richerby, David Counting Homomorphisms to Square-Free Graphs, Modulo 2. Transactions on Computation Theory 2016: 12:1-12:29
     
  • ConcentrationOfFirstHittingTimesUnderAdditiveDriftJournal.pdf
    Timo Kötzing Concentration of First Hitting Times Under Additive Drift. Algorithmica 2016: 490-506
     
  • LIPIcs-ISAAC-2016-4.pdf
    Faisal N. Abu-Khzam, Bazgan, Cristina, Casel, Katrin, Fernau, Henning Building Clusters with Lower-Bounded Sizes. International Symposium on Algorithms and Computation (ISAAC) 2016: 4:1-4:13
     
  • AntColonyOptimizationBeatsResamplingOnNoisyFunctions.pdf
    Tobias Friedrich, 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
    Andreas Galanis, 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
     
  • 978-3-319-29221-2_6.pdf
    Cristina Bazgan, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning, Jansen, Klaus, Klein, Kim-Manuel, Lampis, Michael, Liedloff, Mathieu, Monnot, Jérôme, Paschos, Vangelis Th. Algorithmic Aspects of Upper Domination: A Parameterised Perspective. Algorithmic Aspects in Information and Management (AAIM) 2016: 113-124
     
  • new-perspective-on-clustered-planarity.pdf
    Thomas Bläsius, Rutter, Ignaz A new perspective on clustered planarity as a combinatorial embedding problem. Theoretical Computer Science 2016: 306-315
     
  • AMapOfUpdateConstraintsInInductiveInferenceJournal.pdf
    Timo Kötzing, Palenta, Raphaela A map of update constraints in inductive inference. Theoretical Computer Science 2016: 4-24
     

2015

  • UnboundedDiscrepancyOfDeterministicRandomWalksOnGrids.pdf
    Tobias Friedrich, Katzmann, Maximilian, Krohmer, Anton Unbounded Discrepancy of Deterministic Random Walks on Grids. International Symposium on Algorithms and Computation (ISAAC) 2015: 212-222
     
  • UnbiasedBlackBoxComplexitiesOfJumpFunctionsJournal.pdf
    Benjamin Doerr, Doerr, Carola, Kötzing, Timo Unbiased Black-Box Complexities of Jump Functions. Evolutionary Computation 2015: 641-670
     
  • Ultra-FastLoadBalancingOnScale-FreeNetworks.pdf
    Karl Bringmann, 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
    Tiago Paixão, 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
    Tobias Friedrich, 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
    Benjamin Doerr, 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
     
  • SeedingTheInitialPopulationOfMultiObjectiveEvolutionaryAlgorithmsAComputationalStudyJournal.pdf
    Tobias Friedrich, Wagner, Markus Seeding the initial population of multi-objective evolutionary algorithms: A computational study. Applied Soft Computing 2015: 223-230
     
  • RobustnessOfAntColonyOptimizationToNoise.pdf
    Tobias Friedrich, 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
     
  • RandomizedDiffusionForIndivisibleLoadsJournal.pdf
    Petra Berenbrink, Cooper, Colin, Friedetzky, Tom, Friedrich, Tobias, Sauerwald, Thomas Randomized diffusion for indivisible loads. Journal of Computer and System Sciences 2015: 159-185
     
  • PopulationSizeMattersRigorousRuntimeResultsForMaximizingTheHypervolumeIndicatorJournal.pdf
    Anh Quang Nguyen, Sutton, Andrew M., Neumann, Frank Population size matters: Rigorous runtime results for maximizing the hypervolume indicator. Theoretical Computer Science 2015: 24-36
     
  • PixelAndVoxelRepresentationsOfGraphs.pdf
    Md. Jawaherul Alam, Bläsius, Thomas, Rutter, Ignaz, Ueckerdt, Torsten, Wolff, Alexander Pixel and Voxel Representations of Graphs. Graph Drawing (GD) 2015: 472-486
     
  • ParameterizedCliqueOnInhomogeneousRandomGraphsJournal.pdf
    Tobias Friedrich, Krohmer, Anton Parameterized clique on inhomogeneous random graphs. Discrete Applied Mathematics 2015: 130-138
     
  • ParameterizedAnaloguesOfProbabilisticComputation.pdf
    Ankit Chauhan, Rao, B. V. Raghavendra Parameterized Analogues of Probabilistic Computation. Conference on Algorithms and Discrete Applied Mathematics (CALDAM) 2015: 181-192
     
  • OrthogonalGraphDrawingWithInflexibleEdges.pdf
    Thomas Bläsius, Lehmann, Sebastian, Rutter, Ignaz Orthogonal Graph Drawing with Inflexible Edges. Conference on Algorithms and Complexity (CIAC) 2015: 61-73
     
  • OnTheKernelSizeOfCliqueCoverReductionsForRandomInteresectionGraphs.pdf
    Tobias Friedrich, Hercher, Christian On the kernel size of clique cover reductions for random intersection graphs. Journal of Discrete Algorithms 2015: 128-136
     
  • OnTheDiameterOfHyperbolicRandomGraphs.pdf
    Tobias Friedrich, Krohmer, Anton On the Diameter of Hyperbolic Random Graphs. International Colloquium on Automata, Languages and Programming (ICALP) 2015: 614-625
     
  • FountoulakisFH15.pdf
    Nikolaos Fountoulakis, Friedrich, Tobias, Hermelin, Danny On the average-case complexity of parameterized clique. Theoretical Computer Science 2015: 18-29
     
  • SchirneckThesis2015.pdf
    Martin Schirneck On Restrictions in Computational Language Learning. 2015
     
  • Blaesius_Thomas_diss.pdf
    Thomas Bläsius New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity. 2015
     
  • NetworkCreationGamesThinkGlobal-ActLocal.pdf
    Andreas Cord-Landwehr, Lenzner, Pascal Network Creation Games: Think Global - Act Local. Mathematical Foundations of Computer Science (MFCS) 2015: 248-260
     
  • MultiplicativeApproximationsOptimalHypervolumeDistributionsAndTheChoiceOfTheReferencePointJournal.pdf
    Tobias Friedrich, Neumann, Frank, Thyssen, Christian Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. Evolutionary Computation 2015: 131-159
     
  • FriedrichN15.pdf
    Tobias Friedrich, Neumann, Frank Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms. Evolutionary Computation 2015: 543-558
     
  • ImprovedRuntimeBoundsForThe(1+1)EaOnRandom3-CnfFormulasBasedOnFitness-DistanceCorrelation.pdf
    Benjamin Doerr, 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
     
  • GeneticAndEvolutionaryComputation2015Journal.pdf
    Tobias Friedrich, He, Jun, Jansen, Thomas, Moraglio, Alberto Genetic and Evolutionary Computation. Theoretical Computer Science 2015: 1-2
     
  • FitnessProbabilityDistributionOfBit-FlipMutation.pdf
    Francisco Chicano, Sutton, Andrew M., Whitley, L. Darrell, Alba, Enrique Fitness Probability Distribution of Bit-Flip Mutation. Evolutionary Computation 2015: 217-248
     
  • FastLearningOfRestrictedRegularExpressionsAndDTDsJournal.pdf
    Dominik D. Freydenberger, Kötzing, Timo Fast Learning of Restricted Regular Expressions and DTDs. Theory of Computing Systems 2015: 1114-1158
     
  • 0007BFN15.pdf
    Markus Wagner, Bringmann, Karl, Friedrich, Tobias, Neumann, Frank Efficient optimization of many objectives by approximation-guided evolution. European Journal of Operational Research 2015: 465-479
     
  • BringmannFK15.pdf
    Karl Bringmann, Friedrich, Tobias, Klitzke, Patrick Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator. Congress on Evolutionary Computation (CEC) 2015: 970-977