Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
 

All publications in 2016

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


Conference Publications

2016

  • Algorithmic Aspects of Up... - Download
    Bazgan, Cristina; 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 PerspectiveAlgorithmic Aspects in Information and Management (AAIM) 2016: 113–124
     
  • On the Complexity Landsca... - Download
    Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning On the Complexity Landscape of the Domination ChainAlgorithms and Discrete Applied Mathematics (CALDAM) 2016: 61–72
     
  • Probabilistic Routing for... - Download
    Arndt, Tobias; Hafner, Danijar; Kellermeier, Thomas; Krogmann, Simon; Razmjou, Armin; Krejca, Martin S.; Rothenberger, Ralf; Friedrich, Tobias Probabilistic Routing for On-Street Parking SearchEuropean Symposium on Algorithms (ESA) 2016: 6:1–6:13
     
  • Scalable Exact Visualizat... - Download
    Baum, Moritz; Bläsius, Thomas; Gemsa, Andreas; Rutter, Ignaz; Wegner, Franziska Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link PathsEuropean Symposium on Algorithms (ESA) 2016: 7:1–7:18
     
  • Hyperbolic Random Graphs:... - Download
    Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton Hyperbolic Random Graphs: Separators and TreewidthEuropean Symposium on Algorithms (ESA) 2016: 15:1–15:16
     
  • Efficient Embedding of Sc... - Download
    Bläsius, Thomas; Friedrich, Tobias; Krohmer, Anton; Laue, Sören Efficient Embedding of Scale-Free Graphs in the Hyperbolic PlaneEuropean Symposium on Algorithms (ESA) 2016: 16:1–16:18
    EATCS Best Paper Award
     
  • Greed is Good for Determi... - Download
    Chauhan, Ankit; Friedrich, Tobias; Rothenberger, Ralf Greed is Good for Deterministic Scale-Free NetworksFoundations of Software Technology and Theoretical Computer Science (FSTTCS) 2016: 33:1–33:15
     
  • Ant Colony Optimization B... - Download
    Friedrich, Tobias; Kötzing, Timo; Quinzan, Francesco; Sutton, Andrew M. Ant Colony Optimization Beats Resampling on Noisy FunctionsGenetic and Evolutionary Computation Conference (GECCO) 2016: 3–4
     
  • The Benefit of Recombinat... - Download
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. The Benefit of Recombination in Noisy Evolutionary SearchGenetic and Evolutionary Computation Conference (GECCO) 2016: 161–162
     
  • Escaping Local Optima wit... - Download
    Dang, Duc-Cuong; 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 CrossoverGenetic and Evolutionary Computation Conference (GECCO) 2016: 645–652
     
  • Fast Building Block Assem... - Download
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Nallaperuma, Samadhi; Neumann, Frank; Schirneck, Martin Fast Building Block Assembly by Majority Vote CrossoverGenetic and Evolutionary Computation Conference (GECCO) 2016: 661–668
     
  • The Right Mutation Streng... - Download
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo The Right Mutation Strength for Multi-Valued Decision VariablesGenetic and Evolutionary Computation Conference (GECCO) 2016: 1115–1122
     
  • EDAs cannot be Balanced a... - Download
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S. EDAs cannot be Balanced and StableGenetic and Evolutionary Computation Conference (GECCO) 2016: 1139–1146
     
  • Line Planning on Path Net... - Download
    Borndörfer, Ralf; Arslan, Oytun; Elijazyfer, Ziena; Güler, Hakan; Renken, Malte; Şahin, Güvenç; Schlechte, Thomas Line Planning on Path Networks with Application to the Istanbul MetrobüsGerman Operations Research Society (GOR) 2016: 235–241
     
  • Amplifiers for the Moran ... - Download
    Galanis, Andreas; Göbel, Andreas; Goldberg, Leslie-Ann; Lapinskas, John; Richerby, David Amplifiers for the Moran ProcessInternational Colloquium on Automata, Languages and Programming (ICALP) 2016: 62:1–62:13
     
  • On the Complexity of Gram... - Download
    Casel, Katrin; Fernau, Henning; Gaspers, Serge; Gras, Benjamin; Schmid, Markus L. On the Complexity of Grammar-Based Compression over Fixed AlphabetsInternational Colloquium on Automata, Languages, and Programming (ICALP) 2016: 122:1–122:14
     
  • Cseh, Ágnes; Kavitha, Telikepalli Popular Edges and Dominant MatchingsInternational Conference on Integer Programming and Combinatorial Optimization (IPCO) 2016: 138–151
     
  • On the Parameterized Comp... - Download
    Issac, Davis; Chandran, L. Sunil; Karrenbauer, Andreas On the Parameterized Complexity of Biclique Cover and PartitionInternational Symposium on Parameterized and Exact Computation (IPEC) 2016: 1–13
     
  • The Parameterized Complex... - Download
    Bläsius, Thomas; Friedrich, Tobias; Schirneck, Martin The Parameterized Complexity of Dependency Detection in Relational DatabasesInternational Symposium on Parameterized and Exact Computation (IPEC) 2016: 6:1–6:13
     
  • Building Clusters with Lo... - Download
    Abu-Khzam, Faisal N.; Bazgan, Cristina; Casel, Katrin; Fernau, Henning Building Clusters with Lower-Bounded SizesInternational Symposium on Algorithms and Computation (ISAAC) 2016: 4:1–4:13
     
  • Upper Domination: Complex... - Download
    Bazgan, Cristina; 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 ApproximationInternational Workshop on Combinatorial Algorithms (IWOCA) 2016: 241–252
     
  • Scale-Free Networks, Hype... - Download
    Friedrich, Tobias Scale-Free Networks, Hyperbolic Geometry, and Efficient AlgorithmsSymposium on Mathematical Foundations of Computer Science (MFCS) 2016: 4:1–4:3
    Invited Talk
     
  • Fixed-Parameter Single Ob... - Download
    Gao, Wanru; Friedrich, Tobias; Neumann, Frank Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex CoverParallel Problem Solving From Nature (PPSN) 2016: 740–750
     
  • Graceful Scaling on Unifo... - Download
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Graceful Scaling on Uniform versus Steep-Tailed NoiseParallel Problem Solving From Nature (PPSN) 2016: 761–770
     
  • On the Robustness of Evol... - Download
    Friedrich, Tobias; Kötzing, Timo; Sutton, Andrew M. On the Robustness of Evolving PopulationsParallel Problem Solving From Nature (PPSN) 2016: 771–781
     
  • Provably Optimal Self-Adj... - Download
    Doerr, Benjamin; Doerr, Carola; Kötzing, Timo Provably Optimal Self-Adjusting Step Sizes for Multi-Valued Decision VariablesParallel Problem Solving From Nature (PPSN) 2016: 782–791
     
  • Emergence of Diversity an... - Download
    Dang, Duc-Cuong; 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 AlgorithmsParallel Problem Solving From Nature (PPSN) 2016: 890–900
     
  • On Selfish Creation of Ro... - Download
    Chauhan, Ankit; Lenzner, Pascal; Melnichenko, Anna; Münn, Martin On Selfish Creation of Robust NetworksSymposium on Algorithmic Game Theory (SAGT) 2016: 141–152
     
  • Cseh, Ágnes; Irving, Robert W.; Manlove, David F. The Stable Roommates Problem with Short ListsSymposium Algorithmic Game Theory (SAGT) 2016: 207–219
     
  • Towards an Atlas of Compu... - Download
    Kötzing, Timo; Schirneck, Martin Towards an Atlas of Computational Learning TheorySymposium on Theoretical Aspects of Computer Science (STACS) 2016: 47:1–47:13
     

