Pages that link to "Item:Q4458875"
From MaRDI portal
The following pages link to Robust algorithms for restricted domains (Q4458875):
Displaying 19 items.
- Location-oblivious distributed unit disk graph coloring (Q534767) (← links)
- On the chromatic number of random geometric graphs (Q663092) (← links)
- Mind the independence gap (Q776261) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- The number of disk graphs (Q2509768) (← links)
- Approximating 2-cliques in unit disk graphs (Q2636809) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Improper coloring of unit disk graphs (Q3057115) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- (Q5115779) (← links)
- (Q5743499) (← links)
- (Q6089666) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
