World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
39
Citations
6665
World Ranking
9745
National Ranking
7

Mathematics

D-Index
39
Citations
6686
World Ranking
2193
National Ranking
12

Research.com Recognitions

  • 2018 - Member of Academia Europaea

Overview

Gábor Tardos is affiliated with the Alfréd Rényi Institute of Mathematics in Hungary. Their research primarily spans the fields of computer science and mathematics, with a significant focus on computational theory and mathematics as well as discrete mathematics and combinatorics. The scientist's work encompasses subfields such as electrical and electronic engineering, geometry and topology, and computer graphics and computer-aided design.

The main topics of Gábor Tardos's research include advanced graph theory research, limits and structures in graph theory, graph theory and CDMA systems, computational geometry and mesh generation, graph theory and applications, advanced combinatorial mathematics, and graph labeling and dimension problems.

Frequent collaborators in their research are János Pach, Gézá Tóth, Abhishek Methuku, Seth Pettie, and Dániel Gerbner. These co-authors have worked with Tardos on various projects, contributing to a series of academic papers and findings.

Gábor Tardos's publication record shows frequent contributions to prominent venues such as arXiv (Cornell University), the Journal of Combinatorial Theory Series B, COMBINATORICA, the Journal of the European Mathematical Society, and the Journal of Combinatorial Theory Series A. Notable recent papers include the following:

  • "Two extensions of the Erdős-Szekeres problem", 2020, Journal of the European Mathematical Society
  • "Turán problems for edge-ordered graphs", 2023, Journal of Combinatorial Theory Series B
  • "A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions", 2023, COMBINATORICA
  • "Successive vertex orderings of fully regular graphs", 2023, Journal of Combinatorial Theory Series A
  • "Convergence and Limits of Finite Trees", 2021, COMBINATORICA

In recognition of scientific contributions, Gábor Tardos was made a Member of Academia Europaea in 2018. This accolade reflects acknowledgment within the academic community.

Best Publications

  • On the power of randomization in on-line algorithms

    S. Ben-David;A. Borodin;R. Karp;G. Tardos

  • A constructive proof of the general lovász local lemma

    Robin A. Moser;Gábor Tardos

  • Optimal probabilistic fingerprint codes

    Gábor Tardos

  • Excluded permutation matrices and the Stanley-Wilf conjecture

    Adam Marcus;Gábor Tardos

  • Optimal probabilistic fingerprint codes

    Gábor Tardos

  • On the power of randomization in online algorithms

    S. Ben-David;A. Borodin;R. Karp;G. Tardos

  • Tight bounds for Lp samplers, finding duplicates in streams, and related problems

    Hossein Jowhari;Mert Sağlam;Gábor Tardos

  • Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs

    Janos Pach;Rados Radoicic;Gabor Tardos;Geza Toth

  • On the maximum number of edges in quasi-planar graphs

    Eyal Ackerman;Gábor Tardos

  • Conflict-free colourings of graphs and hypergraphs

    JÁnos Pach;GÁbor Tardos

  • Local Chromatic Number, KY Fan's Theorem, And Circular Colorings

    Gábor Simonyi;Gábor Tardos

  • Polynomial bound for a chip firing game on graphs

    Gábor Tardos

  • Forbidden paths and cycles in ordered graphs and matrices

    János Pach;Gábor Tardos

  • Query complexity, or why is it difficult to separateNP A ∩coNP A fromP A by random oraclesA?

    Gábor Tardos

  • Extremal Problems For Transversals In Graphs With Bounded Degree

    Tibor Szabó;Gábor Tardos

  • High rate fingerprinting codes and the fingerprinting capacity

    Ehsan Amiri;Gábor Tardos

  • An improved bound for k-sets in three dimensions

    Micha Sharir;Shakhar Smorodinsky;Gábor Tardos

  • An Improved Bound for k-Sets in Three Dimensions

    M. Sharir;S. Smorodinsky;G. Tardos

  • A new entropy inequality for the Erd os distance problem

    Unknown

  • On 0-1 matrices and small excluded submatrices

    Gábor Tardos

  • Tight lower bounds for the size of epsilon-nets

    János Pach;Gábor Tardos

  • On the Power of Randomization in Online Algorithms (Extended Abstract)

    Shai Ben-David;Allan Borodin;Richard M. Karp;Gábor Tardos

Frequent Co-Authors

János Pach
János Pach Alfréd Rényi Institute of Mathematics
Joel Spencer
Joel Spencer Courant Institute of Mathematical Sciences
Benjamin Doerr
Benjamin Doerr École Polytechnique
Micha Sharir
Micha Sharir Tel Aviv University
Nathan Linial
Nathan Linial Hebrew University of Jerusalem
Erez Petrank
Erez Petrank Technion – Israel Institute of Technology
Avi Wigderson
Avi Wigderson Institute for Advanced Study
Ran Raz
Ran Raz Princeton University
Noga Alon
Noga Alon Tel Aviv University
Richard M. Karp
Richard M. Karp University of California, Berkeley

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing mathematics in the USA, exploring related online degrees can open doors to diverse career opportunities. Finance professionals, for example, benefit from affordable advanced education options like the cheap online masters in finance, which balance cost-effectiveness and academic rigor.

Similarly, those aiming to enhance leadership skills alongside their quantitative expertise might consider accelerated business education options. Programs such as the fastest online mba and 12 month mba programs offer efficient pathways to elevate a mathematical background with essential management knowledge.

Students interested in the intersection of analytics and marketing can leverage specialized training through degrees like the ms in digital marketing degree cost tuition fees, which emphasize data-driven decision-making and are designed to be affordable and rewarding.

Integrating these online degrees with a strong foundation in mathematics allows for versatile career pathways in finance, marketing, and business administration, meeting the demands of modern industries while maintaining flexibility in learning.

Best Scientists Citing Gábor Tardos

Trending Scientists