Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDTobias Friedrich 0001
Person information
- affiliation: Hasso Plattner Institute, Potsdam, Germany
- affiliation: Friedrich Schiller University Jena, Faculty of Mathematics and Computer Science
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Other persons with the same name
- Tobias Friedrich 0002 — University of Göttingen, Faculty of Economic Sciences
- Tobias Friedrich 0003 — Dolby Inc., Nuremberg, Germany (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c125]Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich:
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions. AISTATS 2021: 964-972- [c124]Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger:
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. SODA 2021: 42-53 - [i59]Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich:
Adaptive Sampling for Fast Constrained Maximization of Submodular Function. CoRR abs/2102.06486 (2021) - [i58]Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor:
The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs. CoRR abs/2102.09856 (2021) - [i57]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Complexity of Dependency Detection and Discovery in Relational Databases. CoRR abs/2103.13331 (2021) - [i56]Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters, Daniel Stephan, Michael Vaichenker:
Efficiency and Stability in Euclidean Network Design. CoRR abs/2104.11618 (2021) - 2020
- [j65]Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann:
Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 82(10): 3117-3123 (2020) - [j64]Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger
:
Greed is Good for Deterministic Scale-Free Networks. Algorithmica 82(11): 3338-3389 (2020) - [j63]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ACM J. Exp. Algorithmics 25: 1-18 (2020) - [j62]Johann Birnick, Thomas Bläsius, Tobias Friedrich, Felix Naumann, Thorsten Papenbrock, Martin Schirneck:
Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery. Proc. VLDB Endow. 13(11): 2270-2283 (2020) - [j61]Tobias Friedrich, Timo Kötzing, J. A. Gregor Lagodzinski, Frank Neumann, Martin Schirneck:
Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints. Theor. Comput. Sci. 832: 3-19 (2020) - [c123]Thomas Bläsius, Maximilian Böther, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hüffner, Otto Kißig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells, Simon Wietheger:
A Strategic Routing Framework and Algorithms for Computing Alternative Paths. ATMOS 2020: 10:1-10:14 - [c122]Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Aneta Neumann, Frank Neumann, Francesco Quinzan:
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. ECAI 2020: 435-442 - [c121]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Minimization of Random Hypergraphs. ESA 2020: 21:1-21:15 - [c120]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor:
Fair Tree Connection Games with Topology-Dependent Edge Cost. FSTTCS 2020: 15:1-15:15 - [c119]Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Manuel Rizzo, Arthur Zahn:
Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation. ICONIP (3) 2020: 592-604 - [c118]Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Flow-Based Network Creation Games. IJCAI 2020: 139-145 - [c117]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann:
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. STACS 2020: 25:1-25:14 - [i55]Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger:
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. CoRR abs/2004.07319 (2020) - [i54]Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid:
Shortest Distances as Enumeration Problem. CoRR abs/2005.06827 (2020) - [i53]Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Flow-Based Network Creation Games. CoRR abs/2006.14964 (2020) - [i52]Felix Mujkanovic, Vanja Doskoc, Martin Schirneck, Patrick Schäfer, Tobias Friedrich:
timeXplain - A Framework for Explaining the Predictions of Time Series Classifiers. CoRR abs/2007.07606 (2020) - [i51]Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik:
Polymer dynamics via cliques with applications to hard-sphere mixtures. CoRR abs/2007.08293 (2020) - [i50]Thomas Bläsius, Maximilian Böther, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hüffner, Otto Kißig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells, Simon Wietheger:
A Strategic Routing Framework and Algorithms for Computing Alternative Paths. CoRR abs/2008.10316 (2020) - [i49]Thomas Bläsius, Tobias Friedrich, Christopher Weyand:
Efficiently Computing Maximum Flows in Scale-Free Networks. CoRR abs/2009.09678 (2020) - [i48]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor:
Fair Tree Connection Games with Topology-Dependent Edge Cost. CoRR abs/2009.10988 (2020) - [i47]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR abs/2010.02787 (2020) - [i46]Katrin Casel, Ziena Elijazyfer, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits:
Balanced Crown Decomposition for Connectivity Constraints. CoRR abs/2011.04528 (2020) - [i45]J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich:
On Counting (Quantum-)Graph Homomorphisms in Finite Fields. CoRR abs/2011.04827 (2020) - [i44]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko:
Selfish Creation of Social Networks. CoRR abs/2012.06203 (2020)
2010 – 2019
- 2019
- [j60]Tobias Friedrich, Martin S. Krejca, Ralf Rothenberger, Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou:
Routing for on-street parking search using probabilistic data. AI Commun. 32(2): 113-124 (2019) - [j59]Aneta Neumann, Frank Neumann, Tobias Friedrich:
Quasi-random Image Transition and Animation. Aust. J. Intell. Inf. Process. Syst. 16(1): 10-18 (2019) - [j58]Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann:
Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 81(2): 828-857 (2019) - [j57]Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck:
Island Models Meet Rumor Spreading. Algorithmica 81(2): 886-915 (2019) - [j56]Tobias Friedrich, Timo Kötzing, Martin S. Krejca:
Unbiasedness of estimation-of-distribution algorithms. Theor. Comput. Sci. 785: 46-59 (2019) - [c116]Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger:
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. AAAI 2019: 2272-2279 - [c115]Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich:
Pareto Optimization for Subset Selection with Dynamic Cost Constraints. AAAI 2019: 2354-2361 - [c114]Jannik 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:
Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. ICAPS 2019: 541-554 - [c113]Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck:
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. ALENEX 2019: 130-143 - [c112]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA 2019: 21:1-21:14 - [c111]Tobias Friedrich, Ralf Rothenberger:
The Satisfiability Threshold for Non-Uniform Random 2-SAT. ICALP 2019: 61:1-61:14 - [c110]Tobias Friedrich, Ralf Rothenberger:
Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. IJCAI 2019: 6151-6155 - [c109]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Geometric Network Creation Games. SPAA 2019: 323-332 - [c108]Tobias Friedrich:
From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial). STACS 2019: 5:1-5:9 - [c107]Thomas Bläsius, Tobias Friedrich, Andrew M. Sutton:
On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. TACAS (1) 2019: 117-134 - [c106]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck:
Understanding the Effectiveness of Data Reduction in Public Transportation Networks. WAW 2019: 87-101 - [c105]Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Louise Molitor, Marcus Pappik, Friedrich Schöne, Fabian Sommer, David Stangl:
Convergence and Hardness of Strategic Schelling Segregation. WINE 2019: 156-170 - [e3]Tobias Friedrich, Carola Doerr, Dirk V. Arnold:
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2019, Potsdam, Germany, August 27-29, 2019. ACM 2019, ISBN 978-1-4503-6254-2 [contents] - [i43]Álvaro Parra Bustos, Tat-Jun Chin, Frank Neumann, Tobias Friedrich, Maximilian Katzmann:
A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints. CoRR abs/1902.01534 (2019) - [i42]Tobias Friedrich, Ralf Rothenberger:
The Satisfiability Threshold for Non-Uniform Random 2-SAT. CoRR abs/1904.02027 (2019) - [i41]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Geometric Network Creation Games. CoRR abs/1904.07001 (2019) - [i40]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann:
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. CoRR abs/1904.12503 (2019) - [i39]Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski:
Zeros and approximations of Holant polynomials on the complex plane. CoRR abs/1905.03194 (2019) - [i38]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR abs/1905.06706 (2019) - [i37]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck:
Understanding the Effectiveness of Data Reduction in Public Transportation Networks. CoRR abs/1905.12477 (2019) - [i36]Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Louise Molitor, Marcus Pappik, Friedrich Schöne, Fabian Sommer, David Stangl:
Convergence and Hardness of Strategic Schelling Segregation. CoRR abs/1907.07513 (2019) - [i35]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Minimization of Random Hypergraphs. CoRR abs/1910.00308 (2019) - [i34]Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm:
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. CoRR abs/1911.02453 (2019) - [i33]Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Frank Neumann, Aneta Neumann, Francesco Quinzan:
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. CoRR abs/1911.06791 (2019) - [i32]Carola Doerr, Carlos M. Fonseca, Tobias Friedrich, Xin Yao:
Theory of Randomized Optimization Heuristics (Dagstuhl Reports 19431). Dagstuhl Reports 9(10): 61-94 (2019) - 2018
- [j55]Thomas Bläsius, Tobias Friedrich, Anton Krohmer:
Cliques in Hyperbolic Random Graphs. Algorithmica 80(8): 2324-2344 (2018) - [j54]Karl Bringmann, Tobias Friedrich, Anton Krohmer:
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. Algorithmica 80(11): 3397-3427 (2018) - [j53]Tobias Friedrich, Anton Krohmer:
On the Diameter of Hyperbolic Random Graphs. SIAM J. Discret. Math. 32(2): 1314-1334 (2018) - [j52]Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Unbounded Discrepancy of Deterministic Random Walks on Grids. SIAM J. Discret. Math. 32(4): 2441-2452 (2018) - [j51]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima Using Crossover With Emergent Diversity. IEEE Trans. Evol. Comput. 22(3): 484-497 (2018) - [j50]Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue:
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. IEEE/ACM Trans. Netw. 26(2): 920-933 (2018) - [c104]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ALENEX 2018: 199-208 - [c103]Tobias Friedrich, Francesco Quinzan, Markus Wagner:
Escaping large deceptive basins of attraction with heavy-tailed mutation operators. GECCO 2018: 293-300 - [c102]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. GECCO 2018: 301-308 - [c101]Wanru Gao, Tobias Friedrich, Frank Neumann, Christian Hercher:
Randomized greedy algorithms for covering problems. GECCO 2018: 309-315 - [c100]Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry:
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ICALP 2018: 20:1-20:14 - [c99]Tobias Friedrich, Andreas Göbel, Francesco Quinzan, Markus Wagner:
Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization. PPSN (1) 2018: 134-145 - [c98]Tobias Friedrich, Ralf Rothenberger:
Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. SAT 2018: 273-291 - [c97]Thomas Bläsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Ralf Rothenberger, Julius Severin, Fabian Sommer, Justin Trautmann:
Memory-Restricted Routing with Tiled Map Data. SMC 2018: 3347-3354 - [c96]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel:
Towards a Systematic Evaluation of Generative Network Models. WAW 2018: 99-114 - [i31]Thomas Bläsius, Tobias Friedrich, Kitty Meeks, Martin Schirneck:
On the Enumeration of Minimal Hitting Sets in Lexicographical Order. CoRR abs/1805.01310 (2018) - [i30]Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry:
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR abs/1805.03253 (2018) - [i29]Tobias Friedrich, Andreas Göbel, Francesco Quinzan, Markus Wagner:
Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations. CoRR abs/1805.10902 (2018) - [i28]Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger:
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. CoRR abs/1811.05351 (2018) - [i27]Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich:
Pareto Optimization for Subset Selection with Dynamic Cost Constraints. CoRR abs/1811.07806 (2018) - 2017
- [j49]S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica 77(2): 515-536 (2017) - [j48]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise. IEEE Trans. Evol. Comput. 21(3): 477-490 (2017) - [c95]Tobias Friedrich, Timo Kötzing, Markus Wagner:
A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. AAAI 2017: 801-807 - [c94]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton:
Phase Transitions for Scale-Free SAT Formulas. AAAI 2017: 3893-3899 - [c93]Tobias Friedrich, Frank Neumann:
What's Hot in Evolutionary Computation. AAAI 2017: 5064-5066 - [c92]Wanru Gao, Tobias Friedrich, Timo Kötzing, Frank Neumann:
Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. Australasian Conference on Artificial Intelligence 2017: 131-143 - [c91]Markus Wagner, Tobias Friedrich, Marius Lindauer:
Improving local search in a minimum vertex cover solver for classes of networks. CEC 2017: 1704-1711 - [c90]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton:
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. ESA 2017: 37:1-37:15 - [c89]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Resampling vs Recombination: a Statistical Run Time Estimation. FOGA 2017: 25-35 - [c88]Mojgan Pourhassan, Tobias Friedrich, Frank Neumann:
On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. FOGA 2017: 37-44 - [c87]Tobias Friedrich, Timo Kötzing, Gregor Lagodzinski, Frank Neumann, Martin Schirneck:
Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. FOGA 2017: 45-54 - [c86]Ankit Chauhan, Tobias Friedrich, Francesco Quinzan:
Approximating optimization problems using EAs on scale-free networks. GECCO 2017: 235-242 - [c85]Tobias Friedrich, Timo Kötzing, Anna Melnichenko:
Analyzing search heuristics with differential equations. GECCO (Companion) 2017: 313-314 - [c84]Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck:
Island models meet rumor spreading. GECCO 2017: 1359-1366 - [c83]Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann:
Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. GECCO 2017: 1407-1414 - [c82]Tobias Friedrich, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert, David Schumann:
Efficient Best Response Computation for Strategic Network Formation Under Attack. SAGT 2017: 199-211 - [c81]Tobias Friedrich, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert, David Schumann:
Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack. SPAA 2017: 321-323 - [i26]Ankit Chauhan, Tobias Friedrich, Francesco Quinzan:
Approximating Optimization Problems using EAs on Scale-Free Networks. CoRR abs/1704.03664 (2017) - [i25]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton:
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. CoRR abs/1706.08431 (2017) - [i24]Aneta Neumann, Frank Neumann, Tobias Friedrich:
Quasi-random Agents for Image Transition and Animation. CoRR abs/1710.07421 (2017) - 2016
- [j47]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
Robustness of Ant Colony Optimization to Noise. Evol. Comput. 24(2): 237-254 (2016) - [c80]Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, Tobias Friedrich:
Probabilistic Routing for On-Street Parking Search. ESA 2016: 6:1-6:13 - [c79]Thomas Bläsius, Tobias Friedrich, Anton Krohmer:
Hyperbolic Random Graphs: Separators and Treewidth. ESA 2016: 15:1-15:16 - [c78]Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue:
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. ESA 2016: 16:1-16:18 - [c77]Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger:
Greed is Good for Deterministic Scale-Free Networks. FSTTCS 2016: 33:1-33:15 - [c76]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Ant Colony Optimization Beats Resampling on Noisy Functions. GECCO (Companion) 2016: 3-4 - [c75]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Benefit of Recombination in Noisy Evolutionary Search. GECCO (Companion) 2016: 161-162 - [c74]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima with Diversity Mechanisms and Crossover. GECCO 2016: 645-652 - [c73]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Samadhi Nallaperuma, Frank Neumann, Martin Schirneck:
Fast Building Block Assembly by Majority Vote Crossover. GECCO 2016: 661-668 - [c72]Tobias Friedrich, Timo Kötzing, Martin S. Krejca:
EDAs cannot be Balanced and Stable. GECCO 2016: 1139-1146 - [c71]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Parameterized Complexity of Dependency Detection in Relational Databases. IPEC 2016: 6:1-6:13 - [c70]Tobias Friedrich:
Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms. MFCS 2016: 4:1-4:3 - [c69]Wanru Gao, Tobias Friedrich, Frank Neumann:
Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover. PPSN 2016: 740-750 - [c68]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
Graceful Scaling on Uniform Versus Steep-Tailed Noise. PPSN 2016: 761-770 - [c67]Tobias Friedrich, Timo Kötzing, Andrew M. Sutton:
On the Robustness of Evolving Populations. PPSN 2016: 771-781 - [c66]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. PPSN 2016: 890-900 - [e2]Tobias Friedrich, Frank Neumann, Andrew M. Sutton:
Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20 - 24, 2016. ACM 2016, ISBN 978-1-4503-4206-3 [contents] - [e1]Tobias Friedrich, Frank Neumann, Andrew M. Sutton:
Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20-24, 2016, Companion Material Proceedings. ACM 2016, ISBN 978-1-4503-4323-7 [contents] - [i23]Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton:
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. CoRR abs/1608.03123 (2016) - [i22]Tobias Friedrich, Timo Kötzing, Markus Wagner:
A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover. CoRR abs/1609.03993 (2016) - [i21]Sven Ihde, Christoph Keßler, Stefan Neubert, David Schumann, Pascal Lenzner, Tobias Friedrich:
Efficient Best-Response Computation for Strategic Network Formation under Attack. CoRR abs/1610.01861 (2016) - [i20]Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger:
Greed is Good for Deterministic Scale-Free Networks. CoRR abs/1610.04217 (2016) - 2015
- [j46]Tobias Friedrich, Markus Wagner:
Seeding the initial population of multi-objective evolutionary algorithms: A computational study. Appl. Soft Comput. 33: 223-230 (2015) - [j45]Tobias Friedrich, Anton Krohmer:
Parameterized clique on inhomogeneous random graphs. Discret. Appl. Math. 184: 130-138 (2015) - [j44]Tobias Friedrich, Frank Neumann, Christian Thyssen:
Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. Evol. Comput. 23(1): 131-159 (2015) - [j43]Tobias Friedrich, Frank Neumann:
Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms. Evol. Comput. 23(4): 543-558 (2015) - [j42]Markus Wagner, Karl Bringmann, Tobias Friedrich, Frank Neumann:
Efficient optimization of many objectives by approximation-guided evolution. Eur. J. Oper. Res. 243(2): 465-479 (2015) - [j41]Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald:
Randomized diffusion for indivisible loads. J. Comput. Syst. Sci. 81(1): 159-185 (2015) - [j40]