The following pages link to Gábor Wiener (Q234553):
Displaying 31 items.
- Finding a majority ball with majority answers (Q322261) (← links)
- On non-traceable, non-hypotraceable, arachnoid graphs (Q322337) (← links)
- Rounds in combinatorial search (Q378259) (← links)
- Finding a non-minority ball with majority answers (Q505416) (← links)
- On constructions of hypotraceable graphs (Q510557) (← links)
- On cubic planar hypohamiltonian and hypotraceable graphs (Q540080) (← links)
- Computing majority with triple queries (Q690459) (← links)
- Finding the maximum and minimum elements with one lie (Q708325) (← links)
- Recognition problems and communication complexity. (Q1422409) (← links)
- Depth first search in claw-free graphs (Q1744633) (← links)
- Gallai's question and constructions of almost hypotraceable graphs (Q1752468) (← links)
- On minimum leaf spanning trees and a criticality notion (Q2182204) (← links)
- Adaptive majority problems for restricted query graphs and for weighted sets (Q2208365) (← links)
- Spiders everywhere (Q2217501) (← links)
- On separating systems with bounded set size (Q2309567) (← links)
- On the minimum leaf number of cubic graphs (Q2324488) (← links)
- On finding spanning trees with few leaves (Q2380066) (← links)
- Inclusionwise minimal completely separating systems (Q2431691) (← links)
- Strict group testing and the set basis problem (Q2452424) (← links)
- Leaf-Critical and Leaf-Stable Graphs (Q2978184) (← links)
- On planar hypohamiltonian graphs (Q2998925) (← links)
- Computing Majority with Triple Queries (Q3087986) (← links)
- Edge Multiplicity and Other Trace Functions (Q3503508) (← links)
- New constructions of hypohamiltonian and hypotraceable graphs (Q4638645) (← links)
- Density-Based Group Testing (Q4915256) (← links)
- Search for the end of a path in the d-dimensional grid and in other graphs (Q5357306) (← links)
- Search for a majority element (Q5957833) (← links)
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory (Q6069164) (← links)
- <i>K</i><sub>2</sub>‐Hamiltonian graphs: II (Q6199383) (← links)
- Adaptive majority problems for restricted query graphs and for weighted sets (Q6621188) (← links)
- Query complexity of Boolean functions on the middle slice of the cube (Q6657260) (← links)
