List of publications
Attila Bernáth

In refereed journals

[1] Attila Bernáth and Dániel Gerbner. Chain intersecting families. Graphs Combin., 23(4):353-366, 2007. [ bib | .pdf ]
[2] Attila Bernáth. A representation for intersecting families. Mat. Lapok (N.S.), 13(1):6-12, 2006/07. (Hungarian, with English summary). [ bib | .pdf ]
[3] Attila Bernáth. On a problem in extremal set theory. Mat. Lapok (N.S.), 10(2):2-4 (2005), 2000/01. (Hungarian, with English summary). [ bib | .pdf ]
[4] Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, and Zoltán Szigeti. Recent results on well-balanced orientations. Discrete Optimization, 5(4):663-676, 2008. EGRES Technical Report version TR 2006-11, www.cs.elte.hu/egres. [ bib | .pdf ]
[5] Attila Bernáth. Source location in undirected and directed hypergraphs. Oper. Res. Lett., 36(3):355-360, 2008. (Preliminary version: EGRES technical report "TR-2006-12" at www.cs.elte.hu/egres.). [ bib | .pdf ]
[6] Attila Bernáth and Henning Bruhn. Degree constrained orientations in countable graphs. Electron. J. Combin., 15(1):Research Paper 122, 11, 2008. [ bib | .html | .pdf ]
[7] Attila Bernáth and Gwenaël Joret. Well-balanced orientations of mixed graphs. Inf. Process. Lett., 106(4):149-151, 2008. (See the EGRES Quick Proof version "QP-2007-01" at www.cs.elte.hu/egres.). [ bib | .pdf ]
[8] Attila Bernáth and Tamás Király. Covering skew-supermodular functions by hypergraphs of minimum total size. Operations Research Letters, 37(5):345 - 350, 2009. Preliminary version: EGRES Report TR-2008-05 www.cs.elte.hu/egres. [ bib | DOI | http ]
[9] Attila Bernáth and Tamás Király. A unifying approach to splitting-off. Combinatorica, 32:373-401, 2012. 10.1007/s00493-012-2548-8. [ bib | http ]
[10] Attila Bernáth, Roland Grappe, and Zoltán Szigeti. Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph. Journal of Graph Theory, 72(3):291-312, 2013. [ bib | DOI | http ]
Keywords: edge-connectivity augmentation, hypergraphs, partition constraints
[11] Attila Bernáth, Tamás Király, Erika Renáta Kovács, Gergely Mádi-Nagy, Gyula Pap, Júlia Pap, Jácint Szabó, and László Végh. Algorithms for multiplayer multicommodity flow problems. Central European Journal of Operations Research, pages 1-14, 2012. [ bib | DOI | http ]
Keywords: Optimization; Multicommodity flows; Equilibria

This file was generated by bibtex2html 1.96.

In conference proceedings

[1] Roland Grappe, Attila Bernáth, and Zoltán Szigeti. Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph. In European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), volume 34 of Electron. Notes Discrete Math., pages 173-177. Elsevier Sci. B. V., Amsterdam, 2009. Accepted at the Journal of Graph Theory. [ bib ]
[2] Attila Bernáth, Roland Grappe, and Zoltán Szigeti. Partition constrained covering of a symmetric crossing supermodular function by a graph. In Moses Charikar, editor, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, Lecture Notes in Computer Science, pages 1512-1520. SIAM, 2010. [ bib ]
[3] Attila Bernáth and Zoltán Király. On the tractability of some natural packing, covering and partitioning problems. In Proceedings of the 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, May 31 - June 3, 2011, RIMS, Kyoto University, Kyoto, Japan, pages 19-28, 2011. Full version available as the EGRES Technical Report TR-2011-05 from www.cs.elte.hu/egres. [ bib ]
[4] Attila Bernáth and Gyula Pap. Blocking optimal arborescences. In Integer Programming and Combinatorial Optimization, pages 74-85. Springer Berlin Heidelberg, 2013. [ bib ]
[5] Tamás Király, Attila Bernáth, László Végh, Lajos Bajzik, Erika Kovács, Kristóf Bérczi, A Jüttner, and Tibor Jordán. Worst case bin packing for otn electrical layer networks dimensioning. In Transparent Optical Networks (ICTON), 2011 13th International Conference on, pages 1-6. IEEE, 2011. [ bib ]

This file was generated by bibtex2html 1.96.

Phd thesis

[1] Attila Bernáth. Edge-connectivity augmentation of graphs and hypergraphs. PhD thesis, Eötvös Loránd University, 2009. [ bib | http ]

This file was generated by bibtex2html 1.96.

Technical reports

[1] Attila Bernáth. Node-to-area connectivity augmentation of hypergraphs without increasing the rank. Technical Report QP-2009-02, Egerváry Research Group, Budapest, 2009. "www.cs.elte.hu/egres, see also: Attila Bernáth and Tamás Király, The node-to-area connectivity augmentation problem: related questions and results, Proceedings of the 6th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, 2009, Budapest". [ bib ]
[2] Attila Bernáth. A note on the directed source location algorithm. Technical Report TR-2004-12, Egerváry Research Group, Budapest, 2004. www.cs.elte.hu/egres. [ bib | .pdf ]
[3] Attila Bernáth. Hardness results for well-balanced orientations. Technical Report TR-2006-05, Egerváry Research Group, Budapest, 2006. www.cs.elte.hu/egres. [ bib | .pdf ]
[4] Attila Bernáth. A simple proof of a theorem of Benczúr and Frank. Technical Report TR-2009-02, Egerváry Research Group, Budapest, 2009. www.cs.elte.hu/egres. [ bib ]
[5] Attila Bernáth and Zoltán Király. Finding edge-disjoint subgraphs in graphs. Technical Report QP-2010-04, Egerváry Research Group, Budapest, 2010. www.cs.elte.hu/egres. [ bib ]
[6] Attila Bernáth, Tamás Király, and László Végh. Special skew-supermodular functions and a generalization of mader's splitting-off theorem. Technical Report TR-2011-10, Egerváry Research Group, Budapest, 2011. www.cs.elte.hu/egres. [ bib ]
[7] Attila Bernáth and Gyula Pap. Covering minimum cost arborescences. Technical Report TR-2011-13, Egerváry Research Group, Budapest, 2011. www.cs.elte.hu/egres. [ bib ]
[8] Attila Bernáth and Erika Kovács Renáta. NP-hardness of the Clar number in general plane graphs. Technical Report QP-2011-07, Egerváry Research Group, Budapest, 2011. www.cs.elte.hu/egres. [ bib ]

This file was generated by bibtex2html 1.96.