Attila Bernáth
Attila Bernáth
Lufthansa Sytems Hungária Ltd.
Verified email at cs.elte.hu - Homepage
Title
Cited by
Cited by
Year
Regular graphs are antimagic
K Bérczi, A Bernáth, M Vizer
arXiv preprint arXiv:1504.08146, 2015
302015
Blocking Optimal k-Arborescences
A Bernáth, T Király
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
152016
A new approach to splitting-off
A Bernáth, T Király
International Conference on Integer Programming and Combinatorial …, 2008
132008
The complexity of the Clar number problem and an exact algorithm
ER Bérczi-Kovács, A Bernáth
Journal of Mathematical Chemistry 56 (2), 597-605, 2018
92018
Partition constrained covering of a symmetric crossing supermodular function by a graph
A Bernáth, R Grappe, Z Szigeti
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
7*2010
Recent results on well-balanced orientations
A Bernáth, S Iwata, T Király, Z Király, Z Szigeti
Discrete Optimization 5 (4), 663-676, 2008
72008
Well-balanced orientations of mixed graphs
A Bernáth, G Joret
Information processing letters 106 (4), 149-151, 2008
62008
Chain intersecting families
A Bernáth, D Gerbner
Graphs and Combinatorics 23 (4), 353-366, 2007
62007
Finding edge-disjoint subgraphs in graphs
A Bernáth, Z Király
Egres Quick Proof 4, 3, 2010
52010
A note on the directed source location algorithm
A Bernáth
Technical report, TR-2004-12, Egerváry Research Group, Budapest, 2004
52004
The generalized terminal backup problem
A Bernáth, Y Kobayashi, T Matsuoka
SIAM Journal on Discrete Mathematics 29 (3), 1764-1782, 2015
42015
Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph
A Bernáth, R Grappe, Z Szigeti
Journal of Graph Theory 72 (3), 291-312, 2013
42013
Blocking unions of arborescences
A Bernáth, G Pap
Discrete Optimization 22, 277-290, 2016
32016
On the tractability of some natural packing, covering and partitioning problems
A Bernáth, Z Király
Discrete Applied Mathematics 180, 25-35, 2015
32015
Algorithms for multiplayer multicommodity flow problems
A Bernáth, T Király, ER Kovács, G Mádi-Nagy, G Pap, J Pap, J Szabó, ...
Central European Journal of Operations Research 21 (4), 699-712, 2013
32013
NP-hardness of the Clar number in general plane graphs
A Bernáth, ER Kovács
32011
Covering skew-supermodular functions by hypergraphs of minimum total size
A Bernáth, T Király
Operations research letters 37 (5), 345-350, 2009
32009
Source location in undirected and directed hypergraphs
A Bernáth
Operations research letters 36 (3), 355-360, 2008
32008
Hardness results for well-balanced orientations
A Bernáth
Tech. Report TR-2006-05, Egerváry Research Group, Budapest, 2006, www. cs …, 2006
32006
The complexity of the Clar number problem and an FPT algorithm
ER Bérczi-Kovács, A Bernáth
arXiv preprint arXiv:1508.06889, 2015
22015
The system can't perform the operation now. Try again later.
Articles 1–20