Waiting for a Bat to Fly By (in Polynomial Time).
- Published in:
- Combinatorics, Probability & Computing, 2006, v. 15, n. 5, p. 673, doi. 10.1017/s0963548306007590
- By:
- Publication type:
- Article
Works matching AU Gabor Tardos
Results: 18
1
2
Distinct Distances in Three and Higher Dimensions.
- Published in:
- Combinatorics, Probability & Computing, 2004, v. 13, n. 3, p. 283, doi. 10.1017/s0963548304006091
- By:
- Publication type:
- Article
3
On directed local chromatic number, shift graphs, and Borsuk-like graphs.
- Published in:
- Journal of Graph Theory, 2011, v. 66, n. 1, p. 65, doi. 10.1002/jgt.20494
- By:
- Publication type:
- Article
4
Crossing numbers of imbalanced graphs.
- Published in:
- Journal of Graph Theory, 2010, v. 64, n. 1, p. 12, doi. 10.1002/jgt.20435
- By:
- Publication type:
- Article
5
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority.
- Published in:
- Random Structures & Algorithms, 2016, v. 48, n. 3, p. 612, doi. 10.1002/rsa.20598
- By:
- Publication type:
- Article
6
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles.
- Published in:
- Random Structures & Algorithms, 2009, v. 34, n. 1, p. 11, doi. 10.1002/rsa.20246
- By:
- Publication type:
- Article
7
Disjointness graphs of segments in the space.
- Published in:
- Combinatorics, Probability & Computing, 2021, v. 30, n. 4, p. 498, doi. 10.1017/S0963548320000504
- By:
- Publication type:
- Article
8
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves.
- Published in:
- Combinatorics, Probability & Computing, 2016, v. 25, n. 6, p. 941, doi. 10.1017/S0963548316000043
- By:
- Publication type:
- Article
9
Conflict-Free Colouring of Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2014, v. 23, n. 3, p. 434, doi. 10.1017/S0963548313000540
- By:
- Publication type:
- Article
10
Conflict-Free Colourings of Graphs and Hypergraphs.
- Published in:
- Combinatorics, Probability & Computing, 2009, v. 18, n. 5, p. 819, doi. 10.1017/S0963548309990290
- By:
- Publication type:
- Article
11
Graph Colouring with No Large Monochromatic Components.
- Published in:
- Combinatorics, Probability & Computing, 2008, v. 17, n. 4, p. 577, doi. 10.1017/S0963548308009140
- By:
- Publication type:
- Article
12
A Note on Non-Deterministic Communication Complexity with Few Witnesses.
- Published in:
- Theory of Computing Systems, 2003, v. 36, n. 4, p. 387, doi. 10.1007/s00224-003-1158-7
- By:
- Publication type:
- Article
13
Multiple Coverings of the Plane with Triangles.
- Published in:
- Discrete & Computational Geometry, 2007, v. 38, n. 2, p. 443, doi. 10.1007/s00454-007-1345-4
- By:
- Publication type:
- Article
14
Erdős-Pyber Theorem for Hypergraphs and Secret Sharing.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 5, p. 1335, doi. 10.1007/s00373-014-1448-7
- By:
- Publication type:
- Article
15
Cross-Intersecting Families of Vectors.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 2, p. 477, doi. 10.1007/s00373-015-1551-4
- By:
- Publication type:
- Article
16
Relations between the Local Chromatic Number and Its Directed Version.
- Published in:
- Journal of Graph Theory, 2015, v. 79, n. 4, p. 318, doi. 10.1002/jgt.21834
- By:
- Publication type:
- Article
17
Two extensions of the Erdős--Szekeres problem.
- Published in:
- Journal of the European Mathematical Society (EMS Publishing), 2020, v. 22, n. 12, p. 3981, doi. 10.4171/JEMS/1000
- By:
- Publication type:
- Article
18
Where Have All the Grasshoppers Gone?
- Published in:
- American Mathematical Monthly, 2024, v. 131, n. 3, p. 204, doi. 10.1080/00029890.2023.2284611
- By:
- Publication type:
- Article