VLDB 2026 Research / reviewers in the wild / expert

Marko Jakovac

dblp:18/8049 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
3since 2021 · last 2022
0000-0002-4136-7365ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 9 · 4 first-author · 2 since 2021Computer networks · 1 · 1 since 2021
YearPublicationVenuePosition
2022 The k-path vertex cover: General bounds and chordal graphs
abstract
Abstract For an integer , a k‐path vertex cover of a graph is a set that shares a vertex with every path subgraph of order k in G. The minimum cardinality of a k‐path vertex cover is denoted by . We give estimates—mostly upper bounds—on in terms of various parameters, including vertex degrees and the number of vertices and edges. The problem is also considered on chordal graphs and planar graphs.
Csilla Bujtás, Marko Jakovac, Zsolt Tuza
 Networks2
2021 Indicated coloring game on Cartesian products of graphs
Bostjan Bresar, Marko Jakovac, Dasa Stesl
 Discret. Appl. Math.2
2021 On the security number of the Cartesian product of graphs
Marko Jakovac, Yota Otachi
 Discret. Appl. Math.1
2020 S-packing chromatic vertex-critical graphs
Premysl Holub, Marko Jakovac, Sandi Klavzar
 Discret. Appl. Math.2
2019 Relating the annihilation number and the 2-domination number of block graphs
Marko Jakovac
 Discret. Appl. Math.1
2018 The b-chromatic number and related topics - A survey
Marko Jakovac, Iztok Peterin
 Discret. Appl. Math.1
2016 The security number of strong grid-like graphs
Ismael González Yero, Marko Jakovac, Dorota Kuziak
 Theor. Comput. Sci.2
2015 The k-path vertex cover of rooted product graphs
Marko Jakovac
 Discret. Appl. Math.1
2013 On the vertex kk-path cover
Bostjan Bresar, Marko Jakovac, Ján Katrenic, Gabriel Semanisin, Andrej Taranenko
 Discret. Appl. Math.2
2011 On the b-chromatic number of regular graphs
Sergio Cabello, Marko Jakovac
 Discret. Appl. Math.2