Attila Bernáth

According to our database, Attila Bernáth authored at least 24 papers between 2007 and 2018.

Collaborative distances:

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

2018

Blocking optimal structures.

Kristóf Bérczi, Attila Bernáth, Tamás Király, Gyula Pap

Discret. Math., 2018

2017

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

2016

Blocking unions of arborescences.

Attila Bernáth, Gyula Pap

Discret. Optim., 2016

A Note on $\mathtt{V}$-free 2-matchings.

Kristóf Bérczi, Attila Bernáth, Máté Vizer

Electron. J. Comb., 2016

Blocking Optimal <i>k</i>-Arborescences.

Attila Bernáth, Tamás Király

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

The Generalized Terminal Backup Problem.

Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka

SIAM J. Discret. Math., 2015

On the tractability of some natural packing, covering and partitioning problems.

Attila Bernáth, Zoltán Király

Discret. Appl. Math., 2015

Blocking optimal k-arborescences.

Attila Bernáth, Tamás Király

CoRR, 2015

The complexity of the Clar number problem and an FPT algorithm.

Erika R. Bérczi-Kovács, Attila Bernáth

CoRR, 2015

Regular Graphs are Antimagic.

Kristóf Bérczi, Attila Bernáth, Máté Vizer

Electron. J. Comb., 2015

2014

Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem.

Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

The Generalized Terminal Backup Problem.

Attila Bernáth, Yusuke Kobayashi

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

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

Blocking Optimal Arborescences.

Attila Bernáth, Gyula Pap

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

A unifying approach to splitting-off.

Attila Bernáth, Tamás Király

Comb., 2012

2010

Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph.

Attila Bernáth, Roland Grappe, Zoltán Szigeti

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Covering skew-supermodular functions by hypergraphs of minimum total size.

Attila Bernáth, Tamás Király

Oper. Res. Lett., 2009

Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph.

Roland Grappe, Attila Bernáth, Zoltán Szigeti

Electron. Notes Discret. Math., 2009

2008

Source location in undirected and directed hypergraphs.

Attila Bernáth

Oper. Res. Lett., 2008

Well-balanced orientations of mixed graphs.

Attila Bernáth, Gwenaël Joret

Inf. Process. Lett., 2008

Recent results on well-balanced orientations.

Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti

Discret. Optim., 2008

Degree Constrained Orientations in Countable Graphs.

Attila Bernáth, Henning Bruhn

Electron. J. Comb., 2008

A New Approach to Splitting-Off.

Attila Bernáth, Tamás Király

Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007

Chain Intersecting Families.

Attila Bernáth, Dániel Gerbner

Graphs Comb., 2007