Tobias Friedrich
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
167
Venues
41
Active years
2005–2025
Best venue rank
A*
Where they publish
- AGECCO35 papers
- A*ICALP14 papers
- AESA13 papers
- APPSN12 papers
- A*AAAI9 papers
- BISAAC9 papers
- A*IJCAI6 papers
- A*SODA6 papers
- BCEC6 papers
- AFOGA6 papers
- AALENEX5 papers
- A*STOC4 papers
- ASTACS3 papers
- BSPAA3 papers
- BDocEng2 papers
- MulticonferenceICASSP2 papers
- BPAKDD2 papers
- AAISTATS2 papers
- BSAGT2 papers
- NationalCOCOON2 papers
- BMFCS2 papers
- ASAT2 papers
- CWAW2 papers
- BESANN1 paper
- A*FOCS1 paper
- CIDEAL1 paper
- A*PODC1 paper
- BWADS1 paper
- BWG1 paper
- A*ICLR1 paper
- BSIROCCO1 paper
- BFCT1 paper
- A*KDD1 paper
- CATMOS1 paper
- AECAI1 paper
- BICONIP1 paper
- ATACAS1 paper
- BSMC1 paper
- A*INFOCOM1 paper
- CEMO1 paper
- BWAOA1 paper
Papers
167 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | AAAI | Strategic Network Creation for Enabling Greedy Routing. | Julian Berger, Tobias Friedrich, Pascal Lenzner, Paraskevi Machaira, Janosch Ruff |
| 2025 | AAAI | Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks. | Davide Bil, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2025 | DocEng | Text Image Super-Resolution for Improved OCR in Real-Life Scenarios using Swin Transformers. | Philipp Hildebrandt, Maximilian Schulze, Sarel Cohen, Vanja Doskoc, Raid Saabni, Tobias Friedrich |
| 2024 | AAAI | The Irrelevance of Influencers: Information Diffusion with Re-Activation and Immunity Lasts Exponentially Long on Social Network Models. | Tobias Friedrich, Andreas Gbel, Nicolas Klodt, Martin S. Krejca, Marcus Pappik |
| 2024 | ESA | How to Reduce Temporal Cliques to Find Sparse Spanners. | Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells |
| 2024 | ESANN | Predicting the Closing Cross Auction Results at the NASDAQ Stock Exchange. | Sarel Cohen, Manuel Hettich, Philipp Bielefeld, Crispin Schomers, Tobias Friedrich |
| 2024 | FOCS | Improved Distance (Sensitivity) Oracles with Subquadratic Space. | Davide Bil, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2024 | ICASSP | Detecting Continuous Gravitational Waves Using Generated Training Data. | Judith Herrmann, Raphael Kunert, Ron Hachmon, Aviv Markus, Allison Gunby-Mann, Sarel Cohen, Tobias Friedrich, Peter Chin |
| 2024 | IJCAI | Real-World Networks Are Low-Dimensional: Theoretical and Practical Assessment. | Tobias Friedrich, Andreas Gbel, Maximilian Katzmann, Leon Schiller |
| 2024 | PAKDD | A Contraction Tree SAT Encoding for Computing Twin-Width. | Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, Kirill Simonov |
| 2023 | AISTATS | Fast Feature Selection with Fairness Constraints. | Francesco Quinzan, Rajiv Khanna, Moshik Hershcovitch, Sarel Cohen, Daniel G. Waddington, Tobias Friedrich, Michael W. Mahoney |
| 2023 | ALENEX | Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. | Ivan Khomutovskiy, Rebekka Dunker, Jessica Dierking, Julian Egbert, Christian Helms, Finn Schllkopf, Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Davis Issac, Simon Krogmann, Pascal Lenzner |
| 2023 | ESA | On the Giant Component of Geometric Inhomogeneous Random Graphs. | Thomas Blsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif |
| 2023 | GECCO | Analysis of (1+1) EA on LeadingOnes with Constraints. | Tobias Friedrich, Timo Ktzing, Aneta Neumann, Frank Neumann, Aishwarya Radhakrishnan |
| 2023 | GECCO | Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. | Samuel Baguley, Tobias Friedrich, Aneta Neumann, Frank Neumann, Marcus Pappik, Ziena Zeif |
| 2023 | GECCO | Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. | Adel Nikfarjam, Ralf Rothenberger, Frank Neumann, Tobias Friedrich |
| 2023 | ICALP | Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. | Tobias Friedrich, Andreas Gbel, Maximilian Katzmann, Leon Schiller |
| 2023 | ICALP | Fault-Tolerant ST-Diameter Oracles. | Davide Bil, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck |
| 2023 | IJCAI | Temporal Network Creation Games. | Davide Bil, Sarel Cohen, Tobias Friedrich, Hans Gawendowicz, Nicolas Klodt, Pascal Lenzner, George Skretas |
| 2023 | IDEAL | Sustainable On-Street Parking Mapping with Deep Learning and Airborne Imagery. | Bashini K. Mahaarachchi, Sarel Cohen, Bodo Bookhagen, Vanja Doskoc, Tobias Friedrich |
| 2023 | PAKDD | The Common-Neighbors Metric Is Noise-Robust and Reveals Substructures of Real-World Networks. | Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca |
| 2023 | PODC | The Impact of Cooperation in Bilateral Network Creation. | Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Arthur Zahn |
| 2023 | STOC | Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. | Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif |
| 2023 | STOC | Approximate Distance Sensitivity Oracles in Subquadratic Space. | Davide Bil, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck |
| 2023 | STACS | Strongly Hyperbolic Unit Disk Graphs. | Thomas Blsius, Tobias Friedrich, Maximilian Katzmann, Daniel Stephan |
| 2023 | SAGT | Single-Peaked Jump Schelling Games. | Tobias Friedrich, Pascal Lenzner, Louise Molitor, Lars Seifert |
| 2023 | WADS | Compact Distance Oracles with Large Sensitivity and Low Stretch. | Davide Bil, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck |
| 2023 | WG | Efficient Constructions for the Győri-Lovsz Theorem on Almost Chordal Graphs. | Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif |
| 2022 | ALENEX | An Efficient Branch-and-Bound Solver for Hitting Set. | Thomas Blsius, Tobias Friedrich, David Stangl, Christopher Weyand |
| 2022 | COCOON | Algorithms for Hard-Constraint Point Processes via Discretization. | Tobias Friedrich, Andreas Gbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik |
| 2022 | DocEng | Optical character recognition guided image super resolution. | Philipp Hildebrandt, Maximilian Schulze, Sarel Cohen, Vanja Doskoc, Raid Saabni, Tobias Friedrich |
| 2022 | GECCO | Crossover for cardinality constrained optimization. | Tobias Friedrich, Timo Ktzing, Aishwarya Radhakrishnan, Leon Schiller, Martin Schirneck, Georg Tennigkeit, Simon Wietheger |
| 2022 | GECCO | Towards explainable real estate valuation via evolutionary algorithms. | Sebastian Angrick, Ben Bals, Niko Hastrich, Maximilian Kleissl, Jonas Schmidt, Vanja Doskoc, Louise Molitor, Tobias Friedrich, Maximilian Katzmann |
| 2022 | GECCO | Analysis of a gray-box operator for vertex cover. | Samuel Baguley, Tobias Friedrich, Timo Ktzing, Xiaoyue Li, Marcus Pappik, Ziena Zeif |
| 2022 | ICALP | Social Distancing Network Creation. | Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko |
| 2022 | ICALP | Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. | Davide Bil, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2022 | ICLR | What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization. | Maximilian Bther, Otto Kiig, Martin Taraz, Sarel Cohen, Karen Seidel, Tobias Friedrich |
| 2022 | PPSN | Escaping Local Optima with Local Search: A Theory-Driven Discussion. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Amirhossein Rajabi |
| 2022 | PPSN | Theoretical Study of Optimizing Rugged Landscapes with the cGA. | Tobias Friedrich, Timo Ktzing, Frank Neumann, Aishwarya Radhakrishnan |
| 2022 | SIROCCO | Accelerated Information Dissemination on Networks with Local and Global Edges. | Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca, Thomas Sauerwald |
| 2021 | AAAI | Selfish Creation of Social Networks. | Davide Bil, Tobias Friedrich, Pascal Lenzner, Stefanie Lowski, Anna Melnichenko |
| 2021 | AISTATS | Adaptive Sampling for Fast Constrained Maximization of Submodular Functions. | Francesco Quinzan, Vanja Doskoc, Andreas Gbel, Tobias Friedrich |
| 2021 | ESA | Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. | Davide Bil, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2021 | ESA | Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. | Thomas Blsius, Tobias Friedrich, Maximilian Katzmann |
| 2021 | ESA | Efficiently Computing Maximum Flows in Scale-Free Networks. | Thomas Blsius, Tobias Friedrich, Christopher Weyand |
| 2021 | ESA | Balanced Crown Decomposition for Connectivity Constraints. | Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif |
| 2021 | FCT | From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization. | Lukas Behrendt, Katrin Casel, Tobias Friedrich, J. A. Gregor Lagodzinski, Alexander Lser, Marcus Wilhelm |
| 2021 | GECCO | Evolutionary minimization of traffic congestion. | Maximilian Bther, Leon Schiller, Philipp Fischbeck, Louise Molitor, Martin S. Krejca, Tobias Friedrich |
| 2021 | ICALP | A Spectral Independence View on Hard Spheres via Block Dynamics. | Tobias Friedrich, Andreas Gbel, Martin S. Krejca, Marcus Pappik |
| 2021 | ICALP | On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. | J. A. Gregor Lagodzinski, Andreas Gbel, Katrin Casel, Tobias Friedrich |
| 2021 | ISAAC | The Impact of Geometry on Monochrome Regions in the Flip Schelling Process. | Thomas Blsius, Tobias Friedrich, Martin S. Krejca, Louise Molitor |
| 2021 | KDD | A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics. | Nicolas Klodt, Lars Seifert, Arthur Zahn, Katrin Casel, Davis Issac, Tobias Friedrich |
| 2021 | MFCS | Space-Efficient Fault-Tolerant Diameter Oracles. | Davide Bil, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2021 | SODA | The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. | Thomas Blsius, Tobias Friedrich, Andreas Gbel, Jordi Levy, Ralf Rothenberger |
| 2021 | SPAA | Efficiency and Stability in Euclidean Network Design. | Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner, Anna Melnichenko, Jannik Peters, Daniel Stephan, Michael Vaichenker |
| 2021 | SAT | Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. | Tobias Friedrich, Frank Neumann, Ralf Rothenberger, Andrew M. Sutton |
| 2020 | ATMOS | A Strategic Routing Framework and Algorithms for Computing Alternative Paths. | Thomas Blsius, Maximilian Bther, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hffner, Otto Kiig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells, Simon Wietheger |
| 2020 | ECAI | Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. | Vanja Doskoc, Tobias Friedrich, Andreas Gbel, Aneta Neumann, Frank Neumann, Francesco Quinzan |
| 2020 | ESA | The Minimization of Random Hypergraphs. | Thomas Blsius, Tobias Friedrich, Martin Schirneck |
| 2020 | ICONIP | Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation. | Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Manuel Rizzo, Arthur Zahn |
| 2020 | IJCAI | Flow-Based Network Creation Games. | Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko |
| 2020 | STACS | Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. | Thomas Blsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann |
| 2019 | AAAI | Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. | Tobias Friedrich, Andreas Gbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger |
| 2019 | AAAI | Pareto Optimization for Subset Selection with Dynamic Cost Constraints. | Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich |
| 2019 | ALENEX | Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. | Thomas Blsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck |
| 2019 | ESA | Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. | Thomas Blsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand |
| 2019 | ICALP | The Satisfiability Threshold for Non-Uniform Random 2-SAT. | Tobias Friedrich, Ralf Rothenberger |
| 2019 | IJCAI | Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. | Tobias Friedrich, Ralf Rothenberger |
| 2019 | STACS | From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial). | Tobias Friedrich |
| 2019 | SPAA | Geometric Network Creation Games. | Davide Bil, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko |
| 2019 | TACAS | On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. | Thomas Blsius, Tobias Friedrich, Andrew M. Sutton |
| 2019 | WAW | Understanding the Effectiveness of Data Reduction in Public Transportation Networks. | Thomas Blsius, Philipp Fischbeck, Tobias Friedrich, Martin Schirneck |
| 2018 | ALENEX | Hyperbolic Embeddings for Near-Optimal Greedy Routing. | Thomas Blsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer |
| 2018 | GECCO | Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. | Tobias Friedrich, Timo Ktzing, Francesco Quinzan, Andrew M. Sutton |
| 2018 | GECCO | Escaping large deceptive basins of attraction with heavy-tailed mutation operators. | Tobias Friedrich, Francesco Quinzan, Markus Wagner |
| 2018 | GECCO | Randomized greedy algorithms for covering problems. | Wanru Gao, Tobias Friedrich, Frank Neumann, Christian Hercher |
| 2018 | ICALP | Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. | Thomas Blsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry |
| 2018 | PPSN | Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization. | Tobias Friedrich, Andreas Gbel, Francesco Quinzan, Markus Wagner |
| 2018 | SMC | Memory-Restricted Routing with Tiled Map Data. | Thomas Blsius, Jan Eube, Thomas Feldtkeller, Tobias Friedrich, Martin S. Krejca, J. A. Gregor Lagodzinski, Ralf Rothenberger, Julius Severin, Fabian Sommer, Justin Trautmann |
| 2018 | SAT | Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT. | Tobias Friedrich, Ralf Rothenberger |
| 2018 | WAW | Towards a Systematic Evaluation of Generative Network Models. | Thomas Blsius, Tobias Friedrich, Maximilian Katzmann, Anton Krohmer, Jonathan Striebel |
| 2017 | AAAI | A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. | Tobias Friedrich, Timo Ktzing, Markus Wagner |
| 2017 | AAAI | Phase Transitions for Scale-Free SAT Formulas. | Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Andrew M. Sutton |
| 2017 | AAAI | What's Hot in Evolutionary Computation. | Tobias Friedrich, Frank Neumann |
| 2017 | CEC | Improving local search in a minimum vertex cover solver for classes of networks. | Markus Wagner, Tobias Friedrich, Marius Lindauer |
| 2017 | ESA | Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. | Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton |
| 2017 | FOGA | Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. | Tobias Friedrich, Timo Ktzing, Gregor Lagodzinski, Frank Neumann, Martin Schirneck |
| 2017 | FOGA | Resampling vs Recombination: a Statistical Run Time Estimation. | Tobias Friedrich, Timo Ktzing, Francesco Quinzan, Andrew M. Sutton |
| 2017 | FOGA | On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. | Mojgan Pourhassan, Tobias Friedrich, Frank Neumann |
| 2017 | GECCO | Analyzing search heuristics with differential equations. | Tobias Friedrich, Timo Ktzing, Anna Melnichenko |
| 2017 | GECCO | Approximating optimization problems using EAs on scale-free networks. | Ankit Chauhan, Tobias Friedrich, Francesco Quinzan |
| 2017 | GECCO | Island models meet rumor spreading. | Benjamin Doerr, Philipp Fischbeck, Clemens Frahnow, Tobias Friedrich, Timo Ktzing, Martin Schirneck |
| 2017 | GECCO | Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. | Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Ktzing, Frank Neumann |
| 2017 | SPAA | Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack. | Tobias Friedrich, Sven Ihde, Christoph Keler, Pascal Lenzner, Stefan Neubert, David Schumann |
| 2017 | SAGT | Efficient Best Response Computation for Strategic Network Formation Under Attack. | Tobias Friedrich, Sven Ihde, Christoph Keler, Pascal Lenzner, Stefan Neubert, David Schumann |
| 2016 | ESA | Probabilistic Routing for On-Street Parking Search. | Tobias Arndt, Danijar Hafner, Thomas Kellermeier, Simon Krogmann, Armin Razmjou, Martin S. Krejca, Ralf Rothenberger, Tobias Friedrich |
| 2016 | ESA | Hyperbolic Random Graphs: Separators and Treewidth. | Thomas Blsius, Tobias Friedrich, Anton Krohmer |
| 2016 | ESA | Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. | Thomas Blsius, Tobias Friedrich, Anton Krohmer, Sren Laue |
| 2016 | GECCO | Escaping Local Optima with Diversity Mechanisms and Crossover. | Duc-Cuong Dang, Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton |
| 2016 | GECCO | EDAs cannot be Balanced and Stable. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca |
| 2016 | GECCO | Fast Building Block Assembly by Majority Vote Crossover. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Samadhi Nallaperuma, Frank Neumann, Martin Schirneck |
| 2016 | GECCO | The Benefit of Recombination in Noisy Evolutionary Search. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Andrew M. Sutton |
| 2016 | GECCO | Ant Colony Optimization Beats Resampling on Noisy Functions. | Tobias Friedrich, Timo Ktzing, Francesco Quinzan, Andrew M. Sutton |
| 2016 | MFCS | Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms. | Tobias Friedrich |
| 2016 | PPSN | Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. | Duc-Cuong Dang, Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton |
| 2016 | PPSN | Graceful Scaling on Uniform Versus Steep-Tailed Noise. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Andrew M. Sutton |
| 2016 | PPSN | On the Robustness of Evolving Populations. | Tobias Friedrich, Timo Ktzing, Andrew M. Sutton |
| 2016 | PPSN | Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover. | Wanru Gao, Tobias Friedrich, Frank Neumann |
| 2015 | CEC | Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator. | Karl Bringmann, Tobias Friedrich, Patrick Klitzke |
| 2015 | GECCO | Robustness of Ant Colony Optimization to Noise. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Andrew M. Sutton |
| 2015 | ICALP | Ultra-Fast Load Balancing on Scale-Free Networks. | Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald |
| 2015 | ICALP | On the Diameter of Hyperbolic Random Graphs. | Tobias Friedrich, Anton Krohmer |
| 2015 | INFOCOM | Cliques in hyperbolic random graphs. | Tobias Friedrich, Anton Krohmer |
| 2015 | ISAAC | Unbounded Discrepancy of Deterministic Random Walks on Grids. | Tobias Friedrich, Maximilian Katzmann, Anton Krohmer |
| 2015 | ISAAC | The Benefit of Recombination in Noisy Evolutionary Search. | Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Andrew M. Sutton |
| 2014 | ESA | De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. | Karl Bringmann, Tobias Friedrich, Anton Krohmer |
| 2014 | GECCO | Two-dimensional subset selection for hypervolume and epsilon-indicator. | Karl Bringmann, Tobias Friedrich, Patrick Klitzke |
| 2014 | PPSN | Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator. | Karl Bringmann, Tobias Friedrich, Patrick Klitzke |
| 2014 | PPSN | Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms. | Tobias Friedrich, Frank Neumann |
| 2013 | CEC | Efficient parent selection for Approximation-Guided Evolutionary multi-objective optimization. | Markus Wagner, Tobias Friedrich |
| 2013 | GECCO | Parameterized average-case complexity of the hypervolume indicator. | Karl Bringmann, Tobias Friedrich |
| 2013 | ICALP | Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. | S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar |
| 2013 | ICALP | Exact and Efficient Generation of Geometric Random Variates and Random Graphs. | Karl Bringmann, Tobias Friedrich |
| 2012 | GECCO | Efficient algorithms for extracting biological key pathways with global constraints. | Jan Baumbach, Tobias Friedrich, Timo Ktzing, Anton Krohmer, Joachim Mller, Josch Pauling |
| 2012 | GECCO | Convergence of hypervolume-based archiving algorithms ii: competitiveness. | Karl Bringmann, Tobias Friedrich |
| 2012 | ISAAC | Parameterized Clique on Scale-Free Networks. | Tobias Friedrich, Anton Krohmer |
| 2011 | FOGA | The logarithmic hypervolume indicator. | Tobias Friedrich, Karl Bringmann, Thomas Vo, Christian Igel |
| 2011 | GECCO | Convergence of hypervolume-based archiving algorithms I: effectiveness. | Karl Bringmann, Tobias Friedrich |
| 2011 | GECCO | Foundations of evolutionary multi-objective optimization. | Tobias Friedrich, Frank Neumann |
| 2011 | IJCAI | Approximation-Guided Evolutionary Multi-Objective Optimization. | Karl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner |
| 2011 | IJCAI | Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable. | Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond |
| 2011 | ISAAC | Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. | Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer |
| 2011 | SODA | Randomized Diffusion for Indivisible Loads. | Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald |
| 2011 | STOC | Social networks spread rumors in sublogarithmic time. | Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich |
| 2010 | COCOON | The Cover Time of Deterministic Random Walks. | Tobias Friedrich, Thomas Sauerwald |
| 2010 | GECCO | Set-based multi-objective optimization, indicators, and deteriorative cycles. | Rudolf Berghammer, Tobias Friedrich, Frank Neumann |
| 2010 | GECCO | The maximum hypervolume set yields near-optimal approximation. | Karl Bringmann, Tobias Friedrich |
| 2010 | GECCO | Foundations of evolutionary multi-objective optimization. | Tobias Friedrich, Frank Neumann |
| 2010 | GECCO | Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary study. | Thomas Vo, Tobias Friedrich, Karl Bringmann, Christian Igel |
| 2010 | PPSN | Tight Bounds for the Approximation Ratio of the Hypervolume Indicator. | Karl Bringmann, Tobias Friedrich |
| 2010 | SODA | Efficient Broadcast on Random Geometric Graphs. | Milan Bradonjic, Robert Elssser, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer |
| 2010 | SODA | Quasirandom Load Balancing. | Tobias Friedrich, Martin Gairing, Thomas Sauerwald |
| 2009 | ALENEX | Quasirandom Rumor Spreading: An Experimental Analysis. | Benjamin Doerr, Tobias Friedrich, Marvin Knnemann, Thomas Sauerwald |
| 2009 | EMO | Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice. | Karl Bringmann, Tobias Friedrich |
| 2009 | FOGA | Computing single source shortest paths using single-objective fitness. | Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann |
| 2009 | FOGA | Don't be greedy when calculating hypervolume contributions. | Karl Bringmann, Tobias Friedrich |
| 2009 | GECCO | Multiplicative approximations and the hypervolume indicator. | Tobias Friedrich, Christian Horoba, Frank Neumann |
| 2009 | ICALP | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. | Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald |
| 2009 | ICALP | Smoothed Analysis of Balancing Networks. | Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik |
| 2009 | STOC | Near-perfect load balancing by randomized rounding. | Tobias Friedrich, Thomas Sauerwald |
| 2008 | CEC | When to use bit-wise neutrality. | Tobias Friedrich, Frank Neumann |
| 2008 | GECCO | Theoretical analysis of diversity mechanisms for global exploration. | Tobias Friedrich, Pietro S. Oliveto, Dirk Sudholt, Carsten Witt |
| 2008 | ICASSP | Subband conversion for feature extraction from compressed audio. | Tobias Friedrich, Matthias Gruhne, Gerald Schuller |
| 2008 | ISAAC | Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. | Karl Bringmann, Tobias Friedrich |
| 2008 | ISAAC | Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. | Tobias Friedrich, Nils Hebbinghaus |
| 2008 | PPSN | Analyzing Hypervolume Indicator Based Algorithms. | Dimo Brockhoff, Tobias Friedrich, Frank Neumann |
| 2008 | PPSN | Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. | Tobias Friedrich, Christian Horoba, Frank Neumann |
| 2008 | SODA | Deterministic random walks on regular trees. | Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer |
| 2008 | SODA | Quasirandom rumor spreading. | Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald |
| 2007 | CEC | On improving approximate solutions by evolutionary algorithms. | Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt |
| 2007 | CEC | Plateaus can be harder in multi-objective optimization. | Tobias Friedrich, Nils Hebbinghaus, Frank Neumann |
| 2007 | GECCO | Do additional objectives make a problem harder? | Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler |
| 2007 | GECCO | Rigorous analyses of simple diversity mechanisms. | Tobias Friedrich, Nils Hebbinghaus, Frank Neumann |
| 2007 | GECCO | Approximating covering problems by randomized search heuristics using multi-objective models. | Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt |
| 2007 | ISAAC | Average-Case Analysis of Online Topological Ordering. | Deepak Ajwani, Tobias Friedrich |
| 2006 | ISAAC | Deterministic Random Walks on the Two-Dimensional Grid. | Benjamin Doerr, Tobias Friedrich |
| 2005 | WAOA | Rounding of Sequences and Matrices, with Applications. | Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild |