Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

All publications in 2012

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

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


Conference Publications

2012

  • A Parameterized Runtime A... - Download
    Sutton, Andrew M.; Neumann, Frank A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem. Conference on Artificial Intelligence (AAAI) 2012
     
  • Enlarging Learnable Class... - Download
    Jain, Sanjay; Kötzing, Timo; Stephan, Frank Enlarging Learnable Classes. Algorithmic Learning Theory (ALT) 2012: 36-50
     
  • Disconnectivity and Relat... - Download
    Bläsius, Thomas; Rutter, Ignaz Disconnectivity and Relative Positions in Simultaneous Embeddings. Graph Drawing (GD) 2012: 31-42
     
  • Ants easily solve stochas... - Download
    Doerr, Benjamin; Hota, Ashish; Kötzing, Timo Ants easily solve stochastic shortest path problems. Genetic and Evolutionary Computation Conference (GECCO) 2012: 17-24
     
  • Efficient Algorithms for ... - Download
    Baumbach, Jan; Friedrich, Tobias; Kötzing, Timo; Krohmer, Anton; Müller, Joachim; Pauling, Josch Efficient Algorithms for Extracting Biological Key Pathways with Global Constraints. Genetic and Evolutionary Computation Conference (GECCO) 2012: 169-176
     
  • A parameterized runtime a... - Download
    Sutton, Andrew M.; Day, Jareth; Neumann, Frank A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT. Genetic and Evolutionary Computation Conference (GECCO) 2012: 433-440
     
  • Convergence of hypervolum... - Download
    Bringmann, Karl; Friedrich, Tobias Convergence of hypervolume-based archiving algorithms ii: competitiveness. Genetic and Evolutionary Computation Conference (GECCO) 2012: 457-464
     
  • 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 programming. Genetic and Evolutionary Computation Conference (GECCO) 2012: 1333-1340
     
  • Parameterized Clique on S... - Download
    Friedrich, Tobias; Krohmer, Anton Parameterized Clique on Scale-Free Networks. International Symposium on Algorithms and Computation (ISAAC) 2012: 659-668
     
  • Experimental Analysis of ... - Download
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Experimental Analysis of Rumor Spreading in Social Networks. Mediterranean Conference on Algorithms (MedAlg) 2012: 159-173
     
  • A Parameterized Runtime A... - Download
    Sutton, Andrew M.; Neumann, Frank A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling. Parallel Problem Solving from Nature (PPSN) 2012: 52-61
     
  • ACO Beats EA on a Dynamic... - Download
    Kötzing, Timo; Molter, Hendrik ACO Beats EA on a Dynamic Pseudo-Boolean Function. Parallel Problem Solving from Nature (PPSN) 2012: 113-122
     
  • Deliberative Acceptabilit... - Download
    Croitoru, Cosmina; Kötzing, Timo Deliberative Acceptability of Arguments. Starting AI Researcher Symposium (STAIRS) 2012: 71-82
     
  • Asynchronous Rumor Spread... - Download
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Asynchronous Rumor Spreading in Preferential Attachment Graphs. Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) 2012: 307-315
     
  • Greedy Selfish Network Cr... - Download
    Lenzner, Pascal Greedy Selfish Network Creation. Web and Internet Economics (WINE) 2012: 142-155
     

Journal Publications

2012

  • Why rumors spread so quic... - Download
    Doerr, Benjamin; Fouz, Mahmoud; Friedrich, Tobias Why rumors spread so quickly in social networks. Communications of the ACM 2012: 70-75
     
  • Learning secrets interact... - Download
    Case, John; Kötzing, Timo Learning secrets interactively. Dynamic modeling in inductive inference. Information and Computation 2012: 60-73
     
  • Efficient Key Pathway Min... - Download
    Alcaraz, Nicolas; Friedrich, Tobias; Kötzing, Timo; Krohmer, Anton; Müller, Joachim; Pauling, Josch; Baumbach, Jan Efficient Key Pathway Mining: Combining Networks and OMICS Data. Integrative Biology 2012: 756-764
     
  • Computability-Theoretic L... - Download
    Case, John; Kötzing, Timo Computability-Theoretic Learning Complexity. Philosophical Transactions of the Royal Society A 2012: 3570-3596
     
  • Quasirandom Load Balancin... - Download
    Friedrich, Tobias; Gairing, Martin; Sauerwald, Thomas Quasirandom Load Balancing. SIAM Journal of Computing 2012: 747-771
     
  • Theoretical analysis of t... - Download
    Kötzing, Timo; Neumann, Frank; Röglin, Heiko; Witt, Carsten Theoretical analysis of two ACO approaches for the traveling salesman problem. Swarm Intelligence 2012: 1-21
     
  • Convergence of Set-Based ... - Download
    Berghammer, Rudolf; Friedrich, Tobias; Neumann, Frank Convergence of Set-Based Multi-Objective Optimization, Indicators and Deteriorative Cycles. Theoretical Computer Science 2012: 2-17
     
  • Computing the moments of ... - Download
    Sutton, Andrew M.; Whitley, L. Darrell; Howe, Adele E. Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time. Theoretical Computer Science 2012: 58-74
     
  • Approximating the least h... - Download
    Bringmann, Karl; Friedrich, Tobias Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Theoretical Computer Science 2012: 104-116
     
  • Learning in the limit wit... - Download
    Heinz, Jeffrey; Kasprzik, Anna; Kötzing, Timo Learning in the limit with lattice-structured hypothesis spaces. Theoretical Computer Science 2012: 111-127