Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Regular Graphs are Antimagic

- Kristóf Bérczi, A. Bernáth, Máté Vizer
- Computer Science, Mathematics
- Electron. J. Comb.
- 30 April 2015

An undirected simple graph $G=(V,E)$ is called antimagic if there exists an injective function $f:E\rightarrow\{1,\dots,|E|\}$ such that $\sum_{e\in E(u)} f(e)\neq\sum_{e\in E(v)} f(e)$ for any pair… Expand

A note on the directed source location algorithm

- A. Bernáth
- Mathematics
- 2011

Recently Barasz, Becker and Frank gave a strongly polynomial time algorithm that solves the Directed Source Location Problem which is the following: given a directed graph D = (V,A) and positive… Expand

- 3
- 1
- PDF

Blocking Optimal k-Arborescences

- A. Bernáth, T. Király
- Mathematics, Computer Science
- SODA
- 15 July 2015

The problem of covering minimum cost common bases of two matroids is NP-complete, even if the two matroids coincide, and the costs are all equal to 1. In this paper we show that the following special… Expand

Scale Up in the Near-Well Region

- L. J. Durlofsky, W. Milliken, A. Bernáth
- Computer Science
- 1999

A process wherein an elongated area selected in proximity to the bearing surface of a bearing member is roughened in comparison with other area encircling partially or wholly the bearing surface, an… Expand

Covering skew-supermodular functions by hypergraphs of minimum total size

- A. Bernáth, T. Király
- Mathematics, Computer Science
- Oper. Res. Lett.
- 1 September 2009

The paper presents results related to a theorem of Szigeti on covering symmetric skew-supermodular set functions by hypergraphs. We prove the following generalization using a variation of Schrijver's… Expand

The complexity of the Clar number problem and an FPT algorithm

- Erika R. Kovács, Attila Bernáth
- Mathematics, Computer Science
- ArXiv
- 27 August 2015

The Clar number of a (hydro)carbon molecule, introduced by Clar [E. Clar, \emph{The aromatic sextet}, (1972).], is the maximum number of mutually disjoint resonant hexagons in the molecule.… Expand

- 1
- 1

A New Approach to Splitting-Off

- A. Bernáth, T. Király
- Computer Science, Mathematics
- IPCO
- 26 May 2008

A new approach to undirected splitting-off is presented in this paper. We study the behaviour of splitting-off algorithms when applied to the problem of covering a symmetric skew-supermodular set… Expand

The Generalized Terminal Backup Problem

- A. Bernáth, Y. Kobayashi
- Mathematics, Computer Science
- SODA
- 5 January 2014

We consider the following network design problem, that we call the Generalized Terminal Backup Problem. Given a graph (or a hypergraph) G0 = (V, E0), a set of (at least 2) terminals T ⊆ V and a… Expand

Blocking unions of arborescences

- A. Bernáth, G. Pap
- Mathematics, Computer Science
- ArXiv
- 3 July 2015

Given a digraph $D=(V,A)$ and a positive integer $k$, a subset $B\subseteq A$ is called a \textbf{$k$-union-arborescence}, if it is the disjoint union of $k$ spanning arborescences. When also… Expand