Gábor Wiener

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 21

Top Topics

Graph Theoretic

Query Complexity

Depth First Search

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

J. Graph Theory

Publications

Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu
-Hamiltonian graphs: II. J. Graph Theory 105 (4) (2024)
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
Query complexity of Boolean functions on the middle slice of the cube. CoRR (2023)
Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu
-Hamiltonian Graphs: II. CoRR (2023)
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
copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341 (2023)
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
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288 (2021)
Gábor Wiener, Maho Yokota, Carol T. Zamfirescu
Spiders everywhere. Discret. Appl. Math. 289 (2021)
Kenta Ozeki, Gábor Wiener, Carol T. Zamfirescu
On minimum leaf spanning trees and a criticality notion. Discret. Math. 343 (7) (2020)
Gábor Wiener, Éva Hosszu, János Tapolcai
On separating systems with bounded set size. Discret. Appl. Math. 276 (2020)
Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener
On the minimum leaf number of cubic graphs. Discret. Math. 342 (11) (2019)
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
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR (2019)
Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener
On the minimum leaf number of cubic graphs. CoRR (2018)
Gábor Wiener
Depth first search in claw-free graphs. Optim. Lett. 12 (2) (2018)
Gábor Wiener
New constructions of hypohamiltonian and hypotraceable graphs. J. Graph Theory 87 (4) (2018)
Gábor Wiener, Carol T. Zamfirescu
Gallai's question and constructions of almost hypotraceable graphs. Discret. Appl. Math. 243 (2018)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
Finding a non-minority ball with majority answers. Discret. Appl. Math. 219 (2017)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Günter Rote, Gábor Wiener
Search for the end of a path in the d-dimensional grid and in other graphs. Ars Math. Contemp. 12 (2) (2017)
Gábor Wiener
Leaf-Critical and Leaf-Stable Graphs. J. Graph Theory 84 (4) (2017)
Tamás Fleiner, Gábor Wiener
Coloring signed graphs using DFS. Optim. Lett. 10 (4) (2016)
Gábor Wiener
On constructions of hypotraceable graphs. Electron. Notes Discret. Math. 54 (2016)
Gábor Wiener
On non-traceable, non-hypotraceable, arachnoid graphs. Electron. Notes Discret. Math. 49 (2015)
Máté Vizer, Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener
Finding a majority ball with majority answers. Electron. Notes Discret. Math. 49 (2015)
Peter Damaschke, Azam Sheikh Muhammad, Gábor Wiener
Strict group testing and the set basis problem. J. Comb. Theory, Ser. A 126 (2014)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
Density-Based Group Testing. Information Theory, Combinatorics, and Search Theory (2013)
Gábor Wiener
Rounds in Combinatorial Search. Algorithmica 67 (3) (2013)
Gianluca De Marco, Evangelos Kranakis, Gábor Wiener
Computing majority with triple queries. Theor. Comput. Sci. 461 (2012)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
Density-based group testing CoRR (2012)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
Search for the end of a path in the d-dimensional grid and in other graphs CoRR (2012)
Makoto Araya, Gábor Wiener
On Cubic Planar Hypohamiltonian and Hypotraceable Graphs. Electron. J. Comb. 18 (1) (2011)
Gábor Wiener, Makoto Araya
On planar hypohamiltonian graphs. J. Graph Theory 67 (1) (2011)
Gianluca De Marco, Evangelos Kranakis, Gábor Wiener
Computing Majority with Triple Queries CoRR (2011)
Gianluca De Marco, Evangelos Kranakis, Gábor Wiener
Computing Majority with Triple Queries. COCOON (2011)
Dániel Gerbner, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener
Finding the maximum and minimum elements with one lie. Discret. Appl. Math. 158 (9) (2010)
Gábor Wiener
Rounds in Combinatorial Search. Search Methodologies (2009)
Gábor Salamon, Gábor Wiener
On finding spanning trees with few leaves. Inf. Process. Lett. 105 (5) (2008)
Gábor Wiener
Edge Multiplicity and Other Trace Functions. Electron. Notes Discret. Math. 29 (2007)
Gábor Wiener
Recognition problems and communication complexity. Discret. Appl. Math. 137 (1) (2004)