Pages that link to "Item:Q5390615"
From MaRDI portal
The following pages link to Tightening Nonsimple Paths and Cycles on Surfaces (Q5390615):
Displaying 16 items.
- Shortest path embeddings of graphs on surfaces (Q1688859) (← links)
- An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- Discrete systolic inequalities and decompositions of triangulated surfaces (Q2349858) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- Testing graph isotopy on surfaces (Q2441582) (← links)
- Computing the Fréchet Distance Between Polygons with Holes (Q3448855) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- (Q5088964) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)
- (Q5743478) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants (Q6159726) (← links)
- On quasi-polynomials counting planar tight maps (Q6615501) (← links)
- Short topological decompositions of non-orientable surfaces (Q6624179) (← links)