Journal Publications

2016

  • Robustness of Populations... - Download
    Gießen, Christian; Kötzing, Timo Robustness of Populations in Stochastic EnvironmentsAlgorithmica 2016: 462–489
     
  • Concentration of First Hi... - Download
    Kötzing, Timo Concentration of First Hitting Times Under Additive DriftAlgorithmica 2016: 490–506
     
  • Superpolynomial Lower Bou... - Download
    Sutton, Andrew M. Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial ProblemsAlgorithmica 2016: 507–528
     
  • Marriages are made in cal... - Download
    Cseh, Ágnes Marriages are made in calculationBulletin of the European Association for Theoretical Computer Science 2016: 180–183
     
  • On the Choice of a Geneti... - Download
    Rizzo, Manuel; Battaglia, Francesco On the Choice of a Genetic Algorithm for Estimating GARCH ModelsComputational Economics 2016: 473–485
     
  • Orthogonal Graph Drawing ... - Download
    Bläsius, Thomas; Lehmann, Sebastian; Rutter, Ignaz Orthogonal Graph Drawing with Inflexible EdgesComputational Geometry 2016: 26–40
     
  • Stable Marriage and Roomm... - Download
    Cseh, Ágnes; Manlove, David F. Stable Marriage and Roommates problems with restricted edges: Complexity and approximabilityDiscrete Optimization 2016: 62–89
     
  • Weak total resolvability ... - Download
    Casel, Katrin; Estrada-Moreno, Alejandro; Fernau, Henning; Rodríguez-Velázquez, Juan Alberto Weak total resolvability in graphsDiscussiones Mathematicae Graph Theory 2016: 185–210
     
  • Robustness of Ant Colony ... - Download
    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Sutton, Andrew M. Robustness of Ant Colony Optimization to NoiseEvolutionary Computation 2016: 237–254
     
  • Strongly non-U-shaped lan... - Download
    Case, John; Kötzing, Timo Strongly non-U-shaped language learning results by general techniquesInformation and Computation 2016: 1–15
     
  • 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 LearningInformation and Computation 2016: 152–168
     
  • Enlarging learnable class... - Download
    Jain, Sanjay; Kötzing, Timo; Stephan, Frank Enlarging learnable classesInformation and Computation 2016: 194–207
     
  • Improved algorithmic resu... - Download
    Cseh, Ágnes; Dean, Brian C. Improved algorithmic results for unsplittable stable allocation problemsJournal of Combinatorial Optimization 2016: 657–671
     
  • A map of update constrain... - Download
    Kötzing, Timo; Palenta, Raphaela A map of update constraints in inductive inferenceTheoretical Computer Science 2016: 4–24
     
  • Topological Separations i... - Download
    Case, John; Kötzing, Timo Topological Separations in Inductive InferenceTheoretical Computer Science 2016: 33–45
     
  • A new perspective on clus... - Download
    Bläsius, Thomas; Rutter, Ignaz A new perspective on clustered planarity as a combinatorial embedding problemTheoretical Computer Science 2016: 306–315
     
  • Simultaneous PQ-Ordering ... - Download
    Bläsius, Thomas; Rutter, Ignaz Simultaneous PQ-Ordering with Applications to Constrained Embedding ProblemsTransactions on Algorithms 2016: 16
     
  • Optimal Orthogonal Graph ... - Download
    Bläsius, Thomas; Rutter, Ignaz; Wagner, Dorothea Optimal Orthogonal Graph Drawing with Convex Bend CostsTransactions on Algorithms 2016: 33
     
  • Counting Homomorphisms to... - Download
    Göbel, Andreas; Goldberg, Leslie Ann; Richerby, David Counting Homomorphisms to Square-Free Graphs, Modulo 2Transactions on Computation Theory 2016: 12:1–12:29
     

Editorships

2016

  • Friedrich, Tobias; Neumann, Frank; Sutton, Andrew M. Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20-24, 2016, Companion Material Proceedings 2016 ACM.
    Editorship
     
  • Friedrich, Tobias; Neumann, Frank; Sutton, Andrew M. Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20 - 24, 2016 2016 ACM.
    Editorship