Rounding of Sequences and Matrices, with Applications. - Benjamin Doerr; Tobias Friedrich 001; Christian Klein 001; Ralf Osbild (WAOA, 2005)

An O(n2.75) algorithm for online topological ordering. - Deepak Ajwani; Tobias Friedrich 001; Ulrich Meyer 001 (Electron. Notes Discret. Math., 2006)

Quasirandomness in Graphs. - Benjamin Doerr; Tobias Friedrich 001 (Electron. Notes Discret. Math., 2006)

Use and avoidance of randomness. - Tobias Friedrich 001 (2007)

On improving approximate solutions by evolutionary algorithms. - Tobias Friedrich 001; Jun He 004; Nils Hebbinghaus; Frank Neumann 001; Carsten Witt (IEEE Congress on Evolutionary Computation, 2007)

Do additional objectives make a problem harder? - Dimo Brockhoff; Tobias Friedrich 001; Nils Hebbinghaus; Christian Klein 001; Frank Neumann 001; Eckart Zitzler (GECCO, 2007)

Rigorous analyses of simple diversity mechanisms. - Tobias Friedrich 001; Nils Hebbinghaus; Frank Neumann 001 (GECCO, 2007)

Verwendung und Vermeidung von Zufall [Use and Avoidance of Randomness]. - Tobias Friedrich 001 (Ausgezeichnete Informatikdissertationen, 2007)

Average-Case Analysis of Online Topological Ordering. - Deepak Ajwani; Tobias Friedrich 001 (ISAAC, 2007)

Deterministic Random Walks on Regular Trees. - Joshua N. Cooper; Benjamin Doerr; Tobias Friedrich 001; Joel Spencer (Electron. Notes Discret. Math., 2007)

Unbiased Matrix Rounding. - Tobias Friedrich 001; Benjamin Doerr; Christian Klein 001; Ralf Osbild (Electron. Notes Discret. Math., 2007)

Theoretical analysis of diversity mechanisms for global exploration. - Tobias Friedrich 001; Pietro S. Oliveto; Dirk Sudholt; Carsten Witt (GECCO, 2008)

Analyzing Hypervolume Indicator Based Algorithms. - Dimo Brockhoff; Tobias Friedrich 001; Frank Neumann 001 (PPSN, 2008)

Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. - Tobias Friedrich 001; Christian Horoba; Frank Neumann 001 (PPSN, 2008)

An O(n2.75) algorithm for incremental topological ordering. - Deepak Ajwani; Tobias Friedrich 001; Ulrich Meyer 001 (ACM Trans. Algorithms, 2008)

Computing single source shortest paths using single-objective fitness. - Surender Baswana; Somenath Biswas; Benjamin Doerr; Tobias Friedrich 001; Piyush P. Kurur; Frank Neumann 001 (FOGA, 2009)

Don't be greedy when calculating hypervolume contributions. - Karl Bringmann; Tobias Friedrich 001 (FOGA, 2009)

Multiplicative approximations and the hypervolume indicator. - Tobias Friedrich 001; Christian Horoba; Frank Neumann 001 (GECCO, 2009)

Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. - Benjamin Doerr; Tobias Friedrich 001; Thomas Sauerwald (ICALP (1), 2009)

Near-perfect load balancing by randomized rounding. - Tobias Friedrich 001; Thomas Sauerwald (STOC, 2009)

Deterministic Random Walks on the Two-Dimensional Grid. - Benjamin Doerr; Tobias Friedrich 001 (Comb. Probab. Comput., 2009)

Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. - Tobias Friedrich 001; Jun He 004; Nils Hebbinghaus; Frank Neumann 001; Carsten Witt (Evol. Comput., 2009)

Analysis of Diversity-Preserving Mechanisms for Global Exploration. - Tobias Friedrich 001; Pietro S. Oliveto; Dirk Sudholt; Carsten Witt (Evol. Comput., 2009)

Quasirandom Rumor Spreading on Expanders. - Benjamin Doerr; Tobias Friedrich 001; Thomas Sauerwald (Electron. Notes Discret. Math., 2009)

Comparison of simple diversity mechanisms on plateau functions. - Tobias Friedrich 001; Nils Hebbinghaus; Frank Neumann 001 (Theor. Comput. Sci., 2009)

On the Effects of Adding Objectives to Plateau Functions. - Dimo Brockhoff; Tobias Friedrich 001; Nils Hebbinghaus; Christian Klein 001; Frank Neumann 001; Eckart Zitzler (IEEE Trans. Evol. Comput., 2009)

Set-based multi-objective optimization, indicators, and deteriorative cycles. - Rudolf Berghammer; Tobias Friedrich 001; Frank Neumann 001 (GECCO, 2010)

The maximum hypervolume set yields near-optimal approximation. - Karl Bringmann; Tobias Friedrich 001 (GECCO, 2010)

Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary study. - Thomas Voß; Tobias Friedrich 001; Karl Bringmann; Christian Igel (GECCO (Companion), 2010)

Tight Bounds for the Approximation Ratio of the Hypervolume Indicator. - Karl Bringmann; Tobias Friedrich 001 (PPSN (1), 2010)

Efficient Broadcast on Random Geometric Graphs. - Milan Bradonjic; Robert Elsässer; Tobias Friedrich 001; Thomas Sauerwald; Alexandre Stauffer (SODA, 2010)

The Cover Time of Deterministic Random Walks. - Tobias Friedrich 001; Thomas Sauerwald (Electron. J. Comb., 2010)

Approximating the volume of unions and intersections of high-dimensional geometric objects. - Karl Bringmann; Tobias Friedrich 001 (Comput. Geom., 2010)

Average-case analysis of incremental topological ordering. - Deepak Ajwani; Tobias Friedrich 001 (Discret. Appl. Math., 2010)

