| Publication | Date of Publication | Type |
|---|
Query complexity of Boolean functions on the middle slice of the cube
Discrete Applied Mathematics | 2025-01-06 | Paper |
Adaptive majority problems for restricted query graphs and for weighted sets
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
K2‐Hamiltonian graphs: II
Journal of Graph Theory | 2024-02-23 | Paper |
On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
Discrete Applied Mathematics | 2023-11-13 | Paper |
| Query complexity of Boolean functions on the middle slice of the cube | 2023-09-24 | Paper |
| Cooperation in Combinatorial Search | 2023-04-22 | Paper |
Spiders everywhere
Discrete Applied Mathematics | 2020-12-29 | Paper |
Adaptive majority problems for restricted query graphs and for weighted sets
Discrete Applied Mathematics | 2020-11-02 | Paper |
On minimum leaf spanning trees and a criticality notion
Discrete Mathematics | 2020-05-21 | Paper |
On separating systems with bounded set size
Discrete Applied Mathematics | 2020-04-01 | Paper |
On the minimum leaf number of cubic graphs
Discrete Mathematics | 2019-09-11 | Paper |
Gallai's question and constructions of almost hypotraceable graphs
Discrete Applied Mathematics | 2018-05-24 | Paper |
New constructions of hypohamiltonian and hypotraceable graphs
Journal of Graph Theory | 2018-04-27 | Paper |
Depth first search in claw-free graphs
Optimization Letters | 2018-04-19 | Paper |
Search for the end of a path in the \(\cdot\)-dimensional grid and in other graphs
Ars Mathematica Contemporanea | 2017-09-14 | Paper |
Leaf-critical and leaf-stable graphs
Journal of Graph Theory | 2017-04-21 | Paper |
| On constructions of hypotraceable graphs | 2017-02-13 | Paper |
Finding a non-minority ball with majority answers
Discrete Applied Mathematics | 2017-01-23 | Paper |
| Finding a majority ball with majority answers | 2016-10-14 | Paper |
Finding a majority ball with majority answers
(available as arXiv preprint) | 2016-10-14 | Paper |
| On non-traceable, non-hypotraceable, arachnoid graphs | 2016-10-14 | Paper |
Coloring signed graphs using DFS
Optimization Letters | 2016-05-03 | Paper |
Strict group testing and the set basis problem
Journal of Combinatorial Theory. Series A | 2014-06-03 | Paper |
Rounds in combinatorial search
Algorithmica | 2013-11-11 | Paper |
Density-based group testing
Information Theory, Combinatorics, and Search Theory | 2013-04-09 | Paper |
Computing majority with triple queries
Theoretical Computer Science | 2012-11-27 | Paper |
Computing majority with triple queries
Lecture Notes in Computer Science | 2011-08-17 | Paper |
On cubic planar hypohamiltonian and hypotraceable graphs
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
On cubic planar hypohamiltonian and hypotraceable graphs
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
On planar hypohamiltonian graphs
Journal of Graph Theory | 2011-05-11 | Paper |
Inclusionwise minimal completely separating systems
Journal of Statistical Theory and Practice | 2011-04-18 | Paper |
Finding the maximum and minimum elements with one lie
Discrete Applied Mathematics | 2010-10-11 | Paper |
On finding spanning trees with few leaves
Information Processing Letters | 2010-03-24 | Paper |
Edge Multiplicity and Other Trace Functions
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Recognition problems and communication complexity.
Discrete Applied Mathematics | 2004-02-14 | Paper |
Search for a majority element
Journal of Statistical Planning and Inference | 2002-10-10 | Paper |
