


Остановите войну!
for scientists:
Tobias 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
- 2022
- [j71]Vahid Roostapour
, Aneta Neumann
, Frank Neumann, Tobias Friedrich:
Pareto optimization for subset selection with dynamic cost constraints. Artif. Intell. 302: 103597 (2022) - [j70]Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski:
Zeros and approximations of Holant polynomials on the complex plane. Comput. Complex. 31(2): 11 (2022) - [j69]Thomas Bläsius, Tobias Friedrich
, Julius Lischeid, Kitty Meeks
, Martin Schirneck:
Efficiently enumerating hitting sets of hypergraphs arising in data profiling. J. Comput. Syst. Sci. 124: 192-213 (2022) - [j68]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. ACM Trans. Algorithms 18(2): 19:1-19:32 (2022) - [j67]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The complexity of dependency detection and discovery in relational databases. Theor. Comput. Sci. 900: 79-96 (2022) - [c148]Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand:
An Efficient Branch-and-Bound Solver for Hitting Set. ALENEX 2022: 209-220 - [c147]Ágnes Cseh, Tobias Friedrich, Jannik Peters:
Pareto Optimal and Popular House Allocation with Lower and Upper Quotas. AAMAS 2022: 300-308 - [c146]Sebastian Angrick, Ben Bals, Niko Hastrich, Maximilian Kleissl, Jonas Schmidt, Vanja Doskoc, Louise Molitor, Tobias Friedrich, Maximilian Katzmann:
Towards explainable real estate valuation via evolutionary algorithms. GECCO 2022: 1130-1138 - [c145]Samuel Baguley, Tobias Friedrich, Timo Kötzing, Xiaoyue Li, Marcus Pappik, Ziena Zeif:
Analysis of a gray-box operator for vertex cover. GECCO 2022: 1363-1371 - [c144]Tobias Friedrich, Timo Kötzing, Aishwarya Radhakrishnan, Leon Schiller, Martin Schirneck, Georg Tennigkeit, Simon Wietheger:
Crossover for cardinality constrained optimization. GECCO 2022: 1399-1407 - [c143]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. ICALP 2022: 22:1-22:19 - [c142]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko:
Social Distancing Network Creation. ICALP 2022: 62:1-62:21 - [c141]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. ITCS 2022: 23:1-23:18 - [c140]Sarel Cohen
, Philipp Fischbeck, Tobias Friedrich
, Martin S. Krejca
, Thomas Sauerwald:
Accelerated Information Dissemination on Networks with Local and Global Edges. SIROCCO 2022: 79-97 - [i75]Maximilian Böther, Otto Kißig, Martin Taraz, Sarel Cohen, Karen Seidel, Tobias Friedrich:
What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization. CoRR abs/2201.10494 (2022) - [i74]Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch, Sarel Cohen, Daniel G. Waddington, Tobias Friedrich, Michael W. Mahoney:
Fast Feature Selection with Fairness Constraints. CoRR abs/2202.13718 (2022) - [i73]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik:
Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials. CoRR abs/2204.01793 (2022) - [i72]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko:
Social Distancing Network Creation. CoRR abs/2204.10423 (2022) - [i71]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. CoRR abs/2204.10679 (2022) - [i70]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Arthur Zahn:
The Impact of Cooperation in Bilateral Network Creation. CoRR abs/2207.03798 (2022) - [i69]Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. CoRR abs/2207.09262 (2022) - 2021
- [j66]Francesco Quinzan, Andreas Göbel, Markus Wagner
, Tobias Friedrich:
Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations. Nat. Comput. 20(3): 561-575 (2021) - [c139]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko:
Selfish Creation of Social Networks. AAAI 2021: 5185-5193 - [c138]Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich:
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions. AISTATS 2021: 964-972 - [c137]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. ESA 2021: 18:1-18:17 - [c136]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. ESA 2021: 20:1-20:15 - [c135]Thomas Bläsius, Tobias Friedrich, Christopher Weyand:
Efficiently Computing Maximum Flows in Scale-Free Networks. ESA 2021: 21:1-21:14 - [c134]Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Balanced Crown Decomposition for Connectivity Constraints. ESA 2021: 26:1-26:15 - [c133]Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski
, Alexander Löser, Marcus Wilhelm:
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. FCT 2021: 53-66 - [c132]Maximilian Böther, Leon Schiller, Philipp Fischbeck, Louise Molitor, Martin S. Krejca, Tobias Friedrich:
Evolutionary minimization of traffic congestion. GECCO 2021: 937-945 - [c131]Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik:
A Spectral Independence View on Hard Spheres via Block Dynamics. ICALP 2021: 66:1-66:15 - [c130]J. A. Gregor Lagodzinski
, Andreas Göbel, Katrin Casel, Tobias Friedrich:
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. ICALP 2021: 91:1-91:15 - [c129]Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor:
The Impact of Geometry on Monochrome Regions in the Flip Schelling Process. ISAAC 2021: 29:1-29:17 - [c128]Nicolas Klodt, Lars Seifert, Arthur Zahn, Katrin Casel, Davis Issac, Tobias Friedrich:
A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics. KDD 2021: 882-891 - [c127]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Space-Efficient Fault-Tolerant Diameter Oracles. MFCS 2021: 18:1-18:16 - [c126]Tobias Friedrich
, Frank Neumann
, Ralf Rothenberger
, Andrew M. Sutton
:
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. SAT 2021: 188-206 - [c125]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 - [c124]Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters, Daniel Stephan, Michael Vaichenker:
Efficiency and Stability in Euclidean Network Design. SPAA 2021: 232-242 - [c123]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. SEA 2021: 22:1-22:18 - [i68]Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich:
Adaptive Sampling for Fast Constrained Maximization of Submodular Function. CoRR abs/2102.06486 (2021) - [i67]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) - [i66]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Complexity of Dependency Detection and Discovery in Relational Databases. CoRR abs/2103.13331 (2021) - [i65]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) - [i64]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. CoRR abs/2106.15731 (2021) - [i63]Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Space-Efficient Fault-Tolerant Diameter Oracles. CoRR abs/2107.03485 (2021) - [i62]Ágnes Cseh, Tobias Friedrich, Jannik Peters:
Pareto optimal and popular house allocation with lower and upper quotas. CoRR abs/2107.03801 (2021) - [i61]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan:
Routing in Strongly Hyperbolic Unit Disk Graphs. CoRR abs/2107.05518 (2021) - [i60]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik:
Algorithms for general hard-constraint point processes via discretization. CoRR abs/2107.08848 (2021) - [i59]Sebastian Angrick, Ben Bals, Niko Hastrich, Maximilian Kleissl, Jonas Schmidt, Vanja Doskoc, Maximilian Katzmann, Louise Molitor, Tobias Friedrich:
Towards Explainable Real Estate Valuation via Evolutionary Algorithms. CoRR abs/2110.05116 (2021) - [i58]Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand:
An Efficient Branch-and-Bound Solver for Hitting Set. CoRR abs/2110.11697 (2021) - [i57]Tobias Friedrich, Maximilian Katzmann, Leon Schiller:
Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane. CoRR abs/2112.02553 (2021) - [i56]Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger:
Fixed-Parameter Sensitivity Oracles. CoRR abs/2112.03059 (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) - [c122]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 - [c121]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 - [c120]Thomas Bläsius, Tobias Friedrich
, Martin Schirneck:
The Minimization of Random Hypergraphs. ESA 2020: 21:1-21:15 - [c119]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 - [c118]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 - [c117]Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Flow-Based Network Creation Games. IJCAI 2020: 139-145 - [c116]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, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
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) - [c115]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 - [c114]Vahid Roostapour, Aneta Neumann
, Frank Neumann, Tobias Friedrich:
Pareto Optimization for Subset Selection with Dynamic Cost Constraints. AAAI 2019: 2354-2361 - [c113]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 - [c112]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 - [c111]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 - [c110]Tobias Friedrich
, Ralf Rothenberger
:
The Satisfiability Threshold for Non-Uniform Random 2-SAT. ICALP 2019: 61:1-61:14 - [c109]Tobias Friedrich, Ralf Rothenberger:
Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. IJCAI 2019: 6151-6155 - [c108]Davide Bilò
, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Geometric Network Creation Games. SPAA 2019: 323-332 - [c107]Tobias Friedrich
:
From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial). STACS 2019: 5:1-5:9 - [c106]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 - [c105]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck:
Understanding the Effectiveness of Data Reduction in Public Transportation Networks. WAW 2019: 87-101 - [c104]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) - [c103]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Hyperbolic Embeddings for Near-Optimal Greedy Routing. ALENEX 2018: 199-208 - [c102]Tobias Friedrich, Francesco Quinzan, Markus Wagner
:
Escaping large deceptive basins of attraction with heavy-tailed mutation operators. GECCO 2018: 293-300 - [c101]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 - [c100]Wanru Gao, Tobias Friedrich, Frank Neumann
, Christian Hercher:
Randomized greedy algorithms for covering problems. GECCO 2018: 309-315 - [c99]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 - [c98]Tobias Friedrich, Andreas Göbel, Francesco Quinzan, Markus Wagner:
Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization. PPSN (1) 2018: 134-145 - [c97]Tobias Friedrich
, Ralf Rothenberger
:
Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. SAT 2018: 273-291 - [c96]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 - [c95]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]