default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Algorithms and Applications, Volume 30
Volume 30, Number 1, 2026
- Ernestine Großmann
, Felix Joos, Henrik Reinstädtler, Christian Schulz:
Engineering Hypergraph $b$-Matching Algorithms. 1-24 - Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Relaxed Agreement Forests of Phylogenetic Trees. 25-46 - Dieter Rautenbach, Florian Werner:
Largest Common Subgraph of Two Forests. 47-63 - Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Degree Realization by Bipartite Cactus Graphs. 65-87 - Andrés López Martínez, Mark de Berg, Frits C. R. Spieksma:
Stable and Dynamic Minimum Cuts. 89-107 - Massimo A. Achterberg, Robert E. Kooij:
On the Non-Submodularity of the Problem of Adding Links to Minimize the Effective Graph Resistance. 109-132
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-17 00:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
