The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tibor Szabó: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Robert Berke, Tibor Szabó
    Deciding Relaxed Two-Colorability - A Hardness Jump. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:124-135 [Conf]
  2. Ingo Schurr, Tibor Szabó
    Finding the Sink Takes Some Time. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:833-844 [Conf]
  3. Jirí Matousek, Tibor Szabó
    Random Edge Can Be Exponential on Abstract Cubes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:92-100 [Conf]
  4. Tibor Szabó, Emo Welzl
    Unique Sink Orientations of Cubes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:547-555 [Conf]
  5. Ingo Schurr, Tibor Szabó
    Jumping Doesn't Help in Abstract Cubes. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:225-235 [Conf]
  6. Sarolta Dibuz, Tibor Szabó, Zsolt Torpis
    BCMP Performance Test with TTCN-3 Mobile Node Emulator. [Citation Graph (0, 0)][DBLP]
    TestCom, 2004, pp:50-59 [Conf]
  7. László Babai, Anna Gál, János Kollár, Lajos Rónyai, Tibor Szabó, Avi Wigderson
    Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:603-611 [Conf]
  8. János Kollár, Lajos Rónyai, Tibor Szabó
    Norm-Graphs and Bipartite Turán Numbers. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:3, pp:399-406 [Journal]
  9. Michael Krivelevich, Benny Sudakov, Tibor Szabó
    Triangle Factors In Sparse Pseudo-Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:403-426 [Journal]
  10. Tibor Szabó, Gábor Tardos
    Extremal Problems For Transversals In Graphs With Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:3, pp:333-351 [Journal]
  11. Tibor Szabó, Gábor Tardos
    A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:6, pp:- [Journal]
  12. Ingo Schurr, Tibor Szabó
    Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound for Finding the Sink of Unique Sink Oriented Cubes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:4, pp:627-642 [Journal]
  13. Tibor Szabo'
    Intersection Properties of Subsets of Integers. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:5, pp:429-444 [Journal]
  14. Dan Hefetz, Michael Krivelevich, Tibor Szabó
    Bart-Moe games, JumbleG and discrepancy. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:4, pp:1131-1143 [Journal]
  15. Tibor Szabó, Van H. Vu
    Exact k-Wise Intersection Theorems. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:2, pp:247-261 [Journal]
  16. Tibor Szabó
    On the spectrum of projective norm-graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:2, pp:71-74 [Journal]
  17. Noga Alon, Lajos Rónyai, Tibor Szabó
    Norm-Graphs: Variations and Applications. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:76, n:2, pp:280-290 [Journal]
  18. Penny E. Haxell, Tibor Szabó, Gábor Tardos
    Bounded size components--partitions and transversals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:281-297 [Journal]
  19. Ákos Seress, Tibor Szabó
    Dense Graphs with Cycle Neighborhoods. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:2, pp:281-293 [Journal]
  20. Milos Stojakovic, Tibor Szabó
    Positional games on random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:1-2, pp:204-223 [Journal]
  21. Tibor Szabó, Van H. Vu
    Turán's theorem in sparse random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:3, pp:225-234 [Journal]
  22. Benny Sudakov, Tibor Szabó, Van H. Vu
    A generalization of Turán's theorem. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:3, pp:187-195 [Journal]
  23. Tibor Szabó
    On nearly regular co-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:279-281 [Journal]
  24. Dan Hefetz, Michael Krivelevich, Tibor Szabó
    Avoider-Enforcer games. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2007, v:114, n:5, pp:840-853 [Journal]
  25. Robert Berke, Tibor Szabó
    Relaxed two-coloring of cubic graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:652-668 [Journal]

  26. Discrepancy Games. [Citation Graph (, )][DBLP]


  27. The Local Lemma Is Tight for SAT [Citation Graph (, )][DBLP]


  28. Odd Independent Transversals are Odd. [Citation Graph (, )][DBLP]


  29. Deciding Relaxed Two-Colourability: A Hardness Jump. [Citation Graph (, )][DBLP]


  30. Vizing's conjecture for chordal graphs. [Citation Graph (, )][DBLP]


Search in 0.098secs, Finished in 0.100secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002