Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Kristina Vušković - MaRDI portal

Kristina Vušković

From MaRDI portal
(Redirected from Person:1375056)
Person:203962

Available identifiers

zbMath Open vuskovic.kristinaMaRDI QIDQ203962

List of research outcomes





PublicationDate of PublicationType
Bisimplicial separators2024-07-02Paper
Tree independence number. I. (Even hole, diamond, pyramid)-free graphs2024-07-02Paper
Graphs with all holes the same length2024-07-01Paper
Induced subgraphs and tree decompositions V. one neighbor in a hole2024-02-23Paper
Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree2024-01-29Paper
Bisimplicial separators2023-12-17Paper
Coloring rings2023-09-29Paper
Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree2022-09-23Paper
A mickey-mouse decomposition theorem2022-08-30Paper
Induced subgraphs and tree decompositions V. Small components of big vertices2022-04-06Paper
When all holes have the same length2022-03-22Paper
Graphs with polynomially many minimal separators2021-11-17Paper
Graphs with all holes the same length2021-10-19Paper
https://portal.mardi4nfdi.de/entity/Q50118772021-08-30Paper
Counting Weighted Independent Sets beyond the Permanent2021-06-28Paper
Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes2021-06-14Paper
The (theta, wheel)-free graphs. IV: Induced paths and cycles2021-02-03Paper
The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs2020-04-22Paper
The (theta, wheel)-free graphs. II: Structure theorem2020-04-22Paper
The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring2020-04-22Paper
Maximum independent sets in (pyramid, even hole)-free graphs2019-12-24Paper
Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable2019-10-31Paper
Clique‐cutsets beyond chordal graphs2019-06-14Paper
The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs2019-04-25Paper
Coloring square-free Berge graphs2019-02-08Paper
On rank-width of even-hole-free graphs2018-11-30Paper
Clique cutsets beyond chordal graphs2018-04-09Paper
Structure and algorithms for (cap, even hole)-free graphs2017-12-20Paper
On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph2017-04-21Paper
A polynomial Turing-kernel for weighted independent set in bull-free graphs2017-04-12Paper
https://portal.mardi4nfdi.de/entity/Q28160762016-07-01Paper
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs2015-09-09Paper
Coloring perfect graphs with no balanced skew-partitions2015-08-21Paper
Vertex elimination orderings for hereditary graph classes2015-01-30Paper
The world of hereditary graph classes viewed through Truemper configurations2014-08-12Paper
Linear Balanceable and Subcubic Balanceable Graphs*2014-01-28Paper
Detecting 2-joins faster2013-06-24Paper
A Class of Three‐Colorable Triangle‐Free Graphs2013-04-19Paper
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It2013-04-09Paper
Decomposition of even-hole-free graphs with star cutsets and 2-joins2013-01-18Paper
Even-hole-free graphs: A survey2013-01-10Paper
Combinatorial optimization with 2-joins2012-03-19Paper
On Roussel-Rubio-type lemmas and their consequences2011-05-06Paper
A structure theorem for graphs with no cycle with a unique chord and its consequences2010-03-15Paper
Chromatic index of graphs with no cycle with a unique chord2010-03-09Paper
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences2009-06-23Paper
Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs2009-03-16Paper
Algorithms for 3PC(⋅, ⋅)-free Berge graphs2007-05-29Paper
Triangulated neighborhoods in even-hole-free graphs2007-03-15Paper
Balanced matrices2006-10-30Paper
Recognizing Berge graphs2006-06-27Paper
Odd Hole Recognition in Graphs of Bounded Clique Size2006-06-01Paper
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins2004-08-06Paper
Square-free perfect graphs.2004-03-14Paper
Balanced \(0,\pm 1\) matrices. I: Decomposition2002-12-10Paper
Balanced \(0,\pm 1\) matrices. II: Recognition algorithm2002-12-10Paper
Perfect graphs, partitionable graphs and cutsets2002-10-20Paper
Even-hole-free graphs part II: Recognition algorithm2002-09-29Paper
The graph sandwich problem for 1-join composition is NP-complete2002-08-29Paper
Even-hole-free graphs part I: Decomposition theorem2002-06-02Paper
https://portal.mardi4nfdi.de/entity/Q45007072001-01-23Paper
Perfect, ideal and balanced matrices2001-01-01Paper
Recognition of quasi-Meyniel graphs2001-01-01Paper
A class of \(\beta\)-perfect graphs2000-12-28Paper
Balanced cycles and holes in bipartite graphs2000-07-05Paper
Even and odd holes in cap-free graphs1999-05-26Paper
https://portal.mardi4nfdi.de/entity/Q43983631998-07-19Paper
Universally signable graphs1998-01-05Paper
https://portal.mardi4nfdi.de/entity/Q43352001997-06-02Paper
Perfect matchings in balanced hypergraphs1997-01-23Paper
Submodular functions and perfect graphsN/APaper
Tree independence number I. (Even hole, diamond, pyramid)-free graphsN/APaper

Research outcomes over time

This page was built for person: Kristina Vušković