An Efficient Algorithm for Computing Hypervolume Contributions. - Karl Bringmann; Tobias Friedrich 001 (Evol. Comput., 2010)

Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. - Tobias Friedrich 001; Jun He 004; Nils Hebbinghaus; Frank Neumann 001; Carsten Witt (Evol. Comput., 2010)

When to use bit-wise neutrality. - Tobias Friedrich 001; Frank Neumann 001 (Nat. Comput., 2010)

Plateaus can be harder in multi-objective optimization. - Tobias Friedrich 001; Nils Hebbinghaus; Frank Neumann 001 (Theor. Comput. Sci., 2010)

The logarithmic hypervolume indicator. - Tobias Friedrich 001; Karl Bringmann; Thomas Voß; Christian Igel (FOGA, 2011)

Convergence of hypervolume-based archiving algorithms I: effectiveness. - Karl Bringmann; Tobias Friedrich 001 (GECCO, 2011)

Foundations of evolutionary multi-objective optimization. - Tobias Friedrich 001; Frank Neumann 001 (GECCO (Companion), 2011)

Approximation-Guided Evolutionary Multi-Objective Optimization. - Karl Bringmann; Tobias Friedrich 001; Frank Neumann 001; Markus Wagner 007 (IJCAI, 2011)

Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation - Katya Vladislavleva; Tobias Friedrich 001; Frank Neumann 001; Markus Wagner 007 (CoRR, 2011)

Average update times for fully-dynamic all-pairs shortest paths. - Tobias Friedrich 001; Nils Hebbinghaus (Discret. Appl. Math., 2011)

Social Networks Spread Rumors in Sublogarithmic Time. - Benjamin Doerr; Mahmoud Fouz; Tobias Friedrich 001 (Electron. Notes Discret. Math., 2011)

Quasirandom rumor spreading: An experimental analysis. - Benjamin Doerr; Tobias Friedrich 001; Marvin Künnemann; Thomas Sauerwald (ACM J. Exp. Algorithmics, 2011)

Smoothed analysis of balancing networks. - Tobias Friedrich 001; Thomas Sauerwald; Dan Vilenchik (Random Struct. Algorithms, 2011)

Illustration of fairness in evolutionary multi-objective optimization. - Tobias Friedrich 001; Christian Horoba; Frank Neumann 001 (Theor. Comput. Sci., 2011)

Efficient algorithms for extracting biological key pathways with global constraints. - Jan Baumbach; Tobias Friedrich 001; Timo Kötzing; Anton Krohmer; Joachim Müller; Josch Pauling (GECCO, 2012)

Convergence of hypervolume-based archiving algorithms ii: competitiveness. - Karl Bringmann; Tobias Friedrich 001 (GECCO, 2012)

Parameterized Clique on Scale-Free Networks. - Tobias Friedrich 001; Anton Krohmer (ISAAC, 2012)

Experimental Analysis of Rumor Spreading in Social Networks. - Benjamin Doerr; Mahmoud Fouz; Tobias Friedrich 001 (MedAlg, 2012)

Asynchronous Rumor Spreading in Preferential Attachment Graphs. - Benjamin Doerr; Mahmoud Fouz; Tobias Friedrich 001 (SWAT, 2012)

Why rumors spread so quickly in social networks. - Benjamin Doerr; Mahmoud Fouz; Tobias Friedrich 001 (Commun. ACM, 2012)

Quasirandom Load Balancing. - Tobias Friedrich 001; Martin Gairing; Thomas Sauerwald (SIAM J. Comput., 2012)

Convergence of set-based multi-objective optimization, indicators and deteriorative cycles. - Rudolf Berghammer; Tobias Friedrich 001; Frank Neumann 001 (Theor. Comput. Sci., 2012)

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice. - Karl Bringmann; Tobias Friedrich 001 (Theor. Comput. Sci., 2012)

Efficient parent selection for Approximation-Guided Evolutionary multi-objective optimization. - Markus Wagner 007; Tobias Friedrich 001 (IEEE Congress on Evolutionary Computation, 2013)

Parameterized average-case complexity of the hypervolume indicator. - Karl Bringmann; Tobias Friedrich 001 (GECCO, 2013)

Exact and Efficient Generation of Geometric Random Variates and Random Graphs. - Karl Bringmann; Tobias Friedrich 001 (ICALP (1), 2013)

Approximation quality of the hypervolume indicator. - Karl Bringmann; Tobias Friedrich 001 (Artif. Intell., 2013)

Speeding up many-objective optimization by Monte Carlo approximations. - Karl Bringmann; Tobias Friedrich 001; Christian Igel; Thomas Voß (Artif. Intell., 2013)

Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. - Tobias Friedrich 001; Thomas Sauerwald; Alexandre Stauffer (Algorithmica, 2013)

Weighted preferences in evolutionary multi-objective optimization. - Tobias Friedrich 001; Trent Kroeger; Frank Neumann 001 (Int. J. Mach. Learn. Cybern., 2013)

Fast simulation of large-scale growth models. - Tobias Friedrich 001; Lionel Levine (Random Struct. Algorithms, 2013)

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. - Michael R. Fellows; Tobias Friedrich 001; Danny Hermelin; Nina Narodytska; Frances A. Rosamond (Theor. Comput. Sci., 2013)

Two-dimensional subset selection for hypervolume and epsilon-indicator. - Karl Bringmann; Tobias Friedrich 001; Patrick Klitzke (GECCO, 2014)

Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator. - Karl Bringmann; Tobias Friedrich 001; Patrick Klitzke (PPSN, 2014)

Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms. - Tobias Friedrich 001; Frank Neumann 001 (PPSN, 2014)

Quasirandom Rumor Spreading. - Benjamin Doerr; Tobias Friedrich 001; Thomas Sauerwald (ACM Trans. Algorithms, 2014)

