Borut Luzar - RankMe

60 papers C 2Journal 57Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	List strong and list normal edge-coloring of (sub)cubic graphs. Eur. J. Comb. Borut Luzar, Edita Mácajová, Roman Soták, Diana Svecová
2025	J	`jnl`	Degree-balanced decompositions of cubic graphs. Eur. J. Comb. Borut Luzar, Jakub Przybylo, Roman Soták
2024	J	`jnl`	Degree-balanced decompositions of cubic graphs. CoRR Borut Luzar, Jakub Przybylo, Roman Soták
2024	J	`jnl`	List strong and list normal edge-coloring of (sub)cubic graphs. CoRR Borut Luzar, Edita Mácajová, Roman Soták, Diana Svecová
2024	J	`jnl`	Packing coloring of hypercubes with extended Hamming codes. Discret. Appl. Math. Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel
2024	J	`jnl`	Revisiting semistrong edge-coloring of graphs. J. Graph Theory Borut Luzar, Martina Mockovciaková, Roman Soták
2023	J	`jnl`	3-facial edge-coloring of plane graphs. Discret. Math. Mirko Hornák, Borut Luzar, Kenny Storgel
2023	J	`jnl`	Locally irregular edge-coloring of subcubic graphs. Discret. Appl. Math. Borut Luzar, Mária Maceková, Simona Rindosová, Roman Soták, Katarína Sroková, Kenny Storgel
2023	J	`jnl`	Packing coloring of hypercubes with extended Hamming codes. CoRR Petr Gregor, Jaka Kranjc, Borut Luzar, Kenny Storgel
2023	J	`jnl`	Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods. Discret. Appl. Math. Igor Fabrici, Borut Luzar, Simona Rindosová, Roman Soták
2023	J	`jnl`	Structure of university licensing networks. Scientometrics Dolores Modic, Borut Luzar, Tohru Yoshioka-Kobayashi
2022	J	`jnl`	Between proper and strong edge-colorings of subcubic graphs. J. Graph Theory Hervé Hocquard, Dimitri Lajou, Borut Luzar
2022	J	`jnl`	BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints. ACM Trans. Math. Softw. Nicolò Gusmeroli, Timotej Hrga, Borut Luzar, Janez Povh, Melanie Siebenhofer, Angelika Wiegele
2022	J	`jnl`	Further extensions of the Grötzsch Theorem. Discret. Math. Hoang La, Borut Luzar, Kenny Storgel
2022	J	`jnl`	Locally irregular edge-coloring of subcubic graphs. CoRR Borut Luzar, Mária Maceková, Simona Rindosová, Roman Soták, Katarína Sroková, Kenny Storgel
2022	J	`jnl`	Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods. CoRR Igor Fabrici, Borut Luzar, Simona Rindosová, Roman Soták
2022	J	`jnl`	Revisiting Semistrong Edge-Coloring of Graphs. CoRR Borut Luzar, Martina Mockovciaková, Roman Soták
2022	J	`jnl`	Scientific performance across research disciplines: Trends and differences in the case of Slovenia. J. Informetrics Katarina Rojko, Borut Luzar
2022	J	`jnl`	Strong edge colorings of graphs and the covers of Kneser graphs. J. Graph Theory Borut Luzar, Edita Mácajová, Martin Skoviera, Roman Soták
2022	J	`jnl`	The Dudeney-Stockmeyer Conjecture. Discret. Appl. Math. Andreas M. Hinz, Borut Luzar, Ciril Petr
2021	J	`jnl`	Star edge-coloring of square grids. Appl. Math. Comput. Premysl Holub, Borut Luzar, Erika Mihaliková, Martina Mockovciaková, Roman Soták
2020	J	`jnl`	Adynamic coloring of graphs. Discret. Appl. Math. Mária Surimová, Borut Luzar, Tomás Madaras
2020	C	`conf`	Between Proper and Strong Edge-Colorings of Subcubic Graphs. IWOCA Hervé Hocquard, Dimitri Lajou, Borut Luzar
2020	J	`jnl`	Between proper and strong edge-colorings of subcubic graphs. CoRR Hervé Hocquard, Dimitri Lajou, Borut Luzar
2020	J	`jnl`	On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. Discret. Appl. Math. Borut Luzar, Martina Mockovciaková, Pascal Ochem, Alexandre Pinlou, Roman Soták
2020	J	`jnl`	The Bologna reform's impacts on the scientific publication performance of Ph.D. graduates - the case of Slovenia. Scientometrics Katarina Rojko, Brankica Bratic, Borut Luzar
2019	—	`conf`	BiqBin: Moving Boundaries for NP-hard Problems by HPC. HPC Timotej Hrga, Borut Luzar, Janez Povh, Angelika Wiegele
2019	J	`jnl`	Note on 3-choosability of planar graphs with maximum degree 4. Discret. Math. François Dross, Borut Luzar, Mária Maceková, Roman Soták
2019	J	`jnl`	Note on list star edge-coloring of subcubic graphs. J. Graph Theory Borut Luzar, Martina Mockovciaková, Roman Soták
2018	J	`jnl`	Is science driven by principal investigators? CoRR Andrej Kastrin, Jelena Klisara, Borut Luzar, Janez Povh
2018	J	`jnl`	Is science driven by principal investigators? Scientometrics Andrej Kastrin, Jelena Klisara, Borut Luzar, Janez Povh
2018	J	`jnl`	New bounds for locally irregular chromatic index of bipartite and subcubic graphs. J. Comb. Optim. Borut Luzar, Jakub Przybylo, Roman Soták
2018	J	`jnl`	On Repetition Thresholds of Caterpillars and Trees of Bounded Degree. Electron. J. Comb. Borut Luzar, Pascal Ochem, Alexandre Pinlou
2018	J	`jnl`	On facial unique-maximum (edge-)coloring. Discret. Appl. Math. Vesna Andova, Bernard Lidický, Borut Luzar, Riste Skrekovski
2018	J	`jnl`	On vertex-parity edge-colorings. J. Comb. Optim. Borut Luzar, Mirko Petrusevski, Riste Skrekovski
2017	J	`jnl`	Analysis of Slovenian research community through bibliographic networks. Scientometrics Andrej Kastrin, Jelena Klisara, Borut Luzar, Janez Povh
2017	J	`jnl`	From NMNR-coloring of hypergraphs to homogenous coloring of graphs. Ars Math. Contemp. Mária Janicová, Tomás Madaras, Roman Soták, Borut Luzar
2017	J	`jnl`	Note on incidence chromatic number of subquartic graphs. J. Comb. Optim. Petr Gregor, Borut Luzar, Roman Soták
2017	J	`jnl`	On a star chromatic index of subcubic graphs. Electron. Notes Discret. Math. Borut Luzar, Martina Mockovciaková, Roman Soták
2017	J	`jnl`	On repetition thresholds of caterpillars and trees of bounded degree. CoRR Borut Luzar, Pascal Ochem, Alexandre Pinlou
2017	J	`jnl`	On the difference between the Szeged and the Wiener index. Appl. Math. Comput. Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski
2016	J	`jnl`	Core-periphery dynamics in collaboration networks: the case study of Slovenia. Scientometrics Mario Karlovcec, Borut Luzar, Dunja Mladenic
2016	J	`jnl`	On incidence coloring conjecture in Cartesian products of graphs. Discret. Appl. Math. Petr Gregor, Borut Luzar, Roman Soták
2016	J	`jnl`	Star Edge Coloring of Some Classes of Graphs. J. Graph Theory L'udmila Bezegová, Borut Luzar, Martina Mockovciaková, Roman Soták, Riste Skrekovski
2015	J	`jnl`	Counterexamples to a conjecture on injective colorings. Ars Math. Contemp. Borut Luzar, Riste Skrekovski
2015	J	`jnl`	Odd edge coloring of graphs. Ars Math. Contemp. Borut Luzar, Mirko Petrusevski, Riste Skrekovski
2015	J	`jnl`	On a Generalization of Thue Sequences. Electron. J. Comb. Jaka Kranjc, Borut Luzar, Martina Mockovciaková, Roman Soták
2015	J	`jnl`	Sandwiching the (generalized) Randić index. Discret. Appl. Math. Martin Knor, Borut Luzar, Riste Skrekovski
2015	J	`jnl`	l-facial edge colorings of graphs. Discret. Appl. Math. Borut Luzar, Martina Mockovciaková, Roman Soták, Riste Skrekovski, Peter Sugerek
2014	J	`jnl`	Community structure and the evolution of interdisciplinarity in Slovenia's scientific collaboration network. CoRR Borut Luzar, Zoran Levnajic, Janez Povh, Matjaz Perc
2014	J	`jnl`	Note on coloring of double disk graphs. J. Glob. Optim. Jaka Kranjc, Borut Luzar, Martina Mockovciaková, Roman Soták
2014	J	`jnl`	Strong edge-coloring of planar graphs. Discret. Math. Dávid Hudák, Borut Luzar, Roman Soták, Riste Skrekovski
2013	J	`jnl`	Improved bound on facial parity edge coloring. Discret. Math. Borut Luzar, Riste Skrekovski
2012	J	`jnl`	A Planar linear arboricity conjecture. J. Graph Theory Marek Cygan, Jianfeng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu
2012	J	`jnl`	Acyclic edge coloring of planar graphs with Δ colors. Discret. Appl. Math. Dávid Hudák, Frantisek Kardos, Borut Luzar, Roman Soták, Riste Skrekovski
2012	J	`jnl`	Extending Fractional Precolorings. SIAM J. Discret. Math. Daniel Král', Matjaz Krnc, Martin Kupec, Borut Luzar, Jan Volec
2012	J	`jnl`	Some remarks on inverse Wiener index problem. Discret. Appl. Math. Jirí Fink, Borut Luzar, Riste Skrekovski
2010	C	`conf`	A Planar Linear Arboricity Conjecture. CIAC Marek Cygan, Lukasz Kowalik, Borut Luzar
2010	J	`jnl`	An improved bound on the largest induced forests for triangle-free planar graphs. Discret. Math. Theor. Comput. Sci. Lukasz Kowalik, Borut Luzar, Riste Skrekovski
2009	J	`jnl`	Injective colorings of planar graphs with few colors. Discret. Math. Borut Luzar, Riste Skrekovski, Martin Tancer