Efficient design of stochastic mechanisms - Endre Csóka (CoRR, 2006)

Maximum flow is approximable by deterministic constant-time algorithm in sparse networks - Endre Csóka (CoRR, 2010)

An Undecidability Result on Limits of Sparse Graphs. - Endre Csóka (Electron. J. Comb., 2012)

Random local algorithms - Endre Csóka (CoRR, 2012)

Core percolation on complex networks - Yang-Yu Liu; Endre Csóka; Haijun Zhou; Márton Pósfai (CoRR, 2012)

A macro placer algorithm for chip design. - Endre Csóka; Attila Deák (CoRR, 2015)

Several Tokens in Herman's algorithm. - Endre Csóka; Szabolcs Mészáros (CoRR, 2015)

Emergence of bimodality in controlling complex networks. - Tao Jia; Yang-Yu Liu; Endre Csóka; Márton Pósfai; Jean-Jacques E. Slotine; Albert-László Barabási (CoRR, 2015)

Limits of some combinatorial problems. - Endre Csóka (Electron. Notes Discret. Math., 2015)

Invariant Gaussian processes and independent sets on regular graphs of large girth. - Endre Csóka; Balázs Gerencsér; Viktor Harangi; Bálint Virág (Random Struct. Algorithms, 2015)

Independent sets and cuts in large-girth regular graphs. - Endre Csóka (CoRR, 2016)

Positive graphs. - Omar Antolín Camarena; Endre Csóka; Tamás Hubai; Gábor Lippner; László Lovász 001 (Eur. J. Comb., 2016)

On the graph limit question of Vera T. Sós. - Endre Csóka (J. Comb. Theory B, 2016)

The extremal function for disconnected minors. - Endre Csóka; Irene Lo; Sergey Norin; Hehui Wu; Liana Yepremyan (J. Comb. Theory B, 2017)

Application-oriented mathematical algorithms for group testing. - Endre Csóka (CoRR, 2020)

Towards solving the 7-in-a-row game. - Domonkos Czifra; Endre Csóka; Zsolt Zombori; Géza Makay (CoG, 2021)

A Robust Efficient Dynamic Mechanism. - Endre Csóka (CoRR, 2021)

Moser-Tardos Algorithm with small number of random bits. - Endre Csóka; Lukasz Grabowski; András Máthé; Oleg Pikhurko; Konstantinos Tyros (CoRR, 2022)

On directed analogues of expander and hyperfinite graph sequences. - Endre Csóka; Lukasz Grabowski (Comb. Probab. Comput., 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)

Finding cliques and dense subgraphs using edge queries. - Endre Csóka; András Pongrácz (CoRR, 2023)

Locally common graphs. - Endre Csóka; Tamás Hubai; László Lovász 001 (J. Graph Theory, 2023)