Home › Entities › academia › Subexponential Time Algorithms for Embedding H-Minor Free Graphs

Subexponential Time Algorithms for Embedding H-Minor Free Graphs

Research article (DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), 2016) · cited 13× · AI/ML
academia openalex:W2551041103
Press Enter · cited answer in seconds

Subexponential Time Algorithms for Embedding H-Minor Free Graphs

Summary

Subexponential Time Algorithms for Embedding H-Minor Free Graphs is a scholarly article[1].

Key Facts

  • Subexponential Time Algorithms for Embedding H-Minor Free Graphs's instance of is recorded as scholarly article[2].

Related Entities

Hans L. Bodlaender

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Subexponential Time Algorithms for Embedding H-Minor Free Graphs. Retrieved May 24, 2026, from https://4ort.xyz/entity/subexponential-time-algorithms-for-embedding-h-minor-free-graphs
MLA “Subexponential Time Algorithms for Embedding H-Minor Free Graphs.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/subexponential-time-algorithms-for-embedding-h-minor-free-graphs.
BibTeX @misc{4ortxyz_subexponential-time-algorithms-for-embedding-h-minor-free-graphs_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Subexponential Time Algorithms for Embedding H-Minor Free Graphs}}, year = {2026}, url = {https://4ort.xyz/entity/subexponential-time-algorithms-for-embedding-h-minor-free-graphs}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Subexponential Time Algorithms for Embedding H-Minor Free Graphs — https://4ort.xyz/entity/subexponential-time-algorithms-for-embedding-h-minor-free-graphs (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/subexponential-time-algorithms-for-embedding-h-minor-free-graphs · Last refreshed: