Zdeněk Dvořák
#77,138
Most Influential Person Now
Czech mathematician
Zdeněk Dvořák's AcademicInfluence.com Rankings
Zdeněk Dvořákmathematics Degrees
Mathematics
#4250
World Rank
#6078
Historical Rank
Group Theory
#288
World Rank
#337
Historical Rank
Algebra
#651
World Rank
#858
Historical Rank
Measure Theory
#3691
World Rank
#4354
Historical Rank
Download Badge
Mathematics
Zdeněk Dvořák's Degrees
- PhD Mathematics Charles University
- Masters Mathematics Charles University
Why Is Zdeněk Dvořák Influential?
(Suggest an Edit or Addition)According to Wikipedia, Zdeněk Dvořák is a Czech mathematician specializing in graph theory. Dvořák was born in Nové Město na Moravě. He competed on the Czech national team in the 1999 International Mathematical Olympiad, and in the same year in the International Olympiad in Informatics, where he won a gold medal. He earned his Ph.D. in 2007 from Charles University in Prague, under the supervision of Jaroslav Nešetřil. He remained as a research fellow at Charles University until 2010, and then did postdoctoral studies at the Georgia Institute of Technology and Simon Fraser University. He then returned to the Computer Science Institute of Charles University, obtained his habilitation in 2012, and has been a full professor there since 2022.
Zdeněk Dvořák's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (2015) (174)
- Testing first-order properties for subclasses of sparse graphs (2011) (106)
- Deciding First-Order Properties for Sparse Graphs (2010) (101)
- Coloring squares of planar graphs with girth six (2008) (86)
- Constant-factor approximation of the domination number in sparse graphs (2011) (77)
- Strongly Sublinear Separators and Polynomial Expansion (2015) (60)
- A minimum degree condition forcing complete graph immersion (2011) (55)
- On recognizing graphs by numbers of homomorphisms (2010) (45)
- Star Chromatic Index (2010) (40)
- Three-coloring triangle-free planar graphs in linear time (2009) (40)
- Forbidden graphs for tree-depth (2012) (37)
- Classes of graphs with small rank decompositions are X-bounded (2011) (37)
- Asymptotical Structure of Combinatorial Objects (2007) (34)
- List-Coloring Squares of Sparse Subcubic Graphs (2008) (33)
- On forbidden subdivision characterizations of graph classes (2008) (33)
- Randić index and the diameter of a graph (2011) (30)
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (2009) (27)
- Sublinear separators, fragility and subexponential expansion (2014) (26)
- Treewidth of graphs with balanced separations (2014) (24)
- Coloring Triangle-Free Graphs on Surfaces (2007) (22)
- Coloring planar graphs with triangles far apart (2009) (22)
- Density of 5/2-critical graphs (2014) (22)
- On Planar Mixed Hypergraphs (2001) (21)
- Chromatic number and complete graph substructures for degree sequences (2009) (21)
- Packing six T-joins in plane graphs (2010) (20)
- A stronger structure theorem for excluded topological minors (2012) (19)
- A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs (2012) (19)
- Large Independent Sets in Triangle-Free Planar Graphs (2013) (19)
- Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations (2015) (19)
- Coloring face hypergraphs on surfaces (2005) (18)
- Small graph classes and bounded expansion (2010) (18)
- Induced subdivisions and bounded expansion (2017) (17)
- Notes on Graph Product Structure Theory (2020) (17)
- Subcubic triangle‐free graphs have fractional chromatic number at most 14/5 (2013) (17)
- Planar 4-critical graphs with four triangles (2013) (17)
- List coloring with requests (2016) (16)
- Noncrossing Hamiltonian paths in geometric graphs (2007) (16)
- 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles (2010) (16)
- Mathematical and Engineering Methods in Computer Science (2014) (15)
- Complete graph immersions and minimum degree (2015) (15)
- List-coloring embedded graphs without cycles of lengths 4 to 8 (2015) (14)
- 3-choosability of Planar Graphs with ( 4)-cycles Far Apart (2011) (14)
- Choosability of planar graphs of girth 5 (2011) (14)
- A Structure Theorem for Strong Immersions (2014) (14)
- Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph (2008) (14)
- An Algorithm for Cyclic Edge Connectivity of Cubic Graphs (2004) (13)
- Crossing-critical graphs with large maximum degree (2009) (13)
- Fractional Coloring of Triangle-Free Planar Graphs (2014) (13)
- Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies (2009) (12)
- Algorithms for Classes of Graphs with Bounded Expansion (2009) (12)
- List-coloring embedded graphs (2012) (12)
- Distance constrained labelings of planar graphs with no short cycles (2009) (12)
- Three Optimal Algorithms for Balls of Three Colors (2005) (11)
- 5-list-coloring Planar Graphs with Distant Precolored Vertices (2012) (11)
- 5-choosability of Graphs with Crossings Far Apart (2012) (11)
- Probabilistic strategies for the partition and plurality problems (2007) (11)
- 3‐Coloring Triangle‐Free Planar Graphs with a Precolored 8‐Cycle (2013) (11)
- Three-coloring triangle-free graphs on surfaces III. Graphs of girth five (2014) (11)
- Flexibility of triangle‐free planar graphs (2019) (10)
- On classes of graphs with strongly sublinear separators (2017) (10)
- Sublinear Separators in Intersection Graphs of Convex Shapes (2020) (10)
- Bipartizing fullerenes (2011) (10)
- Flexibility of planar graphs of girth at least six (2019) (9)
- An Update on Reconfiguring $10$-Colorings of Planar Graphs (2020) (9)
- Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12 (2022) (9)
- Strong Immersions and Maximum Degree (2013) (9)
- Non-rainbow colorings of 3-, 4- and 5-connected plane graphs (2010) (9)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (2009) (9)
- A Thomassen-type method for planar graph recoloring (2020) (9)
- On Planar Boolean CSP (2015) (8)
- Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles (2015) (8)
- On Fractional Fragility Rates of Graph Classes (2019) (8)
- Immersion in four-edge-connected graphs (2013) (8)
- Thin graph classes and polynomial-time approximation schemes (2017) (8)
- Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk (2013) (8)
- Structure and generation of crossing-critical graphs (2018) (8)
- List-coloring apex-minor-free graphs (2014) (7)
- Single‐conflict colouring (2018) (7)
- Do Triangle-Free Planar Graphs have Exponentially Many $3$-Colorings? (2017) (7)
- A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth (2014) (7)
- On distance r ‐dominating and 2 r ‐independent sets in sparse graphs (2017) (7)
- Graphs with Two Crossings Are 5-Choosable (2011) (7)
- Non‐rainbow colorings of 3‐, 4‐ and 5‐connected plane graphs (2010) (7)
- Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces (2015) (7)
- Two-factors in orientated graphs with forbidden transitions (2009) (7)
- Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs (2021) (6)
- Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle (2010) (6)
- 1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio (2018) (6)
- On Forbidden Subdivision Characterization of Graph Classes (6)
- Graphic TSP in Cubic Graphs (2016) (6)
- Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs (2014) (6)
- Treewidth of Grid Subsets (2015) (6)
- Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm (2016) (5)
- Planar graphs without cycles of length 4 or 5 are (11: 3)-colorable (2018) (5)
- Toughness threshold for the existence of 2-walks in K4-minor-free graphs (2010) (5)
- A Theorem About a Contractible and Light Edge (2006) (5)
- Cyclic coloring of plane graphs with maximum face size 16 and 17 (2016) (5)
- Crossing Numbers of Periodic Graphs (2014) (5)
- Locally Consistent Constraint Satisfaction Problems: (Extended Abstract) (2004) (4)
- Pattern Hypergraphs (2010) (4)
- Spectrally degenerate graphs: Hereditary case (2010) (4)
- Planar graphs have two-coloring number at most 8 (2015) (4)
- 4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles (2013) (4)
- Matrix Decompositions (2020) (4)
- Triangle-free graphs of tree-width t are ⌈ (t+3)/2 ⌉-colorable (2017) (4)
- Treewidth of grid subsets (2017) (4)
- Least conflict choosability (2018) (3)
- Irreducible 4-critical triangle-free toroidal graphs (2017) (3)
- Dynamic Data Structure for Tree-Depth Decomposition (2013) (3)
- Fractional Coloring of Planar Graphs of Girth Five (2018) (3)
- On a Rado Type Problem for Homogeneous Second Order Linear Recurrences (2010) (3)
- Chromatic number and complete graph substructures for degree sequences (2013) (3)
- Induced odd cycle packing number, independent sets, and chromatic number (2020) (3)
- Locally consistent constraint satisfaction problems (2005) (3)
- Bounding the number of cycles in a graph in terms of its degree sequence (2019) (3)
- (3a: a)-List-Colorability of Embedded Graphs of Girth at Least Five (2018) (2)
- Coloring near-quadrangulations of the cylinder and the torus (2019) (2)
- Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains (2015) (2)
- Matchings and Nonrainbow Colorings (2008) (2)
- New Trends in Graph Coloring (2016) (2)
- Approximation metatheorem for fractionally treewidth-fragile graphs (2021) (2)
- Weak Coloring Numbers of Intersection Graphs (2021) (2)
- On Generalized Choice and Coloring Numbers (2018) (2)
- On weighted sublinear separators (2020) (2)
- Characterization of 4-critical triangle-free toroidal graphs (2020) (2)
- A note on antisymmetric flows in graphs (2010) (2)
- Distance-two coloring of sparse graphs (2013) (2)
- Eulerian colorings and the bipartizing matchings conjecture of Fleischner (2006) (2)
- Additive non-approximability of chromatic number in proper minor-closed classes (2017) (2)
- Square roots of nearly planar graphs (2022) (1)
- Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows (2017) (1)
- Complexity of Pattern Coloring of Cycle Systems (2002) (1)
- Number of perfect matchings (2020) (1)
- Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs (2017) (1)
- On Decidability of Hyperbolicity (2020) (1)
- Triangle‐free planar graphs with the smallest independence number (2016) (1)
- A simplified discharging proof of Grötzsch theorem (2013) (1)
- Coloring triangle-free graphs on surfaces . Extended abstract . ∗ (2007) (1)
- Independent sets near the lower bound in bounded degree graphs (2016) (1)
- Graphic TSP in 2-connected cubic graphs (2016) (1)
- On Recognizing Graphs by Numbers of Homomorphisms Zdeněk Dvořák (2006) (0)
- INTERNET SIGURNOST U SVETLU OTKRIĆA EDVARDA SNOUDENA INTERNET SECURITY IN LIGHT OF EDWARD SNOWDEN'S REVELATIONS (2014) (0)
- Testing isomorphism of circular-arc graphs – Hsu ’ s approach revisited (2019) (0)
- Density of 5/2-critical graphs (2016) (0)
- Coloring Graphs on Surfaces (2012) (0)
- On the Complexity of the G-Reconstruction Problem (2005) (0)
- Towards dichotomy for planar boolean CSP (2014) (0)
- Eigenvalues, diagonalization, and Jordan normal form (2016) (0)
- A note on local search for hitting sets (2023) (0)
- J ul 2 01 9 Coloring count cones of planar graphs (2019) (0)
- Mathematical and Engineering Methods in Computer Science : 9th International Doctoral Workshop, MEMICS 2014, Telč, Czech Republic, October 17--19, 2014, Revised Selected Papers (2014) (0)
- Fractional coloring (2018) (0)
- Interval Representation of Balanced Separators in Graphs Avoiding a Minor (2021) (0)
- A note on sublinear separators and expansion (2020) (0)
- Representation of short distances in structurally sparse graphs (2023) (0)
- M ar 2 02 1 Approximation metatheorem for fractionally treewidth-fragile graphs ∗ (2021) (0)
- k-Chromatic Number of Graphs on Surfaces (2008) (0)
- Triangle-free planar graphs with small independence number (2017) (0)
- Ju l 2 01 9 On fractional fragility rates of graph classes ∗ (2019) (0)
- Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12 (2019) (0)
- Spectral radius, symmetric and positive matrices (2016) (0)
- Coloring count cones of planar graphs (2019) (0)
- An efficient implementation and a strengthening of Alon-Tarsi list coloring method (2023) (0)
- Treewidth of Grid Subsets (2017) (0)
- Planar graphs of odd-girth at least 9 are homomorphic to Petersen graph 1 (2006) (0)
- Baker game and polynomial-time approximation schemes (2019) (0)
- Four gravity results (2007) (0)
- Embedded graph 3-coloring and flows (2023) (0)
- Approximation Metatheorems for Classes with Bounded Expansion (2022) (0)
- Triangle-free planar graphs with at most 64n0.731 3-colorings (2021) (0)
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract) (2009) (0)
- A minimum degree condition forcing complete graph immersion (2014) (0)
- C O ] 2 9 M ar 2 01 8 Least conflict choosability ∗ (2018) (0)
- Graphs avoiding immersion of K_{3,3} (2019) (0)
- Cographs ; chordal graphs and tree decompositions (2015) (0)
- Triangle-free planar graphs with at most <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:msup><mml:mrow><mml:mn>64</mml:mn></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>0.731</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:msup> (2022) (0)
This paper list is powered by the following services:
Other Resources About Zdeněk Dvořák
What Schools Are Affiliated With Zdeněk Dvořák?
Zdeněk Dvořák is affiliated with the following schools:
