Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
 

All publications in 2015

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


Conference Publications

2015

  • Parameterized Analogues o... - Download
    Chauhan, Ankit; Rao, B. V. Raghavendra Parameterized Analogues of Probabilistic ComputationConference on Algorithms and Discrete Applied Mathematics (CALDAM) 2015: 181–192
     
  • Efficient computation of ... - Download
    Bringmann, Karl; Friedrich, Tobias; Klitzke, Patrick Efficient computation of two-dimensional solution sets maximizing the epsilon-indicatorCongress on Evolutionary Computation (CEC) 2015: 970–977
     
  • Orthogonal Graph Drawing ... - Download
    Bläsius, Thomas; Lehmann, Sebastian; Rutter, Ignaz Orthogonal Graph Drawing with Inflexible EdgesInternational Conference on Algorithms and Complexity (CIAC) 2015: 61–73
     
  • (1+1) EA on Generalized D... - Download
    Kötzing, Timo; Lissovoi, Andrei; Witt, Carsten (1+1) EA on Generalized Dynamic OneMaxFoundations of Genetic Algorithms (FOGA) 2015: 40–51
     
  • Pixel and Voxel Represent... - Download
    Alam, Md. Jawaherul; Bläsius, Thomas; Rutter, Ignaz; Ueckerdt, Torsten; Wolff, Alexander Pixel and Voxel Representations of GraphsGraph Drawing (GD) 2015: 472–486
     
  • Robustness of Ant Colony ... - Download
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Robustness of Ant Colony Optimization to NoiseGenetic and Evolutionary Computation Conference (GECCO) 2015: 17–24
    Best-Paper Award (ACO/SI Track)
     
  • Solving Problems with Unk... - Download
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Solving Problems with Unknown Solution Length at (Almost) No Extra CostGenetic and Evolutionary Computation Conference (GECCO) 2015: 831–838
     
  • Improved Runtime Bounds f... - Download
    Doerr, Benjamin; Neumann, Frank; Sutton, Andrew M. Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance CorrelationGenetic and Evolutionary Computation Conference (GECCO) 2015: 1415–1422
     
  • Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli Popular Matchings with Two-Sided Preferences and One-Sided TiesInternational Colloquium on Automata, Languages and Programming (ICALP) 2015: 367–379
     
  • Ultra-Fast Load Balancing... - Download
    Bringmann, Karl; Friedrich, Tobias; Hoefer, Martin; Rothenberger, Ralf; Sauerwald, Thomas Ultra-Fast Load Balancing on Scale-Free NetworksInternational Colloquium on Automata, Languages and Programming (ICALP) 2015: 516–527
     
  • On the Diameter of Hyperb... - Download
    Friedrich, Tobias; Krohmer, Anton On the Diameter of Hyperbolic Random GraphsInternational Colloquium on Automata, Languages and Programming (ICALP) 2015: 614–625
     
  • Counting Homomorphisms to... - Download
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David Counting Homomorphisms to Square-Free Graphs, Modulo 2International Colloquium on Automata, Languages, and Programming (ICALP) 2015: 642–653
     
  • Cliques in Hyperbolic Ran... - Download
    Friedrich, Tobias; Krohmer, Anton Cliques in Hyperbolic Random GraphsInternational Conference on Computer Communications (INFOCOM) 2015: 1544–1552
     
  • The Benefit of Recombinat... - Download
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. The Benefit of Recombination in Noisy Evolutionary SearchInternational Symposium of Algorithms and Computation (ISAAC) 2015: 140–150
     
  • Arulselvan, Ashwin; Cseh, Ágnes; Groß, Martin; Manlove, David F.; Matuschke, Jannik Many-to-one Matchings with Lower Quotas: Algorithms and ComplexityInternational Symposium Algorithms and Computation (ISAAC) 2015: 176–187
     
  • Unbounded Discrepancy of ... - Download
    Friedrich, Tobias; Katzmann, Maximilian; Krohmer, Anton Unbounded Discrepancy of Deterministic Random Walks on GridsInternational Symposium on Algorithms and Computation (ISAAC) 2015: 212–222
     
  • Network Creation Games: T... - Download
    Cord-Landwehr, Andreas; Lenzner, Pascal Network Creation Games: Think Global - Act LocalMathematical Foundations of Computer Science (MFCS) 2015: 248–260
     
  • Cseh, Ágnes; Manlove, David F. Stable Marriage and Roommates Problems with Restricted Edges: Complexity and ApproximabilitySymposium Algorithmic Game Theory (SAGT) 2015: 15–26
     
  • Dominating an s-t-Cut in ... - Download
    Rothenberger, Ralf; Grau, Sascha; Rossberg, Michael Dominating an s-t-Cut in a NetworkCurrent Trends in Theory and Practice of Computer Science (SOFSEM) 2015: 401–411
     
  • Patching Physical Objects - Download
    Teibrich, Alexander; Mueller, Stefanie; Guimbretière, François; Kovacs, Robert; Neubert, Stefan; Baudisch, Patrick Patching Physical ObjectsUser Interface Software and Technology (UIST) 2015: 83–91
     

