Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

All publications in 2014

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


Conference Publications

2014

  • AMapOfUpdateConstraintsInInductiveInference.pdf
    Kötzing, Timo; Palenta, Raphaela A Map of Update Constraints in Inductive Inference. Algorithmic Learning Theory (ALT) 2014: 40-54
     
  • OnTheRoleOfUpdateConstraintsAndText-TypesInIterativeLearning.pdf
    Jain, Sanjay; Kötzing, Timo; Ma, Junqi; Stephan, Frank On the Role of Update Constraints and Text-Types in Iterative Learning. Algorithmic Learning Theory (ALT) 2014: 55-69
     
  • 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
     
  • 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
     
  • 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
     
  • ANewPerspectiveOnClusteredPlanarityAsACombinatorialEmbeddingProblem.pdf
    Bläsius, Thomas; Rutter, Ignaz A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem. Graph Drawing (GD) 2014: 440-451
     
  • 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
     
  • 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
     
  • 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
     
  • RobustnessOfPopulationsInStochasticEnvironments1.pdf
    Gießen, Christian; Kötzing, Timo Robustness of populations in stochastic environments. Genetic and Evolutionary Computation Conference (GECCO) 2014: 1383-1390
     
  • ConcentrationOfFirstHittingTimesUnderAdditiveDrift.pdf
    Kötzing, Timo Concentration of first hitting times under additive drift. Genetic and Evolutionary Computation Conference (GECCO) 2014: 1391-1398
     
  • 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
     
  • FriedrichN14.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
    Nominated for Best Paper Award
     
  • 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
     
  • 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
     
  • ASolutionToWiehagensThesis.pdf
    Kötzing, Timo A Solution to Wiehagen's Thesis. Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 494-505
     

Journal Publications

2014

  • OrthogonalGraphDrawingWithFlexibilityConstraints.pdf
    Bläsius, Thomas; Krug, Marcus; Rutter, Ignaz; Wagner, Dorothea Orthogonal Graph Drawing with Flexibility Constraints. Algorithmica 2014: 859-885
     
  • TheUnbiasedBlack-BoxComplexityOfPartitionIsPolynomial.pdf
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo The unbiased black-box complexity of partition is polynomial. Artificial Intelligence 2014: 275-286
     
  • TestingMutualDualityOfPlanarGraphsJournal.pdf
    Angelini, Patrizio; Bläsius, Thomas; Rutter, Ignaz Testing Mutual duality of Planar graphs. Computational Geometry and Applications 2014: 325-346
     
  • 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
     
  • ConvergenceOfHypervolumeBasedArchivingAlgorithmsJournal.pdf
    Bringmann, Karl; Friedrich, Tobias Convergence of Hypervolume-Based Archiving Algorithms. IEEE Transactions on Evolutionary Computation 2014: 643-657
     
  • GeneticAndEvolutionaryComputation2014Journal.pdf
    Friedrich, Tobias; Rowe, Jonathan E. Genetic and Evolutionary Computation. Theoretical Computer Science 2014: 1
     
  • 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
     
  • 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 2014: 94-107
     
  • IterativeLearningFromPositiveDataAndCountersJournal.pdf
    Kötzing, Timo Iterative learning from positive data and counters. Theoretical Computer Science 2014: 155-169
     
  • QuasirandomRumorSpreadingJournal.pdf
    Doerr, Benjamin; Friedrich, Tobias; Sauerwald, Thomas Quasirandom Rumor Spreading. Transactions on Algorithms 2014: 9:1-9:35
     
  • 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