Saved in:
| Main Authors: | Achterberg, Massimo A., Kooij, Robert E. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.03363 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
by: Bengali, Vedangi, et al.
Published: (2024)
by: Bengali, Vedangi, et al.
Published: (2024)
Enumerating minimal solution sets for metric graph problems
by: Bergougnoux, Benjamin, et al.
Published: (2023)
by: Bergougnoux, Benjamin, et al.
Published: (2023)
Continuous optimization methods for the graph isomorphism problem
by: Klus, Stefan, et al.
Published: (2023)
by: Klus, Stefan, et al.
Published: (2023)
Enumerating minimal dominating sets and variants in chordal bipartite graphs
by: Castelo, Emanuel, et al.
Published: (2025)
by: Castelo, Emanuel, et al.
Published: (2025)
Generating minimal redundant and maximal irredundant sets in incidence graphs
by: Castelo, Emanuel, et al.
Published: (2026)
by: Castelo, Emanuel, et al.
Published: (2026)
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
by: Bonamy, Marthe, et al.
Published: (2020)
by: Bonamy, Marthe, et al.
Published: (2020)
Minimizing the effective graph resistance by adding links is NP-hard
by: Kooij, Robert E., et al.
Published: (2023)
by: Kooij, Robert E., et al.
Published: (2023)
Approximation algorithms for non-sequential star packing problems
by: Hu, Mengyuan, et al.
Published: (2024)
by: Hu, Mengyuan, et al.
Published: (2024)
Fast approximation algorithms for the 1-median problem on real-world large graphs
by: Ueta, Keisuke, et al.
Published: (2025)
by: Ueta, Keisuke, et al.
Published: (2025)
Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
by: Arkhipov, Pavel, et al.
Published: (2024)
by: Arkhipov, Pavel, et al.
Published: (2024)
On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
by: Ghanbari, Babak, et al.
Published: (2025)
by: Ghanbari, Babak, et al.
Published: (2025)
Circular-arc graphs and the Helly property
by: Derbisz, Jan, et al.
Published: (2024)
by: Derbisz, Jan, et al.
Published: (2024)
The Complexity of Diameter on H-free graphs
by: Oostveen, Jelle J., et al.
Published: (2024)
by: Oostveen, Jelle J., et al.
Published: (2024)
Periodic trajectories in P-time event graphs and the non-positive circuit weight problem
by: Zorzenon, Davide, et al.
Published: (2021)
by: Zorzenon, Davide, et al.
Published: (2021)
Circle graphs can be recognized in linear time
by: Paul, Christophe, et al.
Published: (2025)
by: Paul, Christophe, et al.
Published: (2025)
Packing $K_r$s in bounded degree graphs
by: McKay, Michael, et al.
Published: (2022)
by: McKay, Michael, et al.
Published: (2022)
Generalizing Roberts' characterization of unit interval graphs
by: Martínez, Virginia Ardévol, et al.
Published: (2024)
by: Martínez, Virginia Ardévol, et al.
Published: (2024)
Reconfiguration of labeled matchings in triangular grid graphs
by: Kakimura, Naonori, et al.
Published: (2024)
by: Kakimura, Naonori, et al.
Published: (2024)
Independent set reconfiguration in H-free graphs
by: Bartier, Valentin, et al.
Published: (2024)
by: Bartier, Valentin, et al.
Published: (2024)
Generation of weighted trees, block trees and block graphs
by: Ekim, Tınaz, et al.
Published: (2024)
by: Ekim, Tınaz, et al.
Published: (2024)
Max Weight Independent Set in sparse graphs with no long claws
by: Abrishami, Tara, et al.
Published: (2023)
by: Abrishami, Tara, et al.
Published: (2023)
A polynomial kernel for vertex deletion into bipartite permutation graphs
by: Derbisz, Jan
Published: (2021)
by: Derbisz, Jan
Published: (2021)
Terminal Steiner tree problem : Complexity and Algorithms
by: S, Jyothish, et al.
Published: (2026)
by: S, Jyothish, et al.
Published: (2026)
On the number of $k$-mers admitting a given lexicographical minimizer
by: Ingels, Florian, et al.
Published: (2024)
by: Ingels, Florian, et al.
Published: (2024)
All ascents exponential from valued constraint graphs of pathwidth three
by: Kaznatcheev, Artem, et al.
Published: (2026)
by: Kaznatcheev, Artem, et al.
Published: (2026)
Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
by: Berthe, Gaétan, et al.
Published: (2024)
by: Berthe, Gaétan, et al.
Published: (2024)
Sequential testing problem: A follow-up review
by: Ünlüyurt, Tonguç
Published: (2025)
by: Ünlüyurt, Tonguç
Published: (2025)
Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
by: Bencs, Ferenc, et al.
Published: (2025)
by: Bencs, Ferenc, et al.
Published: (2025)
A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
by: Xiao, Hanyin, et al.
Published: (2025)
by: Xiao, Hanyin, et al.
Published: (2025)
Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
by: Ingels, Florian, et al.
Published: (2026)
by: Ingels, Florian, et al.
Published: (2026)
A column generation algorithm for finding co-3-plexes in chordal graphs
by: Dupont-Bouillard, Alexandre
Published: (2026)
by: Dupont-Bouillard, Alexandre
Published: (2026)
Fast mixing in Ising models with a negative spectral outlier via Gaussian approximation
by: Mikulincer, Dan, et al.
Published: (2025)
by: Mikulincer, Dan, et al.
Published: (2025)
Kawasaki dynamics beyond the uniqueness threshold
by: Bauerschmidt, Roland, et al.
Published: (2023)
by: Bauerschmidt, Roland, et al.
Published: (2023)
Fast relaxation of the random field Ising dynamics
by: Alaoui, Ahmed El, et al.
Published: (2023)
by: Alaoui, Ahmed El, et al.
Published: (2023)
Pirogov--Sinai Theory Beyond Lattices
by: Cannon, Sarah, et al.
Published: (2024)
by: Cannon, Sarah, et al.
Published: (2024)
Perfect Sampling for Hard Spheres from Strong Spatial Mixing
by: Anand, Konrad, et al.
Published: (2023)
by: Anand, Konrad, et al.
Published: (2023)
On boundedness of zeros of the independence polynomial of tori
by: de Boer, David, et al.
Published: (2023)
by: de Boer, David, et al.
Published: (2023)
Trickle-Down in Localization Schemes and Applications
by: Anari, Nima, et al.
Published: (2024)
by: Anari, Nima, et al.
Published: (2024)
On the tractability of sampling from the Potts model at low temperatures via random-cluster dynamics
by: Blanca, Antonio, et al.
Published: (2023)
by: Blanca, Antonio, et al.
Published: (2023)
Cycling in the forest with Wilson's algorithm
by: Fanuel, Michaël, et al.
Published: (2024)
by: Fanuel, Michaël, et al.
Published: (2024)
Similar Items
-
On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
by: Bengali, Vedangi, et al.
Published: (2024) -
Enumerating minimal solution sets for metric graph problems
by: Bergougnoux, Benjamin, et al.
Published: (2023) -
Continuous optimization methods for the graph isomorphism problem
by: Klus, Stefan, et al.
Published: (2023) -
Enumerating minimal dominating sets and variants in chordal bipartite graphs
by: Castelo, Emanuel, et al.
Published: (2025) -
Generating minimal redundant and maximal irredundant sets in incidence graphs
by: Castelo, Emanuel, et al.
Published: (2026)