Computing paths of large rank in planar frameworks deterministically
From MaRDI portal
Publication:6668350
DOI10.1137/24m1632759MaRDI QIDQ6668350
Giannos Stamoulis, Tuukka Korhonen, Petr A. Golovach, Fedor V. Fomin
Publication date: 22 January 2025
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum labeled path problem
- A parameterized view on matroid optimization problems
- Matching theory
- Quickly excluding a planar graph
- Treewidth. Computations and approximations
- Graph minors. XIII: The disjoint paths problem
- Narrow sieves for parameterized paths and packings
- Obtaining a planar graph by vertex deletion
- Odd cycle packing
- Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Deterministic Truncation of Linear Matroids
- An Improved Algorithm for Finding Cycles Through Elements
- Faster Algebraic Algorithms for Path and Packing Problems
- An analysis of approximations for maximizing submodular set functions—I
- Color-coding
- Modification to Planarity is Fixed Parameter Tractable
- Hitting topological minors is FPT
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
- Planarity Allowing Few Error Vertices in Linear Time
- Hadwiger's conjecture is decidable
- Graphs and Geometry
- Linkless and flat embeddings in 3-space and the unknot problem
- Determinant Sums for Undirected Hamiltonicity
- Finding topological subgraphs is fixed-parameter tractable
- Parameterized Algorithms
- The Parameterized Complexity of Graph Cyclability
- Tropical paths in vertex-colored graphs
- k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
- Vertex deletion parameterized by elimination distance and even less
- Shortest cycles with monotone submodular costs
- Model-checking for first-order logic with disjoint paths predicates in proper minor-closed graph classes
- Fixed-parameter tractability of maximum colored path and beyond
- Determinantal sieving
This page was built for publication: Computing paths of large rank in planar frameworks deterministically
