| Publication | Date of Publication | Type |
|---|
On the giant component of geometric inhomogeneous random graphs
| 2025-01-06 | Paper |
Understanding the impact of non-linearity in the SIS model
Physica A | 2024-12-16 | Paper |
Fault-tolerant \(ST\)-diameter oracles
| 2024-11-14 | Paper |
Cliques in high-dimensional geometric inhomogeneous random graphs
| 2024-11-14 | Paper |
Strongly hyperbolic unit disk graphs
| 2024-10-08 | Paper |
Analysis of the survival time of the SIRS process via expansion
Electronic Journal of Probability | 2024-08-30 | Paper |
A primal-dual Algorithm for multicommodity flows and multicuts in treewidth-2 graphs
| 2024-08-22 | Paper |
A strategic routing framework and algorithms for computing alternative paths
| 2024-08-13 | Paper |
Cliques in high-dimensional geometric inhomogeneous random graphs
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
Approximate distance sensitivity oracles in subquadratic space
TheoretiCS | 2024-07-03 | Paper |
Deterministic sensitivity oracles for diameter, eccentricities and all pairs distances
| 2024-06-24 | Paper |
Social distancing network creation
| 2024-06-24 | Paper |
An efficient branch-and-bound solver for hitting set
| 2024-05-24 | Paper |
Applying skeletons to speed up the Arc-Flags routing algorithm
| 2024-05-24 | Paper |
Approximate max-flow min-multicut theorem for graphs of bounded treewidth
| 2024-05-08 | Paper |
Approximate distance sensitivity oracles in subquadratic space
| 2024-05-08 | Paper |
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
| 2024-05-03 | Paper |
scientific article; zbMATH DE number 7829255 (Why is no real title available?)
| 2024-04-09 | Paper |
The Impact of Cooperation in Bilateral Network Creation
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Understanding the effectiveness of data reduction in public transportation networks
Lecture Notes in Computer Science | 2024-02-16 | Paper |
Shortest distances as enumeration problem
Discrete Applied Mathematics | 2024-01-24 | Paper |
Geometric Network Creation Games
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
Compact distance oracles with large sensitivity and low stretch
Lecture Notes in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788342 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788602 (Why is no real title available?)
| 2024-01-15 | Paper |
Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry
Algorithmica | 2023-12-13 | Paper |
The impact of heterogeneity and geometry on the proof complexity of random satisfiability
Random Structures \& Algorithms | 2023-11-07 | Paper |
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Efficiently Computing Maximum Flows in Scale-Free Networks.
| 2023-09-20 | Paper |
scientific article; zbMATH DE number 7740873 (Why is no real title available?)
| 2023-09-20 | Paper |
Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry
| 2023-09-20 | Paper |
scientific article; zbMATH DE number 7740881 (Why is no real title available?)
| 2023-09-20 | Paper |
Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
Natural Computing | 2023-09-08 | Paper |
Algorithms for hard-constraint point processes via discretization
Lecture Notes in Computer Science | 2023-08-10 | Paper |
scientific article; zbMATH DE number 7724191 (Why is no real title available?)
| 2023-08-08 | Paper |
Social distancing network creation
Algorithmica | 2023-06-28 | Paper |
Force-Directed Embedding of Scale-Free Networks in the Hyperbolic Plane
| 2023-06-23 | Paper |
From symmetry to asymmetry: generalizing TSP approximations by parametrization
Journal of Computer and System Sciences | 2023-06-12 | Paper |
Hyperbolic Embeddings for Near-Optimal Greedy Routing
ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
Solving vertex cover in polynomial time on hyperbolic random graphs
Theory of Computing Systems | 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
Lecture Notes in Computer Science | 2023-03-09 | Paper |
Single-Peaked Jump Schelling Games
| 2023-02-23 | Paper |
scientific article; zbMATH DE number 7651160 (Why is no real title available?)
| 2023-02-07 | Paper |
Solving vertex cover in polynomial time on hyperbolic random graphs
| 2023-02-07 | Paper |
Polymer dynamics via cliques: new conditions for approximations
Theoretical Computer Science | 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
Computational Geometry | 2022-10-06 | Paper |
A spectral independence view on hard spheres via block dynamics
SIAM Journal on Discrete Mathematics | 2022-10-06 | Paper |
Zeros and approximations of holant polynomials on the complex plane
Computational Complexity | 2022-09-02 | Paper |
scientific article; zbMATH DE number 7561554 (Why is no real title available?)
| 2022-07-21 | Paper |
From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
| 2022-07-18 | Paper |
From symmetry to asymmetry: generalizing TSP approximations by parametrization
| 2022-05-20 | Paper |
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
| 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
Theoretical Computer Science | 2021-12-22 | Paper |
Pareto optimization for subset selection with dynamic cost constraints
Artificial Intelligence | 2021-12-13 | Paper |
Efficiently enumerating hitting sets of hypergraphs arising in data profiling
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Efficient shortest paths in scale-free networks with underlying hyperbolic geometry
| 2021-07-28 | Paper |
Non-monotone submodular maximization with multiple knapsacks in static and dynamic settings
| 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
Algorithmica | 2020-10-21 | Paper |
Correction to: ``Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
Algorithmica | 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 |
Bounds on the satisfiability threshold for power law distributed random SAT
| 2020-05-27 | Paper |
Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints
Theoretical Computer Science | 2020-05-26 | Paper |
The Minimization of Random Hypergraphs
| 2019-10-01 | Paper |
Efficiently enumerating hitting sets of hypergraphs arising in data profiling
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Hyperbolic Embeddings for Near-Optimal Greedy Routing
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Quasirandom Rumor Spreading: An Experimental Analysis
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Unbiasedness of estimation-of-distribution algorithms
Theoretical Computer Science | 2019-07-31 | Paper |
Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
Algorithmica | 2019-02-14 | Paper |
Island models meet rumor spreading
Algorithmica | 2019-02-14 | Paper |
De-anonymization of heterogeneous random graphs in quasilinear time
Algorithmica | 2019-01-11 | Paper |
An O ( n 2.75 ) algorithm for incremental topological ordering
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Quasirandom rumor spreading
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Unbounded discrepancy of deterministic random walks on grids
SIAM Journal on Discrete Mathematics | 2018-10-19 | Paper |
Sharpness of the satisfiability threshold for non-uniform random \(k\)-SAT
| 2018-08-10 | Paper |
Cliques in hyperbolic random graphs
Algorithmica | 2018-07-25 | Paper |
On the diameter of hyperbolic random graphs
SIAM Journal on Discrete Mathematics | 2018-06-15 | Paper |
Greed is good for deterministic scale-free networks
| 2018-04-19 | Paper |
The parameterized complexity of dependency detection in relational databases
| 2018-04-10 | Paper |
Probabilistic routing for on-street parking search
| 2018-03-02 | Paper |
Hyperbolic random graphs: separators and treewidth
| 2018-03-02 | Paper |
Efficient embedding of scale-free graphs in the hyperbolic plane
| 2018-03-02 | Paper |
Efficient best response computation for strategic network formation under attack
| 2018-02-13 | Paper |
scientific article; zbMATH DE number 6783405 (Why is no real title available?)
| 2017-09-29 | Paper |
Don't be greedy when calculating hypervolume contributions
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms | 2017-07-14 | Paper |
Computing single source shortest paths using single-objective fitness
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms | 2017-07-14 | Paper |
The logarithmic hypervolume indicator
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms | 2017-07-14 | Paper |
Resampling vs recombination: a statistical run time estimation
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2017-06-13 | Paper |
Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2017-06-13 | Paper |
On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2017-06-13 | Paper |
Efficient optimization of many objectives by approximation-guided evolution
European Journal of Operational Research | 2016-10-06 | Paper |
Toward a unifying framework for evolutionary processes
Journal of Theoretical Biology | 2016-08-18 | Paper |
Unbounded discrepancy of deterministic random walks on grids
Algorithms and Computation | 2016-01-11 | Paper |
The Benefit of Recombination in Noisy Evolutionary Search
Algorithms and Computation | 2016-01-11 | Paper |
On the diameter of hyperbolic random graphs
Automata, Languages, and Programming | 2015-11-04 | Paper |
Ultra-fast load balancing on scale-free networks
Automata, Languages, and Programming | 2015-11-04 | Paper |
Speeding up many-objective optimization by Monte Carlo approximations
Artificial Intelligence | 2015-08-27 | Paper |
On the kernel size of clique cover reductions for random intersection graphs
Journal of Discrete Algorithms | 2015-08-24 | Paper |
On the average-case complexity of parameterized clique
Theoretical Computer Science | 2015-05-18 | Paper |
Parameterized clique on inhomogeneous random graphs
Discrete Applied Mathematics | 2015-04-28 | Paper |
Near-perfect load balancing by randomized rounding
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
De-anonymization of heterogeneous random graphs in quasilinear time
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Randomized diffusion for indivisible loads
Journal of Computer and System Sciences | 2014-09-22 | Paper |
Social networks spread rumors in sublogarithmic time
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
scientific article; zbMATH DE number 6297797 (Why is no real title available?)
| 2014-05-22 | Paper |
Quasirandom load balancing
| 2014-05-22 | Paper |
Quasirandom rumor spreading, an experimental analysis
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Diameter and broadcast time of random geometric graphs in arbitrary dimensions
Algorithmica | 2013-11-11 | Paper |
Social networks spread rumors in sublogarithmic time
| 2013-11-01 | Paper |
Quasirandom rumor spreading on expanders
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Approximation quality of the hypervolume indicator
Artificial Intelligence | 2013-08-26 | Paper |
Exact and efficient generation of geometric random variates and random graphs
Automata, Languages, and Programming | 2013-08-06 | Paper |
Parameterized Clique on Scale-Free Networks
Algorithms and Computation | 2013-03-21 | Paper |
Fast simulation of large-scale growth models
Random Structures \& Algorithms | 2013-03-12 | Paper |
Constraint satisfaction problems: convexity makes AllDifferent constraints tractable
Theoretical Computer Science | 2013-03-04 | Paper |
Quasirandom load balancing
SIAM Journal on Computing | 2012-11-29 | Paper |
Convergence of set-based multi-objective optimization, indicators and deteriorative cycles
Theoretical Computer Science | 2012-10-11 | Paper |
Asynchronous Rumor Spreading in Preferential Attachment Graphs
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
Theoretical Computer Science | 2012-05-14 | Paper |
Diameter and broadcast time of random geometric graphs in arbitrary dimensions
Algorithms and Computation | 2011-12-16 | Paper |
Average update times for fully-dynamic all-pairs shortest paths
Discrete Applied Mathematics | 2011-10-27 | Paper |
Fast simulation of large-scale growth models
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Smoothed analysis of balancing networks
Random Structures \& Algorithms | 2011-08-09 | Paper |
Illustration of fairness in evolutionary multi-objective optimization
Theoretical Computer Science | 2011-03-29 | Paper |
The cover time of deterministic random walks
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
Deterministic random walks on regular trees
Random Structures \& Algorithms | 2010-11-10 | Paper |
Tight bounds for the approximation ratio of the hypervolume indicator
Parallel Problem Solving from Nature, PPSN XI | 2010-10-26 | Paper |
scientific article; zbMATH DE number 5764860 (Why is no real title available?)
| 2010-08-06 | Paper |
scientific article; zbMATH DE number 5764901 (Why is no real title available?)
| 2010-08-06 | Paper |
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry | 2010-07-28 | Paper |
The cover time of deterministic random walks
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Average-case analysis of incremental topological ordering
Discrete Applied Mathematics | 2010-05-05 | Paper |
When to use bit-wise neutrality
Natural Computing | 2010-05-05 | Paper |
Deterministic random walks on the two-dimensional grid
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Plateaus can be harder in multi-objective optimization
Theoretical Computer Science | 2010-02-19 | Paper |
Smoothed analysis of balancing networks
Lecture Notes in Computer Science | 2009-07-14 | Paper |
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Automata, Languages and Programming | 2009-07-14 | Paper |
Comparison of simple diversity mechanisms on plateau functions
Theoretical Computer Science | 2009-07-10 | Paper |
Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects
Algorithms and Computation | 2009-01-29 | Paper |
Average Update Times for Fully-Dynamic All-Pairs Shortest Paths
Algorithms and Computation | 2009-01-29 | Paper |
Deterministic Random Walks on Regular Trees
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Average-Case Analysis of Online Topological Ordering
Algorithms and Computation | 2008-05-27 | Paper |
Deterministic Random Walks on the Two-Dimensional Grid
Algorithms and Computation | 2008-04-24 | Paper |
Unbiased Matrix Rounding
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Quasirandomness in Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
An algorithm for online topological ordering
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Unbiased Matrix Rounding
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Nonperiodic echoes from mushroom billiard hats
| N/A | Paper |
From Market Saturation to Social Reinforcement: Understanding the Impact of Non-Linearity in Information Diffusion Models
| N/A | Paper |
