Gábor Wiener

According to our database1, Gábor Wiener authored at least 25 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On minimum leaf spanning trees and a criticality notion.
Discret. Math., 2020

On separating systems with bounded set size.
Discret. Appl. Math., 2020

2019
On the minimum leaf number of cubic graphs.
Discret. Math., 2019

Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets.
CoRR, 2019

2018
Depth first search in claw-free graphs.
Optim. Lett., 2018

New constructions of hypohamiltonian and hypotraceable graphs.
J. Graph Theory, 2018

Gallai's question and constructions of almost hypotraceable graphs.
Discret. Appl. Math., 2018

2017
Leaf-Critical and Leaf-Stable Graphs.
J. Graph Theory, 2017

Finding a non-minority ball with majority answers.
Discret. Appl. Math., 2017

Search for the end of a path in the d-dimensional grid and in other graphs.
Ars Math. Contemp., 2017

2016
Coloring signed graphs using DFS.
Optim. Lett., 2016

On constructions of hypotraceable graphs.
Electron. Notes Discret. Math., 2016

2015
On non-traceable, non-hypotraceable, arachnoid graphs.
Electron. Notes Discret. Math., 2015

Finding a majority ball with majority answers.
Electron. Notes Discret. Math., 2015

2014
Strict group testing and the set basis problem.
J. Comb. Theory, Ser. A, 2014

2013
Rounds in Combinatorial Search.
Algorithmica, 2013

Density-Based Group Testing.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012
Computing majority with triple queries.
Theor. Comput. Sci., 2012

Search for the end of a path in the d-dimensional grid and in other graphs
CoRR, 2012

2011
On planar hypohamiltonian graphs.
J. Graph Theory, 2011

On Cubic Planar Hypohamiltonian and Hypotraceable Graphs.
Electron. J. Comb., 2011

2010
Finding the maximum and minimum elements with one lie.
Discret. Appl. Math., 2010

2008
On finding spanning trees with few leaves.
Inf. Process. Lett., 2008

2007
Edge Multiplicity and Other Trace Functions.
Electron. Notes Discret. Math., 2007

2004
Recognition problems and communication complexity.
Discret. Appl. Math., 2004


  Loading...