Recognition problems and communication complexity. - Gábor Wiener (Discret. Appl. Math., 2004)

Edge Multiplicity and Other Trace Functions. - Gábor Wiener (Electron. Notes Discret. Math., 2007)

On finding spanning trees with few leaves. - Gábor Salamon; Gábor Wiener (Inf. Process. Lett., 2008)

Finding the maximum and minimum elements with one lie. - Dániel Gerbner; Dömötör Pálvölgyi; Balázs Patkós; Gábor Wiener (Discret. Appl. Math., 2010)

On Cubic Planar Hypohamiltonian and Hypotraceable Graphs. - Makoto Araya; Gábor Wiener (Electron. J. Comb., 2011)

On planar hypohamiltonian graphs. - Gábor Wiener; Makoto Araya (J. Graph Theory, 2011)

Search for the end of a path in the d-dimensional grid and in other graphs - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Gábor Wiener (CoRR, 2012)

Computing majority with triple queries. - Gianluca De Marco; Evangelos Kranakis; Gábor Wiener (Theor. Comput. Sci., 2012)

Density-Based Group Testing. - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Gábor Wiener (Information Theory, Combinatorics, and Search Theory, 2013)

Rounds in Combinatorial Search. - Gábor Wiener (Algorithmica, 2013)

Strict group testing and the set basis problem. - Peter Damaschke; Azam Sheikh Muhammad; Gábor Wiener (J. Comb. Theory A, 2014)

Finding a majority ball with majority answers. - Máté Vizer; Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Balázs Patkós; Gábor Wiener (Electron. Notes Discret. Math., 2015)

On non-traceable, non-hypotraceable, arachnoid graphs. - Gábor Wiener (Electron. Notes Discret. Math., 2015)

On constructions of hypotraceable graphs. - Gábor Wiener (Electron. Notes Discret. Math., 2016)

Coloring signed graphs using DFS. - Tamás Fleiner; Gábor Wiener (Optim. Lett., 2016)

Search for the end of a path in the d-dimensional grid and in other graphs. - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Günter Rote; Gábor Wiener (Ars Math. Contemp., 2017)

Finding a non-minority ball with majority answers. - Dániel Gerbner; Balázs Keszegh; Dömötör Pálvölgyi; Balázs Patkós; Máté Vizer; Gábor Wiener (Discret. Appl. Math., 2017)

Leaf-Critical and Leaf-Stable Graphs. - Gábor Wiener (J. Graph Theory, 2017)

Gallai's question and constructions of almost hypotraceable graphs. - Gábor Wiener; Carol T. Zamfirescu (Discret. Appl. Math., 2018)

New constructions of hypohamiltonian and hypotraceable graphs. - Gábor Wiener (J. Graph Theory, 2018)

Depth first search in claw-free graphs. - Gábor Wiener (Optim. Lett., 2018)

On the minimum leaf number of cubic graphs. - Jan Goedgebeur; Kenta Ozeki; Nico Van Cleemput; Gábor Wiener (Discret. Math., 2019)

On separating systems with bounded set size. - Gábor Wiener; Éva Hosszu; János Tapolcai (Discret. Appl. Math., 2020)

On minimum leaf spanning trees and a criticality notion. - Kenta Ozeki; Gábor Wiener; Carol T. Zamfirescu (Discret. Math., 2020)

Adaptive majority problems for restricted query graphs and for weighted sets. - Gábor Damásdi; Dániel Gerbner; Gyula O. H. Katona; Balázs Keszegh; Dániel Lenger; Abhishek Methuku; Dániel T. Nagy; Dömötör Pálvölgyi; Balázs Patkós; Máté Vizer; Gábor Wiener (Discret. Appl. Math., 2021)

Spiders everywhere. - Gábor Wiener; Maho Yokota; Carol T. Zamfirescu (Discret. Appl. Math., 2021)

K2-Hamiltonian Graphs: II. - Jan Goedgebeur; Jarne Renders; Gábor Wiener; Carol T. Zamfirescu (CoRR, 2023)

On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. - Dániel Gerbner; Balázs Keszegh; Dániel Lenger; Dániel T. Nagy; Dömötör Pálvölgyi; Balázs Patkós; Máté Vizer; Gábor Wiener (Discret. Appl. Math., 2023)

K2-Hamiltonian graphs: II. - Jan Goedgebeur; Jarne Renders; Gábor Wiener; Carol T. Zamfirescu (J. Graph Theory, 2024)

Query complexity of Boolean functions on the middle slice of the cube. - Dániel Gerbner; Balázs Keszegh; Dániel T. Nagy; Kartal Nagy; Dömötör Pálvölgyi; Balázs Patkós; Gábor Wiener (Discret. Appl. Math., 2025)

Network fault costs based on minimum leaf spanning trees. - Jan Goedgebeur; Jarne Renders; Gábor Wiener; Carol T. Zamfirescu (CoRR, 2025)

Cooperation in combinatorial search. - Dániel Gerbner; Balázs Keszegh; Kartal Nagy; Balázs Patkós; Gábor Wiener (Optim. Lett., 2025)