Attila Bernáth

Orcid: 0000-0003-4574-4129

According to our database1, Attila Bernáth authored at least 24 papers between 2007 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Blocking optimal structures.
Discret. Math., 2018

2017
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph.
SIAM J. Discret. Math., 2017

Blocking optimal arborescences.
Math. Program., 2017

Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczúr and Frank.
Inf. Process. Lett., 2017

2016
Blocking unions of arborescences.
Discret. Optim., 2016

A Note on $\mathtt{V}$-free 2-matchings.
Electron. J. Comb., 2016

Blocking Optimal <i>k</i>-Arborescences.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
The Generalized Terminal Backup Problem.
SIAM J. Discret. Math., 2015

On the tractability of some natural packing, covering and partitioning problems.
Discret. Appl. Math., 2015

Blocking optimal k-arborescences.
CoRR, 2015

The complexity of the Clar number problem and an FPT algorithm.
CoRR, 2015

Regular Graphs are Antimagic.
Electron. J. Comb., 2015

2014
Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

The Generalized Terminal Backup Problem.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Algorithms for multiplayer multicommodity flow problems.
Central Eur. J. Oper. Res., 2013

2012
A unifying approach to splitting-off.
Comb., 2012

2009
Covering skew-supermodular functions by hypergraphs of minimum total size.
Oper. Res. Lett., 2009

Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph.
Electron. Notes Discret. Math., 2009

2008
Source location in undirected and directed hypergraphs.
Oper. Res. Lett., 2008

Well-balanced orientations of mixed graphs.
Inf. Process. Lett., 2008

Recent results on well-balanced orientations.
Discret. Optim., 2008

Degree Constrained Orientations in Countable Graphs.
Electron. J. Comb., 2008

A New Approach to Splitting-Off.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007
Chain Intersecting Families.
Graphs Comb., 2007


  Loading...