default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKristina Vuskovic
Person information
- affiliation: University of Leeds, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j58]Tara Abrishami, Maria Chudnovsky
, Cemil Dibek, Kristina Vuskovic:
Submodular Functions and Perfect Graphs. Math. Oper. Res. 50(1): 189-208 (2025)- 2024
- [j57]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Sophie Spirkl, Kristina Vuskovic:
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. J. Comb. Theory B 164: 371-403 (2024) - [j56]Linda Cook, Jake Horsfield, Myriam Preissmann, Cléophée Robin, Paul D. Seymour, Ni Luh Dewi Sintiari, Nicolas Trotignon, Kristina Vuskovic:
Graphs with all holes the same length. J. Comb. Theory B 168: 96-158 (2024) - [j55]Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vuskovic:
Induced subgraphs and tree decompositions V. one neighbor in a hole. J. Graph Theory 105(4): 542-561 (2024) - 2023
- [i12]Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic:
Bisimplicial separators. CoRR abs/2312.10830 (2023) - 2022
- [j54]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Graphs with polynomially many minimal separators. J. Comb. Theory B 152: 248-280 (2022) - [j53]Tara Abrishami, Maria Chudnovsky, Kristina Vuskovic:
Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree. J. Comb. Theory B 157: 144-175 (2022) - 2021
- [j52]Jake Horsfield, Kristina Vuskovic:
Two classes of β-perfect graphs that do not necessarily have simplicial extremes. Discret. Math. 344(7): 112374 (2021) - [j51]Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
The (theta, wheel)-free graphs Part IV: Induced paths and cycles. J. Comb. Theory B 146: 495-531 (2021) - [j50]Frédéric Maffray, Irena Penev, Kristina Vuskovic:
Coloring rings. J. Graph Theory 96(4): 642-683 (2021) - [j49]Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic:
Counting Weighted Independent Sets beyond the Permanent. SIAM J. Discret. Math. 35(2): 1503-1524 (2021) - 2020
- [j48]Kathie Cameron, Kristina Vuskovic:
Hadwiger's Conjecture for some hereditary classes of graphs: a survey. Bull. EATCS 131 (2020) - [j47]Emilie Diot, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs. J. Comb. Theory B 143: 123-147 (2020) - [j46]Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
The (theta, wheel)-free graphs Part II: Structure theorem. J. Comb. Theory B 143: 148-184 (2020) - [j45]Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
The (theta, wheel)-free graphs Part III: Cliques, stable sets and coloring. J. Comb. Theory B 143: 185-218 (2020)
2010 – 2019
- 2019
- [j44]Maria Chudnovsky, Irene Lo, Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Coloring square-free Berge graphs. J. Comb. Theory B 135: 96-128 (2019) - [j43]Valerio Boncompagni, Marko Radovanovic, Kristina Vuskovic:
The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs. J. Graph Theory 90(4): 591-628 (2019) - [j42]Valerio Boncompagni, Irena Penev, Kristina Vuskovic:
Clique-cutsets beyond chordal graphs. J. Graph Theory 91(2): 192-246 (2019) - [j41]Maria Chudnovsky, Chun-Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas Trotignon, Kristina Vuskovic:
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. J. Graph Theory 92(2): 67-95 (2019) - [i11]Martin E. Dyer, Mark Jerrum, Haiko Müller, Kristina Vuskovic:
Counting weighted independent sets beyond the permanent. CoRR abs/1909.03414 (2019) - [i10]Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Maximum independent sets in (pyramid, even hole)-free graphs. CoRR abs/1912.11246 (2019) - 2018
- [j40]Kathie Cameron, Murilo V. G. da Silva, Shenwei Huang, Kristina Vuskovic:
Structure and algorithms for (cap, even hole)-free graphs. Discret. Math. 341(2): 463-473 (2018) - 2017
- [j39]Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. Algorithmica 77(3): 619-641 (2017) - [j38]Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
On rank-width of even-hole-free graphs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j37]Valerio Boncompagni, Irena Penev, Kristina Vuskovic:
Clique cutsets beyond chordal graphs. Electron. Notes Discret. Math. 62: 81-86 (2017) - [j36]Nicolas Trotignon, Kristina Vuskovic:
On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph. J. Graph Theory 84(3): 233-248 (2017) - 2016
- [i9]Kathie Cameron, Murilo Vicente Gonçalves da Silva, Shenwei Huang, Kristina Vuskovic:
Structure and algorithms for (cap, even hole)-free graphs. CoRR abs/1611.08066 (2016) - [i8]Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
On rank-width of even-hole-free graphs. CoRR abs/1611.09907 (2016) - 2015
- [j35]Pierre Aboulker, Pierre Charbit, Nicolas Trotignon, Kristina Vuskovic:
Vertex elimination orderings for hereditary graph classes. Discret. Math. 338(5): 825-834 (2015) - [j34]Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic:
Coloring perfect graphs with no balanced skew-partitions. J. Comb. Theory B 115: 26-65 (2015) - 2014
- [j33]Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic:
Linear Balanceable and Subcubic Balanceable Graphs. J. Graph Theory 75(2): 150-166 (2014) - [c5]Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. WG 2014: 408-419 - 2013
- [j32]Murilo Vicente Gonçalves da Silva, Kristina Vuskovic:
Decomposition of even-hole-free graphs with star cutsets and 2-joins. J. Comb. Theory B 103(1): 144-183 (2013) - [j31]Marko Radovanovic, Kristina Vuskovic:
A Class of Three-Colorable Triangle-Free Graphs. J. Graph Theory 72(4): 430-439 (2013) - [p1]Kristina Vuskovic:
The world of hereditary graph classes viewed through Truemper configurations. Surveys in Combinatorics 2013: 265-326 - [i7]Maria Chudnovsky, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic:
Coloring perfect graphs with no balanced skew-partitions. CoRR abs/1308.6444 (2013) - [i6]Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs. CoRR abs/1309.0694 (2013) - [i5]Nicolas Trotignon, Kristina Vuskovic:
Combinatorial optimization with 2-joins. CoRR abs/1309.1547 (2013) - [i4]Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
Graphs that do not contain a cycle with a node that has at least two neighbors on it. CoRR abs/1309.1841 (2013) - [i3]Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Parameterized algorithm for weighted independent set problem in bull-free graphs. CoRR abs/1310.6205 (2013) - 2012
- [j30]Nicolas Trotignon, Kristina Vuskovic:
Combinatorial optimization with 2-joins. J. Comb. Theory B 102(1): 153-185 (2012) - [j29]Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic:
Detecting 2-joins faster. J. Discrete Algorithms 17: 60-66 (2012) - [j28]Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic:
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It. SIAM J. Discret. Math. 26(4): 1510-1531 (2012) - [i2]Pierre Aboulker, Pierre Charbit, Maria Chudnovsky, Nicolas Trotignon, Kristina Vuskovic:
LexBFS, structure and algorithms. CoRR abs/1205.2535 (2012) - 2011
- [j27]Nicolas Trotignon, Kristina Vuskovic:
On Roussel-Rubio-type lemmas and their consequences. Discret. Math. 311(8-9): 684-687 (2011) - [i1]Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic:
Detecting 2-joins faster. CoRR abs/1107.3977 (2011) - 2010
- [j26]Nicolas Trotignon, Kristina Vuskovic:
A structure theorem for graphs with no cycle with a unique chord and its consequences. J. Graph Theory 63(1): 31-67 (2010) - [j25]Raphael C. S. Machado, Celina M. H. de Figueiredo, Kristina Vuskovic:
Chromatic index of graphs with no cycle with a unique chord. Theor. Comput. Sci. 411(7-9): 1221-1234 (2010)
2000 – 2009
- 2009
- [j24]Ton Kloks, Haiko Müller, Kristina Vuskovic:
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. J. Comb. Theory B 99(5): 733-800 (2009) - 2008
- [j23]Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Algorithms for Square-3PC(., .)-Free Berge Graphs. SIAM J. Discret. Math. 22(1): 51-71 (2008) - 2007
- [j22]Murilo Vicente Gonçalves da Silva, Kristina Vuskovic:
Triangulated neighborhoods in even-hole-free graphs. Discret. Math. 307(9-10): 1065-1073 (2007) - 2006
- [j21]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Balanced matrices. Discret. Math. 306(19-20): 2411-2437 (2006) - [j20]Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli:
Odd Hole Recognition in Graphs of Bounded Clique Size. SIAM J. Discret. Math. 20(1): 42-48 (2006) - 2005
- [j19]Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic:
Recognizing Berge Graphs. Comb. 25(2): 143-186 (2005) - [j18]Frédéric Maffray, Nicolas Trotignon, Kristina Vuskovic:
Algorithms for 3PC(., .)-free Berge graphs. Electron. Notes Discret. Math. 22: 73-77 (2005) - 2004
- [j17]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. Discret. Appl. Math. 141(1-3): 41-91 (2004) - [j16]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Square-free perfect graphs. J. Comb. Theory B 90(2): 257-307 (2004) - 2003
- [c4]Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic:
A Polynomial Algorithm for Recognizing Perfect Graphs. FOCS 2003: 20-27 - 2002
- [j15]Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic:
Perfect Graphs, Partitionable Graphs and Cutsets. Comb. 22(1): 19-33 (2002) - [j14]Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic:
The graph sandwich problem for 1-join composition is NP-complete. Discret. Appl. Math. 121(1-3): 73-82 (2002) - [j13]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even-hole-free graphs part I: Decomposition theorem. J. Graph Theory 39(1): 6-49 (2002) - [j12]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even-hole-free graphs part II: Recognition algorithm. J. Graph Theory 40(4): 238-266 (2002) - 2001
- [j11]Celina M. H. de Figueiredo, Kristina Vuskovic:
Recognition of quasi-Meyniel graphs. Discret. Appl. Math. 113(2-3): 255-260 (2001) - [j10]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Perfect, ideal and balanced matrices. Eur. J. Oper. Res. 133(3): 455-461 (2001) - [j9]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Balanced 0-1 Matrices I. Decomposition. J. Comb. Theory B 81(2): 243-274 (2001) - [j8]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Balanced 0-1 Matrices II. Recognition Algorithm. J. Comb. Theory B 81(2): 275-306 (2001) - 2000
- [j7]Celina M. H. de Figueiredo, Kristina Vuskovic:
A class of ?-perfect graphs. Discret. Math. 216(1-3): 169-193 (2000) - [j6]Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic:
The graph sandwich problem for 1-join composition is NP-complete. Electron. Notes Discret. Math. 5: 89-92 (2000) - [j5]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Triangle-free graphs that are signable without even holes. J. Graph Theory 34(3): 204-220 (2000)
1990 – 1999
- 1999
- [j4]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Balanced cycles and holes in bipartite graphs. Discret. Math. 199(1-3): 27-33 (1999) - [j3]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even and odd holes in cap-free graphs. J. Graph Theory 30(4): 289-308 (1999) - 1997
- [j2]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Universally Signable Graphs. Comb. 17(1): 67-77 (1997) - [c3]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Finding an Even Hole in a Graph. FOCS 1997: 480-485 - 1996
- [j1]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Perfect Matchings in Balanced Hypergraphs. Comb. 16(3): 325-329 (1996) - 1995
- [c2]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
A Mickey-Mouse Decomposition Theorem. IPCO 1995: 321-328 - 1994
- [c1]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Recognizing Balanced 0, +/- Matrices. SODA 1994: 103-111
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-09 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
