The following pages link to Dömötör Pálvölgyi (Q284346):
Displaying 50 items.
- Topological orderings of weighted directed acyclic graphs (Q284347) (← links)
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Unsplittable coverings in the plane (Q317324) (← links)
- Finding a majority ball with majority answers (Q322261) (← links)
- Saturating Sperner families (Q367051) (← links)
- Testing additive integrality gaps (Q378120) (← links)
- Domination in transitive colorings of tournaments (Q403357) (← links)
- Octants are cover-decomposable (Q411409) (← links)
- Consistent digital line segments (Q420574) (← links)
- Lower bounds on the obstacle number of graphs (Q426912) (← links)
- Finding a non-minority ball with majority answers (Q505416) (← links)
- Indecomposable coverings with concave polygons (Q603839) (← links)
- Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions (Q612906) (← links)
- Regular families of forests, antichains and duality pairs of relational structures (Q681598) (← links)
- Finding the maximum and minimum elements with one lie (Q708325) (← links)
- Permutations, hyperplanes and polynomials over finite fields (Q708430) (← links)
- Vectors in a box (Q715080) (← links)
- Convex polygons are self-coverable (Q741609) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- Polychromatic colorings of arbitrary rectangular partitions (Q1045138) (← links)
- Majority and plurality problems (Q1946224) (← links)
- Coloring Delaunay-edges and their generalizations (Q1984605) (← links)
- Distribution of colors in Gallai colorings (Q1987082) (← links)
- Exponential lower bound for Berge-Ramsey problems (Q2042217) (← links)
- Induced and non-induced poset saturation problems (Q2049440) (← links)
- On the number of hyperedges in the hypergraph of lines and pseudo-discs (Q2161213) (← links)
- Complexity of domination in triangulated plane graphs (Q2178742) (← links)
- Adaptive majority problems for restricted query graphs and for weighted sets (Q2208365) (← links)
- Grid drawings of graphs with constant edge-vertex resolution (Q2230412) (← links)
- Query complexity and the polynomial Freiman-Ruzsa conjecture (Q2237416) (← links)
- Partitioning to three matchings of given size is NP-complete for bipartite graphs (Q2254544) (← links)
- Unlabeled compression schemes exceeding the VC-dimension (Q2309557) (← links)
- Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings (Q2323247) (← links)
- Proper coloring of geometric hypergraphs (Q2324632) (← links)
- Almost cross-intersecting and almost cross-Sperner pairs of families of sets (Q2376112) (← links)
- Combinatorial necklace splitting (Q2380234) (← links)
- Convex polygons are cover-decomposable (Q2380774) (← links)
- Unified Hanani-Tutte theorem (Q2401398) (← links)
- Octants are cover-decomposable into many coverings (Q2444310) (← links)
- Drawing cubic graphs with at most five slopes (Q2483558) (← links)
- Online and quasi-online colorings of wedges and intervals (Q2520715) (← links)
- Bounded-degree graphs can have arbitrarily large slope numbers (Q2583679) (← links)
- Radon numbers grow linearly (Q2671172) (← links)
- Turán problems for edge-ordered graphs (Q2692781) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes (Q2827816) (← links)
- Digitalizing line segments (Q2857358) (← links)
- Octants are cover decomposable (Q2857395) (← links)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- On families of weakly cross-intersecting set-pairs (Q2898454) (← links)
