Marko Radovanovic

13 papers Journal 13
YearRankTypeTitle / Venue / Authors
2022 J jnl
Modification of the DIBR and MABAC Methods by Applying Rough Numbers and Its Application in Making Decisions.
Inf.
Dusko Tesic, Marko Radovanovic, Darko Bozanic, Dragan Pamucar, Aleksandar Milic, Adis Puska
2021 J jnl
The (theta, wheel)-free graphs Part IV: Induced paths and cycles.
J. Comb. Theory B
Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
2020 J jnl
Gröbner bases for (partial) flag manifolds.
J. Symb. Comput.
Zoran Z. Petrovic, Branislav I. Prvulovic, Marko Radovanovic
2020 J jnl
The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs.
J. Comb. Theory B
Emilie Diot, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
2020 J jnl
The (theta, wheel)-free graphs Part II: Structure theorem.
J. Comb. Theory B
Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
2020 J jnl
The (theta, wheel)-free graphs Part III: Cliques, stable sets and coloring.
J. Comb. Theory B
Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
2019 J jnl
The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs.
J. Graph Theory
Valerio Boncompagni, Marko Radovanovic, Kristina Vuskovic
2017 J jnl
On rank-width of even-hole-free graphs.
Discret. Math. Theor. Comput. Sci.
Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
2016 J jnl
On rank-width of even-hole-free graphs.
CoRR
Isolde Adler, Ngoc-Khang Le, Haiko Müller, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
2014 J jnl
Linear Balanceable and Subcubic Balanceable Graphs.
J. Graph Theory
Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Théophile Trunck, Kristina Vuskovic
2013 J jnl
A Class of Three-Colorable Triangle-Free Graphs.
J. Graph Theory
Marko Radovanovic, Kristina Vuskovic
2013 J jnl
Graphs that do not contain a cycle with a node that has at least two neighbors on it.
CoRR
Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic
2012 J jnl
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It.
SIAM J. Discret. Math.
Pierre Aboulker, Marko Radovanovic, Nicolas Trotignon, Kristina Vuskovic