Image de couverture de livre

Forbidden Subgraph Problems with Predictions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Böckenhauer, Hans-Joachim, Jahn, Melvin, Komm, Dennis, Stocker, Moritz
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Unbounded Knapsack
par: Böckenhauer, Hans-Joachim, et autres
Publié: (2024)

Time-Optimal $k$-Server
par: Frei, Fabian, et autres
Publié: (2025)

Tree Coloring: Random Order and Predictions
par: Frei, Fabian, et autres
Publié: (2024)

Removable Online Knapsack and Advice
par: Böckenhauer, Hans-Joachim, et autres
Publié: (2020)

Online Knapsack Problems with Estimates
par: Balabán, Jakub, et autres
Publié: (2025)

Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal
par: Gehnen, Matthias, et autres
Publié: (2025)

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
par: Zhou, Yi, et autres
Publié: (2025)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
par: Hochbaum, Dorit S., et autres
Publié: (2025)

Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
par: Nguyen, Ta Duy, et autres
Publié: (2024)

Tokenisation over Bounded Alphabets is Hard
par: Kastreva, Violeta, et autres
Publié: (2025)

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor
par: Csikós, Mónika, et autres
Publié: (2023)

Finding Order-Preserving Subgraphs
par: Imamura, Haruya, et autres
Publié: (2025)

Destroying Densest Subgraphs is Hard
par: Bazgan, Cristina, et autres
Publié: (2024)

Fast and Simple Densest Subgraph with Predictions
par: Bui, Thai, et autres
Publié: (2025)

Coloring Graphs With Forbidden Almost Bipartite Subgraphs
par: James Anderson, et autres
Publié: (2025)

Counting Cohesive Subgraphs with Hereditary Properties
par: Li, Rong-Hua, et autres
Publié: (2024)

Finding Small Complete Subgraphs Efficiently
par: Chen, Ke, et autres
Publié: (2023)

Subexponential Parameterized Algorithms for Hitting Subgraphs
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Packing Compact Subgraphs with Applications to Districting
par: Chen, Ho-Lin, et autres
Publié: (2026)

A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
par: Çivril, Ali
Publié: (2023)

A Survey on the Densest Subgraph Problem and Its Variants
par: Lanciano, Tommaso, et autres
Publié: (2023)

The Complexity Landscape of Dynamic Distributed Subgraph Finding
par: Chang, Yi-Jun, et autres
Publié: (2024)

Scalable $k$-clique Densest Subgraph Search
par: Ye, Xiaowei, et autres
Publié: (2024)

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
par: Shih, Yu-Sheng, et autres
Publié: (2026)

Learning-Augmented Online Covering Problems
par: Ameli, Afrouz Jabal, et autres
Publié: (2025)

New Parallel and Streaming Algorithms for Directed Densest Subgraph
par: Mitrović, Slobodan, et autres
Publié: (2025)

Dense Subgraph Discovery Meets Strong Triadic Closure
par: Arachchi, Chamalee Wickrama, et autres
Publié: (2025)

Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries
par: Kothalawala, Buddhi, et autres
Publié: (2026)

Almost Tight Bounds for Differentially Private Densest Subgraph
par: Dinitz, Michael, et autres
Publié: (2023)

Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
par: Buchem, Moritz, et autres
Publié: (2024)

$Δ$-Motif: Parallel Subgraph Isomorphism via Tabular Operations
par: Wang, Yulun, et autres
Publié: (2025)

Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules
par: Suga, Tatsuhiro, et autres
Publié: (2025)

Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity
par: Long, Yaowei, et autres
Publié: (2024)

Finding Induced Subgraphs from Graphs with Small Mim-Width
par: Otachi, Yota, et autres
Publié: (2024)

A Simple Algorithm for Trimmed Multipoint Evaluation
par: Fischer, Nick, et autres
Publié: (2025)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
par: Lu, Qiheng, et autres
Publié: (2025)

Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
par: Hanaka, Tesshu, et autres
Publié: (2025)

An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
par: Xu, Xiaojia, et autres
Publié: (2024)

A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
par: Bringmann, Karl, et autres
Publié: (2024)

Approximating Traveling Salesman Problems Using a Bridge Lemma
par: Böhm, Martin, et autres
Publié: (2024)