Tobias Friedrich

394 papers A* 39A 77B 38C 5Misc 3Journal 195Unranked 34

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Combining Crown Structures for Vulnerability Measures. Algorithmica Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif
2025	J	`jnl`	Analysis of the (1+1) EA on LeadingOnes with Constraints. Algorithmica Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan
2025	J	`jnl`	Binary CoRR Farehe Soheil, Kirill Simonov, Tobias Friedrich
2025	B	`conf`	Binary k-Center with Missing Entries: Structure Leads to Tractability. IPEC Tobias Friedrich, Kirill Simonov, Farehe Soheil
2025	A*	`conf`	Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks. AAAI Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2025	J	`jnl`	Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. Algorithmica Samuel Baguley, Tobias Friedrich, Aneta Neumann, Frank Neumann, Marcus Pappik, Ziena Zeif
2025	J	`jnl`	Optimal Padded Decomposition For Bounded Treewidth Graphs. TheoretiCS Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif
2025	B	`conf`	Parameterized Complexity of Vehicle Routing. IPEC Michelle Döring, Jan Fehse, Tobias Friedrich, Paula Marten, Niklas Mohrin, Kirill Simonov, Farehe Soheil, Jakob Timm, Shaily Verma
2025	J	`jnl`	Parameterized Complexity of Vehicle Routing. CoRR Michelle Döring, Jan Fehse, Tobias Friedrich, Paula Marten, Niklas Mohrin, Kirill Simonov, Farehe Soheil, Jakob Timm, Shaily Verma
2025	J	`jnl`	Sampling repulsive Gibbs point processes using random graphs. Comb. Probab. Comput. Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik
2025	A*	`conf`	Strategic Network Creation for Enabling Greedy Routing. AAAI Julian Berger, Tobias Friedrich, Pascal Lenzner, Paraskevi Machaira, Janosch Ruff
2025	J	`jnl`	Teaching Wav2Vec2 the Language of the Brain. CoRR Tobias Fiedler, Leon Hermann, Florian Müller, Sarel Cohen, Sang (Peter) Chin, Tobias Friedrich, Eilon Vaadia
2025	A	`conf`	Temporal Network Creation Games: The Impact of Non-Locality and Terminals. AAMAS Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2025	B	`conf`	Text Image Super-Resolution for Improved OCR in Real-Life Scenarios using Swin Transformers. DocEng Philipp Hildebrandt, Maximilian Schulze, Sarel Cohen, Vanja Doskoc, Raid Saabni, Tobias Friedrich
2024	—	`conf`	A Contraction Tree SAT Encoding for Computing Twin-Width. PAKDD (2) Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, Kirill Simonov
2024	J	`jnl`	Approximate Distance Sensitivity Oracles in Subquadratic Space. TheoretiCS Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2024	J	`jnl`	Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. SIAM J. Discret. Math. Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller
2024	B	`conf`	Combining Crown Structures for Vulnerability Measures. IPEC Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif
2024	J	`jnl`	Combining Crown Structures for Vulnerability Measures. CoRR Katrin Casel, Tobias Friedrich, Aikaterini Niklanovits, Kirill Simonov, Ziena Zeif
2024	Misc	`conf`	Detecting Continuous Gravitational Waves Using Generated Training Data. ICASSP Judith Herrmann, Raphael Kunert, Ron Hachmon, Aviv Markus, Allison Gunby-Mann, Sarel Cohen, Tobias Friedrich, Peter Chin
2024	J	`jnl`	Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2024	A	`conf`	From Market Saturation to Social Reinforcement: Understanding the Impact of Non-Linearity in Information Diffusion Models. AAMAS Tobias Friedrich, Andreas Göbel, Nicolas Klodt, Martin S. Krejca, Marcus Pappik
2024	J	`jnl`	Geometric Network Creation Games. SIAM J. Discret. Math. Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
2024	A	`conf`	How to Reduce Temporal Cliques to Find Sparse Spanners. ESA Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells
2024	A*	`conf`	Improved Distance (Sensitivity) Oracles with Subquadratic Space. FOCS Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2024	J	`jnl`	Improved Distance (Sensitivity) Oracles with Subquadratic Space. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2024	J	`jnl`	Integrating higher-order relations for enhanced twitter bot detection. Soc. Netw. Anal. Min. Sebastian Reiche, Sarel Cohen, Kirill Simonov, Tobias Friedrich
2024	J	`jnl`	Optimal Padded Decomposition For Bounded Treewidth Graphs. CoRR Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif
2024	B	`conf`	Predicting the Closing Cross Auction Results at the NASDAQ Stock Exchange. ESANN Sarel Cohen, Manuel Hettich, Philipp Bielefeld, Crispin Schomers, Tobias Friedrich
2024	A*	`conf`	Real-World Networks Are Low-Dimensional: Theoretical and Practical Assessment. IJCAI Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller
2024	J	`jnl`	Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation. CoRR Thomas Bläsius, Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca
2024	J	`jnl`	Shortest distances as enumeration problem. Discret. Appl. Math. Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid
2024	J	`jnl`	Strategic Network Creation for Enabling Greedy Routing. CoRR Julian Berger, Tobias Friedrich, Pascal Lenzner, Paraskevi Machaira, Janosch Ruff
2024	J	`jnl`	Temporal Network Creation Games: The Impact of Non-Locality and Terminals. CoRR Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2024	A*	`conf`	The Irrelevance of Influencers: Information Diffusion with Re-Activation and Immunity Lasts Exponentially Long on Social Network Models. AAAI Tobias Friedrich, Andreas Göbel, Nicolas Klodt, Martin S. Krejca, Marcus Pappik
2024	J	`jnl`	Towards Linear Spanners in All Temporal Cliques. CoRR Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells
2023	J	`jnl`	A simple statistic for determining the dimensionality of complex networks. CoRR Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller
2023	A	`conf`	Analysis of (1+1) EA on LeadingOnes with Constraints. GECCO Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan
2023	J	`jnl`	Analysis of the (1+1) EA on LeadingOnes with Constraints. CoRR Tobias Friedrich, Timo Kötzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan
2023	A	`conf`	Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. ALENEX 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
2023	A*	`conf`	Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Approximate Distance Sensitivity Oracles in Subquadratic Space. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	A*	`conf`	Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. STOC Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif
2023	—	`conf`	Beyond Following: Augmenting Bot Detection with the Integration of Behavioral Patterns. COMPLEX NETWORKS (1) Sebastian Reiche, Sarel Cohen, Kirill Simonov, Tobias Friedrich
2023	A*	`conf`	Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. ICALP Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller
2023	J	`jnl`	Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. CoRR Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller
2023	B	`conf`	Compact Distance Oracles with Large Sensitivity and Low Stretch. WADS Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Compact Distance Oracles with Large Sensitivity and Low Stretch. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Crossover for Cardinality Constrained Optimization. ACM Trans. Evol. Learn. Optim. Tobias Friedrich, Timo Kötzing, Aishwarya Radhakrishnan, Leon Schiller, Martin Schirneck, Georg Tennigkeit, Simon Wietheger
2023	—	`conf`	Deep Distance Sensitivity Oracles. COMPLEX NETWORKS (1) Davin Jeong, Allison Gunby-Mann, Sarel Cohen, Maximilian Katzmann, Chau Pham, Arnav Bhakta, Tobias Friedrich, Peter Chin
2023	B	`conf`	Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. WG Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
2023	J	`jnl`	Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. Algorithmica Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
2023	A	`conf`	Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. GECCO Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich
2023	J	`jnl`	Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. CoRR Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich
2023	J	`jnl`	Evolutionary Minimization of Traffic Congestion. IEEE Trans. Evol. Comput. Maximilian Böther, Leon Schiller, Philipp Fischbeck, Louise Molitor, Martin S. Krejca, Tobias Friedrich
2023	—	`conf`	Fair Correlation Clustering in Forests. FORC Katrin Casel, Tobias Friedrich, Martin Schirneck, Simon Wietheger
2023	J	`jnl`	Fair Correlation Clustering in Forests. CoRR Katrin Casel, Tobias Friedrich, Martin Schirneck, Simon Wietheger
2023	A	`conf`	Fast Feature Selection with Fairness Constraints. AISTATS Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch, Sarel Cohen, Daniel G. Waddington, Tobias Friedrich, Michael W. Mahoney
2023	A*	`conf`	Fault-Tolerant ST-Diameter Oracles. ICALP Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Fault-Tolerant ST-Diameter Oracles. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	A	`conf`	Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. GECCO Samuel Baguley, Tobias Friedrich, Aneta Neumann, Frank Neumann, Marcus Pappik, Ziena Zeif
2023	J	`jnl`	From symmetry to asymmetry: Generalizing TSP approximations by parametrization. J. Comput. Syst. Sci. Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm
2023	J	`jnl`	Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2023	A	`conf`	On the Giant Component of Geometric Inhomogeneous Random Graphs. ESA Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif
2023	J	`jnl`	On the Giant Component of Geometric Inhomogeneous Random Graphs. CoRR Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif
2023	J	`jnl`	Polymer dynamics via cliques: New conditions for approximations. Theor. Comput. Sci. Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik
2023	A	`conf`	Single-Peaked Jump Schelling Games. AAMAS Tobias Friedrich, Pascal Lenzner, Louise Molitor, Lars Seifert
2023	B	`conf`	Single-Peaked Jump Schelling Games. SAGT Tobias Friedrich, Pascal Lenzner, Louise Molitor, Lars Seifert
2023	J	`jnl`	Single-Peaked Jump Schelling Games. CoRR Tobias Friedrich, Pascal Lenzner, Louise Molitor, Lars Seifert
2023	J	`jnl`	Social Distancing Network Creation. Algorithmica Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko
2023	B	`conf`	Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover. SEA Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt
2023	J	`jnl`	Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. Theory Comput. Syst. Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
2023	A	`conf`	Strongly Hyperbolic Unit Disk Graphs. STACS Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan
2023	C	`conf`	Sustainable On-Street Parking Mapping with Deep Learning and Airborne Imagery. IDEAL Bashini K. Mahaarachchi, Sarel Cohen, Bodo Bookhagen, Vanja Doskoc, Tobias Friedrich
2023	A*	`conf`	Temporal Network Creation Games. IJCAI Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2023	J	`jnl`	Temporal Network Creation Games. CoRR Davide Bilò, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas
2023	—	`conf`	The Common-Neighbors Metric Is Noise-Robust and Reveals Substructures of Real-World Networks. PAKDD (1) Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca
2023	A*	`conf`	The Impact of Cooperation in Bilateral Network Creation. PODC Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Arthur Zahn
2023	J	`jnl`	The impact of geometry on monochrome regions in the flip Schelling process. Comput. Geom. Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor
2023	J	`jnl`	The impact of heterogeneity and geometry on the proof complexity of random satisfiability. Random Struct. Algorithms Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
2022	A	`conf`	A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs. APPROX/RANDOM Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif
2022	J	`jnl`	A Spectral Independence View on Hard Spheres via Block Dynamics. SIAM J. Discret. Math. Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik
2022	J	`jnl`	AI Compliance - Challenges of Bridging Data Science and Law. ACM J. Data Inf. Qual. Philipp Hacker, Felix Naumann, Tobias Friedrich, Stefan Grundmann, Anja Lehmann, Herbert Zech
2022	B	`conf`	Accelerated Information Dissemination on Networks with Local and Global Edges. SIROCCO Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca, Thomas Sauerwald
2022	Misc	`conf`	Algorithms for Hard-Constraint Point Processes via Discretization. COCOON Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik
2022	A	`conf`	An Efficient Branch-and-Bound Solver for Hitting Set. ALENEX Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
2022	A	`conf`	Analysis of a gray-box operator for vertex cover. GECCO Samuel Baguley, Tobias Friedrich, Timo Kötzing, Xiaoyue Li, Marcus Pappik, Ziena Zeif
2022	J	`jnl`	Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. CoRR Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif
2022	A	`conf`	Crossover for cardinality constrained optimization. GECCO Tobias Friedrich, Timo Kötzing, Aishwarya Radhakrishnan, Leon Schiller, Martin Schirneck, Georg Tennigkeit, Simon Wietheger
2022	J	`jnl`	Deep Distance Sensitivity Oracles. CoRR Davin Jeong, Chau Pham, Arnav Bhakta, Sarel Cohen, Maximilian Katzmann, Tobias Friedrich, Sang (Peter) Chin
2022	A*	`conf`	Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. ICALP Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2022	J	`jnl`	Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. CoRR Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2022	J	`jnl`	Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. CoRR Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
2022	J	`jnl`	Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ACM Trans. Algorithms Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
2022	J	`jnl`	Efficiently enumerating hitting sets of hypergraphs arising in data profiling. J. Comput. Syst. Sci. Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck
2022	J	`jnl`	Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2022	—	`conf`	Escaping Local Optima with Local Search: A Theory-Driven Discussion. PPSN (2) Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Amirhossein Rajabi
2022	J	`jnl`	Fast Feature Selection with Fairness Constraints. CoRR Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch, Sarel Cohen, Daniel G. Waddington, Tobias Friedrich, Michael W. Mahoney
2022	A	`conf`	Fixed-Parameter Sensitivity Oracles. ITCS Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger
2022	B	`conf`	Optical character recognition guided image super resolution. DocEng Philipp Hildebrandt, Maximilian Schulze, Sarel Cohen, Vanja Doskoc, Raid Saabni, Tobias Friedrich
2022	B	`conf`	PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set. IPEC Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt
2022	A	`conf`	Pareto Optimal and Popular House Allocation with Lower and Upper Quotas. AAMAS Ágnes Cseh, Tobias Friedrich, Jannik Peters
2022	J	`jnl`	Pareto optimization for subset selection with dynamic cost constraints. Artif. Intell. Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich
2022	A*	`conf`	Social Distancing Network Creation. ICALP Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko
2022	J	`jnl`	Social Distancing Network Creation. CoRR Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko
2022	J	`jnl`	The Impact of Cooperation in Bilateral Network Creation. CoRR Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Arthur Zahn
2022	J	`jnl`	The complexity of dependency detection and discovery in relational databases. Theor. Comput. Sci. Thomas Bläsius, Tobias Friedrich, Martin Schirneck
2022	—	`conf`	Theoretical Study of Optimizing Rugged Landscapes with the cGA. PPSN (2) Tobias Friedrich, Timo Kötzing, Frank Neumann, Aishwarya Radhakrishnan
2022	J	`jnl`	Theoretical Study of Optimizing Rugged Landscapes with the cGA. CoRR Tobias Friedrich, Timo Kötzing, Frank Neumann, Aishwarya Radhakrishnan
2022	J	`jnl`	Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081). Dagstuhl Reports Anne Auger, Carlos M. Fonseca, Tobias Friedrich, Johannes Lengler
2022	A	`conf`	Towards explainable real estate valuation via evolutionary algorithms. GECCO Sebastian Angrick, Ben Bals, Niko Hastrich, Maximilian Kleissl, Jonas Schmidt, Vanja Doskoc, Louise Molitor, Tobias Friedrich, Maximilian Katzmann
2022	J	`jnl`	Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials. CoRR Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik
2022	A*	`conf`	What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization. ICLR Maximilian Böther, Otto Kißig, Martin Taraz, Sarel Cohen, Karen Seidel, Tobias Friedrich
2022	J	`jnl`	What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization. CoRR Maximilian Böther, Otto Kißig, Martin Taraz, Sarel Cohen, Karen Seidel, Tobias Friedrich
2022	J	`jnl`	Zeros and approximations of Holant polynomials on the complex plane. Comput. Complex. Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski
2021	A*	`conf`	A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics. KDD Nicolas Klodt, Lars Seifert, Arthur Zahn, Katrin Casel, Davis Issac, Tobias Friedrich
2021	A*	`conf`	A Spectral Independence View on Hard Spheres via Block Dynamics. ICALP Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik
2021	J	`jnl`	Adaptive Sampling for Fast Constrained Maximization of Submodular Function. CoRR Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich
2021	A	`conf`	Adaptive Sampling for Fast Constrained Maximization of Submodular Functions. AISTATS Francesco Quinzan, Vanja Doskoc, Andreas Göbel, Tobias Friedrich
2021	J	`jnl`	Algorithms for general hard-constraint point processes via discretization. CoRR Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik
2021	J	`jnl`	An Efficient Branch-and-Bound Solver for Hitting Set. CoRR Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand
2021	A	`conf`	Balanced Crown Decomposition for Connectivity Constraints. ESA Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
2021	J	`jnl`	Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane. CoRR Tobias Friedrich, Maximilian Katzmann, Leon Schiller
2021	—	`conf`	Drug Repurposing Using Link Prediction on Knowledge Graphs with Applications to Non-volatile Memory. COMPLEX NETWORKS Sarel Cohen, Moshik Hershcovitch, Martin Taraz, Otto Kißig, Andrew Wood, Daniel G. Waddington, Peter Chin, Tobias Friedrich
2021	B	`conf`	Efficiency and Stability in Euclidean Network Design. SPAA Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters, Daniel Stephan, Michael Vaichenker
2021	J	`jnl`	Efficiency and Stability in Euclidean Network Design. CoRR Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters, Daniel Stephan, Michael Vaichenker
2021	A	`conf`	Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. ESA Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
2021	A	`conf`	Efficiently Computing Maximum Flows in Scale-Free Networks. ESA Thomas Bläsius, Tobias Friedrich, Christopher Weyand
2021	J	`jnl`	Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations. Nat. Comput. Francesco Quinzan, Andreas Göbel, Markus Wagner, Tobias Friedrich
2021	A	`conf`	Evolutionary minimization of traffic congestion. GECCO Maximilian Böther, Leon Schiller, Philipp Fischbeck, Louise Molitor, Martin S. Krejca, Tobias Friedrich
2021	J	`jnl`	Fixed-Parameter Sensitivity Oracles. CoRR Davide Bilò, Katrin Casel, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, J. A. Gregor Lagodzinski, Martin Schirneck, Simon Wietheger
2021	B	`conf`	Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. SEA Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
2021	B	`conf`	From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. FCT Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm
2021	A	`conf`	Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. ESA Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2021	J	`jnl`	Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. CoRR Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2021	A*	`conf`	On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. ICALP J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich
2021	J	`jnl`	Pareto optimal and popular house allocation with lower and upper quotas. CoRR Ágnes Cseh, Tobias Friedrich, Jannik Peters
2021	J	`jnl`	Routing in Strongly Hyperbolic Unit Disk Graphs. CoRR Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan
2021	A*	`conf`	Selfish Creation of Social Networks. AAAI Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko
2021	A	`conf`	Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. SAT Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton
2021	B	`conf`	Space-Efficient Fault-Tolerant Diameter Oracles. MFCS Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2021	J	`jnl`	Space-Efficient Fault-Tolerant Diameter Oracles. CoRR Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2021	J	`jnl`	The Complexity of Dependency Detection and Discovery in Relational Databases. CoRR Thomas Bläsius, Tobias Friedrich, Martin Schirneck
2021	J	`jnl`	The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs. CoRR Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor
2021	B	`conf`	The Impact of Geometry on Monochrome Regions in the Flip Schelling Process. ISAAC Thomas Bläsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor
2021	A*	`conf`	The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. SODA Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
2021	J	`jnl`	Towards Explainable Real Estate Valuation via Evolutionary Algorithms. CoRR Sebastian Angrick, Ben Bals, Niko Hastrich, Maximilian Kleissl, Jonas Schmidt, Vanja Doskoc, Maximilian Katzmann, Louise Molitor, Tobias Friedrich
2020	C	`conf`	A Strategic Routing Framework and Algorithms for Computing Alternative Paths. ATMOS 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
2020	J	`jnl`	A Strategic Routing Framework and Algorithms for Computing Alternative Paths. CoRR 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
2020	J	`jnl`	Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints. Theor. Comput. Sci. Tobias Friedrich, Timo Kötzing, J. A. Gregor Lagodzinski, Frank Neumann, Martin Schirneck
2020	J	`jnl`	Balanced Crown Decomposition for Connectivity Constraints. CoRR Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
2020	J	`jnl`	Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann
2020	J	`jnl`	Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann
2020	J	`jnl`	Efficiently Computing Maximum Flows in Scale-Free Networks. CoRR Thomas Bläsius, Tobias Friedrich, Christopher Weyand
2020	—	`conf`	Fair Tree Connection Games with Topology-Dependent Edge Cost. FSTTCS Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor
2020	J	`jnl`	Fair Tree Connection Games with Topology-Dependent Edge Cost. CoRR Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor
2020	A*	`conf`	Flow-Based Network Creation Games. IJCAI Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
2020	J	`jnl`	Flow-Based Network Creation Games. CoRR Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
2020	J	`jnl`	Greed is Good for Deterministic Scale-Free Networks. Algorithmica Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger
2020	J	`jnl`	Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery. Proc. VLDB Endow. Johann Birnick, Thomas Bläsius, Tobias Friedrich, Felix Naumann, Thorsten Papenbrock, Martin Schirneck
2020	J	`jnl`	Hyperbolic Embeddings for Near-Optimal Greedy Routing. ACM J. Exp. Algorithmics Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
2020	—	`conf`	Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation. ICONIP (3) Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Manuel Rizzo, Arthur Zahn
2020	A	`conf`	Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. ECAI Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Aneta Neumann, Frank Neumann, Francesco Quinzan
2020	J	`jnl`	On Counting (Quantum-)Graph Homomorphisms in Finite Fields. CoRR J. A. Gregor Lagodzinski, Andreas Göbel, Katrin Casel, Tobias Friedrich
2020	J	`jnl`	Polymer dynamics via cliques with applications to hard-sphere mixtures. CoRR Tobias Friedrich, Andreas Göbel, Martin S. Krejca, Marcus Pappik
2020	J	`jnl`	Selfish Creation of Social Networks. CoRR Davide Bilò, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko
2020	J	`jnl`	Shortest Distances as Enumeration Problem. CoRR Katrin Casel, Tobias Friedrich, Stefan Neubert, Markus L. Schmid
2020	A	`conf`	Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. STACS Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
2020	J	`jnl`	The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. CoRR Thomas Bläsius, Tobias Friedrich, Andreas Göbel, Jordi Levy, Ralf Rothenberger
2020	A	`conf`	The Minimization of Random Hypergraphs. ESA Thomas Bläsius, Tobias Friedrich, Martin Schirneck
2020	J	`jnl`	timeXplain - A Framework for Explaining the Predictions of Time Series Classifiers. CoRR Felix Mujkanovic, Vanja Doskoc, Martin Schirneck, Patrick Schäfer, Tobias Friedrich
2019	J	`jnl`	A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints. CoRR Álvaro Parra Bustos, Tat-Jun Chin, Frank Neumann, Tobias Friedrich, Maximilian Katzmann
2019	—	`conf`	Convergence and Hardness of Strategic Schelling Segregation. WINE Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Louise Molitor, Marcus Pappik, Friedrich Schöne, Fabian Sommer, David Stangl
2019	J	`jnl`	Convergence and Hardness of Strategic Schelling Segregation. CoRR Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Louise Molitor, Marcus Pappik, Friedrich Schöne, Fabian Sommer, David Stangl
2019	A	`conf`	Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. ALENEX Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck
2019	A	`conf`	Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2019	J	`jnl`	Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2019	A	`conf`	From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial). STACS Tobias Friedrich
2019	J	`jnl`	From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. CoRR Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm
2019	B	`conf`	Geometric Network Creation Games. SPAA Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
2019	J	`jnl`	Geometric Network Creation Games. CoRR Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko
2019	A*	`conf`	Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. AAAI Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
2019	J	`jnl`	Island Models Meet Rumor Spreading. Algorithmica Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck
2019	A*	`conf`	Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. ICAPS 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
2019	J	`jnl`	Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. CoRR Vanja Doskoc, Tobias Friedrich, Andreas Göbel, Frank Neumann, Aneta Neumann, Francesco Quinzan
2019	—	`conf`	On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. TACAS (1) Thomas Bläsius, Tobias Friedrich, Andrew M. Sutton
2019	A*	`conf`	Pareto Optimization for Subset Selection with Dynamic Cost Constraints. AAAI Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich
2019	A	`ed.`	Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2019, Potsdam, Germany, August 27-29, 2019. FOGA Tobias Friedrich, Carola Doerr, Dirk V. Arnold
2019	J	`jnl`	Quasi-random Image Transition and Animation. Aust. J. Intell. Inf. Process. Syst. Aneta Neumann, Frank Neumann, Tobias Friedrich
2019	J	`jnl`	Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann
2019	J	`jnl`	Routing for on-street parking search using probabilistic data. AI Commun. Tobias Friedrich, Martin S. Krejca, Ralf Rothenberger, Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou
2019	A*	`conf`	Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. IJCAI Tobias Friedrich, Ralf Rothenberger
2019	J	`jnl`	Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. CoRR Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann
2019	J	`jnl`	The Minimization of Random Hypergraphs. CoRR Thomas Bläsius, Tobias Friedrich, Martin Schirneck
2019	A*	`conf`	The Satisfiability Threshold for Non-Uniform Random 2-SAT. ICALP Tobias Friedrich, Ralf Rothenberger
2019	J	`jnl`	The Satisfiability Threshold for Non-Uniform Random 2-SAT. CoRR Tobias Friedrich, Ralf Rothenberger
2019	J	`jnl`	Theory of Randomized Optimization Heuristics (Dagstuhl Reports 19431). Dagstuhl Reports Carola Doerr, Carlos M. Fonseca, Tobias Friedrich, Xin Yao
2019	J	`jnl`	Unbiasedness of estimation-of-distribution algorithms. Theor. Comput. Sci. Tobias Friedrich, Timo Kötzing, Martin S. Krejca
2019	C	`conf`	Understanding the Effectiveness of Data Reduction in Public Transportation Networks. WAW Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck
2019	J	`jnl`	Understanding the Effectiveness of Data Reduction in Public Transportation Networks. CoRR Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck
2019	J	`jnl`	Zeros and approximations of Holant polynomials on the complex plane. CoRR Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor Lagodzinski
2018	J	`jnl`	Cliques in Hyperbolic Random Graphs. Algorithmica Thomas Bläsius, Tobias Friedrich, Anton Krohmer
2018	J	`jnl`	De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. Algorithmica Karl Bringmann, Tobias Friedrich, Anton Krohmer
2018	J	`jnl`	Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. IEEE/ACM Trans. Netw. Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue
2018	A*	`conf`	Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. ICALP Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
2018	J	`jnl`	Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. CoRR Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry
2018	J	`jnl`	Escaping Local Optima Using Crossover With Emergent Diversity. IEEE Trans. Evol. Comput. Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2018	A	`conf`	Escaping large deceptive basins of attraction with heavy-tailed mutation operators. GECCO Tobias Friedrich, Francesco Quinzan, Markus Wagner
2018	J	`jnl`	Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations CoRR Tobias Friedrich, Andreas Göbel, Francesco Quinzan, Markus Wagner
2018	J	`jnl`	Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. CoRR Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
2018	—	`conf`	Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization. PPSN (1) Tobias Friedrich, Andreas Göbel, Francesco Quinzan, Markus Wagner
2018	A	`conf`	Hyperbolic Embeddings for Near-Optimal Greedy Routing. ALENEX Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
2018	A	`conf`	Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. GECCO Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
2018	B	`conf`	Memory-Restricted Routing with Tiled Map Data. SMC Thomas Bläsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Ralf Rothenberger, Julius Severin, Fabian Sommer, Justin Trautmann
2018	J	`jnl`	On the Diameter of Hyperbolic Random Graphs. SIAM J. Discret. Math. Tobias Friedrich, Anton Krohmer
2018	J	`jnl`	On the Enumeration of Minimal Hitting Sets in Lexicographical Order. CoRR Thomas Bläsius, Tobias Friedrich, Kitty Meeks, Martin Schirneck
2018	J	`jnl`	Pareto Optimization for Subset Selection with Dynamic Cost Constraints. CoRR Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich
2018	A	`conf`	Randomized greedy algorithms for covering problems. GECCO Wanru Gao, Tobias Friedrich, Frank Neumann, Christian Hercher
2018	A	`conf`	Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. SAT Tobias Friedrich, Ralf Rothenberger
2018	C	`conf`	Towards a Systematic Evaluation of Generative Network Models. WAW Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel
2018	J	`jnl`	Unbounded Discrepancy of Deterministic Random Walks on Grids. SIAM J. Discret. Math. Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
2017	A*	`conf`	A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. AAAI Tobias Friedrich, Timo Kötzing, Markus Wagner
2017	A	`conf`	Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. FOGA Tobias Friedrich, Timo Kötzing, Gregor Lagodzinski, Frank Neumann, Martin Schirneck
2017	—	`conf`	Analyzing search heuristics with differential equations. GECCO (Companion) Tobias Friedrich, Timo Kötzing, Anna Melnichenko
2017	J	`jnl`	Approximating Optimization Problems using EAs on Scale-Free Networks. CoRR Ankit Chauhan, Tobias Friedrich, Francesco Quinzan
2017	A	`conf`	Approximating optimization problems using EAs on scale-free networks. GECCO Ankit Chauhan, Tobias Friedrich, Francesco Quinzan
2017	A	`conf`	Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. ESA Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton
2017	J	`jnl`	Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. CoRR Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton
2017	B	`conf`	Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack. SPAA Tobias Friedrich, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert, David Schumann
2017	B	`conf`	Efficient Best Response Computation for Strategic Network Formation Under Attack. SAGT Tobias Friedrich, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert, David Schumann
2017	B	`conf`	Improving local search in a minimum vertex cover solver for classes of networks. CEC Markus Wagner, Tobias Friedrich, Marius Lindauer
2017	A	`conf`	Island models meet rumor spreading. GECCO Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Kötzing, Martin Schirneck
2017	J	`jnl`	Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar
2017	A	`conf`	On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. FOGA Mojgan Pourhassan, Tobias Friedrich, Frank Neumann
2017	A*	`conf`	Phase Transitions for Scale-Free SAT Formulas. AAAI Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton
2017	J	`jnl`	Quasi-random Agents for Image Transition and Animation. CoRR Aneta Neumann, Frank Neumann, Tobias Friedrich
2017	A	`conf`	Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. GECCO Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann
2017	A	`conf`	Resampling vs Recombination: a Statistical Run Time Estimation. FOGA Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
2017	—	`conf`	Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. Australasian Conference on Artificial Intelligence Wanru Gao, Tobias Friedrich, Timo Kötzing, Frank Neumann
2017	J	`jnl`	The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise. IEEE Trans. Evol. Comput. Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2017	A*	`conf`	What's Hot in Evolutionary Computation. AAAI Tobias Friedrich, Frank Neumann
2016	J	`jnl`	A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover. CoRR Tobias Friedrich, Timo Kötzing, Markus Wagner
2016	—	`conf`	Ant Colony Optimization Beats Resampling on Noisy Functions. GECCO (Companion) Tobias Friedrich, Timo Kötzing, Francesco Quinzan, Andrew M. Sutton
2016	A	`conf`	EDAs cannot be Balanced and Stable. GECCO Tobias Friedrich, Timo Kötzing, Martin S. Krejca
2016	J	`jnl`	Efficient Best-Response Computation for Strategic Network Formation under Attack. CoRR Sven Ihde, Christoph Keßler, Stefan Neubert, David Schumann, Pascal Lenzner, Tobias Friedrich
2016	A	`conf`	Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. ESA Thomas Bläsius, Tobias Friedrich, Anton Krohmer, Sören Laue
2016	A	`conf`	Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. PPSN Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2016	J	`jnl`	Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. CoRR Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2016	A	`conf`	Escaping Local Optima with Diversity Mechanisms and Crossover. GECCO Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton
2016	A	`conf`	Fast Building Block Assembly by Majority Vote Crossover. GECCO Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Samadhi Nallaperuma, Frank Neumann, Martin Schirneck
2016	A	`conf`	Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover. PPSN Wanru Gao, Tobias Friedrich, Frank Neumann
2016	—	`ed.`	Genetic and Evolutionary Computation Conference, GECCO 2016, Denver, CO, USA, July 20-24, 2016, Companion Material Proceedings GECCO (Companion) Tobias Friedrich, Frank Neumann, Andrew M. Sutton
2016	A	`conf`	Graceful Scaling on Uniform Versus Steep-Tailed Noise. PPSN Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2016	—	`conf`	Greed is Good for Deterministic Scale-Free Networks. FSTTCS Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger
2016	J	`jnl`	Greed is Good for Deterministic Scale-Free Networks. CoRR Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger
2016	A	`conf`	Hyperbolic Random Graphs: Separators and Treewidth. ESA Thomas Bläsius, Tobias Friedrich, Anton Krohmer
2016	A	`conf`	On the Robustness of Evolving Populations. PPSN Tobias Friedrich, Timo Kötzing, Andrew M. Sutton
2016	A	`conf`	Probabilistic Routing for On-Street Parking Search. ESA Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, Tobias Friedrich
2016	A	`ed.`	Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20 - 24, 2016 GECCO Tobias Friedrich, Frank Neumann, Andrew M. Sutton
2016	J	`jnl`	Robustness of Ant Colony Optimization to Noise. Evol. Comput. Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2016	B	`conf`	Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms. MFCS Tobias Friedrich
2016	—	`conf`	The Benefit of Recombination in Noisy Evolutionary Search. GECCO (Companion) Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2016	B	`conf`	The Parameterized Complexity of Dependency Detection in Relational Databases. IPEC Thomas Bläsius, Tobias Friedrich, Martin Schirneck
2015	A*	`conf`	Cliques in hyperbolic random graphs. INFOCOM Tobias Friedrich, Anton Krohmer
2015	B	`conf`	Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator. CEC Karl Bringmann, Tobias Friedrich, Patrick Klitzke
2015	J	`jnl`	Efficient optimization of many objectives by approximation-guided evolution. Eur. J. Oper. Res. Markus Wagner, Karl Bringmann, Tobias Friedrich, Frank Neumann
2015	J	`jnl`	Genetic and Evolutionary Computation. Theor. Comput. Sci. Tobias Friedrich, Jun He, Thomas Jansen, Alberto Moraglio
2015	J	`jnl`	Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms. Evol. Comput. Tobias Friedrich, Frank Neumann
2015	J	`jnl`	Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. Evol. Comput. Tobias Friedrich, Frank Neumann, Christian Thyssen
2015	—	`conf`	On the Diameter of Hyperbolic Random Graphs. ICALP (2) Tobias Friedrich, Anton Krohmer
2015	J	`jnl`	On the average-case complexity of parameterized clique. Theor. Comput. Sci. Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin
2015	J	`jnl`	On the diameter of hyperbolic random graphs. CoRR Tobias Friedrich, Anton Krohmer
2015	J	`jnl`	On the kernel size of clique cover reductions for random intersection graphs. J. Discrete Algorithms Tobias Friedrich, Christian Hercher
2015	J	`jnl`	Parameterized clique on inhomogeneous random graphs. Discret. Appl. Math. Tobias Friedrich, Anton Krohmer
2015	J	`jnl`	Randomized diffusion for indivisible loads. J. Comput. Syst. Sci. Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald
2015	A	`conf`	Robustness of Ant Colony Optimization to Noise. GECCO Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2015	J	`jnl`	Seeding the initial population of multi-objective evolutionary algorithms: A computational study. Appl. Soft Comput. Tobias Friedrich, Markus Wagner
2015	B	`conf`	The Benefit of Recombination in Noisy Evolutionary Search. ISAAC Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2015	J	`jnl`	The Benefit of Sex in Noisy Evolutionary Search. CoRR Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
2015	—	`conf`	Ultra-Fast Load Balancing on Scale-Free Networks. ICALP (2) Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald
2015	B	`conf`	Unbounded Discrepancy of Deterministic Random Walks on Grids. ISAAC Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
2014	J	`jnl`	Convergence of Hypervolume-Based Archiving Algorithms. IEEE Trans. Evol. Comput. Karl Bringmann, Tobias Friedrich
2014	A	`conf`	De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. ESA Karl Bringmann, Tobias Friedrich, Anton Krohmer
2014	A	`conf`	Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator. PPSN Karl Bringmann, Tobias Friedrich, Patrick Klitzke
2014	J	`jnl`	Genetic and Evolutionary Computation. Theor. Comput. Sci. Tobias Friedrich, Jonathan E. Rowe
2014	A	`conf`	Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms. PPSN Tobias Friedrich, Frank Neumann
2014	J	`jnl`	On the Average-case Complexity of Parameterized Clique. CoRR Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin
2014	J	`jnl`	Quasirandom Rumor Spreading. ACM Trans. Algorithms Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
2014	J	`jnl`	Seeding the Initial Population of Multi-Objective Evolutionary Algorithms: A Computational Study. CoRR Tobias Friedrich, Markus Wagner
2014	A	`conf`	Two-dimensional subset selection for hypervolume and epsilon-indicator. GECCO Karl Bringmann, Tobias Friedrich, Patrick Klitzke
2013	J	`jnl`	Approximation quality of the hypervolume indicator. Artif. Intell. Karl Bringmann, Tobias Friedrich
2013	J	`jnl`	Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theor. Comput. Sci. Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond
2013	J	`jnl`	Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. Algorithmica Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
2013	B	`conf`	Efficient parent selection for Approximation-Guided Evolutionary multi-objective optimization. IEEE Congress on Evolutionary Computation Markus Wagner, Tobias Friedrich
2013	—	`conf`	Exact and Efficient Generation of Geometric Random Variates and Random Graphs. ICALP (1) Karl Bringmann, Tobias Friedrich
2013	J	`jnl`	Fast simulation of large-scale growth models. Random Struct. Algorithms Tobias Friedrich, Lionel Levine
2013	—	`conf`	Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. ICALP (1) S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar
2013	J	`jnl`	Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. CoRR Tobias Friedrich, Frank Neumann, Christian Thyssen
2013	A	`conf`	Parameterized average-case complexity of the hypervolume indicator. GECCO Karl Bringmann, Tobias Friedrich
2013	J	`jnl`	Speeding up many-objective optimization by Monte Carlo approximations. Artif. Intell. Karl Bringmann, Tobias Friedrich, Christian Igel, Thomas Voß
2013	J	`jnl`	Weighted preferences in evolutionary multi-objective optimization. Int. J. Mach. Learn. Cybern. Tobias Friedrich, Trent Kroeger, Frank Neumann
2012	J	`jnl`	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. Theor. Comput. Sci. Karl Bringmann, Tobias Friedrich
2012	—	`conf`	Asynchronous Rumor Spreading in Preferential Attachment Graphs. SWAT Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
2012	A	`conf`	Convergence of hypervolume-based archiving algorithms ii: competitiveness. GECCO Karl Bringmann, Tobias Friedrich
2012	J	`jnl`	Convergence of set-based multi-objective optimization, indicators and deteriorative cycles. Theor. Comput. Sci. Rudolf Berghammer, Tobias Friedrich, Frank Neumann
2012	A	`conf`	Efficient algorithms for extracting biological key pathways with global constraints. GECCO Jan Baumbach, Tobias Friedrich, Timo Kötzing, Anton Krohmer, Joachim Müller, Josch Pauling
2012	—	`conf`	Experimental Analysis of Rumor Spreading in Social Networks. MedAlg Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
2012	B	`conf`	Parameterized Clique on Scale-Free Networks. ISAAC Tobias Friedrich, Anton Krohmer
2012	J	`jnl`	Quasirandom Load Balancing. SIAM J. Comput. Tobias Friedrich, Martin Gairing, Thomas Sauerwald
2012	J	`jnl`	Why rumors spread so quickly in social networks. Commun. ACM Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
2011	A*	`conf`	Approximation-Guided Evolutionary Multi-Objective Optimization. IJCAI Karl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner
2011	J	`jnl`	Average update times for fully-dynamic all-pairs shortest paths. Discret. Appl. Math. Tobias Friedrich, Nils Hebbinghaus
2011	A*	`conf`	Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. IJCAI Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond
2011	A	`conf`	Convergence of hypervolume-based archiving algorithms I: effectiveness. GECCO Karl Bringmann, Tobias Friedrich
2011	B	`conf`	Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. ISAAC Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
2011	—	`conf`	Fast Simulation of Large-Scale Growth Models. APPROX-RANDOM Tobias Friedrich, Lionel Levine
2011	—	`conf`	Foundations of evolutionary multi-objective optimization. GECCO (Companion) Tobias Friedrich, Frank Neumann
2011	J	`jnl`	Illustration of fairness in evolutionary multi-objective optimization. Theor. Comput. Sci. Tobias Friedrich, Christian Horoba, Frank Neumann
2011	J	`jnl`	Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation CoRR Katya Vladislavleva, Tobias Friedrich, Frank Neumann, Markus Wagner
2011	J	`jnl`	Quasirandom rumor spreading: An experimental analysis. ACM J. Exp. Algorithmics Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald
2011	A*	`conf`	Randomized Diffusion for Indivisible Loads. SODA Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald
2011	J	`jnl`	Smoothed analysis of balancing networks. Random Struct. Algorithms Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
2011	J	`jnl`	Social Networks Spread Rumors in Sublogarithmic Time. Electron. Notes Discret. Math. Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
2011	A*	`conf`	Social networks spread rumors in sublogarithmic time. STOC Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
2011	A	`conf`	The logarithmic hypervolume indicator. FOGA Tobias Friedrich, Karl Bringmann, Thomas Voß, Christian Igel
2011	—	`conf`	Weighted Preferences in Evolutionary Multi-objective Optimization. Australasian Conference on Artificial Intelligence Tobias Friedrich, Trent Kroeger, Frank Neumann
2010	J	`jnl`	An Efficient Algorithm for Computing Hypervolume Contributions. Evol. Comput. Karl Bringmann, Tobias Friedrich
2010	J	`jnl`	Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Evol. Comput. Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2010	J	`jnl`	Approximating the volume of unions and intersections of high-dimensional geometric objects. Comput. Geom. Karl Bringmann, Tobias Friedrich
2010	J	`jnl`	Average-case analysis of incremental topological ordering. Discret. Appl. Math. Deepak Ajwani, Tobias Friedrich
2010	J	`jnl`	Deterministic Random Walks on Regular Trees CoRR Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2010	J	`jnl`	Deterministic random walks on regular trees. Random Struct. Algorithms Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2010	A*	`conf`	Efficient Broadcast on Random Geometric Graphs. SODA Milan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
2010	J	`jnl`	Fast simulation of large-scale growth models CoRR Tobias Friedrich, Lionel Levine
2010	—	`conf`	Foundations of evolutionary multi-objective optimization. GECCO (Companion) Tobias Friedrich, Frank Neumann
2010	J	`jnl`	Plateaus can be harder in multi-objective optimization. Theor. Comput. Sci. Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
2010	J	`jnl`	Quasirandom Load Balancing CoRR Tobias Friedrich, Martin Gairing, Thomas Sauerwald
2010	A*	`conf`	Quasirandom Load Balancing. SODA Tobias Friedrich, Martin Gairing, Thomas Sauerwald
2010	J	`jnl`	Quasirandom Rumor Spreading CoRR Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
2010	J	`jnl`	Quasirandom Rumor Spreading: An Experimental Analysis CoRR Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald
2010	—	`conf`	Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary study. GECCO (Companion) Thomas Voß, Tobias Friedrich, Karl Bringmann, Christian Igel
2010	A	`conf`	Set-based multi-objective optimization, indicators, and deteriorative cycles. GECCO Rudolf Berghammer, Tobias Friedrich, Frank Neumann
2010	J	`jnl`	Smoothed Analysis of Balancing Networks CoRR Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
2010	J	`jnl`	The Cover Time of Deterministic Random Walks CoRR Tobias Friedrich, Thomas Sauerwald
2010	Misc	`conf`	The Cover Time of Deterministic Random Walks. COCOON Tobias Friedrich, Thomas Sauerwald
2010	J	`jnl`	The Cover Time of Deterministic Random Walks. Electron. J. Comb. Tobias Friedrich, Thomas Sauerwald
2010	A	`conf`	The maximum hypervolume set yields near-optimal approximation. GECCO Karl Bringmann, Tobias Friedrich
2010	—	`conf`	Tight Bounds for the Approximation Ratio of the Hypervolume Indicator. PPSN (1) Karl Bringmann, Tobias Friedrich
2010	J	`jnl`	When to use bit-wise neutrality. Nat. Comput. Tobias Friedrich, Frank Neumann
2009	J	`jnl`	Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Evol. Comput. Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2009	J	`jnl`	Analysis of Diversity-Preserving Mechanisms for Global Exploration. Evol. Comput. Tobias Friedrich, Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
2009	C	`conf`	Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice. EMO Karl Bringmann, Tobias Friedrich
2009	J	`jnl`	Comparison of simple diversity mechanisms on plateau functions. Theor. Comput. Sci. Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
2009	A	`conf`	Computing single source shortest paths using single-objective fitness. FOGA Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann
2009	J	`jnl`	Deterministic Random Walks on the Two-Dimensional Grid. Comb. Probab. Comput. Benjamin Doerr, Tobias Friedrich
2009	A	`conf`	Don't be greedy when calculating hypervolume contributions. FOGA Karl Bringmann, Tobias Friedrich
2009	A	`conf`	Multiplicative approximations and the hypervolume indicator. GECCO Tobias Friedrich, Christian Horoba, Frank Neumann
2009	A*	`conf`	Near-perfect load balancing by randomized rounding. STOC Tobias Friedrich, Thomas Sauerwald
2009	J	`jnl`	On the Effects of Adding Objectives to Plateau Functions. IEEE Trans. Evol. Comput. Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler
2009	J	`jnl`	Quasirandom Rumor Spreading on Expanders. Electron. Notes Discret. Math. Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
2009	A	`conf`	Quasirandom Rumor Spreading: An Experimental Analysis. ALENEX Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald
2009	—	`conf`	Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. ICALP (1) Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
2009	—	`conf`	Smoothed Analysis of Balancing Networks. ICALP (2) Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
2008	J	`jnl`	An ACM Trans. Algorithms Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
2008	A	`conf`	Analyzing Hypervolume Indicator Based Algorithms. PPSN Dimo Brockhoff, Tobias Friedrich, Frank Neumann
2008	B	`conf`	Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. ISAAC Karl Bringmann, Tobias Friedrich
2008	J	`jnl`	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice CoRR Karl Bringmann, Tobias Friedrich
2008	J	`jnl`	Approximating the volume of unions and intersections of high-dimensional geometric objects CoRR Karl Bringmann, Tobias Friedrich
2008	B	`conf`	Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. ISAAC Tobias Friedrich, Nils Hebbinghaus
2008	J	`jnl`	Average-Case Analysis of Online Topological Ordering CoRR Deepak Ajwani, Tobias Friedrich
2008	A*	`conf`	Deterministic random walks on regular trees. SODA Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2008	A*	`conf`	Quasirandom rumor spreading. SODA Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
2008	A	`conf`	Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. PPSN Tobias Friedrich, Christian Horoba, Frank Neumann
2008	A	`conf`	Theoretical analysis of diversity mechanisms for global exploration. GECCO Tobias Friedrich, Pietro S. Oliveto, Dirk Sudholt, Carsten Witt
2008	B	`conf`	When to use bit-wise neutrality. IEEE Congress on Evolutionary Computation Tobias Friedrich, Frank Neumann
2007	J	`jnl`	Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Electron. Colloquium Comput. Complex. Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2007	A	`conf`	Approximating covering problems by randomized search heuristics using multi-objective models. GECCO Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt
2007	B	`conf`	Average-Case Analysis of Online Topological Ordering. ISAAC Deepak Ajwani, Tobias Friedrich
2007	J	`jnl`	Deterministic Random Walks on Regular Trees. Electron. Notes Discret. Math. Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer
2007	A	`conf`	Do additional objectives make a problem harder? GECCO Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler
2007	B	`conf`	On improving approximate solutions by evolutionary algorithms. IEEE Congress on Evolutionary Computation Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt
2007	B	`conf`	Plateaus can be harder in multi-objective optimization. IEEE Congress on Evolutionary Computation Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
2007	A	`conf`	Rigorous analyses of simple diversity mechanisms. GECCO Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
2007	J	`jnl`	Unbiased Matrix Rounding. Electron. Notes Discret. Math. Tobias Friedrich, Benjamin Doerr, Christian Klein, Ralf Osbild
2007	—	`—`	Use and avoidance of randomness. Tobias Friedrich
2007	—	`ch.`	Verwendung und Vermeidung von Zufall [Use and Avoidance of Randomness]. Ausgezeichnete Informatikdissertationen Tobias Friedrich
2006	—	`conf`	An O(n SWAT Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
2006	J	`jnl`	An O(n CoRR Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
2006	J	`jnl`	An O(n Electron. Notes Discret. Math. Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
2006	B	`conf`	Deterministic Random Walks on the Two-Dimensional Grid. ISAAC Benjamin Doerr, Tobias Friedrich
2006	J	`jnl`	Quasirandomness in Graphs. Electron. Notes Discret. Math. Benjamin Doerr, Tobias Friedrich
2006	J	`jnl`	Unbiased Matrix Rounding CoRR Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
2006	—	`conf`	Unbiased Matrix Rounding. SWAT Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
2005	B	`conf`	Rounding of Sequences and Matrices, with Applications. WAOA Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild