 | 2009 |
|---|
| 11 |       | István Bíró,
Dávid Siklósi,
Jácint Szabó,
András A. Benczúr:
Linked latent Dirichlet allocation in web spam filtering.
AIRWeb 2009: 37-40 |
| 10 | | István Bíró,
Jácint Szabó:
Latent Dirichlet Allocation for Automatic Document Categorization.
ECML/PKDD (2) 2009: 430-441 |
| 9 | | Jácint Szabó:
Good characterizations for some degree constrained subgraphs.
J. Comb. Theory, Ser. B 99(2): 436-446 (2009) |
| 2008 |
|---|
| 8 | | István Bíró,
Jácint Szabó,
András A. Benczúr:
Latent dirichlet allocation in web spam filtering.
AIRWeb 2008: 29-32 |
| 7 | | István Bíró,
András A. Benczúr,
Jácint Szabó,
Ana Gabriela Maguitman:
A Comparative Analysis of Latent Variable Models for Web Page Classification.
LA-WEB 2008: 23-28 |
| 6 | | András Frank,
Lap Chi Lau,
Jácint Szabó:
A note on degree-constrained subgraphs.
Discrete Mathematics 308(12): 2647-2648 (2008) |
| 5 | | Jácint Szabó:
Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski.
SIAM J. Discrete Math. 22(3): 854-860 (2008) |
| 2007 |
|---|
| 4 | | Márton Makai,
Gyula Pap,
Jácint Szabó:
Matching Problems in Polymatroids Without Double Circuits.
IPCO 2007: 167-181 |
| 2006 |
|---|
| 3 | | David Hartvigsen,
Pavol Hell,
Jácint Szabó:
The k-piece packing problem.
Journal of Graph Theory 52(4): 267-293 (2006) |
| 2 | | Johanna Becker,
Zsolt Csizmadia,
Jérôme Galtier,
Alexandre Laugier,
Jácint Szabó,
László Szegö:
An integer programming approach to routing in daisy networks.
Networks 47(2): 116-121 (2006) |
| 2005 |
|---|
| 1 | | Marek Janata,
Martin Loebl,
Jácint Szabó:
The Edmonds-Gallai Decomposition for the k-Piece Packing Problem.
Electr. J. Comb. 12: (2005) |
