The following pages link to Gábor Tardos (Q168595):
Displaying 50 items.
- On infinite-finite duality pairs of directed graphs (Q382885) (← links)
- The visible perimeter of an arrangement of disks (Q390363) (← links)
- The range of a random walk on a comb (Q396906) (← links)
- Piercing quasi-rectangles-on a problem of Danzer and Rogers (Q439049) (← links)
- Erdős-Pyber theorem for hypergraphs and secret sharing (Q497325) (← links)
- Excluded permutation matrices and the Stanley-Wilf conjecture (Q598446) (← links)
- On-line secret sharing (Q664393) (← links)
- Regular families of forests, antichains and duality pairs of relational structures (Q681598) (← links)
- (Q722367) (redirect page) (← links)
- Tilings of the plane with unit area triangles of bounded diameter (Q722368) (← links)
- Separation with restricted families of sets (Q739393) (← links)
- (Q854706) (redirect page) (← links)
- Improving the crossing lemma by finding more crossings in sparse graphs (Q854708) (← links)
- Partitioning multi-dimensional sets in a small number of ``uniform'' parts (Q854815) (← links)
- Extremal problems for transversals in graphs with bounded degree (Q855115) (← links)
- On the maximum number of edges in quasi-planar graphs (Q878960) (← links)
- Local chromatic number, Ky Fan's theorem, and circular colorings (Q879165) (← links)
- Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A? (Q912625) (← links)
- Coloring axis-parallel rectangles (Q986114) (← links)
- (Q1117958) (redirect page) (← links)
- Finitely generated pseudosimple algebras (Q1117959) (← links)
- Croftian sequences (Q1175248) (← links)
- On the intersection of subgroups of a free group (Q1207419) (← links)
- A lower bound on the MOD 6 degree of the OR function (Q1272657) (← links)
- On a search problem in multidimensional grids (Q1361737) (← links)
- Bounded size components -- partitions and transversals. (Q1400964) (← links)
- A note on non-deterministic communication complexity with few witnesses (Q1405785) (← links)
- On distinct sums and distinct distances. (Q1418004) (← links)
- Cutting glass (Q1580771) (← links)
- A crossing lemma for Jordan curves (Q1647400) (← links)
- Improved bounds on the Hadwiger-Debrunner numbers (Q1650467) (← links)
- Tilings with noncongruent triangles (Q1663799) (← links)
- Multi-prover encoding schemes and three-prover proof systems (Q1816732) (← links)
- A maximal clone of monotone operations which is not finitely generated (Q1820185) (← links)
- Transversals of 2-intervals, a topological approach (Q1842574) (← links)
- On the knowledge complexity of \(\mathcal N\mathcal P\) (Q1848028) (← links)
- Untangling a polygon (Q1864117) (← links)
- The \(k\) most frequent distances in the plane (Q1864121) (← links)
- Isosceles triangles determined by a planar point set (Q1865634) (← links)
- Geometric graphs with no self-intersecting path of length three (Q1883291) (← links)
- Towards the Hanna Neumann conjecture using Dicks' method (Q1911542) (← links)
- On point covers of multiple intervals and axis-parallel rectangles (Q1924491) (← links)
- Arthur-Merlin games in Boolean decision trees (Q1961380) (← links)
- Partitioning transitive tournaments into isomorphic digraphs (Q2035088) (← links)
- Planar point sets determine many pairwise crossing segments (Q2039541) (← links)
- Two extensions of the Erdős-Szekeres problem (Q2216751) (← links)
- On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges (Q2220978) (← links)
- Unlabeled compression schemes exceeding the VC-dimension (Q2309557) (← links)
- Cross-intersecting families of vectors (Q2345515) (← links)
- Remarks on a Ramsey theory for trees (Q2392039) (← links)