Genetic and Evolutionary Computation. - Tobias Friedrich 001; Jonathan E. Rowe (Theor. Comput. Sci., 2014)

Convergence of Hypervolume-Based Archiving Algorithms. - Karl Bringmann; Tobias Friedrich 001 (IEEE Trans. Evol. Comput., 2014)

Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator. - Karl Bringmann; Tobias Friedrich 001; Patrick Klitzke (CEC, 2015)

Ultra-Fast Load Balancing on Scale-Free Networks. - Karl Bringmann; Tobias Friedrich 001; Martin Hoefer 001; Ralf Rothenberger; Thomas Sauerwald (ICALP (2), 2015)

Cliques in hyperbolic random graphs. - Tobias Friedrich 001; Anton Krohmer (INFOCOM, 2015)

Seeding the initial population of multi-objective evolutionary algorithms: A computational study. - Tobias Friedrich 001; Markus Wagner 007 (Appl. Soft Comput., 2015)

The Benefit of Sex in Noisy Evolutionary Search. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Andrew M. Sutton (CoRR, 2015)

Parameterized clique on inhomogeneous random graphs. - Tobias Friedrich 001; Anton Krohmer (Discret. Appl. Math., 2015)

Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms. - Tobias Friedrich 001; Frank Neumann 001 (Evol. Comput., 2015)

Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point. - Tobias Friedrich 001; Frank Neumann 001; Christian Thyssen (Evol. Comput., 2015)

Efficient optimization of many objectives by approximation-guided evolution. - Markus Wagner 007; Karl Bringmann; Tobias Friedrich 001; Frank Neumann 001 (Eur. J. Oper. Res., 2015)

Randomized diffusion for indivisible loads. - Petra Berenbrink; Colin Cooper; Tom Friedetzky; Tobias Friedrich 001; Thomas Sauerwald (J. Comput. Syst. Sci., 2015)

On the kernel size of clique cover reductions for random intersection graphs. - Tobias Friedrich 001; Christian Hercher (J. Discrete Algorithms, 2015)

On the average-case complexity of parameterized clique. - Nikolaos Fountoulakis; Tobias Friedrich 001; Danny Hermelin (Theor. Comput. Sci., 2015)

Genetic and Evolutionary Computation. - Tobias Friedrich 001; Jun He 004; Thomas Jansen 001; Alberto Moraglio (Theor. Comput. Sci., 2015)

Probabilistic Routing for On-Street Parking Search. - Tobias Arndt; Danijar Hafner; Thomas Kellermeier; Simon Krogmann; Armin Razmjou; Martin S. Krejca; Ralf Rothenberger; Tobias Friedrich 001 (ESA, 2016)

Hyperbolic Random Graphs: Separators and Treewidth. - Thomas Bläsius; Tobias Friedrich 001; Anton Krohmer (ESA, 2016)

Escaping Local Optima with Diversity Mechanisms and Crossover. - Duc-Cuong Dang; Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Per Kristian Lehre; Pietro S. Oliveto; Dirk Sudholt; Andrew M. Sutton (GECCO, 2016)

EDAs cannot be Balanced and Stable. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca (GECCO, 2016)

Fast Building Block Assembly by Majority Vote Crossover. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Samadhi Nallaperuma; Frank Neumann 001; Martin Schirneck (GECCO, 2016)

The Benefit of Recombination in Noisy Evolutionary Search. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Andrew M. Sutton (GECCO (Companion), 2016)

Ant Colony Optimization Beats Resampling on Noisy Functions. - Tobias Friedrich 001; Timo Kötzing; Francesco Quinzan; Andrew M. Sutton (GECCO (Companion), 2016)

The Parameterized Complexity of Dependency Detection in Relational Databases. - Thomas Bläsius; Tobias Friedrich 001; Martin Schirneck (IPEC, 2016)

Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms. - Tobias Friedrich 001 (MFCS, 2016)

Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. - Duc-Cuong Dang; Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Per Kristian Lehre; Pietro S. Oliveto; Dirk Sudholt; Andrew M. Sutton (PPSN, 2016)

Graceful Scaling on Uniform Versus Steep-Tailed Noise. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Andrew M. Sutton (PPSN, 2016)

On the Robustness of Evolving Populations. - Tobias Friedrich 001; Timo Kötzing; Andrew M. Sutton (PPSN, 2016)

Fixed-Parameter Single Objective Search Heuristics for Minimum Vertex Cover. - Wanru Gao; Tobias Friedrich 001; Frank Neumann 001 (PPSN, 2016)

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity. - Duc-Cuong Dang; Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Per Kristian Lehre; Pietro S. Oliveto; Dirk Sudholt; Andrew M. Sutton (CoRR, 2016)

A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover. - Tobias Friedrich 001; Timo Kötzing; Markus Wagner 007 (CoRR, 2016)

Robustness of Ant Colony Optimization to Noise. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Andrew M. Sutton (Evol. Comput., 2016)

A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. - Tobias Friedrich 001; Timo Kötzing; Markus Wagner 007 (AAAI, 2017)

Phase Transitions for Scale-Free SAT Formulas. - Tobias Friedrich 001; Anton Krohmer; Ralf Rothenberger; Andrew M. Sutton (AAAI, 2017)

What's Hot in Evolutionary Computation. - Tobias Friedrich 001; Frank Neumann 001 (AAAI, 2017)

Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization. - Wanru Gao; Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001 (Australasian Conference on Artificial Intelligence, 2017)

Improving local search in a minimum vertex cover solver for classes of networks. - Markus Wagner 007; Tobias Friedrich 001; Marius Lindauer (CEC, 2017)

Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. - Tobias Friedrich 001; Anton Krohmer; Ralf Rothenberger; Thomas Sauerwald; Andrew M. Sutton (ESA, 2017)

Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints. - Tobias Friedrich 001; Timo Kötzing; Gregor Lagodzinski; Frank Neumann 001; Martin Schirneck (FOGA, 2017)

