The following pages link to (Q4004078):
Displaying 50 items.
- Chromatic kernel and its applications (Q266072) (← links)
- An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231) (← links)
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Coloring random graphs (Q293318) (← links)
- Projections of the natural measure for percolation fractals (Q312289) (← links)
- On the random greedy \(F\)-free hypergraph process (Q322193) (← links)
- Streaming algorithms for independent sets in sparse hypergraphs (Q329293) (← links)
- The number of Seymour vertices in random tournaments and digraphs (Q343729) (← links)
- A simple population protocol for fast robust approximate majority (Q352239) (← links)
- Sperner type theorems with excluded subposets (Q385154) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- A note on eigenvalue bounds for independence numbers of non-regular graphs (Q400541) (← links)
- Domination in transitive colorings of tournaments (Q403357) (← links)
- Two results on the digraph chromatic number (Q418896) (← links)
- Fighting constrained fires in graphs (Q428868) (← links)
- Convergence and approximation in potential games (Q441854) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- Solution of the minimum modulus problem for covering systems (Q482915) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Lower bounds for independence numbers of some locally sparse graphs (Q489716) (← links)
- Information lower bounds via self-reducibility (Q504999) (← links)
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees (Q511918) (← links)
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- Tight bounds for FEC-based reliable multicast (Q598189) (← links)
- Testing juntas (Q598252) (← links)
- Pricing commodities (Q627117) (← links)
- Scaling limits for internal aggregation models with multiple sources (Q628351) (← links)
- Domination number of graphs without small cycles (Q659744) (← links)
- Matching nuts and bolts faster (Q671403) (← links)
- A phase transition for the minimum free energy of secondary structures of a random RNA (Q675899) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- A Kolmogorov complexity proof of the Lovász local lemma for satisfiability (Q690463) (← links)
- The complexity of explicit constructions (Q693069) (← links)
- The `Butterfly effect' in Cayley graphs with applications to genomics. (Q694707) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Coloring face hypergraphs on surfaces (Q703607) (← links)
- A construction for Ramsey numbers for \(K_{m,n}\) (Q709236) (← links)
- The power and limitations of static binary search trees with lazy finger (Q727988) (← links)
- Ramsey numbers involving graphs with large degrees (Q735124) (← links)
- A generalization of an independent set with application to \((K_q; k)\)-stable graphs (Q741777) (← links)
- Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly (Q742585) (← links)
- Estimating satisfiability (Q765341) (← links)
- Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
- Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs (Q845699) (← links)
- Coloring and the Lovász local lemma (Q847296) (← links)
- Sets of permutations that generate the symmetric group pairwise. (Q855853) (← links)
- Generic erasure correcting sets: bounds and constructions (Q855874) (← links)
