Saved in:
| Main Authors: | Garcia, Idoia Cortes, Förster, Peter F., Jansen, Lennart, Schilders, Wil, Schöps, Sebastian |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.20475 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Index-aware learning of circuits
by: Garcia, Idoia Cortes, et al.
Published: (2023)
by: Garcia, Idoia Cortes, et al.
Published: (2023)
A new density limit for unanimity in majority dynamics on random graphs
by: Kim, Jeong Han, et al.
Published: (2025)
by: Kim, Jeong Han, et al.
Published: (2025)
New results on graph matching from degree preserving growth
by: Erdős, Péter L., et al.
Published: (2022)
by: Erdős, Péter L., et al.
Published: (2022)
Learning growth mechanisms of tail realistic preferential attachment models from network degree distributions
by: Boughen, Thomas, et al.
Published: (2025)
by: Boughen, Thomas, et al.
Published: (2025)
Computing the forcing spectrum of outerplanar graphs in polynomial time
by: Gorsky, Maximilian, et al.
Published: (2024)
by: Gorsky, Maximilian, et al.
Published: (2024)
Simultaneous recovery of a sparse topology and the admittance of an electrical network
by: Samperio, Álvaro
Published: (2023)
by: Samperio, Álvaro
Published: (2023)
Games on deBruijn Graphs and Cycle Means
by: Drenska, Nadejda
Published: (2026)
by: Drenska, Nadejda
Published: (2026)
A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence
by: Robson, Eliot W., et al.
Published: (2025)
by: Robson, Eliot W., et al.
Published: (2025)
Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes
by: Cunha, Luís Felipe I., et al.
Published: (2025)
by: Cunha, Luís Felipe I., et al.
Published: (2025)
Fractional Budget Allocation for Influence Maximization under General Marketing Strategies
by: Bhimaraju, Akhil, et al.
Published: (2024)
by: Bhimaraju, Akhil, et al.
Published: (2024)
Opinion dynamics on directed complex networks
by: Fraiman, Nicolas, et al.
Published: (2022)
by: Fraiman, Nicolas, et al.
Published: (2022)
A Pressure-Based Diffusion Model for Influence Maximization on Social Networks
by: Stutsman, Curt, et al.
Published: (2025)
by: Stutsman, Curt, et al.
Published: (2025)
The largest subcritical component in inhomogeneous random graphs of preferential attachment type
by: Mörters, Peter, et al.
Published: (2025)
by: Mörters, Peter, et al.
Published: (2025)
Optimizing Donor Outreach for Blood Collection Sessions: A Scalable Decision Support Framework
by: Carneiro, André, et al.
Published: (2026)
by: Carneiro, André, et al.
Published: (2026)
A political radicalization framework based on Moral Foundations Theory
by: Interian, Ruben
Published: (2024)
by: Interian, Ruben
Published: (2024)
Census Dual Graphs: Properties and Random Graph Models
by: Anderson, Sara, et al.
Published: (2026)
by: Anderson, Sara, et al.
Published: (2026)
How Local Separators Shape Community Structure in Large Networks
by: Frenkel, Sarah, et al.
Published: (2025)
by: Frenkel, Sarah, et al.
Published: (2025)
LOFA: Online Influence Maximization under Full-Bandit Feedback using Lazy Forward Selection
by: Xu, Jinyu, et al.
Published: (2026)
by: Xu, Jinyu, et al.
Published: (2026)
Community Detection using Fortunato's Performance Measure
by: Thakar, Srushti, et al.
Published: (2025)
by: Thakar, Srushti, et al.
Published: (2025)
TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
by: Dau, Son Hoang, et al.
Published: (2022)
by: Dau, Son Hoang, et al.
Published: (2022)
Independent Locating-Dominating Sets in Pseudotrees
by: Cáceres, José, et al.
Published: (2026)
by: Cáceres, José, et al.
Published: (2026)
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)
by: Choi, Mujin, et al.
Published: (2025)
Cluster deletion and clique partitioning in graphs with bounded clique number
by: Galesi, Nicola, et al.
Published: (2025)
by: Galesi, Nicola, et al.
Published: (2025)
On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)
by: Koutsoutis, Alex, et al.
Published: (2025)
On treewidth and maximum cliques
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
Greedy and randomized heuristics for optimization of k-domination models in digraphs and road networks
by: Dijkstra, Lukas, et al.
Published: (2024)
by: Dijkstra, Lukas, et al.
Published: (2024)
On the effect of the average clustering coefficient on topology-based link prediction in featureless graphs
by: Rafiepour, Mehrdad, et al.
Published: (2025)
by: Rafiepour, Mehrdad, et al.
Published: (2025)
Colour ratio in Prim's ranking of bipartite graphs
by: Kahane, Félix, et al.
Published: (2026)
by: Kahane, Félix, et al.
Published: (2026)
Degree corrected stochastic block model: excursion representation
by: Clancy Jr, David, et al.
Published: (2024)
by: Clancy Jr, David, et al.
Published: (2024)
Bipartite Turán problem on cographs
by: Zimmermann, Jakob Paul
Published: (2026)
by: Zimmermann, Jakob Paul
Published: (2026)
Polynomial Bounds for the Graph Minor Structure Theorem
by: Gorsky, Maximilian, et al.
Published: (2025)
by: Gorsky, Maximilian, et al.
Published: (2025)
CyNetDiff -- A Python Library for Accelerated Implementation of Network Diffusion Models
by: Robson, Eliot W., et al.
Published: (2024)
by: Robson, Eliot W., et al.
Published: (2024)
Genealogies of records of stochastic processes with stationary increments as unimodular trees
by: Baccelli, François, et al.
Published: (2024)
by: Baccelli, François, et al.
Published: (2024)
Excluding Pinched Spheres
by: Morelle, Laure, et al.
Published: (2025)
by: Morelle, Laure, et al.
Published: (2025)
(Even hole, triangle)-free graphs revisited
by: Martins, Beatriz, et al.
Published: (2026)
by: Martins, Beatriz, et al.
Published: (2026)
Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)
by: Gorsky, Maximilian, et al.
Published: (2026)
The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)
by: Gorsky, Maximilian, et al.
Published: (2026)
On the characterization of graphs with tree 3-spanners
by: Lin, Lan, et al.
Published: (2025)
by: Lin, Lan, et al.
Published: (2025)
On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
by: Ameli, Afrouz Jabal, et al.
Published: (2024)
by: Ameli, Afrouz Jabal, et al.
Published: (2024)
Similar Items
-
Index-aware learning of circuits
by: Garcia, Idoia Cortes, et al.
Published: (2023) -
A new density limit for unanimity in majority dynamics on random graphs
by: Kim, Jeong Han, et al.
Published: (2025) -
New results on graph matching from degree preserving growth
by: Erdős, Péter L., et al.
Published: (2022) -
Learning growth mechanisms of tail realistic preferential attachment models from network degree distributions
by: Boughen, Thomas, et al.
Published: (2025) -
Computing the forcing spectrum of outerplanar graphs in polynomial time
by: Gorsky, Maximilian, et al.
Published: (2024)