Resampling vs Recombination: a Statistical Run Time Estimation. - Tobias Friedrich 001; Timo Kötzing; Francesco Quinzan; Andrew M. Sutton (FOGA, 2017)

On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms. - Mojgan Pourhassan; Tobias Friedrich 001; Frank Neumann 001 (FOGA, 2017)

Analyzing search heuristics with differential equations. - Tobias Friedrich 001; Timo Kötzing; Anna Melnichenko (GECCO (Companion), 2017)

Approximating optimization problems using EAs on scale-free networks. - Ankit Chauhan; Tobias Friedrich 001; Francesco Quinzan (GECCO, 2017)

Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. - Feng Shi 003; Martin Schirneck; Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001 (GECCO, 2017)

Efficient Best Response Computation for Strategic Network Formation Under Attack. - Tobias Friedrich 001; Sven Ihde; Christoph Keßler; Pascal Lenzner; Stefan Neubert; David Schumann (SAGT, 2017)

Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack. - Tobias Friedrich 001; Sven Ihde; Christoph Keßler; Pascal Lenzner; Stefan Neubert; David Schumann (SPAA, 2017)

Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. - S. Anand 002; Karl Bringmann; Tobias Friedrich 001; Naveen Garg 001; Amit Kumar 001 (Algorithmica, 2017)

Quasi-random Agents for Image Transition and Animation. - Aneta Neumann; Frank Neumann 001; Tobias Friedrich 001 (CoRR, 2017)

The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Andrew M. Sutton (IEEE Trans. Evol. Comput., 2017)

Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences. - Tobias Friedrich 001; Timo Kötzing; Francesco Quinzan; Andrew M. Sutton (GECCO, 2018)

Escaping large deceptive basins of attraction with heavy-tailed mutation operators. - Tobias Friedrich 001; Francesco Quinzan; Markus Wagner 007 (GECCO, 2018)

Randomized greedy algorithms for covering problems. - Wanru Gao; Tobias Friedrich 001; Frank Neumann 001; Christian Hercher (GECCO, 2018)

Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization. - Tobias Friedrich 001; Andreas Göbel 001; Francesco Quinzan; Markus Wagner 007 (PPSN (1), 2018)

Memory-Restricted Routing with Tiled Map Data. - Thomas Bläsius; Jan Eube; Thomas Feldtkeller; Tobias Friedrich 001; Martin S. Krejca; J. A. Gregor Lagodzinski; Ralf Rothenberger; Julius Severin; Fabian Sommer; Justin Trautmann (SMC, 2018)

Towards a Systematic Evaluation of Generative Network Models. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Anton Krohmer; Jonathan Striebel (WAW, 2018)

Cliques in Hyperbolic Random Graphs. - Thomas Bläsius; Tobias Friedrich 001; Anton Krohmer (Algorithmica, 2018)

De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. - Karl Bringmann; Tobias Friedrich 001; Anton Krohmer (Algorithmica, 2018)

On the Enumeration of Minimal Hitting Sets in Lexicographical Order. - Thomas Bläsius; Tobias Friedrich 001; Kitty Meeks; Martin Schirneck (CoRR, 2018)

On the Diameter of Hyperbolic Random Graphs. - Tobias Friedrich 001; Anton Krohmer (SIAM J. Discret. Math., 2018)

Unbounded Discrepancy of Deterministic Random Walks on Grids. - Tobias Friedrich 001; Maximilian Katzmann; Anton Krohmer (SIAM J. Discret. Math., 2018)

Escaping Local Optima Using Crossover With Emergent Diversity. - Duc-Cuong Dang; Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Per Kristian Lehre; Pietro S. Oliveto; Dirk Sudholt; Andrew M. Sutton (IEEE Trans. Evol. Comput., 2018)

Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane. - Thomas Bläsius; Tobias Friedrich 001; Anton Krohmer; Sören Laue (IEEE/ACM Trans. Netw., 2018)

Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints. - Tobias Friedrich 001; Andreas Göbel 001; Frank Neumann 001; Francesco Quinzan; Ralf Rothenberger (AAAI, 2019)

Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. - Jannik Peters 001; Daniel Stephan; Isabel Amon; Hans Gawendowicz; Julius Lischeid; Lennart Salabarria; Jonas Umland; Felix Werner; Martin S. Krejca; Ralf Rothenberger; Timo Kötzing; Tobias Friedrich 001 (ICAPS, 2019)

The Satisfiability Threshold for Non-Uniform Random 2-SAT. - Tobias Friedrich 001; Ralf Rothenberger (ICALP, 2019)

Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT. - Tobias Friedrich 001; Ralf Rothenberger (IJCAI, 2019)

From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial). - Tobias Friedrich 001 (STACS, 2019)

On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition. - Thomas Bläsius; Tobias Friedrich 001; Andrew M. Sutton (TACAS (1), 2019)

Understanding the Effectiveness of Data Reduction in Public Transportation Networks. - Thomas Bläsius; Philipp Fischbeck; Tobias Friedrich 001; Martin Schirneck (WAW, 2019)

Convergence and Hardness of Strategic Schelling Segregation. - Hagen Echzell; Tobias Friedrich 001; Pascal Lenzner; Louise Molitor; Marcus Pappik; Friedrich Schöne; Fabian Sommer; David Stangl (WINE, 2019)

Routing for on-street parking search using probabilistic data. - Tobias Friedrich 001; Martin S. Krejca; Ralf Rothenberger; Tobias Arndt; Danijar Hafner; Thomas Kellermeier; Simon Krogmann; Armin Razmjou (AI Commun., 2019)

