Attila Bernáth

Publication Activity (10 Years)

Years Active: 2007-2018
Publications (10 Years): 16

Top Topics

Multicommodity Flow Problems

Relaxation Algorithm

Top Venues

SIAM J. Discret. Math.

Electron. J. Comb.

Publications

Kristóf Bérczi, Attila Bernáth, Tamás Király, Gyula Pap
Blocking optimal structures. Discret. Math. 341 (7) (2018)
Attila Bernáth, Roland Grappe, Zoltán Szigeti
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. SIAM J. Discret. Math. 31 (1) (2017)
Attila Bernáth, Gyula Pap
Blocking optimal arborescences. Math. Program. 161 (1-2) (2017)
Attila Bernáth
Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczúr and Frank. Inf. Process. Lett. 128 (2017)
Attila Bernáth, Gyula Pap
Blocking unions of arborescences. Discret. Optim. 22 (2016)
Attila Bernáth, Tamás Király
-Arborescences. SODA (2016)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
A Note on $\mathtt{V}$-free 2-matchings. Electron. J. Comb. 23 (4) (2016)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
A note on $\mathtt{V}$-free $2$-matchings. CoRR (2015)
Attila Bernáth, Gyula Pap
Blocking optimal arborescences. CoRR (2015)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
Regular graphs are antimagic. CoRR (2015)
Attila Bernáth, Zoltán Király
On the tractability of some natural packing, covering and partitioning problems. Discret. Appl. Math. 180 (2015)
Attila Bernáth, Gyula Pap
Blocking unions of arborescences. CoRR (2015)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
Regular Graphs are Antimagic. Electron. J. Comb. 22 (3) (2015)
Attila Bernáth, Tamás Király
Blocking optimal k-arborescences. CoRR (2015)
Erika R. Bérczi-Kovács, Attila Bernáth
The complexity of the Clar number problem and an FPT algorithm. CoRR (2015)
Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka
The Generalized Terminal Backup Problem. SIAM J. Discret. Math. 29 (3) (2015)
Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski
Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem. SEA (2014)
Attila Bernáth, Yusuke Kobayashi
The Generalized Terminal Backup Problem. SODA (2014)
Attila Bernáth, Zoltán Király
On the tractability of some natural packing, covering and partitioning problems. CoRR (2014)
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
Algorithms for multiplayer multicommodity flow problems. Central Eur. J. Oper. Res. 21 (4) (2013)
Attila Bernáth, Gyula Pap
Blocking Optimal Arborescences. IPCO (2013)
Attila Bernáth, Roland Grappe, Zoltán Szigeti
Augmenting the Edge-Connectivity of a Hypergraph by Adding a Multipartite Graph. J. Graph Theory 72 (3) (2013)
Attila Bernáth, Tamás Király
A unifying approach to splitting-off. Comb. 32 (4) (2012)
Attila Bernáth, Roland Grappe, Zoltán Szigeti
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. SODA (2010)
Attila Bernáth, Tamás Király
Covering skew-supermodular functions by hypergraphs of minimum total size. Oper. Res. Lett. 37 (5) (2009)
Roland Grappe, Attila Bernáth, Zoltán Szigeti
Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph. Electron. Notes Discret. Math. 34 (2009)
Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti
Recent results on well-balanced orientations. Discret. Optim. 5 (4) (2008)
Attila Bernáth
Source location in undirected and directed hypergraphs. Oper. Res. Lett. 36 (3) (2008)
Attila Bernáth, Gwenaël Joret
Well-balanced orientations of mixed graphs. Inf. Process. Lett. 106 (4) (2008)
Attila Bernáth, Tamás Király
A New Approach to Splitting-Off. IPCO (2008)
Attila Bernáth, Henning Bruhn
Degree Constrained Orientations in Countable Graphs. Electron. J. Comb. 15 (1) (2008)
Attila Bernáth, Dániel Gerbner
Chain Intersecting Families. Graphs Comb. 23 (4) (2007)