The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Tobias Friedrich 0001" ( http://dblp.L3S.de/Authors/Tobias_Friedrich_0001 )

URL (Homepage):  https://hpi.de/friedrich/  Author page on DBLP  Author page in RDF  Community of Tobias Friedrich 0001 in ASPL-2

Publication years (Num. hits)
2005-2007 (19) 2008-2009 (26) 2010 (23) 2011 (16) 2012-2013 (20) 2014-2015 (27) 2016 (22) 2017 (20) 2018 (20) 2019 (27)
Publication types (Num. hits)
article(100) inproceedings(116) phdthesis(1) proceedings(3)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 39 occurrences of 26 keywords

Results
Found 221 publication records. Showing 220 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Tobias Friedrich 0001, Martin S. Krejca, Ralf Rothenberger, Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou Routing for on-street parking search using probabilistic data. Search on Bibsonomy AI Commun. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich 0001, Timo Kötzing, Martin Schirneck Island Models Meet Rumor Spreading. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Feng Shi 0003, Martin Schirneck, Tobias Friedrich 0001, Timo Kötzing, Frank Neumann 0001 Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca Unbiasedness of estimation-of-distribution algorithms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich 0001, Martin Schirneck Understanding the Effectiveness of Data Reduction in Public Transportation Networks. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Tobias Friedrich 0001, Ralf Rothenberger The Satisfiability Threshold for Non-Uniform Random 2-SAT. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Katrin Casel, Philipp Fischbeck, Tobias Friedrich 0001, Andreas Göbel 0001, J. A. Gregor Lagodzinski Zeros and approximations of Holant polynomials on the complex plane. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich 0001, Maximilian Katzmann Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Davide Bilò, Tobias Friedrich 0001, Pascal Lenzner, Anna Melnichenko Geometric Network Creation Games. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Ulrich Meyer 0001, Manuel Penschuck, Christopher Weyand Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Lukas Behrendt, Katrin Casel, Tobias Friedrich 0001, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Martin Schirneck The Minimization of Random Hypergraphs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Álvaro Parra Bustos, Tat-Jun Chin, Frank Neumann 0001, Tobias Friedrich 0001, Maximilian Katzmann A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Hagen Echzell, Tobias Friedrich 0001, Pascal Lenzner, Louise Molitor, Marcus Pappik, Friedrich Schöne, Fabian Sommer, David Stangl Convergence and Hardness of Strategic Schelling Segregation. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Ulrich Meyer 0001, Manuel Penschuck, Christopher Weyand Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. Search on Bibsonomy ESA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Ralf Rothenberger The Satisfiability Threshold for Non-Uniform Random 2-SAT. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hagen Echzell, Tobias Friedrich 0001, Pascal Lenzner, Louise Molitor, Marcus Pappik, Friedrich Schöne, Fabian Sommer, David Stangl Convergence and Hardness of Strategic Schelling Segregation. Search on Bibsonomy WINE The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich 0001, Martin Schirneck Understanding the Effectiveness of Data Reduction in Public Transportation Networks. Search on Bibsonomy WAW The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Andreas Göbel 0001, Frank Neumann 0001, Francesco Quinzan, Ralf Rothenberger Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. Search on Bibsonomy AAAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vahid Roostapour, Aneta Neumann, Frank Neumann 0001, Tobias Friedrich 0001 Pareto Optimization for Subset Selection with Dynamic Cost Constraints. Search on Bibsonomy AAAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001 From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial). Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Andrew M. Sutton On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. Search on Bibsonomy TACAS (1) The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Carola Doerr, Dirk V. Arnold (eds.) Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2019, Potsdam, Germany, August 27-29, 2019. Search on Bibsonomy FOGA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Julius Lischeid, Kitty Meeks, Martin Schirneck Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. Search on Bibsonomy ALENEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jannik Peters, Daniel Stephan, Isabel Amon, Hans Gawendowicz, Julius Lischeid, Lennart Salabarria, Jonas Umland, Felix Werner, Martin S. Krejca, Ralf Rothenberger, Timo Kötzing, Tobias Friedrich 0001 Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. Search on Bibsonomy ICAPS The full citation details ... 2019 DBLP  BibTeX  RDF
1Tobias Friedrich 0001, Ralf Rothenberger Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. Search on Bibsonomy IJCAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Davide Bilò, Tobias Friedrich 0001, Pascal Lenzner, Anna Melnichenko Geometric Network Creation Games. Search on Bibsonomy SPAA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Duc-Cuong Dang, Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro Simone Oliveto, Dirk Sudholt, Andrew M. Sutton Escaping Local Optima Using Crossover With Emergent Diversity. Search on Bibsonomy IEEE Trans. Evolutionary Computation The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Maximilian Katzmann, Anton Krohmer Unbounded Discrepancy of Deterministic Random Walks on Grids. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Anton Krohmer On the Diameter of Hyperbolic Random Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Anton Krohmer, Sören Laue Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Tobias Friedrich 0001, Anton Krohmer De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Anton Krohmer Cliques in Hyperbolic Random Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Kitty Meeks, Martin Schirneck On the Enumeration of Minimal Hitting Sets in Lexicographical Order. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Vahid Roostapour, Aneta Neumann, Frank Neumann 0001, Tobias Friedrich 0001 Pareto Optimization for Subset Selection with Dynamic Cost Constraints. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Thomas Bläsius, Cedric Freiberger, Tobias Friedrich 0001, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Tobias Friedrich 0001, Andreas Göbel 0001, Francesco Quinzan, Markus Wagner 0007 Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Tobias Friedrich 0001, Andreas Göbel 0001, Frank Neumann 0001, Francesco Quinzan, Ralf Rothenberger Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Tobias Friedrich 0001, Andreas Göbel 0001, Francesco Quinzan, Markus Wagner 0007 Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization. Search on Bibsonomy PPSN (1) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Cedric Freiberger, Tobias Friedrich 0001, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel Towards a Systematic Evaluation of Generative Network Models. Search on Bibsonomy WAW The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Ralf Rothenberger Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich 0001, Martin S. Krejca, J. A. Gregor Lagodzinski, Ralf Rothenberger, Julius Severin, Fabian Sommer, Justin Trautmann Memory-Restricted Routing with Tiled Map Data. Search on Bibsonomy SMC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Wanru Gao, Tobias Friedrich 0001, Frank Neumann 0001, Christian Hercher Randomized greedy algorithms for covering problems. Search on Bibsonomy GECCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Francesco Quinzan, Markus Wagner 0007 Escaping large deceptive basins of attraction with heavy-tailed mutation operators. Search on Bibsonomy GECCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. Search on Bibsonomy GECCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Maximilian Katzmann, Anton Krohmer Hyperbolic Embeddings for Near-Optimal Greedy Routing. Search on Bibsonomy ALENEX The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise. Search on Bibsonomy IEEE Trans. Evolutionary Computation The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1S. Anand 0002, Karl Bringmann, Tobias Friedrich 0001, Naveen Garg 0001, Amit Kumar 0001 Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Aneta Neumann, Frank Neumann 0001, Tobias Friedrich 0001 Quasi-random Agents for Image Transition and Animation. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Tobias Friedrich 0001, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Ankit Chauhan, Tobias Friedrich 0001, Francesco Quinzan Approximating Optimization Problems using EAs on Scale-Free Networks. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Tobias Friedrich 0001, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert, David Schumann Efficient Best Response Computation for Strategic Network Formation Under Attack. Search on Bibsonomy SAGT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Markus Wagner 0007, Tobias Friedrich 0001, Marius Lindauer Improving local search in a minimum vertex cover solver for classes of networks. Search on Bibsonomy CEC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. Search on Bibsonomy ESA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton Phase Transitions for Scale-Free SAT Formulas. Search on Bibsonomy AAAI The full citation details ... 2017 DBLP  BibTeX  RDF
1Tobias Friedrich 0001, Frank Neumann 0001 What's Hot in Evolutionary Computation. Search on Bibsonomy AAAI The full citation details ... 2017 DBLP  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Markus Wagner 0007 A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. Search on Bibsonomy AAAI The full citation details ... 2017 DBLP  BibTeX  RDF
1Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich 0001, Timo Kötzing, Martin Schirneck Island models meet rumor spreading. Search on Bibsonomy GECCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Anna Melnichenko Analyzing search heuristics with differential equations. Search on Bibsonomy GECCO (Companion) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Feng Shi 0003, Martin Schirneck, Tobias Friedrich 0001, Timo Kötzing, Frank Neumann 0001 Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. Search on Bibsonomy GECCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ankit Chauhan, Tobias Friedrich 0001, Francesco Quinzan Approximating optimization problems using EAs on scale-free networks. Search on Bibsonomy GECCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mojgan Pourhassan, Tobias Friedrich 0001, Frank Neumann 0001 On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. Search on Bibsonomy FOGA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Gregor Lagodzinski, Frank Neumann 0001, Martin Schirneck Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. Search on Bibsonomy FOGA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton Resampling vs Recombination: a Statistical Run Time Estimation. Search on Bibsonomy FOGA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert, David Schumann Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack. Search on Bibsonomy SPAA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Wanru Gao, Tobias Friedrich 0001, Timo Kötzing, Frank Neumann 0001 Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. Search on Bibsonomy Australasian Conference on Artificial Intelligence The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton Robustness of Ant Colony Optimization to Noise. Search on Bibsonomy Evolutionary Computation The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Markus Wagner 0007 A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Sven Ihde, Christoph Keßler, Stefan Neubert, David Schumann, Pascal Lenzner, Tobias Friedrich 0001 Efficient Best-Response Computation for Strategic Network Formation under Attack. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Ankit Chauhan, Tobias Friedrich 0001, Ralf Rothenberger Greed is Good for Deterministic Scale-Free Networks. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Duc-Cuong Dang, Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro Simone Oliveto, Dirk Sudholt, Andrew M. Sutton Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Wanru Gao, Tobias Friedrich 0001, Frank Neumann 0001 Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover. Search on Bibsonomy PPSN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Duc-Cuong Dang, Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro Simone Oliveto, Dirk Sudholt, Andrew M. Sutton Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. Search on Bibsonomy PPSN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Andrew M. Sutton On the Robustness of Evolving Populations. Search on Bibsonomy PPSN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton Graceful Scaling on Uniform Versus Steep-Tailed Noise. Search on Bibsonomy PPSN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Anton Krohmer Hyperbolic Random Graphs: Separators and Treewidth. Search on Bibsonomy ESA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Anton Krohmer, Sören Laue Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. Search on Bibsonomy ESA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, Tobias Friedrich 0001 Probabilistic Routing for On-Street Parking Search. Search on Bibsonomy ESA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001 Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca EDAs cannot be Balanced and Stable. Search on Bibsonomy GECCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton Ant Colony Optimization Beats Resampling on Noisy Functions. Search on Bibsonomy GECCO (Companion) The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Duc-Cuong Dang, Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro Simone Oliveto, Dirk Sudholt, Andrew M. Sutton Escaping Local Optima with Diversity Mechanisms and Crossover. Search on Bibsonomy GECCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Frank Neumann 0001, Andrew M. Sutton (eds.) Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20-24, 2016, Companion Material Proceedings Search on Bibsonomy GECCO (Companion) The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Samadhi Nallaperuma, Frank Neumann 0001, Martin Schirneck Fast Building Block Assembly by Majority Vote Crossover. Search on Bibsonomy GECCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton The Benefit of Recombination in Noisy Evolutionary Search. Search on Bibsonomy GECCO (Companion) The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Frank Neumann 0001, Andrew M. Sutton (eds.) Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20 - 24, 2016 Search on Bibsonomy GECCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ankit Chauhan, Tobias Friedrich 0001, Ralf Rothenberger Greed is Good for Deterministic Scale-Free Networks. Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Martin Schirneck The Parameterized Complexity of Dependency Detection in Relational Databases. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Frank Neumann 0001, Christian Thyssen Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. Search on Bibsonomy Evolutionary Computation The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Frank Neumann 0001 Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms. Search on Bibsonomy Evolutionary Computation The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Jun He 0004, Thomas Jansen 0001, Alberto Moraglio Genetic and Evolutionary Computation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nikolaos Fountoulakis, Tobias Friedrich 0001, Danny Hermelin On the average-case complexity of parameterized clique. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich 0001, Thomas Sauerwald Randomized diffusion for indivisible loads. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Christian Hercher On the kernel size of clique cover reductions for random intersection graphs. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton The Benefit of Sex in Noisy Evolutionary Search. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Tobias Friedrich 0001, Anton Krohmer On the diameter of hyperbolic random graphs. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Tobias Friedrich 0001, Markus Wagner 0007 Seeding the initial population of multi-objective evolutionary algorithms: A computational study. Search on Bibsonomy Appl. Soft Comput. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Markus Wagner 0007, Karl Bringmann, Tobias Friedrich 0001, Frank Neumann 0001 Efficient optimization of many objectives by approximation-guided evolution. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich 0001, Anton Krohmer Parameterized clique on inhomogeneous random graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 220 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license