default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTobias Friedrich 0001
Person information
- affiliation: Hasso Plattner Institute, Potsdam, Germany
- affiliation: Friedrich Schiller University Jena, Faculty of Mathematics and Computer Science, Germany
- 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, Germany
- Tobias Friedrich 0003 — Dolby Inc., Nuremberg, Germany (and 1 more)
- Tobias Friedrich 0004 — University of Bayreuth, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j88]Katrin Casel, Tobias Friedrich, Stefan Neubert
, Markus L. Schmid:
Shortest distances as enumeration problem. Discret. Appl. Math. 342: 89-103 (2024)- [j87]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko:
Geometric Network Creation Games. SIAM J. Discret. Math. 38(1): 277-315 (2024) - [j86]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. SIAM J. Discret. Math. 38(2): 1943-2000 (2024) - [j85]Sebastian Reiche, Sarel Cohen, Kirill Simonov, Tobias Friedrich:
Integrating higher-order relations for enhanced twitter bot detection. Soc. Netw. Anal. Min. 14(1): 207 (2024) - [j84]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. TheoretiCS 3 (2024) - [c185]Tobias Friedrich, Andreas Göbel, Nicolas Klodt, Martin S. Krejca, Marcus Pappik:
The Irrelevance of Influencers: Information Diffusion with Re-Activation and Immunity Lasts Exponentially Long on Social Network Models. AAAI 2024: 17389-17397 - [c184]Tobias Friedrich, Andreas Göbel, Nicolas Klodt, Martin S. Krejca, Marcus Pappik:
From Market Saturation to Social Reinforcement: Understanding the Impact of Non-Linearity in Information Diffusion Models. AAMAS 2024: 614-622 - [c183]Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells:
How to Reduce Temporal Cliques to Find Sparse Spanners. ESA 2024: 11:1-11:15 - [c182]Judith Herrmann, Raphael Kunert, Ron Hachmon, Aviv Markus, Allison Gunby-Mann, Sarel Cohen, Tobias Friedrich, Peter Chin:
Detecting Continuous Gravitational Waves Using Generated Training Data. ICASSP 2024: 146-150 - [c181]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Real-World Networks Are Low-Dimensional: Theoretical and Practical Assessment. IJCAI 2024: 2036-2044 - [c180]Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, Kirill Simonov:
A Contraction Tree SAT Encoding for Computing Twin-Width. PAKDD (2) 2024: 444-456 - [d2]Thomas Bläsius, Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca:
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation (Data and Code). Zenodo, 2024
- [i97]Thomas Bläsius, Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca:
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation. CoRR abs/2402.05534 (2024) - [i96]Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells:
Towards Linear Spanners in All Temporal Cliques. CoRR abs/2402.13624 (2024) - [i95]Julian Berger, Tobias Friedrich, Pascal Lenzner, Paraskevi Machaira, Janosch Ruff:
Strategic Network Creation for Enabling Greedy Routing. CoRR abs/2403.15307 (2024) - [i94]Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif:
Combining Crown Structures for Vulnerability Measures. CoRR abs/2405.02378 (2024) - [i93]Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif:
Optimal Padded Decomposition For Bounded Treewidth Graphs. CoRR abs/2407.12230 (2024) - [i92]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Distance (Sensitivity) Oracles with Subquadratic Space. CoRR abs/2408.10014 (2024) - 2023
- [j83]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko:
Social Distancing Network Creation. Algorithmica 85(7): 2087-2130 (2023) - [j82]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. Algorithmica 85(12): 3487-3520 (2023) - [j81]Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor:
The impact of geometry on monochrome regions in the flip Schelling process. Comput. Geom. 108: 101902 (2023) - [j80]Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm:
From symmetry to asymmetry: Generalizing TSP approximations by parametrization. J. Comput. Syst. Sci. 136: 157-170 (2023) - [j79]Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann:
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Theory Comput. Syst. 67(1): 28-51 (2023) - [j78]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. Random Struct. Algorithms 63(4): 885-941 (2023) - [j77]Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik:
Polymer dynamics via cliques: New conditions for approximations. Theor. Comput. Sci. 942: 230-252 (2023) - [j76]Maximilian Böther, Leon Schiller, Philipp Fischbeck, Louise Molitor, Martin S. Krejca, Tobias Friedrich:
Evolutionary Minimization of Traffic Congestion. IEEE Trans. Evol. Comput. 27(6): 1809-1821 (2023) - [j75]Tobias Friedrich, Timo Kötzing, Aishwarya Radhakrishnan, Leon Schiller, Martin Schirneck, Georg Tennigkeit, Simon Wietheger:
Crossover for Cardinality Constrained Optimization. ACM Trans. Evol. Learn. Optim. 3(2): 5:1-5:32 (2023) - [c179]Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch, Sarel Cohen, Daniel G. Waddington, Tobias Friedrich, Michael W. Mahoney:
Fast Feature Selection with Fairness Constraints. AISTATS 2023: 7800-7823 - [c178]Ivan Khomutovskiy, Rebekka Dunker, Jessica Dierking, Julian Egbert, Christian Helms, Finn Schöllkopf, Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Davis Issac, Simon Krogmann, Pascal Lenzner:
Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. ALENEX 2023: 110-122 - [c177]Tobias Friedrich, Pascal Lenzner, Louise Molitor, Lars Seifert:
Single-Peaked Jump Schelling Games. AAMAS 2023: 2899-2901 - [c176]Sebastian Reiche, Sarel Cohen, Kirill Simonov, Tobias Friedrich:
Beyond Following: Augmenting Bot Detection with the Integration of Behavioral Patterns. COMPLEX NETWORKS (1) 2023: 250-259 - [c175]Davin Jeong, Allison Gunby-Mann, Sarel Cohen, Maximilian Katzmann, Chau Pham, Arnav Bhakta, Tobias Friedrich, Peter Chin:
Deep Distance Sensitivity Oracles. COMPLEX NETWORKS (1) 2023: 452-463 - [c174]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif:
On the Giant Component of Geometric Inhomogeneous Random Graphs. ESA 2023: 20:1-20:13 - [c173]Katrin Casel, Tobias Friedrich, Martin Schirneck, Simon Wietheger:
Fair Correlation Clustering in Forests. FORC 2023: 9:1-9:12 - [c172]Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich:
Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. GECCO 2023: 938-945 - [c171]Samuel Baguley, Tobias Friedrich, Aneta Neumann, Frank Neumann, Marcus Pappik, Ziena Zeif:
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. GECCO 2023: 1537-1545 - [c170]Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan:
Analysis of (1+1) EA on LeadingOnes with Constraints. GECCO 2023: 1584-1592 - [c169]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Fault-Tolerant ST-Diameter Oracles. ICALP 2023: 24:1-24:20 - [c168]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. ICALP 2023: 62:1-62:13 - [c167]Bashini K. Mahaarachchi, Sarel Cohen, Bodo Bookhagen, Vanja Doskoc, Tobias Friedrich:
Sustainable On-Street Parking Mapping with Deep Learning and Airborne Imagery. IDEAL 2023: 209-221 - [c166]Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas:
Temporal Network Creation Games. IJCAI 2023: 2511-2519 - [c165]Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca:
The Common-Neighbors Metric Is Noise-Robust and Reveals Substructures of Real-World Networks. PAKDD (1) 2023: 67-79 - [c164]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Arthur Zahn:
The Impact of Cooperation in Bilateral Network Creation. PODC 2023: 321-331 - [c163]Tobias Friedrich, Pascal Lenzner, Louise Molitor, Lars Seifert:
Single-Peaked Jump Schelling Games. SAGT 2023: 111-126 - [c162]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan:
Strongly Hyperbolic Unit Disk Graphs. STACS 2023: 13:1-13:17 - [c161]Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif:
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. STOC 2023: 1325-1334 - [c160]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC 2023: 1396-1409 - [c159]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Compact Distance Oracles with Large Sensitivity and Low Stretch. WADS 2023: 149-163 - [c158]Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt:
Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover. SEA 2023: 10:1-10:14 - [c157]Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. WG 2023: 143-156 - [d1]Vanja Doskoc, Tobias Friedrich, Niko Hastrich, Maximilian Katzmann:
Code for: Faster Nearest Neighbors Queries on Geographic Data. Zenodo, 2023 - [i91]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. CoRR abs/2302.04113 (2023) - [i90]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller:
A simple statistic for determining the dimensionality of complex networks. CoRR abs/2302.06357 (2023) - [i89]Katrin Casel, Tobias Friedrich, Martin Schirneck, Simon Wietheger:
Fair Correlation Clustering in Forests. CoRR abs/2302.11295 (2023) - [i88]Tobias Friedrich, Pascal Lenzner, Louise Molitor, Lars Seifert:
Single-Peaked Jump Schelling Games. CoRR abs/2302.12107 (2023) - [i87]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Compact Distance Oracles with Large Sensitivity and Low Stretch. CoRR abs/2304.14184 (2023) - [i86]Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Fault-Tolerant ST-Diameter Oracles. CoRR abs/2305.03697 (2023) - [i85]Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas:
Temporal Network Creation Games. CoRR abs/2305.07494 (2023) - [i84]Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich:
Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. CoRR abs/2305.11457 (2023) - [i83]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck:
Approximate Distance Sensitivity Oracles in Subquadratic Space. CoRR abs/2305.11580 (2023) - [i82]Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan:
Analysis of the (1+1) EA on LeadingOnes with Constraints. CoRR abs/2305.18267 (2023) - [i81]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif:
On the Giant Component of Geometric Inhomogeneous Random Graphs. CoRR abs/2306.09506 (2023) - [i80]Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. CoRR abs/2307.11677 (2023) - 2022
- [j74]Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich:
Pareto optimization for subset selection with dynamic cost constraints. Artif. Intell. 302: 103597 (2022) - [j73]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) - [j72]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) - [j71]Philipp Hacker, Felix Naumann, Tobias Friedrich, Stefan Grundmann, Anja Lehmann, Herbert Zech:
AI Compliance - Challenges of Bridging Data Science and Law. ACM J. Data Inf. Qual. 14(3): 21:1-21:4 (2022) - [j70]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. 10(4): 361-380 (2022) - [j69]Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik:
A Spectral Independence View on Hard Spheres via Block Dynamics. SIAM J. Discret. Math. 36(3): 2282-2322 (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) - [c156]Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand:
An Efficient Branch-and-Bound Solver for Hitting Set. ALENEX 2022: 209-220 - [c155]Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif:
A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs. APPROX/RANDOM 2022: 55:1-55:18 - [c154]Ágnes Cseh, Tobias Friedrich, Jannik Peters:
Pareto Optimal and Popular House Allocation with Lower and Upper Quotas. AAMAS 2022: 300-308 - [c153]Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik:
Algorithms for Hard-Constraint Point Processes via Discretization. COCOON 2022: 242-254 - [c152]Philipp Hildebrandt, Maximilian Schulze, Sarel Cohen, Vanja Doskoc, Raid Saabni, Tobias Friedrich:
Optical character recognition guided image super resolution. DocEng 2022: 14:1-14:4 - [c151]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 - [c150]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 - [c149]Tobias Friedrich, Timo Kötzing, Aishwarya Radhakrishnan, Leon Schiller, Martin Schirneck, Georg Tennigkeit, Simon Wietheger:
Crossover for cardinality constrained optimization. GECCO 2022: 1399-1407 - [c148]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 - [c147]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko:
Social Distancing Network Creation. ICALP 2022: 62:1-62:21 - [c146]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. ICLR 2022 - [c145]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 - [c144]Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt:
PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set. IPEC 2022: 28:1-28:4 - [c143]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Amirhossein Rajabi:
Escaping Local Optima with Local Search: A Theory-Driven Discussion. PPSN (2) 2022: 442-455 - [c142]Tobias Friedrich, Timo Kötzing, Frank Neumann, Aishwarya Radhakrishnan:
Theoretical Study of Optimizing Rugged Landscapes with the cGA. PPSN (2) 2022: 586-599 - [c141]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 - [i79]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) - [i78]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) - [i77]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) - [i76]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko:
Social Distancing Network Creation. CoRR abs/2204.10423 (2022) - [i75]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) - [i74]Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Arthur Zahn:
The Impact of Cooperation in Bilateral Network Creation. CoRR abs/2207.03798 (2022) - [i73]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) - [i72]Davin Jeong, Chau Pham, Arnav Bhakta, Sarel Cohen, Maximilian Katzmann, Tobias Friedrich, Sang (Peter) Chin:
Deep Distance Sensitivity Oracles. CoRR abs/2211.02681 (2022) - [i71]Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif:
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. CoRR abs/2211.06267 (2022) - [i70]Tobias Friedrich, Timo Kötzing, Frank Neumann, Aishwarya Radhakrishnan:
Theoretical Study of Optimizing Rugged Landscapes with the cGA. CoRR abs/2211.13801 (2022) - [i69]Anne Auger, Carlos M. Fonseca, Tobias Friedrich, Johannes Lengler:
Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081). Dagstuhl Reports 12(2): 87-102 (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) - [c140]Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko:
Selfish Creation of Social Networks. AAAI 2021: 5185-5193 - [c139]Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich:
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions. AISTATS 2021: 964-972 - [c138]Sarel Cohen, Moshik Hershcovitch, Martin Taraz, Otto Kißig, Andrew Wood, Daniel G. Waddington, Peter Chin, Tobias Friedrich:
Drug Repurposing Using Link Prediction on Knowledge Graphs with Applications to Non-volatile Memory. COMPLEX NETWORKS 2021: 742-753 - [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]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) - [c94]Tobias Friedrich, Timo Kötzing, Markus Wagner:
A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. AAAI 2017: 801-807 - [c93]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton:
Phase Transitions for Scale-Free SAT Formulas. AAAI 2017: 3893-3899 - [c92]Tobias Friedrich, Frank Neumann:
What's Hot in Evolutionary Computation. AAAI 2017: 5064-5066 - [c91]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 - [c90]Markus Wagner, Tobias Friedrich, Marius Lindauer:
Improving local search in a minimum vertex cover solver for classes of networks. CEC 2017: 1704-1711 - [c89]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 - [c88]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Resampling vs Recombination: a Statistical Run Time Estimation. FOGA 2017: 25-35 - [c87]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 - [c86]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 - [c85]Ankit Chauhan, Tobias Friedrich, Francesco Quinzan:
Approximating optimization problems using EAs on scale-free networks. GECCO 2017: 235-242 - [c84]Tobias Friedrich, Timo Kötzing, Anna Melnichenko:
Analyzing search heuristics with differential equations. GECCO (Companion) 2017: 313-314 - [c83]Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck:
Island models meet rumor spreading. GECCO 2017: 1359-1366 - [c82]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 - [c81]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 - [c80]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) - [c79]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 - [c78]Thomas Bläsius, Tobias Friedrich, Anton Krohmer:
Hyperbolic Random Graphs: Separators and Treewidth. ESA 2016: 15:1-15:16 - [c77]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 - [c76]Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger:
Greed is Good for Deterministic Scale-Free Networks. FSTTCS 2016: 33:1-33:15 - [c75]Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton:
Ant Colony Optimization Beats Resampling on Noisy Functions. GECCO (Companion) 2016: 3-4 - [c74]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Benefit of Recombination in Noisy Evolutionary Search. GECCO (Companion) 2016: 161-162 - [c73]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 - [c72]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 - [c71]Tobias Friedrich, Timo Kötzing, Martin S. Krejca:
EDAs cannot be Balanced and Stable. GECCO 2016: 1139-1146 - [c70]Thomas Bläsius, Tobias Friedrich, Martin Schirneck:
The Parameterized Complexity of Dependency Detection in Relational Databases. IPEC 2016: 6:1-6:13 - [c69]Tobias Friedrich:
Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms. MFCS 2016: 4:1-4:3 - [c68]Wanru Gao, Tobias Friedrich, Frank Neumann:
Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover. PPSN 2016: 740-750 - [c67]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
Graceful Scaling on Uniform Versus Steep-Tailed Noise. PPSN 2016: 761-770 - [c66]Tobias Friedrich, Timo Kötzing, Andrew M. Sutton:
On the Robustness of Evolving Populations. PPSN 2016: 771-781 - [c65]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]Tobias Friedrich, Christian Hercher:
On the kernel size of clique cover reductions for random intersection graphs. J. Discrete Algorithms 34: 128-136 (2015) - [j39]Tobias Friedrich, Jun He, Thomas Jansen, Alberto Moraglio:
Genetic and Evolutionary Computation. Theor. Comput. Sci. 561: 1-2 (2015) - [j38]Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin:
On the average-case complexity of parameterized clique. Theor. Comput. Sci. 576: 18-29 (2015) - [c64]Karl Bringmann, Tobias Friedrich, Patrick Klitzke:
Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator. CEC 2015: 970-977 - [c63]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
Robustness of Ant Colony Optimization to Noise. GECCO 2015: 17-24 - [c62]Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald:
Ultra-Fast Load Balancing on Scale-Free Networks. ICALP (2) 2015: 516-527 - [c61]Tobias Friedrich, Anton Krohmer:
On the Diameter of Hyperbolic Random Graphs. ICALP (2) 2015: 614-625 - [c60]Tobias Friedrich, Anton Krohmer:
Cliques in hyperbolic random graphs. INFOCOM 2015: 1544-1552 - [c59]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Benefit of Recombination in Noisy Evolutionary Search. ISAAC 2015: 140-150 - [c58]Tobias Friedrich, Maximilian Katzmann, Anton Krohmer:
Unbounded Discrepancy of Deterministic Random Walks on Grids. ISAAC 2015: 212-222 - [i19]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton:
The Benefit of Sex in Noisy Evolutionary Search. CoRR abs/1502.02793 (2015) - [i18]Tobias Friedrich, Anton Krohmer:
On the diameter of hyperbolic random graphs. CoRR abs/1512.00184 (2015) - 2014
- [j37]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading. ACM Trans. Algorithms 11(2): 9:1-9:35 (2014) - [j36]Tobias Friedrich, Jonathan E. Rowe:
Genetic and Evolutionary Computation. Theor. Comput. Sci. 545: 1 (2014) - [j35]Karl Bringmann, Tobias Friedrich:
Convergence of Hypervolume-Based Archiving Algorithms. IEEE Trans. Evol. Comput. 18(5): 643-657 (2014) - [c57]Karl Bringmann, Tobias Friedrich, Anton Krohmer:
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. ESA 2014: 197-208 - [c56]Karl Bringmann, Tobias Friedrich, Patrick Klitzke:
Two-dimensional subset selection for hypervolume and epsilon-indicator. GECCO 2014: 589-596 - [c55]Karl Bringmann, Tobias Friedrich, Patrick Klitzke:
Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator. PPSN 2014: 518-527 - [c54]Tobias Friedrich, Frank Neumann:
Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms. PPSN 2014: 922-931 - [i17]Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin:
On the Average-case Complexity of Parameterized Clique. CoRR abs/1410.6400 (2014) - [i16]Tobias Friedrich, Markus Wagner:
Seeding the Initial Population of Multi-Objective Evolutionary Algorithms: A Computational Study. CoRR abs/1412.0307 (2014) - 2013
- [j34]Karl Bringmann, Tobias Friedrich:
Approximation quality of the hypervolume indicator. Artif. Intell. 195: 265-290 (2013) - [j33]Karl Bringmann, Tobias Friedrich, Christian Igel, Thomas Voß:
Speeding up many-objective optimization by Monte Carlo approximations. Artif. Intell. 204: 22-29 (2013) - [j32]Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. Algorithmica 67(1): 65-88 (2013) - [j31]Tobias Friedrich, Trent Kroeger, Frank Neumann:
Weighted preferences in evolutionary multi-objective optimization. Int. J. Mach. Learn. Cybern. 4(2): 139-148 (2013) - [j30]Tobias Friedrich, Lionel Levine:
Fast simulation of large-scale growth models. Random Struct. Algorithms 42(2): 185-213 (2013) - [j29]Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond:
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theor. Comput. Sci. 472: 81-89 (2013) - [c53]Markus Wagner, Tobias Friedrich:
Efficient parent selection for Approximation-Guided Evolutionary multi-objective optimization. IEEE Congress on Evolutionary Computation 2013: 1846-1853 - [c52]Karl Bringmann, Tobias Friedrich:
Parameterized average-case complexity of the hypervolume indicator. GECCO 2013: 575-582 - [c51]S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. ICALP (1) 2013: 13-24 - [c50]Karl Bringmann, Tobias Friedrich:
Exact and Efficient Generation of Geometric Random Variates and Random Graphs. ICALP (1) 2013: 267-278 - [i15]Tobias Friedrich, Frank Neumann, Christian Thyssen:
Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. CoRR abs/1309.3816 (2013) - 2012
- [j28]Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Why rumors spread so quickly in social networks. Commun. ACM 55(6): 70-75 (2012) - [j27]Tobias Friedrich, Martin Gairing, Thomas Sauerwald:
Quasirandom Load Balancing. SIAM J. Comput. 41(4): 747-771 (2012) - [j26]Karl Bringmann, Tobias Friedrich:
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Theor. Comput. Sci. 425: 104-116 (2012) - [j25]Rudolf Berghammer, Tobias Friedrich, Frank Neumann:
Convergence of set-based multi-objective optimization, indicators and deteriorative cycles. Theor. Comput. Sci. 456: 2-17 (2012) - [c49]Jan Baumbach, Tobias Friedrich, Timo Kötzing, Anton Krohmer, Joachim Müller, Josch Pauling:
Efficient algorithms for extracting biological key pathways with global constraints. GECCO 2012: 169-176 - [c48]Karl Bringmann, Tobias Friedrich:
Convergence of hypervolume-based archiving algorithms ii: competitiveness. GECCO 2012: 457-464 - [c47]Tobias Friedrich, Anton Krohmer:
Parameterized Clique on Scale-Free Networks. ISAAC 2012: 659-668 - [c46]Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Experimental Analysis of Rumor Spreading in Social Networks. MedAlg 2012: 159-173 - [c45]Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Asynchronous Rumor Spreading in Preferential Attachment Graphs. SWAT 2012: 307-315 - 2011
- [j24]Tobias Friedrich, Nils Hebbinghaus:
Average update times for fully-dynamic all-pairs shortest paths. Discret. Appl. Math. 159(16): 1751-1758 (2011) - [j23]Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Social Networks Spread Rumors in Sublogarithmic Time. Electron. Notes Discret. Math. 38: 303-308 (2011) - [j22]Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
Quasirandom rumor spreading: An experimental analysis. ACM J. Exp. Algorithmics 16 (2011) - [j21]Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik:
Smoothed analysis of balancing networks. Random Struct. Algorithms 39(1): 115-138 (2011) - [j20]Tobias Friedrich, Christian Horoba, Frank Neumann:
Illustration of fairness in evolutionary multi-objective optimization. Theor. Comput. Sci. 412(17): 1546-1556 (2011) - [c44]Tobias Friedrich, Lionel Levine:
Fast Simulation of Large-Scale Growth Models. APPROX-RANDOM 2011: 555-566 - [c43]Tobias Friedrich, Trent Kroeger, Frank Neumann:
Weighted Preferences in Evolutionary Multi-objective Optimization. Australasian Conference on Artificial Intelligence 2011: 291-300 - [c42]Tobias Friedrich, Karl Bringmann, Thomas Voß, Christian Igel:
The logarithmic hypervolume indicator. FOGA 2011: 81-92 - [c41]Karl Bringmann, Tobias Friedrich:
Convergence of hypervolume-based archiving algorithms I: effectiveness. GECCO 2011: 745-752 - [c40]Tobias Friedrich, Frank Neumann:
Foundations of evolutionary multi-objective optimization. GECCO (Companion) 2011: 1213-1232 - [c39]Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond:
Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI 2011: 522-527 - [c38]Karl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner:
Approximation-Guided Evolutionary Multi-Objective Optimization. IJCAI 2011: 1198-1203 - [c37]Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. ISAAC 2011: 190-199 - [c36]Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald:
Randomized Diffusion for Indivisible Loads. SODA 2011: 429-439 - [c35]Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich:
Social networks spread rumors in sublogarithmic time. STOC 2011: 21-30 - [i14]Katya Vladislavleva, Tobias Friedrich, Frank Neumann, Markus Wagner:
Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation. CoRR abs/1109.1922 (2011) - 2010
- [j19]Tobias Friedrich, Thomas Sauerwald:
The Cover Time of Deterministic Random Walks. Electron. J. Comb. 17(1) (2010) - [j18]Karl Bringmann, Tobias Friedrich:
Approximating the volume of unions and intersections of high-dimensional geometric objects. Comput. Geom. 43(6-7): 601-610 (2010) - [j17]Deepak Ajwani, Tobias Friedrich:
Average-case analysis of incremental topological ordering. Discret. Appl. Math. 158(4): 240-250 (2010) - [j16]Karl Bringmann, Tobias Friedrich:
An Efficient Algorithm for Computing Hypervolume Contributions. Evol. Comput. 18(3): 383-402 (2010) - [j15]Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt:
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Evol. Comput. 18(4): 617-633 (2010) - [j14]Tobias Friedrich, Frank Neumann:
When to use bit-wise neutrality. Nat. Comput. 9(1): 283-294 (2010) - [j13]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic random walks on regular trees. Random Struct. Algorithms 37(3): 353-366 (2010) - [j12]Tobias Friedrich, Nils Hebbinghaus, Frank Neumann:
Plateaus can be harder in multi-objective optimization. Theor. Comput. Sci. 411(6): 854-864 (2010) - [c34]Tobias Friedrich, Thomas Sauerwald:
The Cover Time of Deterministic Random Walks. COCOON 2010: 130-139 - [c33]Rudolf Berghammer, Tobias Friedrich, Frank Neumann:
Set-based multi-objective optimization, indicators, and deteriorative cycles. GECCO 2010: 495-502 - [c32]Karl Bringmann, Tobias Friedrich:
The maximum hypervolume set yields near-optimal approximation. GECCO 2010: 511-518 - [c31]Thomas Voß, Tobias Friedrich, Karl Bringmann, Christian Igel:
Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary study. GECCO (Companion) 2010: 1975-1978 - [c30]Tobias Friedrich, Frank Neumann:
Foundations of evolutionary multi-objective optimization. GECCO (Companion) 2010: 2557-2576 - [c29]Karl Bringmann, Tobias Friedrich:
Tight Bounds for the Approximation Ratio of the Hypervolume Indicator. PPSN (1) 2010: 607-616 - [c28]Milan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Efficient Broadcast on Random Geometric Graphs. SODA 2010: 1412-1421 - [c27]Tobias Friedrich, Martin Gairing, Thomas Sauerwald:
Quasirandom Load Balancing. SODA 2010: 1620-1629 - [i13]Tobias Friedrich, Lionel Levine:
Fast simulation of large-scale growth models. CoRR abs/1006.1003 (2010) - [i12]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic Random Walks on Regular Trees. CoRR abs/1006.1441 (2010) - [i11]Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik:
Smoothed Analysis of Balancing Networks. CoRR abs/1006.1443 (2010) - [i10]Tobias Friedrich, Martin Gairing, Thomas Sauerwald:
Quasirandom Load Balancing. CoRR abs/1006.3302 (2010) - [i9]Tobias Friedrich, Thomas Sauerwald:
The Cover Time of Deterministic Random Walks. CoRR abs/1006.3430 (2010) - [i8]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading. CoRR abs/1012.5351 (2010) - [i7]Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
Quasirandom Rumor Spreading: An Experimental Analysis. CoRR abs/1012.5357 (2010)
2000 – 2009
- 2009
- [j11]Benjamin Doerr, Tobias Friedrich:
Deterministic Random Walks on the Two-Dimensional Grid. Comb. Probab. Comput. 18(1-2): 123-144 (2009) - [j10]Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt:
Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evol. Comput. 17(1): 3-19 (2009) - [j9]Tobias Friedrich, Pietro S. Oliveto, Dirk Sudholt, Carsten Witt:
Analysis of Diversity-Preserving Mechanisms for Global Exploration. Evol. Comput. 17(4): 455-476 (2009) - [j8]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading on Expanders. Electron. Notes Discret. Math. 34: 243-247 (2009) - [j7]Tobias Friedrich, Nils Hebbinghaus, Frank Neumann:
Comparison of simple diversity mechanisms on plateau functions. Theor. Comput. Sci. 410(26): 2455-2462 (2009) - [j6]Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler:
On the Effects of Adding Objectives to Plateau Functions. IEEE Trans. Evol. Comput. 13(3): 591-603 (2009) - [c26]Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
Quasirandom Rumor Spreading: An Experimental Analysis. ALENEX 2009: 145-153 - [c25]Karl Bringmann, Tobias Friedrich:
Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice. EMO 2009: 6-20 - [c24]Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann:
Computing single source shortest paths using single-objective fitness. FOGA 2009: 59-66 - [c23]Karl Bringmann, Tobias Friedrich:
Don't be greedy when calculating hypervolume contributions. FOGA 2009: 103-112 - [c22]Tobias Friedrich, Christian Horoba, Frank Neumann:
Multiplicative approximations and the hypervolume indicator. GECCO 2009: 571-578 - [c21]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. ICALP (1) 2009: 366-377 - [c20]Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik:
Smoothed Analysis of Balancing Networks. ICALP (2) 2009: 472-483 - [c19]Tobias Friedrich, Thomas Sauerwald:
Near-perfect load balancing by randomized rounding. STOC 2009: 121-130 - 2008
- [j5]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for incremental topological ordering. ACM Trans. Algorithms 4(4): 39:1-39:14 (2008) - [c18]Tobias Friedrich, Frank Neumann:
When to use bit-wise neutrality. IEEE Congress on Evolutionary Computation 2008: 997-1003 - [c17]Tobias Friedrich, Pietro S. Oliveto, Dirk Sudholt, Carsten Witt:
Theoretical analysis of diversity mechanisms for global exploration. GECCO 2008: 945-952 - [c16]Karl Bringmann, Tobias Friedrich:
Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. ISAAC 2008: 436-447 - [c15]Tobias Friedrich, Nils Hebbinghaus:
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. ISAAC 2008: 692-703 - [c14]Dimo Brockhoff, Tobias Friedrich, Frank Neumann:
Analyzing Hypervolume Indicator Based Algorithms. PPSN 2008: 651-660 - [c13]Tobias Friedrich, Christian Horoba, Frank Neumann:
Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. PPSN 2008: 671-680 - [c12]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic random walks on regular trees. SODA 2008: 766-772 - [c11]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom rumor spreading. SODA 2008: 773-781 - [i6]Deepak Ajwani, Tobias Friedrich:
Average-Case Analysis of Online Topological Ordering. CoRR abs/0802.1059 (2008) - [i5]Karl Bringmann, Tobias Friedrich:
Approximating the volume of unions and intersections of high-dimensional geometric objects. CoRR abs/0809.0835 (2008) - [i4]Karl Bringmann, Tobias Friedrich:
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. CoRR abs/0812.2636 (2008) - 2007
- [b1]Tobias Friedrich:
Use and avoidance of randomness. Universität Saarbrücken, 2007, pp. I-VIII, 1-120 - [j4]Tobias Friedrich, Benjamin Doerr, Christian Klein, Ralf Osbild:
Unbiased Matrix Rounding. Electron. Notes Discret. Math. 28: 41-46 (2007) - [j3]Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer:
Deterministic Random Walks on Regular Trees. Electron. Notes Discret. Math. 29: 509-513 (2007) - [c10]Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt:
On improving approximate solutions by evolutionary algorithms. IEEE Congress on Evolutionary Computation 2007: 2614-2621 - [c9]Tobias Friedrich, Nils Hebbinghaus, Frank Neumann:
Plateaus can be harder in multi-objective optimization. IEEE Congress on Evolutionary Computation 2007: 2622-2629 - [c8]Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler:
Do additional objectives make a problem harder? GECCO 2007: 765-772 - [c7]Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt:
Approximating covering problems by randomized search heuristics using multi-objective models. GECCO 2007: 797-804 - [c6]Tobias Friedrich, Nils Hebbinghaus, Frank Neumann:
Rigorous analyses of simple diversity mechanisms. GECCO 2007: 1219-1225 - [c5]Deepak Ajwani, Tobias Friedrich:
Average-Case Analysis of Online Topological Ordering. ISAAC 2007: 464-475 - [p1]Tobias Friedrich:
Verwendung und Vermeidung von Zufall [Use and Avoidance of Randomness]. Ausgezeichnete Informatikdissertationen 2007: 101-110 - [i3]Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt:
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j2]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for online topological ordering. Electron. Notes Discret. Math. 25: 7-12 (2006) - [j1]Benjamin Doerr, Tobias Friedrich:
Quasirandomness in Graphs. Electron. Notes Discret. Math. 25: 61-64 (2006) - [c4]Benjamin Doerr, Tobias Friedrich:
Deterministic Random Walks on the Two-Dimensional Grid. ISAAC 2006: 474-483 - [c3]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) Algorithm for Online Topological Ordering. SWAT 2006: 53-64 - [c2]Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild:
Unbiased Matrix Rounding. SWAT 2006: 102-112 - [i2]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for online topological ordering. CoRR abs/cs/0602073 (2006) - [i1]Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild:
Unbiased Matrix Rounding. CoRR abs/cs/0604068 (2006) - 2005
- [c1]Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild:
Rounding of Sequences and Matrices, with Applications. WAOA 2005: 96-109
Coauthor Index
[d2] [i97] [j82] [j81] [j79] [j78] [c174] [c162] [i81] [j72] [j70] [j68] [j67] [c156] [c136] [c135] [c129] [c125] [c123] [i67] [i66] [i61] [i58] [j63] [j62] [c122] [c120] [c116] [i55] [i50] [i49] [i47] [c112] [c111] [c106] [c105] [i40] [i38] [i37] [i35] [j55] [j50] [c103] [c99] [c96] [c95] [i31] [i30] [c78] [c77] [c70]
Gregor Lagodzinski
aka: J. A. Gregor Lagodzinski
aka: J. A. Gregor Lagodzinski
[c172] [c171] [c170] [i84] [i82] [j74] [c142] [i70] [c126] [j65] [j61] [c121] [j59] [j58] [c115] [c114] [i43] [i33] [c100] [i28] [i27] [c92] [c91] [c87] [c86] [c82] [i24] [c72] [c68] [e2] [e1] [j44] [j43] [j42] [c54] [j31] [i15] [j25] [j20] [c43] [c40] [c38] [i14] [j15] [j14] [j12] [c33] [c30] [j10] [j7] [j6] [c24] [c22] [c18] [c14] [c13] [c10] [c9] [c8] [c7] [c6] [i3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