Quasi-random Image Transition and Animation. - Aneta Neumann; Frank Neumann 001; Tobias Friedrich 001 (Aust. J. Intell. Inf. Process. Syst., 2019)

Island Models Meet Rumor Spreading. - Benjamin Doerr; Philipp Fischbeck; Clemens Frahnow; Tobias Friedrich 001; Timo Kötzing; Martin Schirneck (Algorithmica, 2019)

Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. - Feng Shi 003; Martin Schirneck; Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001 (Algorithmica, 2019)

A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints. - Álvaro Parra Bustos; Tat-Jun Chin; Frank Neumann 001; Tobias Friedrich 001; Maximilian Katzmann (CoRR, 2019)

Theory of Randomized Optimization Heuristics (Dagstuhl Reports 19431). - Carola Doerr; Carlos M. Fonseca; Tobias Friedrich 001; Xin Yao 001 (Dagstuhl Reports, 2019)

Unbiasedness of estimation-of-distribution algorithms. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca (Theor. Comput. Sci., 2019)

A Strategic Routing Framework and Algorithms for Computing Alternative Paths. - Thomas Bläsius; Maximilian Böther; Philipp Fischbeck; Tobias Friedrich 001; Alina Gries; Falk Hüffner; Otto Kißig; Pascal Lenzner; Louise Molitor; Leon Schiller; Armin Wells; Simon Wietheger (ATMOS, 2020)

Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings. - Vanja Doskoc; Tobias Friedrich 001; Andreas Göbel 001; Aneta Neumann; Frank Neumann 001; Francesco Quinzan (ECAI, 2020)

The Minimization of Random Hypergraphs. - Thomas Bläsius; Tobias Friedrich 001; Martin Schirneck (ESA, 2020)

Fair Tree Connection Games with Topology-Dependent Edge Cost. - Davide Bilò; Tobias Friedrich 001; Pascal Lenzner; Anna Melnichenko; Louise Molitor (FSTTCS, 2020)

Memetic Genetic Algorithms for Time Series Compression by Piecewise Linear Approximation. - Tobias Friedrich 001; Martin S. Krejca; J. A. Gregor Lagodzinski; Manuel Rizzo; Arthur Zahn (ICONIP (3), 2020)

Flow-Based Network Creation Games. - Hagen Echzell; Tobias Friedrich 001; Pascal Lenzner; Anna Melnichenko (IJCAI, 2020)

Greed is Good for Deterministic Scale-Free Networks. - Ankit Chauhan; Tobias Friedrich 001; Ralf Rothenberger (Algorithmica, 2020)

Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. - Feng Shi 003; Martin Schirneck; Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001 (Algorithmica, 2020)

timeXplain - A Framework for Explaining the Predictions of Time Series Classifiers. - Felix Mujkanovic; Vanja Doskoc; Martin Schirneck; Patrick Schäfer 001; Tobias Friedrich 001 (CoRR, 2020)

Polymer dynamics via cliques with applications to hard-sphere mixtures. - Tobias Friedrich 001; Andreas Göbel 001; Martin S. Krejca; Marcus Pappik (CoRR, 2020)

On Counting (Quantum-)Graph Homomorphisms in Finite Fields. - J. A. Gregor Lagodzinski; Andreas Göbel 001; Katrin Casel; Tobias Friedrich 001 (CoRR, 2020)

Hyperbolic Embeddings for Near-Optimal Greedy Routing. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Anton Krohmer (ACM J. Exp. Algorithmics, 2020)

Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery. - Johann Birnick; Thomas Bläsius; Tobias Friedrich 001; Felix Naumann; Thorsten Papenbrock; Martin Schirneck (Proc. VLDB Endow., 2020)

Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints. - Tobias Friedrich 001; Timo Kötzing; J. A. Gregor Lagodzinski; Frank Neumann 001; Martin Schirneck (Theor. Comput. Sci., 2020)

Selfish Creation of Social Networks. - Davide Bilò; Tobias Friedrich 001; Pascal Lenzner; Stefanie Lowski; Anna Melnichenko (AAAI, 2021)

Adaptive Sampling for Fast Constrained Maximization of Submodular Functions. - Francesco Quinzan; Vanja Doskoc; Andreas Göbel 001; Tobias Friedrich 001 (AISTATS, 2021)

Drug Repurposing Using Link Prediction on Knowledge Graphs with Applications to Non-volatile Memory. - Sarel Cohen; Moshik Hershcovitch; Martin Taraz; Otto Kißig; Andrew Wood; Daniel G. Waddington; Peter Chin 001; Tobias Friedrich 001 (COMPLEX NETWORKS, 2021)

Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (ESA, 2021)

Efficiently Computing Maximum Flows in Scale-Free Networks. - Thomas Bläsius; Tobias Friedrich 001; Christopher Weyand (ESA, 2021)

Balanced Crown Decomposition for Connectivity Constraints. - Katrin Casel; Tobias Friedrich 001; Davis Issac; Aikaterini Niklanovits; Ziena Zeif (ESA, 2021)

On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order. - J. A. Gregor Lagodzinski; Andreas Göbel 001; Katrin Casel; Tobias Friedrich 001 (ICALP, 2021)

A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics. - Nicolas Klodt; Lars Seifert; Arthur Zahn; Katrin Casel; Davis Issac; Tobias Friedrich 001 (KDD, 2021)

Space-Efficient Fault-Tolerant Diameter Oracles. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (MFCS, 2021)

Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily. - Tobias Friedrich 001; Frank Neumann 001; Ralf Rothenberger; Andrew M. Sutton (SAT, 2021)

Efficiency and Stability in Euclidean Network Design. - Wilhelm Friedemann; Tobias Friedrich 001; Hans Gawendowicz; Pascal Lenzner; Anna Melnichenko; Jannik Peters 001; Daniel Stephan; Michael Vaichenker (SPAA, 2021)

Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann (SEA, 2021)

