Attila Bernáth

Address:   Tel:   Email: athos_at_cs.elte.hu   Home page: http://www.cs.elte.hu/~athos/   Publication list: http://www.cs.elte.hu/~athos/publist.html

Interests

• source location type problems
• orientation problems with edge-connectivity type requirements
• problems

List of EGRES technical reports

• Blocking optimal structures (Kristóf Bérczi, Attila Bernáth, Tamás Király, Gyula Pap)
• The complexity of the Clar number problem and an FPT algorithm (Erika Renáta Bérczi-Kovács, Attila Bernáth)
• Blocking optimal k-arborescences (Attila Bernáth, Tamás Király)
• Blocking optimal arborescences (Attila Bernáth, Gyula Pap)
• Nonseparating cycles in planar and Eulerian graphs (Attila Bernáth, Marcin Kaminski)
• Blocking unions of arborescences (Attila Bernáth, Gyula Pap)
• The Generalized Terminal Backup Problem (Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka)
• Algorithms for multiplayer multicommodity flow problems (Attila Bernáth, Tamás Király, Erika Renáta Bérczi-Kovács, Gergely Mádi-Nagy, Gyula Pap, Júlia Pap, Jácint Szabó, László Végh)
• Covering minimum cost arborescences (Attila Bernáth, Gyula Pap)
• Special skew-supermodular functions and a generalization of Mader's splitting-off theorem (Attila Bernáth, Tamás Király, László Végh)
• On the tractability of some natural packing, covering and partitioning problems (Attila Bernáth, Zoltán Király)
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph (Attila Bernáth, Roland Grappe, Zoltán Szigeti)
• A simple proof of a theorem of Benczúr and Frank (Attila Bernáth)
• Covering symmetric skew-supermodular functions with hyperedges (Attila Bernáth, Tamás Király)
• A new approach to splitting-off (Attila Bernáth, Tamás Király)
• Source location in undirected and directed hypergraphs (Attila Bernáth)
• Recent results on well-balanced orientations (Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti)
• Hardness results for well-balanced orientations (Attila Bernáth)
• A note on the directed source location algorithm (Attila Bernáth)

List of EGRES quick proofs

• A note on V-free 2-matchings (Kristóf Bérczi, Attila Bernáth, Máté Vizer)
• Regular graphs are antimagic (Kristóf Bérczi, Attila Bernáth, Máté Vizer)
• NP-hardness of the Clar number in general plane graphs (Attila Bernáth, Erika Renáta Bérczi-Kovács)
• Finding edge-disjoint subgraphs in graphs (Attila Bernáth, Zoltán Király)
• Node-to-area connectivity augmentation of hypergraphs without increasing the rank (Attila Bernáth)
• Well-balanced orientations of mixed graphs (Attila Bernáth, Gwenaël Joret)

---

Last modification: 18.4.2024. Please email your comments to Tamás Király!