Követés
Gábor Wiener
Gábor Wiener
E-mail megerősítve itt: cs.bme.hu
Cím
Hivatkozott rá
Hivatkozott rá
Év
On finding spanning trees with few leaves
G Salamon, G Wiener
Information Processing Letters 105 (5), 164-169, 2008
632008
Search for a majority element
G Wiener
Journal of statistical planning and inference 100 (2), 313-318, 2002
422002
On planar hypohamiltonian graphs
G Wiener, M Araya
Journal of Graph Theory 67 (1), 55-68, 2011
262011
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
162014
Leaf‐critical and leaf‐stable graphs
G Wiener
Journal of Graph Theory 84 (4), 443-459, 2017
152017
New constructions of hypohamiltonian and hypotraceable graphs
G Wiener
Journal of Graph Theory 87 (4), 526-535, 2018
142018
Coloring signed graphs using DFS
T Fleiner, G Wiener
Optimization Letters 10 (4), 865-869, 2016
132016
Computing majority with triple queries
G De Marco, E Kranakis, G Wiener
Theoretical Computer Science 461, 17-26, 2012
132012
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
102017
Rounds in combinatorial search
G Wiener
Algorithmica 67 (3), 315-323, 2013
82013
On non-traceable, non-hypotraceable, arachnoid graphs
G Wiener
Electronic Notes in Discrete Mathematics 49, 621-627, 2015
72015
Density-based group testing
D Gerbner, B Keszegh, D Pálvölgyi, G Wiener
Information theory, combinatorics, and search theory, 543-556, 2013
72013
Edge multiplicity and other trace functions
G Wiener
Electronic Notes in Discrete Mathematics 29, 491-495, 2007
72007
Gallai’s question and constructions of almost hypotraceable graphs
G Wiener, CT Zamfirescu
Discrete Applied Mathematics 243, 270-278, 2018
62018
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
62010
On constructions of hypotraceable graphs
G Wiener
Electronic Notes in Discrete Mathematics 54, 127-132, 2016
42016
Computing majority with triple queries
GD Marco, E Kranakis, G Wiener
International Computing and Combinatorics Conference, 604-615, 2011
42011
Rounds in combinatorial search
G Wiener
Dagstuhl Seminar Proceedings, 2009
42009
On the minimum leaf number of cubic graphs
J Goedgebeur, K Ozeki, N Van Cleemput, G Wiener
Discrete Mathematics 342 (11), 3000-3005, 2019
32019
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20