Adaptive Sampling for Fast Constrained Maximization of Submodular Function. - Francesco Quinzan; Vanja Doskoc; Andreas Göbel 001; Tobias Friedrich 001 (CoRR, 2021)

The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs. - Thomas Bläsius; Tobias Friedrich 001; Martin S. Krejca; Louise Molitor (CoRR, 2021)

Routing in Strongly Hyperbolic Unit Disk Graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Daniel Stephan (CoRR, 2021)

Algorithms for general hard-constraint point processes via discretization. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Martin S. Krejca; Marcus Pappik (CoRR, 2021)

Computing Voronoi Diagrams in the Polar-Coordinate Model of the Hyperbolic Plane. - Tobias Friedrich 001; Maximilian Katzmann; Leon Schiller (CoRR, 2021)

Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations. - Francesco Quinzan; Andreas Göbel 001; Markus Wagner 007; Tobias Friedrich 001 (Nat. Comput., 2021)

An Efficient Branch-and-Bound Solver for Hitting Set. - Thomas Bläsius; Tobias Friedrich 001; David Stangl; Christopher Weyand (ALENEX, 2022)

A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs. - Tobias Friedrich 001; Davis Issac; Nikhil Kumar 001; Nadym Mallek; Ziena Zeif (APPROX/RANDOM, 2022)

Pareto Optimal and Popular House Allocation with Lower and Upper Quotas. - Ágnes Cseh; Tobias Friedrich 001; Jannik Peters 001 (AAMAS, 2022)

Algorithms for Hard-Constraint Point Processes via Discretization. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Martin S. Krejca; Marcus Pappik (COCOON, 2022)

Optical character recognition guided image super resolution. - Philipp Hildebrandt; Maximilian Schulze; Sarel Cohen; Vanja Doskoc; Raid Saabni; Tobias Friedrich 001 (DocEng, 2022)

Towards explainable real estate valuation via evolutionary algorithms. - Sebastian Angrick; Ben Bals; Niko Hastrich; Maximilian Kleissl; Jonas Schmidt 002; Vanja Doskoc; Louise Molitor; Tobias Friedrich 001; Maximilian Katzmann (GECCO, 2022)

Analysis of a gray-box operator for vertex cover. - Samuel Baguley; Tobias Friedrich 001; Timo Kötzing; Xiaoyue Li 001; Marcus Pappik; Ziena Zeif (GECCO, 2022)

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (ICALP, 2022)

What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization. - Maximilian Böther; Otto Kißig; Martin Taraz; Sarel Cohen; Karen Seidel 001; Tobias Friedrich 001 (ICLR, 2022)

Fixed-Parameter Sensitivity Oracles. - Davide Bilò; Katrin Casel; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; J. A. Gregor Lagodzinski; Martin Schirneck; Simon Wietheger (ITCS, 2022)

PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set. - Sebastian Angrick; Ben Bals; Katrin Casel; Sarel Cohen; Tobias Friedrich 001; Niko Hastrich; Theresa Hradilak; Davis Issac; Otto Kißig; Jonas Schmidt 002; Leo Wendt (IPEC, 2022)

Escaping Local Optima with Local Search: A Theory-Driven Discussion. - Tobias Friedrich 001; Timo Kötzing; Martin S. Krejca; Amirhossein Rajabi (PPSN (2), 2022)

Theoretical Study of Optimizing Rugged Landscapes with the cGA. - Tobias Friedrich 001; Timo Kötzing; Frank Neumann 001; Aishwarya Radhakrishnan (PPSN (2), 2022)

Accelerated Information Dissemination on Networks with Local and Global Edges. - Sarel Cohen; Philipp Fischbeck; Tobias Friedrich 001; Martin S. Krejca; Thomas Sauerwald (SIROCCO, 2022)

Pareto optimization for subset selection with dynamic cost constraints. - Vahid Roostapour; Aneta Neumann; Frank Neumann 001; Tobias Friedrich 001 (Artif. Intell., 2022)

Zeros and approximations of Holant polynomials on the complex plane. - Katrin Casel; Philipp Fischbeck; Tobias Friedrich 001; Andreas Göbel 001; J. A. Gregor Lagodzinski (Comput. Complex., 2022)

Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Martin S. Krejca; Marcus Pappik (CoRR, 2022)

Deep Distance Sensitivity Oracles. - Davin Jeong; Chau Pham 001; Arnav Bhakta; Sarel Cohen; Maximilian Katzmann; Tobias Friedrich 001; Sang (Peter) Chin (CoRR, 2022)

Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081). - Anne Auger; Carlos M. Fonseca; Tobias Friedrich 001; Johannes Lengler (Dagstuhl Reports, 2022)

Efficiently enumerating hitting sets of hypergraphs arising in data profiling. - Thomas Bläsius; Tobias Friedrich 001; Julius Lischeid; Kitty Meeks; Martin Schirneck (J. Comput. Syst. Sci., 2022)

AI Compliance - Challenges of Bridging Data Science and Law. - Philipp Hacker; Felix Naumann; Tobias Friedrich 001; Stefan Grundmann; Anja Lehmann; Herbert Zech (ACM J. Data Inf. Qual., 2022)

Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. - Thomas Bläsius; Cedric Freiberger; Tobias Friedrich 001; Maximilian Katzmann; Felix Montenegro-Retana; Marianne Thieffry (ACM Trans. Algorithms, 2022)

The complexity of dependency detection and discovery in relational databases. - Thomas Bläsius; Tobias Friedrich 001; Martin Schirneck (Theor. Comput. Sci., 2022)

A Spectral Independence View on Hard Spheres via Block Dynamics. - Tobias Friedrich 001; Andreas Göbel 001; Martin S. Krejca; Marcus Pappik (SIAM J. Discret. Math., 2022)

Efficiently generating geometric inhomogeneous and hyperbolic random graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Ulrich Meyer 001; Manuel Penschuck; Christopher Weyand (Netw. Sci., 2022)

Fast Feature Selection with Fairness Constraints. - Francesco Quinzan; Rajiv Khanna; Moshik Hershcovitch; Sarel Cohen; Daniel G. Waddington; Tobias Friedrich 001; Michael W. Mahoney (AISTATS, 2023)

Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. - Ivan Khomutovskiy; Rebekka Dunker; Jessica Dierking; Julian Egbert; Christian Helms; Finn Schöllkopf; Katrin Casel; Philipp Fischbeck; Tobias Friedrich 001; Davis Issac; Simon Krogmann; Pascal Lenzner (ALENEX, 2023)

Deep Distance Sensitivity Oracles. - Davin Jeong; Allison Gunby-Mann; Sarel Cohen; Maximilian Katzmann; Chau Pham 001; Arnav Bhakta; Tobias Friedrich 001; Peter Chin 001 (COMPLEX NETWORKS (1), 2023)

Beyond Following: Augmenting Bot Detection with the Integration of Behavioral Patterns. - Sebastian Reiche; Sarel Cohen; Kirill Simonov; Tobias Friedrich 001 (COMPLEX NETWORKS (1), 2023)

On the Giant Component of Geometric Inhomogeneous Random Graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Janosch Ruff; Ziena Zeif (ESA, 2023)

Fair Correlation Clustering in Forests. - Katrin Casel; Tobias Friedrich 001; Martin Schirneck; Simon Wietheger (FORC, 2023)

Evolutionary Diversity Optimisation in Constructing Satisfying Assignments. - Adel Nikfarjam; Ralf Rothenberger; Frank Neumann 001; Tobias Friedrich 001 (GECCO, 2023)

Fault-Tolerant ST-Diameter Oracles. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Simon Krogmann; Martin Schirneck (ICALP, 2023)

Sustainable On-Street Parking Mapping with Deep Learning and Airborne Imagery. - Bashini K. Mahaarachchi; Sarel Cohen; Bodo Bookhagen; Vanja Doskoc; Tobias Friedrich 001 (IDEAL, 2023)

Temporal Network Creation Games. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Hans Gawendowicz; Nicolas Klodt; Pascal Lenzner; George Skretas (IJCAI, 2023)

The Common-Neighbors Metric Is Noise-Robust and Reveals Substructures of Real-World Networks. - Sarel Cohen; Philipp Fischbeck; Tobias Friedrich 001; Martin S. Krejca (PAKDD (1), 2023)

The Impact of Cooperation in Bilateral Network Creation. - Tobias Friedrich 001; Hans Gawendowicz; Pascal Lenzner; Arthur Zahn (PODC, 2023)

Single-Peaked Jump Schelling Games. - Tobias Friedrich 001; Pascal Lenzner; Louise Molitor; Lars Seifert (SAGT, 2023)

Strongly Hyperbolic Unit Disk Graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Daniel Stephan (STACS, 2023)

Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. - Tobias Friedrich 001; Davis Issac; Nikhil Kumar 001; Nadym Mallek; Ziena Zeif (STOC, 2023)

Compact Distance Oracles with Large Sensitivity and Low Stretch. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Simon Krogmann; Martin Schirneck (WADS, 2023)

Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover. - Sebastian Angrick; Ben Bals; Katrin Casel; Sarel Cohen; Tobias Friedrich 001; Niko Hastrich; Theresa Hradilak; Davis Issac; Otto Kißig; Jonas Schmidt 002; Leo Wendt (SEA, 2023)

Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. - Katrin Casel; Tobias Friedrich 001; Davis Issac; Aikaterini Niklanovits; Ziena Zeif (WG, 2023)

The impact of geometry on monochrome regions in the flip Schelling process. - Thomas Bläsius; Tobias Friedrich 001; Martin S. Krejca; Louise Molitor (Comput. Geom., 2023)

A simple statistic for determining the dimensionality of complex networks. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Leon Schiller (CoRR, 2023)

Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (CoRR, 2023)

From symmetry to asymmetry: Generalizing TSP approximations by parametrization. - Lukas Behrendt; Katrin Casel; Tobias Friedrich 001; J. A. Gregor Lagodzinski; Alexander Löser; Marcus Wilhelm (J. Comput. Syst. Sci., 2023)

Polymer dynamics via cliques: New conditions for approximations. - Tobias Friedrich 001; Andreas Göbel 001; Martin S. Krejca; Marcus Pappik (Theor. Comput. Sci., 2023)

Code for: Faster Nearest Neighbors Queries on Geographic Data. - Vanja Doskoc; Tobias Friedrich 001; Niko Hastrich; Maximilian Katzmann (Zenodo, 2023)

Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. - Thomas Bläsius; Philipp Fischbeck; Tobias Friedrich 001; Maximilian Katzmann (Theory Comput. Syst., 2023)

Crossover for Cardinality Constrained Optimization. - Tobias Friedrich 001; Timo Kötzing; Aishwarya Radhakrishnan; Leon Schiller; Martin Schirneck; Georg Tennigkeit; Simon Wietheger (ACM Trans. Evol. Learn. Optim., 2023)

Social Distancing Network Creation. - Tobias Friedrich 001; Hans Gawendowicz; Pascal Lenzner; Anna Melnichenko (Algorithmica, 2023)

Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann (Algorithmica, 2023)

The impact of heterogeneity and geometry on the proof complexity of random satisfiability. - Thomas Bläsius; Tobias Friedrich 001; Andreas Göbel 001; Jordi Levy; Ralf Rothenberger (Random Struct. Algorithms, 2023)

