|
+
PDF
Chat
|
Teaching Wav2Vec2 the Language of the Brain
|
2025
|
Tobias Fiedler
Leon Hermann
Florian H. Müller
Sarel Cohen
Peter Chin
Tobias Friedrich
Eilon Vaadia
|
|
+
|
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem
|
2025
|
Samuel Baguley
Tobias Friedrich
Aneta Neumann
Frank Neumann
Marcus Pappik
Ziena Zeif
|
|
+
PDF
Chat
|
Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
|
2024
|
Davide Bilò
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
Martin Schirneck
|
|
+
PDF
Chat
|
Temporal Network Creation Games: The Impact of Non-Locality and
Terminals
|
2024
|
Davide Bilò
Sarel Cohen
Tobias Friedrich
Hans Gawendowicz
Nicolas Klodt
Pascal Lenzner
George Skretas
|
|
+
PDF
Chat
|
Sampling repulsive Gibbs point processes using random graphs
|
2024
|
Tobias Friedrich
Andreas Göbel
Maximilian Katzmann
Martin S. Krejca
Marcus Pappik
|
|
+
PDF
Chat
|
Improved Distance (Sensitivity) Oracles with Subquadratic Space
|
2024
|
Davide Bilò
Shiri Chechik
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
Martin Schirneck
|
|
+
PDF
Chat
|
Optimal Padded Decomposition For Bounded Treewidth Graphs
|
2024
|
Arnold Filtser
Tobias Friedrich
Davis Issac
Nikhil Kumar
Hung Le
Nadym Mallek
Ziena Zeif
|
|
+
PDF
Chat
|
Winning Through Simplicity: Autonomous Car Design for Formula Student
|
2024
|
Tobias Friedrich
Marco Müller
Adrian Bauske
Simon Härtl
Johannes Herrmann
David Förster
Tobias Tietze
Sebastian Sartor
|
|
+
PDF
Chat
|
Approximate Distance Sensitivity Oracles in Subquadratic Space
|
2024
|
Davide Bilò
Shiri Chechik
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
Simon Krogmann
Martin Schirneck
|
|
+
PDF
Chat
|
Combining Crown Structures for Vulnerability Measures
|
2024
|
Katrin Casel
Tobias Friedrich
Aikaterini Niklanovits
К. V. Simonov
Ziena Zeif
|
|
+
PDF
Chat
|
Strategic Network Creation for Enabling Greedy Routing
|
2024
|
Julian Berger
Tobias Friedrich
Pascal Lenzner
Paraskevi Machaira
Janosch Ruff
|
|
+
PDF
Chat
|
Towards Linear Spanners in All Temporal Cliques
|
2024
|
Sebastian Angrick
Ben Bals
Tobias Friedrich
Hans Gawendowicz
Niko Hastrich
Nicolas Klodt
Pascal Lenzner
Jonas Schmidt
George Skretas
Armin Wells
|
|
+
PDF
Chat
|
Robust Parameter Fitting to Realistic Network Models via Iterative
Stochastic Approximation
|
2024
|
Thomas Bläsius
Sarel Cohen
Philipp Fischbeck
Tobias Friedrich
Martin S. Krejca
|
|
+
PDF
Chat
|
Geometric Network Creation Games
|
2024
|
Davide Bilò
Tobias Friedrich
Pascal Lenzner
Anna Melnichenko
|
|
+
|
From Market Saturation to Social Reinforcement: Understanding the Impact of Non-Linearity in Information Diffusion Models
|
2024
|
Tobias Friedrich
Andreas Göbel
Nicolas Klodt
Martin S. Krejca
Marcus Pappik
|
|
+
|
Analysis of the survival time of the SIRS process via expansion
|
2024
|
Tobias Friedrich
Andreas Göbel
Nicolas Klodt
Martin S. Krejca
Marcus Pappik
|
|
+
|
Temporal Network Creation Games
|
2023
|
Davide Bilò
Sarel Cohen
Tobias Friedrich
Hans Gawendowicz
Nicolas Klodt
Pascal Lenzner
George Skretas
|
|
+
|
Evolutionary Diversity Optimisation in Constructing Satisfying Assignments
|
2023
|
Adel Nikfarjam
Ralf Rothenberger
Frank Neumann
Tobias Friedrich
|
|
+
|
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem
|
2023
|
Samuel Baguley
Tobias Friedrich
Aneta Neumann
Frank Neumann
Marcus Pappik
Ziena Zeif
|
|
+
PDF
Chat
|
Analysis of (1+1) EA on LeadingOnes with Constraints
|
2023
|
Tobias Friedrich
Timo Kötzing
Aneta Neumann
Frank Neumann
Aishwarya Radhakrishnan
|
|
+
PDF
Chat
|
The impact of heterogeneity and geometry on the proof complexity of random satisfiability
|
2023
|
Thomas Bläsius
Tobias Friedrich
Andreas Göbel
Jordi Levy
Ralf Rothenberger
|
|
+
PDF
Chat
|
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
|
2023
|
Thomas Bläsius
Tobias Friedrich
Maximilian Katzmann
|
|
+
|
The Impact of Cooperation in Bilateral Network Creation
|
2023
|
Tobias Friedrich
Hans Gawendowicz
Pascal Lenzner
Arthur Zahn
|
|
+
|
Approximate Distance Sensitivity Oracles in Subquadratic Space
|
2023
|
Davide Bilò
Shiri Chechik
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
Simon Krogmann
Martin Schirneck
|
|
+
|
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth
|
2023
|
Tobias Friedrich
Davis Issac
Nikhil Kumar
Nadym Mallek
Ziena Zeif
|
|
+
PDF
Chat
|
From symmetry to asymmetry: Generalizing TSP approximations by parametrization
|
2023
|
Lukas Behrendt
Katrin Casel
Tobias Friedrich
J. A. Gregor Lagodzinski
Alexander Löser
Marcus Wilhelm
|
|
+
PDF
Chat
|
Social Distancing Network Creation
|
2023
|
Tobias Friedrich
Hans Gawendowicz
Pascal Lenzner
Anna Melnichenko
|
|
+
|
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
|
2023
|
Tobias Friedrich
Andreas Göbel
Maximilian Katzmann
Leon Schiller
|
|
+
|
A simple statistic for determining the dimensionality of complex networks
|
2023
|
Tobias Friedrich
Andreas Göbel
Maximilian Katzmann
Leon Schiller
|
|
+
|
Fair Correlation Clustering in Forests
|
2023
|
Katrin Casel
Tobias Friedrich
Martin Schirneck
Simon Wietheger
|
|
+
|
Single-Peaked Jump Schelling Games
|
2023
|
Tobias Friedrich
Pascal Lenzner
Louise Molitor
Lars Seifert
|
|
+
|
Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem
|
2023
|
Samuel Baguley
Tobias Friedrich
Aneta Neumann
Frank Neumann
Marcus Pappik
Ziena Zeif
|
|
+
|
Compact Distance Oracles with Large Sensitivity and Low Stretch
|
2023
|
Davide Bilò
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
Simon Krogmann
Martin Schirneck
|
|
+
|
Fault-Tolerant ST-Diameter Oracles
|
2023
|
Davide Bilò
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
Simon Krogmann
Martin Schirneck
|
|
+
|
Temporal Network Creation Games
|
2023
|
Davide Bilò
Sarel Cohen
Tobias Friedrich
Hans Gawendowicz
Nicolas Klodt
Pascal Lenzner
George Skretas
|
|
+
|
Approximate Distance Sensitivity Oracles in Subquadratic Space
|
2023
|
Davide Bilò
Shiri Chechik
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
Simon Krogmann
Martin Schirneck
|
|
+
|
Analysis of the (1+1) EA on LeadingOnes with Constraints
|
2023
|
Tobias Friedrich
Timo Kötzing
Aneta Neumann
Frank Neumann
Aishwarya Radhakrishnan
|
|
+
|
On the Giant Component of Geometric Inhomogeneous Random Graphs
|
2023
|
Thomas Bläsius
Tobias Friedrich
Maximilian Katzmann
Janosch Ruff
Ziena Zeif
|
|
+
|
Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs
|
2023
|
Davide Bilò
Shiri Chechik
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
Martin Schirneck
|
|
+
PDF
Chat
|
Compact Distance Oracles with Large Sensitivity and Low Stretch
|
2023
|
Davide Bilò
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
Simon Krogmann
Martin Schirneck
|
|
+
PDF
Chat
|
Polymer dynamics via cliques: New conditions for approximations
|
2022
|
Tobias Friedrich
Andreas Göbel
Martin S. Krejca
Marcus Pappik
|
|
+
PDF
Chat
|
Efficiently generating geometric inhomogeneous and hyperbolic random graphs
|
2022
|
Thomas Bläsius
Tobias Friedrich
Maximilian Katzmann
Ulrich Meyer
Manuel Penschuck
Christopher Weyand
|
|
+
PDF
Chat
|
Analysis of a Gray-Box Operator for Vertex Cover
|
2022
|
Samuel Baguley
Tobias Friedrich
Timo Kötzing
Xiaoyue Li
Marcus Pappik
Ziena Zeif
|
|
+
PDF
Chat
|
A Spectral Independence View on Hard Spheres via Block Dynamics
|
2022
|
Tobias Friedrich
Andreas Göbel
Martin S. Krejca
Marcus Pappik
|
|
+
PDF
Chat
|
Zeros and approximations of Holant polynomials on the complex plane
|
2022
|
Katrin Casel
Philipp Fischbeck
Tobias Friedrich
Andreas Göbel
J. A. Gregor Lagodzinski
|
|
+
PDF
Chat
|
Towards explainable real estate valuation via evolutionary algorithms
|
2022
|
Sebastian Angrick
Ben Bals
Niko Hastrich
Maximilian Kleissl
Jonas Schmidt
Vanja Doskoč
Louise Molitor
Tobias Friedrich
Maximilian Katzmann
|
|
+
PDF
Chat
|
Analysis of a gray-box operator for vertex cover
|
2022
|
Samuel Baguley
Tobias Friedrich
Timo Kötzing
Xiaoyue Li
Marcus Pappik
Ziena Zeif
|
|
+
|
The impact of geometry on monochrome regions in the flip Schelling process
|
2022
|
Thomas Bläsius
Tobias Friedrich
Martin S. Krejca
Louise Molitor
|
|
+
PDF
Chat
|
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
|
2022
|
Thomas Bläsius
Cedric Freiberger
Tobias Friedrich
Maximilian Katzmann
Felix Montenegro-Retana
Marianne Thieffry
|
|
+
PDF
Chat
|
Polymer Dynamics Via Cliques: New Conditions for Approximations
|
2022
|
Marcus Pappik
Tobias Friedrich
Andreas Göbel
Martin S. Krejca
|
|
+
PDF
Chat
|
An Efficient Branch-and-Bound Solver for Hitting Set
|
2022
|
Thomas Bläsius
Tobias Friedrich
David Stangl
Christopher Weyand
|
|
+
|
What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization
|
2022
|
Maximilian Böther
Otto Kißig
Martin Taraz
Sarel Cohen
Karen Seidel
Tobias Friedrich
|
|
+
|
Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials
|
2022
|
Tobias Friedrich
Andreas Göbel
Maximilian Katzmann
Martin S. Krejca
Marcus Pappik
|
|
+
|
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances
|
2022
|
Davide Bilò
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
Martin Schirneck
|
|
+
|
Social Distancing Network Creation
|
2022
|
Tobias Friedrich
Hans Gawendowicz
Pascal Lenzner
Anna Melnichenko
|
|
+
|
Analysis of a Gray-Box Operator for Vertex Cover
|
2022
|
Samuel Baguley
Tobias Friedrich
Timo Kötzing
Xiaoyue Li
Marcus Pappik
Ziena Zeif
|
|
+
|
Fast Feature Selection with Fairness Constraints
|
2022
|
Francesco Quinzan
Rajiv Khanna
Moshik Hershcovitch
Sarel Cohen
Daniel Waddington
Tobias Friedrich
Michael W. Mahoney
|
|
+
PDF
Chat
|
Accelerated Information Dissemination on Networks with Local and Global Edges
|
2022
|
Sarel Cohen
Philipp Fischbeck
Tobias Friedrich
Martin S. Krejca
Thomas Sauerwald
|
|
+
|
The Impact of Cooperation in Bilateral Network Creation
|
2022
|
Tobias Friedrich
Hans Gawendowicz
Pascal Lenzner
Arthur Zahn
|
|
+
|
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
|
2022
|
Katrin Casel
Tobias Friedrich
Davis Issac
Aikaterini Niklanovits
Ziena Zeif
|
|
+
PDF
Chat
|
Theoretical Study of Optimizing Rugged Landscapes with the cGA
|
2022
|
Tobias Friedrich
Timo Kötzing
Frank Neumann
Aishwarya Radhakrishnan
|
|
+
PDF
Chat
|
Algorithms for Hard-Constraint Point Processes via Discretization
|
2022
|
Tobias Friedrich
Andreas Göbel
Maximilian Katzmann
Martin S. Krejca
Marcus Pappik
|
|
+
|
Deep Distance Sensitivity Oracles
|
2022
|
Davin Jeong
Chau Pham
Arnav Bhakta
Sarel Cohen
Maximilian Katzmann
Tobias Friedrich
Sang Chin
|
|
+
|
Analysis of the survival time of the SIRS process via expansion
|
2022
|
Tobias Friedrich
Andreas Göbel
Nicolas Klodt
Martin S. Krejca
Marcus Pappik
|
|
+
|
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth
|
2022
|
Tobias Friedrich
Davis Issac
Nikhil Kumar
Nadym Mallek
Ziena Zeif
|
|
+
|
Theoretical Study of Optimizing Rugged Landscapes with the cGA
|
2022
|
Tobias Friedrich
Timo Kötzing
Frank Neumann
Aishwarya Radhakrishnan
|
|
+
PDF
Chat
|
Fixed-Parameter Sensitivity Oracles
|
2021
|
Davide Bilò
Katrin Casel
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
J. A. Gregor Lagodzinski
Martin Schirneck
Simon Wietheger
|
|
+
PDF
Chat
|
Computing Voronoi Diagrams in the Polar-Coordinate Model of the
Hyperbolic Plane
|
2021
|
Tobias Friedrich
Maximilian Katzmann
Leon Schiller
|
|
+
PDF
Chat
|
The complexity of dependency detection and discovery in relational databases
|
2021
|
Thomas Bläsius
Tobias Friedrich
Martin Schirneck
|
|
+
PDF
Chat
|
Efficiently enumerating hitting sets of hypergraphs arising in data profiling
|
2021
|
Thomas Bläsius
Tobias Friedrich
Julius Lischeid
Kitty Meeks
Martin Schirneck
|
|
+
|
An Efficient Branch-and-Bound Solver for Hitting Set.
|
2021
|
Thomas Bläsius
Tobias Friedrich
David Stangl
Christopher Weyand
|
|
+
PDF
Chat
|
Pareto optimization for subset selection with dynamic cost constraints
|
2021
|
Vahid Roostapour
Aneta Neumann
Frank Neumann
Tobias Friedrich
|
|
+
|
Algorithms for general hard-constraint point processes via discretization.
|
2021
|
Tobias Friedrich
Andreas Göbel
Maximilian Katzmann
Martin S. Krejca
Marcus Pappik
|
|
+
|
Routing in Strongly Hyperbolic Unit Disk Graphs
|
2021
|
Thomas Bläsius
Tobias Friedrich
Maximilian Katzmann
Stephan Daniel
|
|
+
|
Pareto optimal and popular house allocation with lower and upper quotas.
|
2021
|
Ágnes Cseh
Tobias Friedrich
Jannik Peters
|
|
+
|
Space-Efficient Fault-Tolerant Diameter Oracles
|
2021
|
Davide Bilò
Sarel Cohen
Tobias Friedrich
Martin Schirneck
|
|
+
|
Efficiency and Stability in Euclidean Network Design
|
2021
|
Wilhelm Friedemann
Tobias Friedrich
Hans Gawendowicz
Pascal Lenzner
Anna Melnichenko
Jannik Peters
Stephan Daniel
Michael Vaichenker
|
|
+
PDF
Chat
|
Selfish Creation of Social Networks
|
2021
|
Davide Bilò
Tobias Friedrich
Pascal Lenzner
Stefanie Lowski
Anna Melnichenko
|
|
+
|
Efficiency and Stability in Euclidean Network Design
|
2021
|
Wilhelm Friedemann
Tobias Friedrich
Hans Gawendowicz
Pascal Lenzner
Anna Melnichenko
Jannik Peters
Stephan Daniel
Michael Vaichenker
|
|
+
|
The Flip Schelling Process on Random Geometric and Erdös-Rényi Graphs.
|
2021
|
Thomas Bläsius
Tobias Friedrich
Martin S. Krejca
Louise Molitor
|
|
+
PDF
Chat
|
Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
|
2021
|
Francesco Quinzan
Andreas Göbel
Markus Wagner
Tobias Friedrich
|
|
+
PDF
Chat
|
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
|
2021
|
Thomas Bläsius
Tobias Friedrich
Andreas Göbel
Jordi Levy
Ralf Rothenberger
|
|
+
|
Adaptive Sampling for Fast Constrained Maximization of Submodular Function
|
2021
|
Francesco Quinzan
Vanja Doskoč
Andreas Göbel
Tobias Friedrich
|
|
+
|
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles
|
2021
|
Davide Bilò
Sarel Cohen
Tobias Friedrich
Martin Schirneck
|
|
+
|
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order.
|
2021
|
J. A. Gregor Lagodzinski
Andreas Göbel
Katrin Casel
Tobias Friedrich
|
|
+
|
Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry
|
2021
|
Thomas Bläsius
Tobias Friedrich
Maximilian Katzmann
|
|
+
PDF
Chat
|
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization
|
2021
|
Lukas Behrendt
Katrin Casel
Tobias Friedrich
J. A. Gregor Lagodzinski
Alexander Löser
Marcus Wilhelm
|
|
+
|
An Efficient Branch-and-Bound Solver for Hitting Set
|
2021
|
Thomas Bläsius
Tobias Friedrich
David Stangl
Christopher Weyand
|
|
+
|
Towards Explainable Real Estate Valuation via Evolutionary Algorithms
|
2021
|
Sebastian Angrick
Ben Bals
Niko Hastrich
Maximilian Kleissl
Jonas Schmidt
Vanja Doskoč
Maximilian Katzmann
Louise Molitor
Tobias Friedrich
|
|
+
|
Algorithms for hard-constraint point processes via discretization
|
2021
|
Tobias Friedrich
Andreas Göbel
Maximilian Katzmann
Martin S. Krejca
Marcus Pappik
|
|
+
|
Pareto optimal and popular house allocation with lower and upper quotas
|
2021
|
Ágnes Cseh
Tobias Friedrich
Jannik Peters
|
|
+
|
Space-Efficient Fault-Tolerant Diameter Oracles
|
2021
|
Davide Bilò
Sarel Cohen
Tobias Friedrich
Martin Schirneck
|
|
+
|
Efficiency and Stability in Euclidean Network Design
|
2021
|
Wilhelm Friedemann
Tobias Friedrich
Hans Gawendowicz
Pascal Lenzner
Anna Melnichenko
Jannik Peters
Daniel Stephan
Michael Vaichenker
|
|
+
|
The Complexity of Dependency Detection and Discovery in Relational Databases
|
2021
|
Thomas Bläsius
Tobias Friedrich
Martin Schirneck
|
|
+
|
Fixed-Parameter Sensitivity Oracles
|
2021
|
Davide Bilò
Katrin Casel
Keerti Choudhary
Sarel Cohen
Tobias Friedrich
J. A. Gregor Lagodzinski
Martin Schirneck
Simon Wietheger
|
|
+
|
Strongly Hyperbolic Unit Disk Graphs
|
2021
|
Thomas Bläsius
Tobias Friedrich
Maximilian Katzmann
Daniel Stephan
|
|
+
|
On Counting (Quantum-)Graph Homomorphisms in Finite Fields.
|
2020
|
J. A. Gregor Lagodzinski
Andreas Göbel
Katrin Casel
Tobias Friedrich
|
|
+
|
Balanced Crown Decomposition for Connectivity Constraints.
|
2020
|
Katrin Casel
Tobias Friedrich
Davis Issac
Aikaterini Niklanovits
Ziena Zeif
|
|
+
|
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order
|
2020
|
J. A. Gregor Lagodzinski
Andreas Göbel
Katrin Casel
Tobias Friedrich
|
|
+
|
Efficiently Computing Maximum Flows in Scale-Free Networks
|
2020
|
Thomas Bläsius
Tobias Friedrich
Christopher Weyand
|
|
+
|
Polymer dynamics via cliques with applications to hard-sphere mixtures.
|
2020
|
Tobias Friedrich
Andreas Göbel
Martin S. Krejca
Marcus Pappik
|
|
+
|
timeXplain - A Framework for Explaining the Predictions of Time Series Classifiers.
|
2020
|
Felix Mujkanovic
Vanja Doskoč
Martin Schirneck
Patrick Schäfer
Tobias Friedrich
|
|
+
|
Flow-Based Network Creation Games
|
2020
|
Hagen Echzell
Tobias Friedrich
Pascal Lenzner
Anna Melnichenko
|
|
+
|
Flow-Based Network Creation Games.
|
2020
|
Hagen Echzell
Tobias Friedrich
Pascal Lenzner
Anna Melnichenko
|
|
+
PDF
Chat
|
Greed is Good for Deterministic Scale-Free Networks
|
2020
|
Ankit Chauhan
Tobias Friedrich
Ralf Rothenberger
|
|
+
|
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs.
|
2020
|
Thomas Bläsius
Philipp Fischbeck
Tobias Friedrich
Maximilian Katzmann
|
|
+
|
A Strategic Routing Framework and Algorithms for Computing Alternative Paths
|
2020
|
Thomas Bläsius
Maximilian Böther
Philipp Fischbeck
Tobias Friedrich
Alina Gries
Falk Hüffner
Otto Kißig
Pascal Lenzner
Louise Molitor
Leon Schiller
|
|
+
|
Fair Tree Connection Games with Topology-Dependent Edge Cost
|
2020
|
Davide Bilò
Tobias Friedrich
Pascal Lenzner
Anna Melnichenko
Louise Molitor
|
|
+
|
Balanced Crown Decomposition for Connectivity Constraints
|
2020
|
Katrin Casel
Tobias Friedrich
Davis Issac
Aikaterini Niklanovits
Ziena Zeif
|
|
+
|
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
|
2020
|
Thomas Bläsius
Tobias Friedrich
Maximilian Katzmann
|
|
+
|
Efficiently Computing Maximum Flows in Scale-Free Networks
|
2020
|
Thomas Bläsius
Tobias Friedrich
Christopher Weyand
|
|
+
|
Polymer Dynamics via Cliques: New Conditions for Approximations
|
2020
|
Tobias Friedrich
Andreas Göbel
Martin S. Krejca
Marcus Pappik
|
|
+
|
Flow-Based Network Creation Games
|
2020
|
Hagen Echzell
Tobias Friedrich
Pascal Lenzner
Anna Melnichenko
|
|
+
|
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
|
2020
|
Thomas Bläsius
Tobias Friedrich
Andreas Göbel
Jordi Levy
Ralf Rothenberger
|
|
+
|
On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order
|
2020
|
J. A. Gregor Lagodzinski
Andreas Göbel
Katrin Casel
Tobias Friedrich
|
|
+
|
Selfish Creation of Social Networks
|
2020
|
Davide Bilò
Tobias Friedrich
Pascal Lenzner
Stefanie Lowski
Anna Melnichenko
|
|
+
|
Shortest Distances as Enumeration Problem
|
2020
|
Katrin Casel
Tobias Friedrich
Stefan Neubert
Markus L. Schmid
|
|
+
|
timeXplain -- A Framework for Explaining the Predictions of Time Series Classifiers
|
2020
|
Felix Mujkanovic
Vanja Doskoč
Martin Schirneck
Patrick Schäfer
Tobias Friedrich
|
|
+
|
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings
|
2019
|
Vanja Doskoč
Tobias Friedrich
Andreas Göbel
Frank Neumann
Aneta Neumann
Francesco Quinzan
|
|
+
|
Convergence and Hardness of Strategic Schelling Segregation
|
2019
|
Hagen Echzell
Tobias Friedrich
Pascal Lenzner
Louise Molitor
Marcus Pappik
Friedrich Schöne
Fabian Sommer
David Stangl
|
|
+
PDF
Chat
|
Pareto Optimization for Subset Selection with Dynamic Cost Constraints
|
2019
|
Vahid Roostapour
Aneta Neumann
Frank Neumann
Tobias Friedrich
|
|
+
PDF
Chat
|
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints
|
2019
|
Tobias Friedrich
Andreas Göbel
Frank Neumann
Francesco Quinzan
Ralf Rothenberger
|
|
+
PDF
Chat
|
Geometric Network Creation Games
|
2019
|
Davide Bilò
Tobias Friedrich
Pascal Lenzner
Anna Melnichenko
|
|
+
|
Understanding the Effectiveness of Data Reduction in Public Transportation Networks
|
2019
|
Thomas Bläsius
Philipp Fischbeck
Tobias Friedrich
Martin Schirneck
|
|
+
|
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
|
2019
|
Thomas Bläsius
Philipp Fischbeck
Tobias Friedrich
Maximilian Katzmann
|
|
+
|
The Satisfiability Threshold for Non-Uniform Random 2-SAT
|
2019
|
Tobias Friedrich
Ralf Rothenberger
|
|
+
|
A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints
|
2019
|
Álvaro Parra
Tat-Jun Chin
Frank Neumann
Tobias Friedrich
Maximilian Katzmann
|
|
+
|
The Satisfiability Threshold for Non-Uniform Random 2-SAT
|
2019
|
Tobias Friedrich
Ralf Rothenberger
|
|
+
PDF
Chat
|
Understanding the Effectiveness of Data Reduction in Public Transportation Networks
|
2019
|
Thomas Bläsius
Philipp Fischbeck
Tobias Friedrich
Martin Schirneck
|
|
+
|
The Minimization of Random Hypergraphs
|
2019
|
Thomas Bläsius
Tobias Friedrich
Martin Schirneck
|
|
+
PDF
Chat
|
Convergence and Hardness of Strategic Schelling Segregation
|
2019
|
Hagen Echzell
Tobias Friedrich
Pascal Lenzner
Louise Molitor
Marcus Pappik
Friedrich Schöne
Fabian Sommer
David Stangl
|
|
+
PDF
Chat
|
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
|
2019
|
Thomas Bläsius
Tobias Friedrich
Julius Lischeid
Kitty Meeks
Martin Schirneck
|
|
+
|
Convergence and Hardness of Strategic Schelling Segregation
|
2019
|
Hagen Echzell
Tobias Friedrich
Pascal Lenzner
Louise Molitor
Marcus Pappik
F. Schöne
Fabian Sommer
David Stangl
|
|
+
|
Understanding the Effectiveness of Data Reduction in Public Transportation Networks
|
2019
|
Thomas Bläsius
Philipp Fischbeck
Tobias Friedrich
Martin Schirneck
|
|
+
|
Geometric Network Creation Games
|
2019
|
Davide Bilò
Tobias Friedrich
Pascal Lenzner
Anna Melnichenko
|
|
+
|
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings
|
2019
|
Vanja Doskoč
Tobias Friedrich
Andreas Göbel
Frank Neumann
Aneta Neumann
Francesco Quinzan
|
|
+
|
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
|
2019
|
Thomas Bläsius
Philipp Fischbeck
Tobias Friedrich
Maximilian Katzmann
|
|
+
|
Zeros and approximations of Holant polynomials on the complex plane
|
2019
|
Katrin Casel
Philipp Fischbeck
Tobias Friedrich
Andreas Göbel
J. A. Gregor Lagodzinski
|
|
+
|
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization
|
2019
|
Lukas Behrendt
Katrin Casel
Tobias Friedrich
J. A. Gregor Lagodzinski
Alexander Löser
Marcus Wilhelm
|
|
+
|
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs
|
2019
|
Thomas Bläsius
Tobias Friedrich
Maximilian Katzmann
Ulrich Meyer
Manuel Penschuck
Christopher Weyand
|
|
+
|
Pareto Optimization for Subset Selection with Dynamic Cost Constraints
|
2018
|
Vahid Roostapour
Aneta Neumann
Frank Neumann
Tobias Friedrich
|
|
+
|
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints
|
2018
|
Tobias Friedrich
Andreas Göbel
Frank Neumann
Francesco Quinzan
Ralf Rothenberger
|
|
+
|
Randomized Local Search Heuristics for Submodular Maximization and Covering Problems: Benefits of Heavy-tailed Mutation Operators
|
2018
|
Tobias Friedrich
Andreas Göbel
Francesco Quinzan
Markus Wagner
|
|
+
|
Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations
|
2018
|
Tobias Friedrich
Andreas Göbel
Francesco Quinzan
Markus Wagner
|
|
+
|
On the Enumeration of Minimal Hitting Sets in Lexicographical Order.
|
2018
|
Thomas Bläsius
Tobias Friedrich
Kitty Meeks
Martin Schirneck
|
|
+
|
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
|
2018
|
Thomas Bläsius
Tobias Friedrich
Julius Lischeid
Kitty Meeks
Martin Schirneck
|
|
+
PDF
Chat
|
On the Diameter of Hyperbolic Random Graphs
|
2018
|
Tobias Friedrich
Anton Krohmer
|
|
+
|
Unbounded Discrepancy of Deterministic Random Walks on Grids
|
2018
|
Tobias Friedrich
Maximilian Katzmann
Anton Krohmer
|
|
+
|
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints
|
2018
|
Tobias Friedrich
Andreas Göbel
Frank Neumann
Francesco Quinzan
Ralf Rothenberger
|
|
+
|
Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations
|
2018
|
Tobias Friedrich
Andreas Göbel
Francesco Quinzan
Markus Wagner
|
|
+
|
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
|
2018
|
Thomas Bläsius
Tobias Friedrich
Julius Lischeid
Kitty Meeks
Martin Schirneck
|
|
+
|
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
|
2018
|
Thomas Bläsius
Cedric Freiberger
Tobias Friedrich
Maximilian Katzmann
Felix Montenegro-Retana
Marianne Thieffry
|
|
+
PDF
Chat
|
Approximating optimization problems using EAs on scale-free networks
|
2017
|
Ankit Chauhan
Tobias Friedrich
Francesco Quinzan
|
|
+
|
Cliques in Hyperbolic Random Graphs
|
2017
|
Thomas Bläsius
Tobias Friedrich
Anton Krohmer
|
|
+
|
Approximating Optimization Problems using EAs on Scale-Free Networks
|
2017
|
Ankit Chauhan
Tobias Friedrich
Francesco Quinzan
|
|
+
|
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT
|
2017
|
Tobias Friedrich
Anton Krohmer
Ralf Rothenberger
Thomas Sauerwald
Andrew M. Sutton
|
|
+
|
Quasi-random Agents for Image Transition and Animation
|
2017
|
Aneta Neumann
Frank Neumann
Tobias Friedrich
|
|
+
PDF
Chat
|
Efficient Best Response Computation for Strategic Network Formation Under Attack
|
2017
|
Tobias Friedrich
Sven Ihde
Christoph Keßler
Pascal Lenzner
Stefan Neubert
David W. Schumann
|
|
+
|
Approximating Optimization Problems using EAs on Scale-Free Networks
|
2017
|
Ankit Chauhan
Tobias Friedrich
Francesco Quinzan
|
|
+
|
Efficient Best-Response Computation for Strategic Network Formation under Attack
|
2016
|
Tobias Friedrich
Sven Ihde
Christoph Keßler
Pascal Lenzner
Stefan Neubert
David W. Schumann
|
|
+
|
A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover.
|
2016
|
Tobias Friedrich
Timo Kötzing
Markus Wagner
|
|
+
|
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity
|
2016
|
Duc-Cuong Dang
Tobias Friedrich
Timo Kötzing
Martin S. Krejca
Per Kristian Lehre
Pietro S. Oliveto
Dirk Sudholt
Andrew M. Sutton
|
|
+
|
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
|
2016
|
Thomas Bläsius
Tobias Friedrich
Anton Krohmer
Sören Laue
|
|
+
|
A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover
|
2016
|
Tobias Friedrich
Timo Kötzing
Markus Wagner
|
|
+
|
Efficient Best-Response Computation for Strategic Network Formation under Attack
|
2016
|
Tobias Friedrich
Sven Ihde
Christoph Keßler
Pascal Lenzner
Stefan Neubert
David W. Schumann
|
|
+
|
On the kernel size of clique cover reductions for random intersection graphs
|
2015
|
Tobias Friedrich
Christian Hercher
|
|
+
PDF
Chat
|
Seeding the initial population of multi-objective evolutionary algorithms: A computational study
|
2015
|
Tobias Friedrich
Markus Wagner
|
|
+
|
Cliques in hyperbolic random graphs
|
2015
|
Tobias Friedrich
Anton Krohmer
|
|
+
|
On the average-case complexity of parameterized clique
|
2015
|
Nikolaos Fountoulakis
Tobias Friedrich
Danny Hermelin
|
|
+
|
The Benefit of Sex in Noisy Evolutionary Search
|
2015
|
Tobias Friedrich
Timo Kötzing
Martin S. Krejca
Andrew M. Sutton
|
|
+
|
Unbounded Discrepancy of Deterministic Random Walks on Grids
|
2015
|
Tobias Friedrich
Maximilian Katzmann
Anton Krohmer
|
|
+
PDF
Chat
|
On the Diameter of Hyperbolic Random Graphs
|
2015
|
Tobias Friedrich
Anton Krohmer
|
|
+
|
Seeding the Initial Population of Multi-Objective Evolutionary Algorithms: A Computational Study
|
2014
|
Tobias Friedrich
Markus Wagner
|
|
+
|
Parameterized clique on inhomogeneous random graphs
|
2014
|
Tobias Friedrich
Anton Krohmer
|
|
+
PDF
Chat
|
Quasirandom Rumor Spreading
|
2014
|
Benjamin Doerr
Tobias Friedrich
Thomas Sauerwald
|
|
+
|
On the Average-case Complexity of Parameterized Clique
|
2014
|
Nikolaos Fountoulakis
Tobias Friedrich
Danny Hermelin
|
|
+
|
Randomized diffusion for indivisible loads
|
2014
|
Petra Berenbrink
Colin Cooper
Tom Friedetzky
Tobias Friedrich
Thomas Sauerwald
|
|
+
PDF
Chat
|
Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point
|
2014
|
Tobias Friedrich
Frank Neumann
Christian Thyssen
|
|
+
|
On the Average-case Complexity of Parameterized Clique
|
2014
|
Nikolaos Fountoulakis
Tobias Friedrich
Danny Hermelin
|
|
+
|
Seeding the Initial Population of Multi-Objective Evolutionary Algorithms: A Computational Study
|
2014
|
Tobias Friedrich
Markus Wagner
|
|
+
|
Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point
|
2013
|
Tobias Friedrich
Frank Neumann
Christian Thyssen
|
|
+
|
Multiplicative Approximations, Optimal Hypervolume Distributions, and the Choice of the Reference Point
|
2013
|
Tobias Friedrich
Frank Neumann
Christian Thyssen
|
|
+
PDF
Chat
|
Predicting the energy output of wind farms based on weather data: Important variables and their correlation
|
2012
|
Ekaterina Vladislavleva
Tobias Friedrich
Frank Neumann
Markus Wagner
|
|
+
PDF
Chat
|
Fast simulation of large‐scale growth models
|
2012
|
Tobias Friedrich
Lionel Levine
|
|
+
PDF
Chat
|
Quasirandom Load Balancing
|
2012
|
Tobias Friedrich
Martin Gairing
Thomas Sauerwald
|
|
+
|
Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation
|
2011
|
Katya Vladislavleva
Tobias Friedrich
Frank Neumann
Markus Wagner
|
|
+
|
Average update times for fully-dynamic all-pairs shortest paths
|
2011
|
Tobias Friedrich
Nils Hebbinghaus
|
|
+
|
Randomized diffusion for indivisible loads
|
2011
|
Petra Berenbrink
Colin Cooper
Tom Friedetzky
Tobias Friedrich
Thomas Sauerwald
|
|
+
PDF
Chat
|
Fast Simulation of Large-Scale Growth Models
|
2011
|
Tobias Friedrich
Lionel Levine
|
|
+
|
Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation
|
2011
|
Katya Vladislavleva
Tobias Friedrich
Frank Neumann
Markus Wagner
|
|
+
|
Quasirandom Rumor Spreading
|
2010
|
Benjamin Doerr
Tobias Friedrich
Thomas Sauerwald
|
|
+
|
Quasirandom Rumor Spreading: An Experimental Analysis
|
2010
|
Carola Doerr
Tobias Friedrich
Marvin Künnemann
Thomas Sauerwald
|
|
+
|
The Cover Time of Deterministic Random Walks
|
2010
|
Tobias Friedrich
Thomas Sauerwald
|
|
+
|
None
|
2010
|
Joshua Cooper
Carola Doerr
Tobias Friedrich
Joel Spencer
|
|
+
PDF
Chat
|
Deterministic random walks on regular trees: Deterministic Random Walks on Regular Trees
|
2010
|
Joshua Cooper
Benjamin Doerr
Tobias Friedrich
Joel Spencer
|
|
+
PDF
Chat
|
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
|
2010
|
Karl Bringmann
Tobias Friedrich
|
|
+
PDF
Chat
|
Smoothed analysis of balancing networks
|
2010
|
Tobias Friedrich
Thomas Sauerwald
Dan Vilenchik
|
|
+
|
The Cover Time of Deterministic Random Walks
|
2010
|
Tobias Friedrich
Thomas Sauerwald
|
|
+
|
Fast simulation of large-scale growth models
|
2010
|
Tobias Friedrich
Lionel Levine
|
|
+
|
Approximating the volume of unions and intersections of high-dimensional geometric objects
|
2010
|
Karl Bringmann
Tobias Friedrich
|
|
+
PDF
Chat
|
Deterministic random walks on regular trees
|
2010
|
Joshua Cooper
Benjamin Doerr
Tobias Friedrich
Joel Spencer
|
|
+
|
Quasirandom load balancing
|
2010
|
Tobias Friedrich
Martin Gairing
Thomas Sauerwald
|
|
+
PDF
Chat
|
The Cover Time of Deterministic Random Walks
|
2010
|
Tobias Friedrich
Thomas Sauerwald
|
|
+
|
Smoothed Analysis of Balancing Networks
|
2010
|
Tobias Friedrich
Thomas Sauerwald
Dan Vilenchik
|
|
+
|
Quasirandom Rumor Spreading: An Experimental Analysis
|
2010
|
Carola Doerr
Tobias Friedrich
Marvin Künnemann
Thomas Sauerwald
|
|
+
|
The Cover Time of Deterministic Random Walks
|
2010
|
Tobias Friedrich
Thomas Sauerwald
|
|
+
|
Fast simulation of large-scale growth models
|
2010
|
Tobias Friedrich
Lionel Levine
|
|
+
|
Quasirandom Rumor Spreading
|
2010
|
Benjamin Doerr
Tobias Friedrich
Thomas Sauerwald
|
|
+
PDF
Chat
|
On the Effects of Adding Objectives to Plateau Functions
|
2009
|
Dimo Brockhoff
Tobias Friedrich
Nils Hebbinghaus
Christian Klein
Frank Neumann
Eckart Zitzler
|
|
+
PDF
Chat
|
Quasirandom Rumor Spreading: An Experimental Analysis
|
2009
|
Benjamin Doerr
Tobias Friedrich
Marvin Künnemann
Thomas Sauerwald
|
|
+
PDF
Chat
|
Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice
|
2009
|
Karl Bringmann
Tobias Friedrich
|
|
+
|
Random broadcast on random geometric graphs
|
2009
|
Milan Bradonjić
Robert Elsässer⋆
Tobias Friedrich
Tomas Sauerwald
|
|
+
PDF
Chat
|
Smoothed Analysis of Balancing Networks
|
2009
|
Tobias Friedrich
Thomas Sauerwald
Dan Vilenchik
|
|
+
PDF
Chat
|
Quasirandom rumor spreading
|
2008
|
Benjamin Doerr
Tobias Friedrich
Marvin Künnemann
Thomas Sauerwald
|
|
+
|
Deterministic Random Walks on the Two-Dimensional Grid
|
2008
|
Benjamin Doerr
Tobias Friedrich
|
|
+
|
Deterministic random walks on regular trees
|
2008
|
Joshua Cooper
Benjamin Doerr
Tobias Friedrich
Joel Spencer
|
|
+
PDF
Chat
|
Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects
|
2008
|
Karl Bringmann
Tobias Friedrich
|
|
+
|
Average-Case Analysis of Online Topological Ordering
|
2008
|
Deepak Ajwani
Tobias Friedrich
|
|
+
|
Deterministic Random Walks on Regular Trees
|
2007
|
Joshua Cooper
Benjamin Doerr
Tobias Friedrich
Joel Spencer
|
|
+
PDF
Chat
|
Unbiased Matrix Rounding
|
2007
|
Tobias Friedrich
Benjamin Doerr
Christian Klein
Ralf Osbild
|
|
+
|
Deterministic Random Walks on the Two-Dimensional Grid
|
2007
|
Benjamin Doerr
Tobias Friedrich
|
|
+
|
Quasirandomness in Graphs
|
2006
|
Carola Doerr
Tobias Friedrich
|
|
+
|
Unbiased Matrix Rounding
|
2006
|
Benjamin Doerr
Tobias Friedrich
Christian Klein
Ralf Osbild
|
|
+
|
Deterministic Random Walks on the Two-Dimensional Grid
|
2006
|
Carola Doerr
Tobias Friedrich
Tetsuo Asano
|
|
+
|
Deterministic Random Walks on the Two-Dimensional Grid
|
2006
|
Benjamin Doerr
Tobias Friedrich
|
|
+
|
Unbiased Matrix Rounding
|
2006
|
Benjamin Doerr
Tobias Friedrich
Christian Klein
Ralf Osbild
Lars Arge
Rūsiņš Freivalds
|
|
+
|
An O(n^{2.75}) algorithm for online topological ordering
|
2006
|
Deepak Ajwani
Tobias Friedrich
Ulrich Meyer
|