default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAttila Bernáth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j19]Kristóf Bérczi
, Attila Bernáth, Tamás Király, Gyula Pap:
Blocking optimal structures. Discret. Math. 341(7): 1864-1872 (2018)- 2017
- [j18]Attila Bernáth:
Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczúr and Frank. Inf. Process. Lett. 128: 49-53 (2017) - [j17]Attila Bernáth, Gyula Pap:
Blocking optimal arborescences. Math. Program. 161(1-2): 583-601 (2017) - [j16]Attila Bernáth, Roland Grappe, Zoltán Szigeti:
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. SIAM J. Discret. Math. 31(1): 335-382 (2017) - 2016
- [j15]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
A Note on $\mathtt{V}$-free 2-matchings. Electron. J. Comb. 23(4): 4 (2016) - [j14]Attila Bernáth, Gyula Pap:
Blocking unions of arborescences. Discret. Optim. 22: 277-290 (2016) - [c6]Attila Bernáth, Tamás Király:
Blocking Optimal k-Arborescences. SODA 2016: 1682-1694 - 2015
- [j13]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
Regular Graphs are Antimagic. Electron. J. Comb. 22(3): 3 (2015) - [j12]Attila Bernáth, Zoltán Király:
On the tractability of some natural packing, covering and partitioning problems. Discret. Appl. Math. 180: 25-35 (2015) - [j11]Attila Bernáth, Yusuke Kobayashi, Tatsuya Matsuoka:
The Generalized Terminal Backup Problem. SIAM J. Discret. Math. 29(3): 1764-1782 (2015) - [i7]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
Regular graphs are antimagic. CoRR abs/1504.08146 (2015) - [i6]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
A note on $\mathtt{V}$-free $2$-matchings. CoRR abs/1505.03717 (2015) - [i5]Attila Bernáth, Gyula Pap:
Blocking optimal arborescences. CoRR abs/1506.05677 (2015) - [i4]Attila Bernáth, Gyula Pap:
Blocking unions of arborescences. CoRR abs/1507.00868 (2015) - [i3]Attila Bernáth, Tamás Király:
Blocking optimal k-arborescences. CoRR abs/1507.04207 (2015) - [i2]Erika R. Bérczi-Kovács, Attila Bernáth:
The complexity of the Clar number problem and an FPT algorithm. CoRR abs/1508.06889 (2015) - 2014
- [c5]Attila Bernáth, Yusuke Kobayashi:
The Generalized Terminal Backup Problem. SODA 2014: 1678-1686 - [c4]Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski:
Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem. SEA 2014: 74-86 - [i1]Attila Bernáth, Zoltán Király:
On the tractability of some natural packing, covering and partitioning problems. CoRR abs/1407.4999 (2014) - 2013
- [j10]Attila Bernáth, Tamás Király, Erika R. Kovács, Gergely Mádi-Nagy, Gyula Pap, Júlia Pap, Jácint Szabó, László A. Végh:
Algorithms for multiplayer multicommodity flow problems. Central Eur. J. Oper. Res. 21(4): 699-712 (2013) - [j9]Attila Bernáth, Roland Grappe, Zoltán Szigeti:
Augmenting the Edge-Connectivity of a Hypergraph by Adding a Multipartite Graph. J. Graph Theory 72(3): 291-312 (2013) - [c3]Attila Bernáth, Gyula Pap:
Blocking Optimal Arborescences. IPCO 2013: 74-85 - 2012
- [j8]Attila Bernáth, Tamás Király:
A unifying approach to splitting-off. Comb. 32(4): 373-401 (2012) - 2010
- [c2]Attila Bernáth, Roland Grappe, Zoltán Szigeti:
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. SODA 2010: 1512-1520
2000 – 2009
- 2009
- [j7]Roland Grappe, Attila Bernáth, Zoltán Szigeti:
Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph. Electron. Notes Discret. Math. 34: 173-177 (2009) - [j6]Attila Bernáth, Tamás Király:
Covering skew-supermodular functions by hypergraphs of minimum total size. Oper. Res. Lett. 37(5): 345-350 (2009) - 2008
- [j5]Attila Bernáth, Henning Bruhn:
Degree Constrained Orientations in Countable Graphs. Electron. J. Comb. 15(1) (2008) - [j4]Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti:
Recent results on well-balanced orientations. Discret. Optim. 5(4): 663-676 (2008) - [j3]Attila Bernáth, Gwenaël Joret:
Well-balanced orientations of mixed graphs. Inf. Process. Lett. 106(4): 149-151 (2008) - [j2]Attila Bernáth:
Source location in undirected and directed hypergraphs. Oper. Res. Lett. 36(3): 355-360 (2008) - [c1]Attila Bernáth, Tamás Király:
A New Approach to Splitting-Off. IPCO 2008: 401-415 - 2007
- [j1]Attila Bernáth, Dániel Gerbner:
Chain Intersecting Families. Graphs Comb. 23(4): 353-366 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
