Kristina Vušković
#106,960
Most Influential Person Now
Serbian mathematician
Kristina Vušković's AcademicInfluence.com Rankings
Kristina Vuškovićmathematics Degrees
Mathematics
#5922
World Rank
#8282
Historical Rank
Combinatorics
#96
World Rank
#104
Historical Rank
Graph Theory
#103
World Rank
#111
Historical Rank
Measure Theory
#4838
World Rank
#5665
Historical Rank
Download Badge
Mathematics
Kristina Vušković's Degrees
- PhD Mathematics University of Belgrade
- Masters Mathematics University of Belgrade
- Bachelors Mathematics University of Belgrade
Similar Degrees You Can Earn
Why Is Kristina Vušković Influential?
(Suggest an Edit or Addition)According to Wikipedia, Kristina L. Vušković is a Serbian mathematician and theoretical computer scientist working in graph theory. She is Professor in Algorithms and Combinatorics in the School of Computing at the University of Leeds, and a professor of computer science at Union University .
Kristina Vušković's Published Works
Published Works
- Recognizing Berge Graphs (2005) (311)
- Balanced matrices (2006) (126)
- Even‐hole‐free graphs part II: Recognition algorithm (2002) (73)
- Even‐hole‐free graphs part I: Decomposition theorem (2002) (68)
- A structure theorem for graphs with no cycle with a unique chord and its consequences (2010) (57)
- Even and odd holes in cap-free graphs (1999) (52)
- A polynomial algorithm for recognizing perfect graphs (2003) (48)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (2009) (48)
- Decomposition of even-hole-free graphs with star cutsets and 2-joins (2013) (41)
- EVEN-HOLE-FREE GRAPHS: A SURVEY (2010) (38)
- Square-free perfect graphs (2004) (36)
- A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs (2014) (36)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (2004) (32)
- Triangulated neighborhoods in even-hole-free graphs (2007) (31)
- A class of ?-perfect graphs (2000) (31)
- The world of hereditary graph classes viewed through Truemper configurations (2013) (30)
- Chromatic index of graphs with no cycle with a unique chord (2010) (30)
- Even-hole-free graphs part II: Recognition algorithm (2002) (29)
- Universally signable graphs (1997) (29)
- On Roussel-Rubio-type lemmas and their consequences (2011) (27)
- Structure and algorithms for (cap, even hole)-free graphs (2016) (26)
- Combinatorial optimization with 2-joins (2013) (26)
- Vertex elimination orderings for hereditary graph classes (2012) (26)
- Even-hole-free graphs part I: Decomposition theorem (2002) (25)
- The graph sandwich problem for 1-join composition is NP-complete (2000) (24)
- Perfect, ideal and balanced matrices (2001) (23)
- Coloring perfect graphs with no balanced skew-partitions (2013) (23)
- Perfect matchings in balanced hypergraphs (1996) (22)
- Graphs that do not contain a cycle with a node that has at least two neighbors on it (2013) (21)
- Detecting 2-joins faster (2011) (20)
- Algorithms for Square-3PC(., .)-Free Berge Graphs (2008) (20)
- Balanced 0-1 Matrices I. Decomposition (2001) (20)
- Parameterized algorithm for weighted independent set problem in bull-free graphs (2013) (19)
- Odd Hole Recognition in Graphs of Bounded Clique Size (2006) (19)
- Triangle-free graphs that are signable without even holes (2000) (15)
- Clique‐cutsets beyond chordal graphs (2017) (14)
- Balanced 0-1 Matrices II. Recognition Algorithm (2001) (13)
- Finding an even hole in a graph (1997) (11)
- The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs (2015) (11)
- A Mickey-Mouse Decomposition Theorem (1995) (10)
- Perfect Graphs, Partitionable Graphs and Cutsets (2002) (9)
- Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable (2017) (9)
- A Class of Three‐Colorable Triangle‐Free Graphs (2013) (9)
- On rank-width of even-hole-free graphs (2016) (8)
- On Triangle‐Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph (2014) (7)
- Decomposing Berge Graphs Containing Proper Wheels (2002) (7)
- Maximum independent sets in (pyramid, even hole)-free graphs (2019) (6)
- Coloring square-free Berge graphs (2015) (5)
- The (theta, wheel)-free graphs Part III: Cliques, stable sets and coloring (2017) (5)
- The (theta, wheel)-free graphs Part II: Structure theorem (2017) (5)
- Balanced cycles and holes in bipartite graphs (1999) (5)
- Even-hole-free graphs with bounded degree have bounded treewidth (2020) (4)
- Hadwiger's Conjecture for some hereditary classes of graphs: a survey (2020) (4)
- The (theta, wheel)-free graphs Part IV: Induced paths and cycles (2019) (4)
- Recognition of quasi-Meyniel graphs (2001) (4)
- Linear Balanceable and Subcubic Balanceable Graphs * (2013) (3)
- Counting weighted independent sets beyond the permanent (2019) (3)
- Recognizing balanced 0,±matrices (1994) (3)
- On graphs that do not contain a theta nor a wheel Part I: two subclasses (2015) (3)
- On rank-width of (diamond, even hole)-free graphs (2017) (2)
- Coloring rings (2019) (2)
- The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs (2018) (2)
- A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs (2015) (1)
- C O ] 1 9 O ct 2 02 1 Graphs with all holes the same length (2021) (0)
- Balanced 0, + or - Matrices. Part 1. Decomposition, (1994) (0)
- The Algorithmics Column (2020) (0)
- Two classes of β-perfect graphs that do not necessarily have simplicial extremes (2021) (0)
- C O ] 2 7 Ju l 2 01 9 Coloring rings (2019) (0)
- Applicable Analysis and Discrete Mathematics (2010) (0)
- De omposing Berge Graphs Containing Proper Wheels work in progress (2002) (0)
- Toward induced subgraph obstructions to bounded treewidth (2021) (0)
- Algorithms for 3PC(., .)-free Berge graphs (2005) (0)
This paper list is powered by the following services:
Other Resources About Kristina Vušković
What Schools Are Affiliated With Kristina Vušković?
Kristina Vušković is affiliated with the following schools: