Chain Intersecting Families. - Attila Bernáth; Dániel Gerbner (Graphs Comb., 2007)

A New Approach to Splitting-Off. - Attila Bernáth; Tamás Király (IPCO, 2008)

Degree Constrained Orientations in Countable Graphs. - Attila Bernáth; Henning Bruhn (Electron. J. Comb., 2008)

Recent results on well-balanced orientations. - Attila Bernáth; Satoru Iwata 001; Tamás Király; Zoltán Király; Zoltán Szigeti (Discret. Optim., 2008)

Well-balanced orientations of mixed graphs. - Attila Bernáth; Gwenaël Joret (Inf. Process. Lett., 2008)

Source location in undirected and directed hypergraphs. - Attila Bernáth (Oper. Res. Lett., 2008)

Covering skew-supermodular functions by hypergraphs of minimum total size. - Attila Bernáth; Tamás Király (Oper. Res. Lett., 2009)

A unifying approach to splitting-off. - Attila Bernáth; Tamás Király (Comb., 2012)

Algorithms for multiplayer multicommodity flow problems. - Attila Bernáth; Tamás Király; Erika R. Kovács; Gergely Mádi-Nagy; Gyula Pap; Júlia Pap; Jácint Szabó; László A. Végh (Central Eur. J. Oper. Res., 2013)

Augmenting the Edge-Connectivity of a Hypergraph by Adding a Multipartite Graph. - Attila Bernáth; Roland Grappe; Zoltán Szigeti (J. Graph Theory, 2013)

The Generalized Terminal Backup Problem. - Attila Bernáth; Yusuke Kobayashi 001 (SODA, 2014)

Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem. - Attila Bernáth; Krzysztof Ciebiera; Piotr Godlewski; Piotr Sankowski (SEA, 2014)

Regular Graphs are Antimagic. - Kristóf Bérczi; Attila Bernáth; Máté Vizer (Electron. J. Comb., 2015)

The complexity of the Clar number problem and an FPT algorithm. - Erika R. Bérczi-Kovács; Attila Bernáth (CoRR, 2015)

Blocking optimal k-arborescences. - Attila Bernáth; Tamás Király (CoRR, 2015)

On the tractability of some natural packing, covering and partitioning problems. - Attila Bernáth; Zoltán Király (Discret. Appl. Math., 2015)

The Generalized Terminal Backup Problem. - Attila Bernáth; Yusuke Kobayashi 001; Tatsuya Matsuoka (SIAM J. Discret. Math., 2015)

Blocking Optimal k-Arborescences. - Attila Bernáth; Tamás Király (SODA, 2016)

A Note on $ mathtt{V}$-free 2-matchings. - Kristóf Bérczi; Attila Bernáth; Máté Vizer (Electron. J. Comb., 2016)

Blocking unions of arborescences. - Attila Bernáth; Gyula Pap (Discret. Optim., 2016)

Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczúr and Frank. - Attila Bernáth (Inf. Process. Lett., 2017)

Blocking optimal arborescences. - Attila Bernáth; Gyula Pap (Math. Program., 2017)

Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. - Attila Bernáth; Roland Grappe; Zoltán Szigeti (SIAM J. Discret. Math., 2017)

Blocking optimal structures. - Kristóf Bérczi; Attila Bernáth; Tamás Király; Gyula Pap (Discret. Math., 2018)