Gábor Wiener

From MaRDI portal
Person:234553

Available identifiers

zbMath Open wiener.gaborMaRDI QIDQ234553

List of research outcomes





PublicationDate of PublicationType
Query complexity of Boolean functions on the middle slice of the cube2025-01-06Paper
Adaptive majority problems for restricted query graphs and for weighted sets2024-10-18Paper
K2‐Hamiltonian graphs: II2024-02-23Paper
On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory2023-11-13Paper
Query complexity of Boolean functions on the middle slice of the cube2023-09-24Paper
Cooperation in Combinatorial Search2023-04-22Paper
Spiders everywhere2020-12-29Paper
Adaptive majority problems for restricted query graphs and for weighted sets2020-11-02Paper
On minimum leaf spanning trees and a criticality notion2020-05-21Paper
On separating systems with bounded set size2020-04-01Paper
On the minimum leaf number of cubic graphs2019-09-11Paper
Gallai's question and constructions of almost hypotraceable graphs2018-05-24Paper
New constructions of hypohamiltonian and hypotraceable graphs2018-04-27Paper
Depth first search in claw-free graphs2018-04-19Paper
Search for the end of a path in the d-dimensional grid and in other graphs2017-09-14Paper
Leaf-Critical and Leaf-Stable Graphs2017-04-21Paper
On constructions of hypotraceable graphs2017-02-13Paper
Finding a non-minority ball with majority answers2017-01-23Paper
Finding a majority ball with majority answers2016-10-14Paper
On non-traceable, non-hypotraceable, arachnoid graphs2016-10-14Paper
Coloring signed graphs using DFS2016-05-03Paper
Strict group testing and the set basis problem2014-06-03Paper
Rounds in combinatorial search2013-11-11Paper
Density-Based Group Testing2013-04-09Paper
Computing majority with triple queries2012-11-27Paper
Computing Majority with Triple Queries2011-08-17Paper
On cubic planar hypohamiltonian and hypotraceable graphs2011-06-01Paper
On planar hypohamiltonian graphs2011-05-11Paper
Inclusionwise minimal completely separating systems2011-04-18Paper
Finding the maximum and minimum elements with one lie2010-10-11Paper
On finding spanning trees with few leaves2010-03-24Paper
Edge Multiplicity and Other Trace Functions2008-06-05Paper
Recognition problems and communication complexity.2004-02-14Paper
Search for a majority element2002-10-10Paper

Research outcomes over time

This page was built for person: Gábor Wiener