Pages that link to "Item:Q2765954"

The following pages link to Approximation algorithms for independent sets in map graphs (Q2765954):

Displaying 28 items.

• Proper 1-immersions of graphs triangulating the plane (Q394202) (← links)
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
• Large independent sets in random regular graphs (Q1034530) (← links)
• Graph separators: A parameterized view (Q1877710) (← links)
• Planar graphs having no proper 2-immersions in the plane. I (Q2037555) (← links)
• Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
• Characterizing 5-map graphs by 2-fan-crossing graphs (Q2274073) (← links)
• \(K_7\)-minors in optimal 1-planar graphs (Q2400554) (← links)
• Minimal non-1-planar graphs (Q2470008) (← links)
• Map graphs having witnesses of large girth (Q2632022) (← links)
• An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity (Q2880919) (← links)
• Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
• Stack and Queue Layouts via Layered Separators (Q2961542) (← links)
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing (Q3611864) (← links)
• Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
• Tree densities in sparse graph classes (Q5046563) (← links)
• (Q5090476) (← links)
• Decomposition of Map Graphs with Applications. (Q5091217) (← links)
• (Q5092371) (← links)
• Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
• (Q5743499) (← links)
• (Q5874486) (← links)
• Covering and packing of rectilinear subdivision (Q5918965) (← links)
• Hardness and structural results for half-squares of restricted tree convex bipartite graphs (Q5919674) (← links)
• All 2-planar graphs having the same spanning subgraph (Q6087085) (← links)
• Clique-based separators for geometric intersection graphs (Q6103521) (← links)
• Recognizing map graphs of bounded treewidth (Q6182682) (← links)
• Clustered coloring of graphs with bounded layered treewidth and bounded degree (Q6612290) (← links)