Dániel Lenger

According to our database, Dániel Lenger authored at least 6 papers between 2021 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On graphs that contain exactly <i>k</i> copies of a subgraph, and a related problem in search theory.

Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener

Discret. Appl. Math., December, 2023

On the Rényi-Ulam game with restricted size queries.

Ádám Fraknói, Dávid Á. Márton, Dániel G. Simon, Dániel Lenger

Discret. Optim., May, 2023

A plurality problem with three colors and query size three.

Dániel Gerbner, Dániel Lenger, Máté Vizer

Discret. Math., 2023

2022

Upper bounds for the necklace folding problems.

Endre Csóka, Zoltán L. Blázsik, Zoltán Király, Dániel Lenger

J. Comb. Theory B, 2022

2021

Adaptive majority problems for restricted query graphs and for weighted sets.

Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener

Discret. Appl. Math., 2021

Communicating Digital Evolutionary Machines.

Istvan Elek, Zoltán Blázsik, Tamás Héger, Dániel Lenger, Dániel Sindely

Proceedings of the Intelligent Computing, 2021