Evolutionary Minimization of Traffic Congestion. - Maximilian Böther; Leon Schiller; Philipp Fischbeck; Louise Molitor; Martin S. Krejca; Tobias Friedrich 001 (IEEE Trans. Evol. Comput., 2023)

The Irrelevance of Influencers: Information Diffusion with Re-Activation and Immunity Lasts Exponentially Long on Social Network Models. - Tobias Friedrich 001; Andreas Göbel 001; Nicolas Klodt; Martin S. Krejca; Marcus Pappik (AAAI, 2024)

From Market Saturation to Social Reinforcement: Understanding the Impact of Non-Linearity in Information Diffusion Models. - Tobias Friedrich 001; Andreas Göbel 001; Nicolas Klodt; Martin S. Krejca; Marcus Pappik (AAMAS, 2024)

How to Reduce Temporal Cliques to Find Sparse Spanners. - Sebastian Angrick; Ben Bals; Tobias Friedrich 001; Hans Gawendowicz; Niko Hastrich; Nicolas Klodt; Pascal Lenzner; Jonas Schmidt 002; George Skretas; Armin Wells (ESA, 2024)

Predicting the Closing Cross Auction Results at the NASDAQ Stock Exchange. - Sarel Cohen; Manuel Hettich; Philipp Bielefeld; Crispin Schomers; Tobias Friedrich 001 (ESANN, 2024)

Improved Distance (Sensitivity) Oracles with Subquadratic Space. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (FOCS, 2024)

Detecting Continuous Gravitational Waves Using Generated Training Data. - Judith Herrmann; Raphael Kunert; Ron Hachmon; Aviv Markus; Allison Gunby-Mann; Sarel Cohen; Tobias Friedrich 001; Peter Chin 001 (ICASSP, 2024)

Real-World Networks Are Low-Dimensional: Theoretical and Practical Assessment. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Leon Schiller (IJCAI, 2024)

Combining Crown Structures for Vulnerability Measures. - Katrin Casel; Tobias Friedrich 001; Aikaterini Niklanovits; Kirill Simonov; Ziena Zeif (IPEC, 2024)

A Contraction Tree SAT Encoding for Computing Twin-Width. - Yinon Horev; Shiraz Shay; Sarel Cohen; Tobias Friedrich 001; Davis Issac; Lior Kamma; Aikaterini Niklanovits; Kirill Simonov (PAKDD (2), 2024)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation. - Thomas Bläsius; Sarel Cohen; Philipp Fischbeck; Tobias Friedrich 001; Martin S. Krejca (CoRR, 2024)

Towards Linear Spanners in All Temporal Cliques. - Sebastian Angrick; Ben Bals; Tobias Friedrich 001; Hans Gawendowicz; Niko Hastrich; Nicolas Klodt; Pascal Lenzner; Jonas Schmidt 002; George Skretas; Armin Wells (CoRR, 2024)

Optimal Padded Decomposition For Bounded Treewidth Graphs. - Arnold Filtser; Tobias Friedrich 001; Davis Issac; Nikhil Kumar 001; Hung Le 001; Nadym Mallek; Ziena Zeif (CoRR, 2024)

Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Leon Schiller (SIAM J. Discret. Math., 2024)

Approximate Distance Sensitivity Oracles in Subquadratic Space. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Simon Krogmann; Martin Schirneck (TheoretiCS, 2024)

Shortest distances as enumeration problem. - Katrin Casel; Tobias Friedrich 001; Stefan Neubert; Markus L. Schmid (Discret. Appl. Math., 2024)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation (Data and Code). - Thomas Bläsius; Sarel Cohen; Philipp Fischbeck; Tobias Friedrich 001; Martin S. Krejca (Zenodo, 2024)

Geometric Network Creation Games. - Davide Bilò; Tobias Friedrich 001; Pascal Lenzner; Anna Melnichenko (SIAM J. Discret. Math., 2024)

Integrating higher-order relations for enhanced twitter bot detection. - Sebastian Reiche; Sarel Cohen; Kirill Simonov; Tobias Friedrich 001 (Soc. Netw. Anal. Min., 2024)

Strategic Network Creation for Enabling Greedy Routing. - Julian Berger; Tobias Friedrich 001; Pascal Lenzner; Paraskevi Machaira; Janosch Ruff (AAAI, 2025)

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks. - Davide Bilò; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (AAAI, 2025)

Temporal Network Creation Games: The Impact of Non-Locality and Terminals. - Davide Bilò; Sarel Cohen; Tobias Friedrich 001; Hans Gawendowicz; Nicolas Klodt; Pascal Lenzner; George Skretas (AAMAS, 2025)

Sampling repulsive Gibbs point processes using random graphs. - Tobias Friedrich 001; Andreas Göbel 001; Maximilian Katzmann; Martin S. Krejca; Marcus Pappik (Comb. Probab. Comput., 2025)

Teaching Wav2Vec2 the Language of the Brain. - Tobias Fiedler; Leon Hermann; Florian Müller 018; Sarel Cohen; Sang (Peter) Chin; Tobias Friedrich 001; Eilon Vaadia (CoRR, 2025)

Binary k-Center with Missing Entries: Structure Leads to Tractability. - Farehe Soheil; Kirill Simonov; Tobias Friedrich 001 (CoRR, 2025)

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem. - Samuel Baguley; Tobias Friedrich 001; Aneta Neumann; Frank Neumann 001; Marcus Pappik; Ziena Zeif (Algorithmica, 2025)

Analysis of the (1+1) EA on LeadingOnes with Constraints. - Tobias Friedrich 001; Timo Kötzing; Aneta Neumann; Frank Neumann 001; Aishwarya Radhakrishnan (Algorithmica, 2025)