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

  • A Map of Update Constrain... - Download
    Kötzing, Timo; Palenta, Raphaela A Map of Update Constraints in Inductive InferenceAlgorithmic Learning Theory (ALT) 2014: 40–54
     
  • On the Role of Update Con... - Download
    Jain, Sanjay; Kötzing, Timo; Ma, Junqi; Stephan, Frank On the Role of Update Constraints and Text-Types in Iterative LearningAlgorithmic Learning Theory (ALT) 2014: 55–69
     
  • Counting List Matrix Part... - Download
    Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki Counting List Matrix Partitions of GraphsConference on Computational Complexity (CCC) 2014: 56–65
     
  • Complexity of Higher-Degr... - Download
    Bläsius, Thomas; Brückner, Guido; Rutter, Ignaz Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky ModelEuropean Symposium on Algorithms (ESA) 2014: 161–172
     
  • De-anonymization of Heter... - Download
    Bringmann, Karl; Friedrich, Tobias; Krohmer, Anton De-anonymization of Heterogeneous Random Graphs in Quasilinear TimeEuropean Symposium on Algorithms (ESA) 2014: 197–208
     
  • A Fixed-Parameter Approac... - Download
    Casel, Katrin A Fixed-Parameter Approach for Privacy-Protection with Global RecodingFrontiers in Algorithmics (FAW) 2014: 25–35
     
  • A New Perspective on Clus... - Download
    Bläsius, Thomas; Rutter, Ignaz A New Perspective on Clustered Planarity as a Combinatorial Embedding ProblemGraph Drawing (GD) 2014: 440–451
     
  • Efficient identification ... - Download
    Chicano, Francisco; Whitley, Darrell; Sutton, Andrew M. Efficient identification of improving moves in a ball for pseudo-boolean problemsGenetic and Evolutionary Computation Conference (GECCO) 2014: 437–444
     
  • Two-dimensional subset se... - Download
    Bringmann, Karl; Friedrich, Tobias; Klitzke, Patrick Two-dimensional subset selection for hypervolume and epsilon-indicatorGenetic and Evolutionary Computation Conference (GECCO) 2014: 589–596
     
  • Unbiased black-box comple... - Download
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Unbiased black-box complexities of jump functions: how to cross large plateausGenetic and Evolutionary Computation Conference (GECCO) 2014: 769–776
     
  • Robustness of populations... - Download
    Gießen, Christian; Kötzing, Timo Robustness of populations in stochastic environmentsGenetic and Evolutionary Computation Conference (GECCO) 2014: 1383–1390
     
  • Concentration of first hi... - Download
    Kötzing, Timo Concentration of first hitting times under additive driftGenetic and Evolutionary Computation Conference (GECCO) 2014: 1391–1398
     
  • Generic Postprocessing vi... - Download
    Bringmann, Karl; Friedrich, Tobias; Klitzke, Patrick Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-IndicatorParallel Problem Solving from Nature (PPSN) 2014: 518–527
     
  • Maximizing Submodular Fun... - Download
    Friedrich, Tobias; Neumann, Frank Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary AlgorithmsParallel Problem Solving from Nature (PPSN) 2014: 922–931
    Nominated for Best Paper Award
     
  • Runtime Analysis of Evolu... - Download
    Sutton, Andrew M.; Neumann, Frank Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF FormulasParallel Problem Solving from Nature (PPSN) 2014: 942–951
     
  • Cseh, Ágnes; Skutella, Martin Paths to Stable AllocationsSymposium Algorithmic Game Theory (SAGT) 2014: 61–73
     
  • Counting Homomorphisms to... - Download
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David Counting Homomorphisms to Cactus Graphs Modulo 2Symposium on Theoretical Aspects of Computer Science (STACS) 2014: 350–361
     
  • A Solution to Wiehagen's ... - Download
    Kötzing, Timo A Solution to Wiehagen’s ThesisSymposium on Theoretical Aspects of Computer Science (STACS) 2014: 494–505
     

Journal Publications

2014

  • Orthogonal Graph Drawing ... - Download
    Bläsius, Thomas; Krug, Marcus; Rutter, Ignaz; Wagner, Dorothea Orthogonal Graph Drawing with Flexibility ConstraintsAlgorithmica 2014: 859–885
     
  • The unbiased black-box co... - Download
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo The unbiased black-box complexity of partition is polynomialArtificial Intelligence 2014: 275–286
     
  • Testing Mutual duality of... - Download
    Angelini, Patrizio; Bläsius, Thomas; Rutter, Ignaz Testing Mutual duality of Planar graphsComputational Geometry and Applications 2014: 325–346
     
  • Parameterized Runtime Ana... - Download
    Sutton, Andrew M.; Neumann, Frank; Nallaperuma, Samadhi Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson ProblemEvolutionary Computation 2014: 595–628
     
  • Genetic and Evolutionary ... - Download
    Friedrich, Tobias; Rowe, Jonathan E. Genetic and Evolutionary ComputationTheoretical Computer Science 2014: 1
     
  • The component model for e... - Download
    Whitley, Darrell; Sutton, Andrew M.; Ochoa, Gabriela; Chicano, Francisco The component model for elementary landscapes and partial neighborhoodsTheoretical Computer Science 2014: 59–75
     
  • The Max problem revisited... - Download
    Kötzing, Timo; Sutton, Andrew M.; Neumann, Frank; O’Reilly, Una-May The Max problem revisited: The importance of mutation in genetic programmingTheoretical Computer Science 2014: 94–107
     
  • Iterative learning from p... - Download
    Kötzing, Timo Iterative learning from positive data and countersTheoretical Computer Science 2014: 155–169
     
  • Quasirandom Rumor Spreadi... - Download
    Doerr, Benjamin; Friedrich, Tobias; Sauerwald, Thomas Quasirandom Rumor SpreadingTransactions on Algorithms 2014: 9:1–9:35
     
  • The complexity of countin... - Download
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David The complexity of counting homomorphisms to cactus graphs modulo 2Transactions on Computation Theory 2014: 17:1–17:29
     
  • Convergence of Hypervolum... - Download
    Bringmann, Karl; Friedrich, Tobias Convergence of Hypervolume-Based Archiving AlgorithmsTransactions on Evolutionary Computation 2014: 643–657