• Publications
  • Influence
Regular Graphs are Antimagic
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 pairExpand
  • 21
  • 2
  • PDF
A note on the directed source location algorithm
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 positiveExpand
  • 3
  • 1
  • PDF
Blocking Optimal k-Arborescences
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 specialExpand
  • 5
  • 1
  • PDF
Scale Up in the Near-Well Region
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, anExpand
  • 17
  • 1
Covering skew-supermodular functions by hypergraphs of minimum total size
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'sExpand
  • 4
  • 1
The complexity of the Clar number problem and an FPT algorithm
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 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 setExpand
  • 11
  • PDF
The Generalized Terminal Backup Problem
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 aExpand
  • 6
Blocking unions of arborescences
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 alsoExpand
  • 4
  • PDF