  |
Items where Author is "Lenger, Dániel Antal"
Group by: Item Type | No Grouping Jump to: Article Number of items: 4. ArticleGerbner, Dániel and Keszegh, Balázs and Lenger, Dániel Antal and Nagy, Dániel and Pálvölgyi, Dömötör and Patkós, Balázs and Vizer, Máté and Wiener, Gábor (2023) On graphs that contain exactly k copies of a subgraph, and a related problem in search theory. DISCRETE APPLIED MATHEMATICS, 341. pp. 196-203. ISSN 0166-218X Fraknói, Ádám X. and Márton, Dávid Á. and Simon, Dániel G. and Lenger, Dániel Antal (2023) On the Rényi–Ulam game with restricted size queries. DISCRETE OPTIMIZATION, 48 (1). ISSN 1572-5286 Gerbner, Dániel and Lenger, Dániel Antal and Vizer, Máté (2023) A plurality problem with three colors and query size three. DISCRETE MATHEMATICS, 346 (1). ISSN 0012-365X Csóka, Endre and Blázsik, Zoltán and Király, Zoltán and Lenger, Dániel Antal (2022) Upper bounds for the necklace folding problems. JOURNAL OF COMBINATORIAL THEORY SERIES B, 157. pp. 123-143. ISSN 0095-8956 |
