| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126249 | 2024-04-09 | Paper |
| The Impact of Cooperation in Bilateral Network Creation | 2024-03-26 | Paper |
| Understanding the effectiveness of data reduction in public transportation networks | 2024-02-16 | Paper |
| Shortest distances as enumeration problem | 2024-01-24 | Paper |
| Geometric Network Creation Games | 2024-01-23 | Paper |
| Compact distance oracles with large sensitivity and low stretch | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147250 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147530 | 2024-01-15 | Paper |
| Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry | 2023-12-13 | Paper |
| The impact of heterogeneity and geometry on the proof complexity of random satisfiability | 2023-11-07 | Paper |
| Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry | 2023-10-31 | Paper |
| Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075905 | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075907 | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075914 | 2023-09-20 | Paper |
| Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations | 2023-09-08 | Paper |
| Algorithms for hard-constraint point processes via discretization | 2023-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168428 | 2023-08-08 | Paper |
| Social distancing network creation | 2023-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6159913 | 2023-06-23 | Paper |
| From symmetry to asymmetry: generalizing TSP approximations by parametrization | 2023-06-12 | Paper |
| Hyperbolic Embeddings for Near-Optimal Greedy Routing | 2023-05-23 | Paper |
| Solving vertex cover in polynomial time on hyperbolic random graphs | 2023-04-27 | Paper |
| Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem | 2023-03-20 | Paper |
| Towards a Systematic Evaluation of Generative Network Models | 2023-03-09 | Paper |
| Single-Peaked Jump Schelling Games | 2023-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874296 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874488 | 2023-02-07 | Paper |
| Polymer dynamics via cliques: new conditions for approximations | 2022-12-21 | Paper |
| Accelerated information dissemination on networks with local and global edges | 2022-11-11 | Paper |
| The impact of geometry on monochrome regions in the flip Schelling process | 2022-10-06 | Paper |
| A Spectral Independence View on Hard Spheres via Block Dynamics | 2022-10-06 | Paper |
| Zeros and approximations of holant polynomials on the complex plane | 2022-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091218 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090451 | 2022-07-18 | Paper |
| From symmetry to asymmetry: generalizing TSP approximations by parametrization | 2022-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075758 | 2022-05-11 | Paper |
| Analysis of the survival time of the SIRS process via expansion | 2022-05-05 | Paper |
| Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials | 2022-04-04 | Paper |
| Solving non-uniform planted and filtered random SAT formulas greedily | 2022-03-22 | Paper |
| Analysis of a Gray-Box Operator for Vertex Cover | 2022-03-16 | Paper |
| The complexity of dependency detection and discovery in relational databases | 2021-12-22 | Paper |
| Pareto optimization for subset selection with dynamic cost constraints | 2021-12-13 | Paper |
| Efficiently enumerating hitting sets of hypergraphs arising in data profiling | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002689 | 2021-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999249 | 2021-07-06 | Paper |
| The Flip Schelling Process on Random Geometric and Erd\"os-R\'enyi Graphs | 2021-02-19 | Paper |
| Greed is good for deterministic scale-free networks | 2020-10-21 | Paper |
| Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints | 2020-10-12 | Paper |
| Polymer Dynamics via Cliques: New Conditions for Approximations | 2020-07-16 | Paper |
| Convergence and hardness of strategic Schelling segregation | 2020-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111724 | 2020-05-27 | Paper |
| Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints | 2020-05-26 | Paper |
| The Minimization of Random Hypergraphs | 2019-10-01 | Paper |
| Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling | 2019-09-13 | Paper |
| Hyperbolic Embeddings for Near-Optimal Greedy Routing | 2019-09-12 | Paper |
| Quasirandom Rumor Spreading: An Experimental Analysis | 2019-09-11 | Paper |
| Unbiasedness of estimation-of-distribution algorithms | 2019-07-31 | Paper |
| Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints | 2019-02-14 | Paper |
| Island models meet rumor spreading | 2019-02-14 | Paper |
| De-anonymization of heterogeneous random graphs in quasilinear time | 2019-01-11 | Paper |
| An O ( n 2.75 ) algorithm for incremental topological ordering | 2018-11-05 | Paper |
| Quasirandom Rumor Spreading | 2018-10-30 | Paper |
| Unbounded Discrepancy of Deterministic Random Walks on Grids | 2018-10-19 | Paper |
| Sharpness of the satisfiability threshold for non-uniform random \(k\)-SAT | 2018-08-10 | Paper |
| Cliques in hyperbolic random graphs | 2018-07-25 | Paper |
| On the Diameter of Hyperbolic Random Graphs | 2018-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636581 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634389 | 2018-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606276 | 2018-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606284 | 2018-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606285 | 2018-03-02 | Paper |
| Efficient best response computation for strategic network formation under attack | 2018-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365053 | 2017-09-29 | Paper |
| Computing single source shortest paths using single-objective fitness | 2017-07-14 | Paper |
| Don't be greedy when calculating hypervolume contributions | 2017-07-14 | Paper |
| The logarithmic hypervolume indicator | 2017-07-14 | Paper |
| Resampling vs Recombination | 2017-06-13 | Paper |
| On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms | 2017-06-13 | Paper |
| Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints | 2017-06-13 | Paper |
| Efficient optimization of many objectives by approximation-guided evolution | 2016-10-06 | Paper |
| Toward a unifying framework for evolutionary processes | 2016-08-18 | Paper |
| The Benefit of Recombination in Noisy Evolutionary Search | 2016-01-11 | Paper |
| Unbounded Discrepancy of Deterministic Random Walks on Grids | 2016-01-11 | Paper |
| Ultra-Fast Load Balancing on Scale-Free Networks | 2015-11-04 | Paper |
| On the Diameter of Hyperbolic Random Graphs | 2015-11-04 | Paper |
| Speeding up many-objective optimization by Monte Carlo approximations | 2015-08-27 | Paper |
| On the kernel size of clique cover reductions for random intersection graphs | 2015-08-24 | Paper |
| On the average-case complexity of parameterized clique | 2015-05-18 | Paper |
| Parameterized clique on inhomogeneous random graphs | 2015-04-28 | Paper |
| Near-perfect load balancing by randomized rounding | 2015-02-04 | Paper |
| De-anonymization of Heterogeneous Random Graphs in Quasilinear Time | 2014-10-08 | Paper |
| Randomized diffusion for indivisible loads | 2014-09-22 | Paper |
| Social networks spread rumors in sublogarithmic time | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417718 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417736 | 2014-05-22 | Paper |
| Quasirandom rumor spreading | 2014-04-01 | Paper |
| Diameter and broadcast time of random geometric graphs in arbitrary dimensions | 2013-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857363 | 2013-11-01 | Paper |
| Quasirandom Rumor Spreading on Expanders | 2013-10-10 | Paper |
| Approximation quality of the hypervolume indicator | 2013-08-26 | Paper |
| Exact and Efficient Generation of Geometric Random Variates and Random Graphs | 2013-08-06 | Paper |
| Parameterized Clique on Scale-Free Networks | 2013-03-21 | Paper |
| Fast Simulation of Large-Scale Growth Models | 2013-03-12 | Paper |
| Constraint satisfaction problems: convexity makes AllDifferent constraints tractable | 2013-03-04 | Paper |
| Quasirandom Load Balancing | 2012-11-29 | Paper |
| Convergence of set-based multi-objective optimization, indicators and deteriorative cycles | 2012-10-11 | Paper |
| Asynchronous Rumor Spreading in Preferential Attachment Graphs | 2012-08-14 | Paper |
| Approximating the least hypervolume contributor: NP-hard in general, but fast in practice | 2012-05-14 | Paper |
| Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions | 2011-12-16 | Paper |
| Average update times for fully-dynamic all-pairs shortest paths | 2011-10-27 | Paper |
| Fast Simulation of Large-Scale Growth Models | 2011-08-17 | Paper |
| Smoothed analysis of balancing networks | 2011-08-09 | Paper |
| Illustration of fairness in evolutionary multi-objective optimization | 2011-03-29 | Paper |
| The cover time of deterministic random walks | 2010-12-16 | Paper |
| Deterministic random walks on regular trees | 2010-11-10 | Paper |
| Tight Bounds for the Approximation Ratio of the Hypervolume Indicator | 2010-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579453 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579495 | 2010-08-06 | Paper |
| Approximating the volume of unions and intersections of high-dimensional geometric objects | 2010-07-28 | Paper |
| The cover time of deterministic random walks | 2010-07-20 | Paper |
| Average-case analysis of incremental topological ordering | 2010-05-05 | Paper |
| When to use bit-wise neutrality | 2010-05-05 | Paper |
| Deterministic Random Walks on the Two-Dimensional Grid | 2010-04-23 | Paper |
| Plateaus can be harder in multi-objective optimization | 2010-02-19 | Paper |
| Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness | 2009-07-14 | Paper |
| Smoothed analysis of balancing networks | 2009-07-14 | Paper |
| Comparison of simple diversity mechanisms on plateau functions | 2009-07-10 | Paper |
| Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects | 2009-01-29 | Paper |
| Average Update Times for Fully-Dynamic All-Pairs Shortest Paths | 2009-01-29 | Paper |
| Deterministic Random Walks on Regular Trees | 2008-06-05 | Paper |
| Average-Case Analysis of Online Topological Ordering | 2008-05-27 | Paper |
| Deterministic Random Walks on the Two-Dimensional Grid | 2008-04-24 | Paper |
| Unbiased Matrix Rounding | 2007-09-07 | Paper |
| An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering | 2007-09-07 | Paper |
| An algorithm for online topological ordering | 2007-05-29 | Paper |
| Quasirandomness in Graphs | 2007-05-29 | Paper |
| Unbiased Matrix Rounding | 2007-05-29 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
