Volgen
Gábor Wiener
Gábor Wiener
Associate professor, Budapest University of Technology and Economics
Geverifieerd e-mailadres voor cs.bme.hu
Titel
Geciteerd door
Geciteerd door
Jaar
On finding spanning trees with few leaves
G Salamon, G Wiener
Information Processing Letters 105 (5), 164-169, 2008
692008
Search for a majority element
G Wiener
Journal of statistical planning and inference 100 (2), 313-318, 2002
412002
On planar hypohamiltonian graphs
G Wiener, M Araya
Journal of Graph Theory 67 (1), 55-68, 2011
272011
On cubic planar hypohamiltonian and hypotraceable graphs
M Araya, G Wiener
the electronic journal of combinatorics, P85-P85, 2011
252011
Strict group testing and the set basis problem
P Damaschke, AS Muhammad, G Wiener
Journal of Combinatorial Theory, Series A 126, 70-91, 2014
172014
New constructions of hypohamiltonian and hypotraceable graphs
G Wiener
Journal of Graph Theory 87 (4), 526-535, 2018
152018
Coloring signed graphs using DFS
T Fleiner, G Wiener
Optimization Letters 10, 865-869, 2016
152016
Computing majority with triple queries
G De Marco, E Kranakis, G Wiener
Theoretical Computer Science 461, 17-26, 2012
142012
Leaf‐critical and leaf‐stable graphs
G Wiener
Journal of Graph Theory 84 (4), 443-459, 2017
132017
Finding a non-minority ball with majority answers
D Gerbner, B Keszegh, D Pálvölgyi, B Patkós, M Vizer, G Wiener
Discrete Applied Mathematics 219, 18-31, 2017
92017
Gallai’s question and constructions of almost hypotraceable graphs
G Wiener, CT Zamfirescu
Discrete Applied Mathematics 243, 270-278, 2018
72018
On non-traceable, non-hypotraceable, arachnoid graphs
G Wiener
Electronic Notes in Discrete Mathematics 49, 621-627, 2015
72015
Rounds in combinatorial search
G Wiener
Algorithmica 67 (3), 315-323, 2013
72013
Density-based group testing
D Gerbner, B Keszegh, D Pálvölgyi, G Wiener
Information Theory, Combinatorics, and Search Theory: In Memory of Rudolf …, 2013
72013
K2‐Hamiltonian graphs: II
J Goedgebeur, J Renders, G Wiener, CT Zamfirescu
Journal of Graph Theory 105 (4), 580-611, 2024
62024
Edge multiplicity and other trace functions
G Wiener
Electronic Notes in Discrete Mathematics 29, 491-495, 2007
62007
Finding the maximum and minimum elements with one lie
D Gerbner, D Pálvölgyi, B Patkós, G Wiener
Discrete Applied Mathematics 158 (9), 988-995, 2010
52010
On the minimum leaf number of cubic graphs
J Goedgebeur, K Ozeki, N Van Cleemput, G Wiener
Discrete Mathematics 342 (11), 3000-3005, 2019
42019
On constructions of hypotraceable graphs
G Wiener
Electronic Notes in Discrete Mathematics 54, 127-132, 2016
42016
On a problem of Rényi and Katona
É Hosszu, J Tapolcai, G Wiener
Proc. 8th Jpn.-Hungar. Symp. Disc. Math. Appl, 229-232, 2013
42013
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20