Kristina Vuskovic

According to our database1, Kristina Vuskovic authored at least 55 papers between 1994 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
The (theta, wheel)-free graphs Part III: Cliques, stable sets and coloring.
J. Comb. Theory, Ser. B, 2020

The (theta, wheel)-free graphs Part II: Structure theorem.
J. Comb. Theory, Ser. B, 2020

The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs.
J. Comb. Theory, Ser. B, 2020

2019
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable.
J. Graph Theory, 2019

The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs.
J. Graph Theory, 2019

Coloring square-free Berge graphs.
J. Comb. Theory, Ser. B, 2019

Maximum independent sets in (pyramid, even hole)-free graphs.
CoRR, 2019

Counting weighted independent sets beyond the permanent.
CoRR, 2019

2018
Structure and algorithms for (cap, even hole)-free graphs.
Discret. Math., 2018

2017
On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph.
J. Graph Theory, 2017

Clique cutsets beyond chordal graphs.
Electron. Notes Discret. Math., 2017

On rank-width of even-hole-free graphs.
Discret. Math. Theor. Comput. Sci., 2017

A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs.
Algorithmica, 2017

2015
Coloring perfect graphs with no balanced skew-partitions.
J. Comb. Theory, Ser. B, 2015

Vertex elimination orderings for hereditary graph classes.
Discret. Math., 2015

2014
Linear Balanceable and Subcubic Balanceable Graphs.
J. Graph Theory, 2014

2013
A Class of Three-Colorable Triangle-Free Graphs.
J. Graph Theory, 2013

Decomposition of even-hole-free graphs with star cutsets and 2-joins.
J. Comb. Theory, Ser. B, 2013

Parameterized algorithm for weighted independent set problem in bull-free graphs.
CoRR, 2013

Algorithms for square-$3PC(\cdot, \cdot)$-free Berge graphs.
CoRR, 2013

The world of hereditary graph classes viewed through Truemper configurations.
Proceedings of the Surveys in Combinatorics 2013, 2013

2012
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It.
SIAM J. Discret. Math., 2012

Detecting 2-joins faster.
J. Discrete Algorithms, 2012

Combinatorial optimization with 2-joins.
J. Comb. Theory, Ser. B, 2012

LexBFS, structure and algorithms
CoRR, 2012

2011
On Roussel-Rubio-type lemmas and their consequences.
Discret. Math., 2011

2010
Chromatic index of graphs with no cycle with a unique chord.
Theor. Comput. Sci., 2010

A structure theorem for graphs with no cycle with a unique chord and its consequences.
J. Graph Theory, 2010

2009
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences.
J. Comb. Theory, Ser. B, 2009

2008
Algorithms for Square-3PC(., .)-Free Berge Graphs.
SIAM J. Discret. Math., 2008

2007
Triangulated neighborhoods in even-hole-free graphs.
Discret. Math., 2007

2006
Odd Hole Recognition in Graphs of Bounded Clique Size.
SIAM J. Discret. Math., 2006

Balanced matrices.
Discret. Math., 2006

2005
Algorithms for 3PC(., .)-free Berge graphs.
Electron. Notes Discret. Math., 2005

Recognizing Berge Graphs.
Comb., 2005

2004
Square-free perfect graphs.
J. Comb. Theory, Ser. B, 2004

Decomposition of odd-hole-free graphs by double star cutsets and 2-joins.
Discret. Appl. Math., 2004

2003
A Polynomial Algorithm for Recognizing Perfect Graphs.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

2002
Even-hole-free graphs part I: Decomposition theorem.
J. Graph Theory, 2002

Even-hole-free graphs part II: Recognition algorithm.
J. Graph Theory, 2002

Perfect Graphs, Partitionable Graphs and Cutsets.
Comb., 2002

2001
Balanced 0-1 Matrices II. Recognition Algorithm.
J. Comb. Theory, Ser. B, 2001

Balanced 0-1 Matrices I. Decomposition.
J. Comb. Theory, Ser. B, 2001

Perfect, ideal and balanced matrices.
Eur. J. Oper. Res., 2001

Recognition of quasi-Meyniel graphs.
Discret. Appl. Math., 2001

2000
Triangle-free graphs that are signable without even holes.
J. Graph Theory, 2000

The graph sandwich problem for 1-join composition is NP-complete.
Electron. Notes Discret. Math., 2000

A class of ?-perfect graphs.
Discret. Math., 2000

1999
Even and odd holes in cap-free graphs.
J. Graph Theory, 1999

Balanced cycles and holes in bipartite graphs.
Discret. Math., 1999

1997
Universally Signable Graphs.
Comb., 1997

Finding an Even Hole in a Graph.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996
Perfect Matchings in Balanced Hypergraphs.
Comb., 1996

1995
A Mickey-Mouse Decomposition Theorem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
Recognizing Balanced 0, +/- Matrices.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994


  Loading...