:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Ternes, Jakob
Format:	Recurso digital
Language:
Published:	Zenodo 2025
Subjects:	Algorithms Network Science
Online Access:	https://doi.org/10.5281/zenodo.18293375
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Advances in Exact and Approximate Group Closeness Centrality Maximization
by: Schulz, Christian, et al.
Published: (2026)

Profit Maximization in Closed Social Networks
by: Sharma, Poonam, et al.
Published: (2026)

Equalizing Closeness Centralities via Edge Additions
by: Crane, Alex, et al.
Published: (2025)

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
by: Spaeh, Fabian, et al.
Published: (2025)

Algorithmically Fair Maximization of Multiple Submodular Objective Functions
by: Amanatidis, Georgios, et al.
Published: (2024)

Fast Maximization of Current Flow Group Closeness Centrality
by: Xia, Haisong, et al.
Published: (2025)

Influence Maximization in Ising Models
by: Chen, Zongchen, et al.
Published: (2023)

Opinion Maximization in Social Networks by Modifying Internal Opinions
by: Wang, Gengyu, et al.
Published: (2025)

Maximal Closed Substrings
by: Badkobeh, Golnaz, et al.
Published: (2022)

Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets
by: Zhang, Lingling, et al.
Published: (2024)

Fast Estimation of Percolation Centrality
by: Cruciani, Antonio
Published: (2024)

Local Centrality Minimization with Quality Guarantees
by: Miyauchi, Atsushi, et al.
Published: (2024)

Fast Percolation Centrality Approximation with Importance Sampling
by: Cruciani, Antonio, et al.
Published: (2025)

Temporal Betweenness Centrality on Shortest Walks Variants
by: Naima, Mehdi
Published: (2023)

Online Nash Welfare Maximization Without Predictions
by: Huang, Zhiyi, et al.
Published: (2022)

MANTRA: Temporal Betweenness Centrality Approximation through Sampling
by: Cruciani, Antonio
Published: (2023)

On the Learning Curves of Revenue Maximization
by: Hanneke, Steve, et al.
Published: (2026)

An Improved Modular Addition Checksum Algorithm
by: Koopman, Philip
Published: (2023)

Robust Value Maximization in Challenge the Champ Tournaments with Probabilistic Outcomes
by: Bhaskar, Umang, et al.
Published: (2026)

Improved Algorithms for Fair Matroid Submodular Maximization
by: Mahabadi, Sepideh, et al.
Published: (2026)

Maximizing Value in Challenge the Champ Tournaments
by: Bhaskar, Umang, et al.
Published: (2025)

The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
by: Komoto, Kenta, et al.
Published: (2026)

The Long Arm of Nashian Allocation in Online $p$-Mean Welfare Maximization
by: Huang, Zhiyi, et al.
Published: (2025)

On the External Validity of Average-Case Analyses of Graph Algorithms
by: Bläsius, Thomas, et al.
Published: (2022)

An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
by: Han, Seongjune, et al.
Published: (2026)

Triangle Centrality
by: Burkhardt, Paul
Published: (2021)

Controlling the Spread of Epidemics on Networks with Differential Privacy
by: Nguyen, Dung, et al.
Published: (2025)

ReeSPOT: Reeb Graph Models Semantic Patterns of Normalcy in Human Trajectories
by: Zhang, Bowen, et al.
Published: (2024)

Calibrated Recommendations for Users with Decaying Attention
by: Kleinberg, Jon, et al.
Published: (2023)

Revenue Maximization in Choice-Based Matching Markets
by: Nissim, Dan, et al.
Published: (2024)

A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
by: You, Fangchen
Published: (2025)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
by: Chen, Jingbang, et al.
Published: (2024)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
by: Armbruster, Alexander, et al.
Published: (2026)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
by: Zhu, Yanhui, et al.
Published: (2024)

A Competitive Algorithm for Throughput Maximization on Identical Machines
by: Moseley, Benjamin, et al.
Published: (2021)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
by: Wan, Zongqi, et al.
Published: (2024)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
by: Cervenjak, Philip, et al.
Published: (2023)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
by: Chen, Wenjing, et al.
Published: (2023)

Maximizing social welfare among EF1 allocations at the presence of two types of agents
by: Ma, Jiaxuan, et al.
Published: (2025)

An Efficient Streaming Algorithm for Approximating Graphlet Distributions
by: Bressan, Marco, et al.
Published: (2026)