| Adaptive Majority Problems For Restricted Query Graphs And For Weighted Sets | 0 | 0.34 | 2021 |
| On minimum leaf spanning trees and a criticality notion | 1 | 0.35 | 2020 |
| On separating systems with bounded set size | 0 | 0.34 | 2020 |
| Gallai's question and constructions of almost hypotraceable graphs. | 0 | 0.34 | 2018 |
| Depth first search in claw-free graphs. | 0 | 0.34 | 2018 |
| On the minimum leaf number of cubic graphs. | 0 | 0.34 | 2018 |
| New constructions of hypohamiltonian and hypotraceable graphs. | 1 | 0.36 | 2018 |
| Leaf-Critical and Leaf-Stable Graphs | 0 | 0.34 | 2017 |
| Finding a non-minority ball with majority answers. | 2 | 0.39 | 2017 |
| Coloring signed graphs using DFS. | 2 | 0.41 | 2016 |
| On constructions of hypotraceable graphs. | 2 | 0.43 | 2016 |
| Finding a majority ball with majority answers. | 0 | 0.34 | 2015 |
| On non-traceable, non-hypotraceable, arachnoid graphs | 1 | 0.36 | 2015 |
| Strict group testing and the set basis problem. | 2 | 0.37 | 2014 |
| Density-Based group testing | 1 | 0.36 | 2013 |
| Rounds in Combinatorial Search. | 3 | 0.52 | 2013 |
| Computing Majority with Triple Queries | 1 | 0.39 | 2012 |
| Search for the end of a path in the d-dimensional grid and in other graphs | 0 | 0.34 | 2012 |
| On Cubic Planar Hypohamiltonian and Hypotraceable Graphs. | 7 | 0.61 | 2011 |
| On planar hypohamiltonian graphs | 8 | 0.68 | 2011 |
| Finding the maximum and minimum elements with one lie | 1 | 0.38 | 2010 |
| On finding spanning trees with few leaves | 28 | 1.45 | 2008 |
| Edge Multiplicity and Other Trace Functions | 4 | 0.57 | 2007 |
| Recognition problems and communication complexity | 0 | 0.34 | 2004 |
