E-LIB Suche - Ergebnisse für: Csaba, Béla

1

KESZTYŰS LÓRÁND KÓRÉLETTAN PROFESSZOR, AZ 1951-BEN FÜGGTLEN..:

Csaba, Béla ; Fésüs, László ; Muszbek, László.
Gerundium. 13 (2022) 3-4 - p. 22-53 , 2022

2

A discrepancy version of the Hajnal–Szemerédi theorem:

Balogh, József ; Csaba, Béla ; Pluhár, András.
Combinatorics, Probability and Computing. 30 (2020) 3 - p. 444-459 , 2020

Link: https://doi.org/10.1017/..

3

On the Relation of Separability, Bandwidth and Embedding:

Csaba, Béla ; Vásárhelyi, Bálint
Graphs and Combinatorics. 35 (2019) 6 - p. 1541-1553 , 2019

Link: https://doi.org/10.1007/..

4

Embedding Graphs Having Ore-Degree at Most Five:

Csaba, Béla ; Nagy-György, Judit
SIAM Journal on Discrete Mathematics. 33 (2019) 1 - p. 474-508 , 2019

Link: https://doi.org/10.1137/..

5

On the path separation number of graphs:

Balogh, József ; Csaba, Béla ; Martin, Ryan R..
Discrete Applied Mathematics. 213 (2016) - p. 26-33 , 2016

Link: https://doi.org/10.1016/..

6

Empirical investigation of SEA-based dependence cluster pro..:

Beszédes, Árpád ; Schrettner, Lajos ; Csaba, Béla...
Science of Computer Programming. 105 (2015) - p. 3-25 , 2015

Link: https://doi.org/10.1016/..

7

A Weighted Regularity Lemma with Applications:

Csaba, Béla ; Pluhár, András
International Journal of Combinatorics. 2014 (2014) - p. 1-9 , 2014

Link: https://doi.org/10.1155/..

8

Optimal random matchings, tours, and spanning trees in hier..:

Csaba, Béla ; Plick, Thomas A. ; Shokoufandeh, Ali
Theoretical Computer Science. 500 (2013) - p. 68-89 , 2013

Link: https://doi.org/10.1016/..

9

Approximate multipartite version of the Hajnal–Szemerédi th..:

Csaba, Béla ; Mydlarz, Marcelo
Journal of Combinatorial Theory, Series B. 102 (2012) 2 - p. 395-410 , 2012

Link: https://doi.org/10.1016/..

10

Local resilience of almost spanning trees in random graphs:

Balogh, József ; Csaba, Béla ; Samotij, Wojciech
Random Structures & Algorithms. 38 (2010) 1-2 - p. 121-139 , 2010

Link: https://doi.org/10.1002/..

11

On embedding well-separable graphs:

Csaba, Béla
Discrete Mathematics. 308 (2008) 19 - p. 4322-4331 , 2008

Link: https://doi.org/10.1016/..

12

A randomized algorithm for the on-line weighted bipartite m..:

Csaba, Béla ; Pluhár, András
Journal of Scheduling. 11 (2007) 6 - p. 449-455 , 2007

Link: https://doi.org/10.1007/..

13

A randomized on–line algorithm for thek–server problem on a..:

Csaba, Béla ; Lodha, Sachin
Random Structures and Algorithms. 29 (2006) 1 - p. 82-104 , 2006

Link: https://doi.org/10.1002/..

14

Proof of a Conjecture of Bollobás and Eldridge for Graphs o..:

Csaba†‡, Béla ; Shokoufandeh‡, Ali ; Szemerédi, Endre
COMBINATORICA. 23 (2003) 1 - p. 35-72 , 2003

Link: https://doi.org/10.1007/..

15

Approximability of dense and sparse instances of minimum 2-..:

, In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms,

Csaba, Béla ; Karpinski, Marek ; Krysta, Piotr - p. 74-83 , 2002

Link: https://dl.acm.org/doi/1..