Journal Publications

2015

  • Seeding the initial popul... - Download
    Friedrich, Tobias; Wagner, Markus Seeding the initial population of multi-objective evolutionary algorithms: A computational studyApplied Soft Computing 2015: 223–230
     
  • Disconnectivity and relat... - Download
    Bläsius, Thomas; Rutter, Ignaz Disconnectivity and relative positions in simultaneous embeddingsComputational Geometry 2015: 459–478
     
  • Parameterized clique on i... - Download
    Friedrich, Tobias; Krohmer, Anton Parameterized clique on inhomogeneous random graphsDiscrete Applied Mathematics 2015: 130–138
     
  • Efficient optimization of... - Download
    Wagner, Markus; Bringmann, Karl; Friedrich, Tobias; Neumann, Frank Efficient optimization of many objectives by approximation-guided evolutionEuropean Journal of Operational Research 2015: 465–479
     
  • Multiplicative Approximat... - Download
    Friedrich, Tobias; Neumann, Frank; Thyssen, Christian Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference PointEvolutionary Computation 2015: 131–159
     
  • Fitness Probability Distr... - Download
    Chicano, Francisco; Sutton, Andrew M.; Whitley, L. Darrell; Alba, Enrique Fitness Probability Distribution of Bit-Flip MutationEvolutionary Computation 2015: 217–248
     
  • Maximizing Submodular Fun... - Download
    Friedrich, Tobias; Neumann, Frank Maximizing Submodular Functions under Matroid Constraints by Evolutionary AlgorithmsEvolutionary Computation 2015: 543–558
     
  • Unbiased Black-Box Comple... - Download
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Unbiased Black-Box Complexities of Jump FunctionsEvolutionary Computation 2015: 641–670
     
  • Minimal indices for prede... - Download
    Cohen, Sarel; Fiat, Amos; Hershcovitch, Moshik; Kaplan, Haim Minimal indices for predecessor searchInformation and Computation 2015: 12–30
     
  • On a Linear Diophantine P... - Download
    Batra, Sanjit Singh; Kumar, Nikhil; Tripathi, Amitabha On a Linear Diophantine Problem Involving the Fibonacci and Lucas SequencesIntegers 2015: A26
     
  • Randomized diffusion for ... - Download
    Berenbrink, Petra; Cooper, Colin; Friedetzky, Tom; Friedrich, Tobias; Sauerwald, Thomas Randomized diffusion for indivisible loadsJournal of Computer and System Sciences 2015: 159–185
     
  • On the kernel size of cli... - Download
    Friedrich, Tobias; Hercher, Christian On the kernel size of clique cover reductions for random intersection graphsJournal of Discrete Algorithms 2015: 128–136
     
  • Toward a unifying framewo... - Download
    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 processesJournal of Theoretical Biology 2015: 28–43
     
  • Counting List Matrix Part... - Download
    Göbel, Andreas; Goldberg, Leslie Ann; McQuillan, Colin; Richerby, David; Yamakami, Tomoyuki Counting List Matrix Partitions of GraphsSIAM Journal on Computing 2015: 1089–1118
     
  • Genetic and Evolutionary ... - Download
    Friedrich, Tobias; He, Jun; Jansen, Thomas; Moraglio, Alberto Genetic and Evolutionary ComputationTheoretical Computer Science 2015: 1–2
     
  • On the average-case compl... - Download
    Fountoulakis, Nikolaos; Friedrich, Tobias; Hermelin, Danny On the average-case complexity of parameterized cliqueTheoretical Computer Science 2015: 18–29
     
  • Population size matters: ... - Download
    Nguyen, Anh Quang; Sutton, Andrew M.; Neumann, Frank Population size matters: Rigorous runtime results for maximizing the hypervolume indicatorTheoretical Computer Science 2015: 24–36
     
  • Fast Learning of Restrict... - Download
    Freydenberger, Dominik D.; Kötzing, Timo Fast Learning of Restricted Regular Expressions and DTDsTheory of Computing Systems 2015: 1114–1158