default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBéla Csaba
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Béla Csaba, Judit Nagy-György:
On the Advice Complexity of Online Matching on the Line. CoRR abs/2408.11161 (2024)- 2021
- [j21]József Balogh, Béla Csaba, András Pluhár, Andrew Treglown:
A discrepancy version of the Hajnal-Szemerédi theorem. Comb. Probab. Comput. 30(3): 444-459 (2021) - 2020
- [j20]József Balogh, Béla Csaba, Yifan Jing
, András Pluhár:
On the Discrepancies of Graphs. Electron. J. Comb. 27(2): 2 (2020)
2010 – 2019
- 2019
- [j19]Béla Csaba, Bálint Vásárhelyi:
On the Relation of Separability, Bandwidth and Embedding. Graphs Comb. 35(6): 1541-1553 (2019) - [j18]Béla Csaba, Bálint Vásárhelyi:
On embedding degree sequences. Informatica (Slovenia) 43(1) (2019) - [j17]Béla Csaba, Judit Nagy-György:
Embedding Graphs Having Ore-Degree at Most Five. SIAM J. Discret. Math. 33(1): 474-508 (2019) - 2016
- [j16]József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár:
On the path separation number of graphs. Discret. Appl. Math. 213: 26-33 (2016) - 2015
- [j15]Árpád Beszédes, Lajos Schrettner, Béla Csaba, Tamás Gergely, Judit Jász, Tibor Gyimóthy:
Empirical investigation of SEA-based dependence cluster properties. Sci. Comput. Program. 105: 3-25 (2015) - 2013
- [j14]Béla Csaba, Thomas A. Plick, Ali Shokoufandeh:
Optimal random matchings, tours, and spanning trees in hierarchically separated trees. Theor. Comput. Sci. 500: 68-89 (2013) - [c4]Béla Csaba, Lajos Schrettner, Árpád Beszédes, Judit Jász, Péter Hegedüs, Tibor Gyimóthy:
Relating Clusterization Measures and Software Quality. CSMR 2013: 345-348 - [c3]Árpád Beszédes, Lajos Schrettner, Béla Csaba, Tamás Gergely, Judit Jász, Tibor Gyimóthy:
Empirical investigation of SEA-based dependence cluster properties. SCAM 2013: 1-10 - [i2]Béla Csaba, Thomas A. Plick, Ali Shokoufandeh:
Optimal Random Matchings, Tours, and Spanning Trees in Hierarchically Separated Trees. CoRR abs/1307.6939 (2013) - 2012
- [j13]Béla Csaba, Thomas A. Plick, Ali Shokoufandeh:
A note on the Caro-Tuza bound on the independence number of uniform hypergraphs. Australas. J Comb. 52: 235-242 (2012) - [j12]Béla Csaba, Marcelo Mydlarz:
Approximate multipartite version of the Hajnal-Szemerédi theorem. J. Comb. Theory B 102(2): 395-410 (2012) - 2011
- [j11]József Balogh, Béla Csaba, Wojciech Samotij:
Local resilience of almost spanning trees in random graphs. Random Struct. Algorithms 38(1-2): 121-139 (2011) - 2010
- [j10]József Balogh, Béla Csaba, Martin Pei, Wojciech Samotij:
Large Bounded Degree Trees in Expanding Graphs. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2008
- [j9]Béla Csaba:
On embedding well-separable graphs. Discret. Math. 308(19): 4322-4331 (2008) - [j8]Béla Csaba, András Pluhár:
A randomized algorithm for the on-line weighted bipartite matching problem. J. Sched. 11(6): 449-455 (2008) - [c2]Jeff Abrahamson, Béla Csaba, Ali Shokoufandeh:
Optimal Random Matchings on Trees and Applications. APPROX-RANDOM 2008: 254-265 - 2007
- [j7]Béla Csaba:
Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree. Electron. J. Comb. 14(1) (2007) - [j6]Béla Csaba:
On the Bollobás-Eldridge Conjecture for Bipartite Graphs. Comb. Probab. Comput. 16(5): 661-691 (2007) - [i1]Béla Csaba, András Pluhár:
A randomized algorithm for the on-line weighted bipartite matching problem. CoRR abs/0705.4673 (2007) - 2006
- [j5]Béla Csaba, Sachin Lodha:
A randomized on-line algorithm for the k-server problem on a line. Random Struct. Algorithms 29(1): 82-104 (2006) - 2003
- [j4]Béla Csaba, Ali Shokoufandeh, Endre Szemerédi:
Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three. Comb. 23(1): 35-72 (2003) - 2002
- [c1]Béla Csaba, Marek Karpinski, Piotr Krysta:
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. SODA 2002: 74-83 - 2000
- [j3]Béla Csaba:
Note on the Work Function Algorithm. Acta Cybern. 14(3): 503-506 (2000)
1990 – 1999
- 1999
- [j2]Béla Csaba:
On the Partitioning Algorithm. Acta Cybern. 14(2): 217-227 (1999) - 1997
- [j1]Béla Csaba, G. Dányi:
Server Problems and Regular Languages. Acta Cybern. 13(1): 23-39 (1997)
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-09-26 01:01 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:
