Roman Kužel

1. XIONG, Liming, KUŽEL, Roman. A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs. Graphs and combinatorics. 2005, vol. 21, str. 137–144, ilustr. ISSN 0911-0119. DOI: 10.1007/s00373-004-0595-7. [COBISS.SI-ID 209361155]

2. TESKA, Jakub, KUŽEL, Roman, MILLER, Mirka, Fifth Cracow Conference on Graph Theory, USTRON '06, Ustron, Poland, 11-15 September 2006. Divisibility conditions in almost Moore digraphs with selfrepeats. Electronic notes in discrete mathematics. 2006, vol. 24, str. 161-163. ISSN 1571-0653. DOI: 10.1016/j.endm.2006.06.043. [COBISS.SI-ID 209360899]

3. BROERSMA, Hajo, FIJAVŽ, Gašper, KAISER, Tomáš, KUŽEL, Roman, RYJÁČEK, Zdeněk, VRÁNA, Petr, 6th Czech-Slovak International symposium on combinatorics, graph theory, algorithms and applications, Charles University, Prague, 10-16 July, 2006. Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Electronic notes in discrete mathematics. 2007, vol. 28, str. 55-59. ISSN 1571-0653. [COBISS.SI-ID 15088729]

4. KAISER, Tomáš, KUŽEL, Roman, LI, Hao, WANG, Guanghui. A Note on ▫$k$▫-walks in Bridgeless Graphs. Graphs and combinatorics. 2007, vol. 23, str. 303-308. ISSN 0911-0119. DOI: 10.1007/s00373-007-0733-0. [COBISS.SI-ID 209358851]

5. BROERSMA, Hajo, FIJAVŽ, Gašper, KAISER, Tomáš, KUŽEL, Roman, RYJÁČEK, Zdeněk, VRÁNA, Petr. Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Discrete mathematics. [Print ed.]. 2008, vol. 308, iss. 24, str. 6064-6077. ISSN 0012-365X. http://dx.doi.org/10.1016/j.disc.2007.11.026. [COBISS.SI-ID 15007577]

6. FLANDRIN, Evelyne, KAISER, Tomáš, KUŽEL, Roman, LI, Hao, RYJÁČEK, Zdeněk. Neighborhood unions and extremal spanning trees. Discrete mathematics. [Print ed.]. 2008, vol. 308, iss. 12, str. 2343–2350. ISSN 0012-365X. DOI: 10.1016/j.disc.2007.04.071. [COBISS.SI-ID 209354499]

7. KUŽEL, Roman. A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs : note. Discrete mathematics. [Print ed.]. 2008, vol. 308, iss. 23, str. 5801–5804, ilustr. ISSN 0012-365X. DOI: 10.1016/j.disc.2007.09.051. [COBISS.SI-ID 209355267]

8. KUŽEL, Roman, TESKA, Jakub. On 2-Connected Spanning Subgraphs with Bounded Degree in ▫$K_{1,r}$▫-Free Graphs. Graphs and combinatorics. 2011, vol. 27, str. 199–206, ilustr. ISSN 0911-0119. DOI: 10.1007/s00373-010-1011-0. [COBISS.SI-ID 209360387]

9. KUŽEL, Roman, OZEKI, Kenta, YOSHIMOTO, Kiyoshi. 2-factors and independent sets on claw-free graphs. Discrete mathematics. [Print ed.]. 2012, vol. 312, iss. 2, str. 202–206, ilustr. ISSN 0012-365X. DOI: 10.1016/j.disc.2011.08.020. [COBISS.SI-ID 209356291]

10. KUŽEL, Roman, RYJÁČEK, Zdeněk, TESKA, Jakub, VRÁNA, Petr. Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs. Discrete mathematics. [Print ed.]. 2012, vol. 312, iss. 14, str. 2177–2189, ilustr. ISSN 0012-365X. DOI: 10.1016/j.disc.2012.02.027. [COBISS.SI-ID 209357059]

11. KUŽEL, Roman, RYJÁČEK, Zdeněk, VRÁNA, Petr. Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs. Journal of graph theory. 2012, vol. 69, issue 3, str. 241-250. ISSN 0364-9024. DOI: 10.1002/jgt.20578. [COBISS.SI-ID 209357571]

12. KUŽEL, Roman, VANĚK, Petr. Exact interpolation scheme with approximation vector used as a column of the prolongator. Numerical linear algebra with applications. 2015, vol. 22, iss. 6, str. 950-964. ISSN 1070-5325. DOI: 10.1002/nla.1975. [COBISS.SI-ID 209359363]

13. BROUSEK, Jan, FRANKOVÁ, Pavla, HANUŠ, Milan, KOPINCOVÁ, Hana, KUŽEL, Roman, TEZAUR, Radek, VANĚK, Petr, VASTL, Zbyněk. An overview of multilevel methods with aggressive coarsening and massive polynomial smoothing. Electronic transactions on numerical analysis. 2015, vol. 44, str. 401-442, ilustr. ISSN 1068-9613. https://etna.math.kent.edu/volumes/2011-2020/vol44/abstract.php?vol=44&pages=401-442. [COBISS.SI-ID 209359875]

14. BIHANI, Omkar Narayan, KRPAN, Aljaž, KUŽEL, Roman, POVH, Janez. Hybrid Classical-Quantum Exact Solver for the QUBO Problem. V: HARISCH, Damjan (ur.). ASHPC25 : Austrian-Slovenian HPC Meeting 2025 : Rimske Terme, Slovenia, 19-22 May 2025. Vienna: EuroCC, cop. 2025. Str. 50, ilustr. ISBN 978-3-200-10466-2. https://ashpc.eu/event/25/attachments/151/300/ashpc25_booklet.pdf, DiRROS - Digitalni repozitorij raziskovalnih organizacij Slovenije, DOI: 10.25365/phaidra.662. [COBISS.SI-ID 239364355]

15. BIHANI, Omkar Narayan, KUŽEL, Roman, POVH, Janez, PUCHER, Dunja. QUBO Relaxations and Iterative Algorithms for the Sparsest k-Subgraph Problem : version v1. Genève: Zenodo, 2025. 1 spletni vir. https://zenodo.org/records/17086045, DOI: 10.5281/zenodo.17086044. [COBISS.SI-ID 250745347]
projekt: The research work of the first three authors was partially supported by the project Quantum Solver for Hard Binary Quadratic Problems (QBIQ), ID J7-50186, funded by the Slovenian Research and Innovation Agency (ARIS), the project DIGITOP, co-funded by the Republic of Slovenia, the Ministry of Higher Education, Science and Innovation, ARIS, and the European Union – NextGenerationEU, and by ARIS through the annual work program of Rudolfovo. The fourth author was funded in part by the Austrian Science Fund (FWF) [10.55776/DOC78].

16. POVH, Janez, BIHANI, Omkar Narayan, KRPAN, Aljaž, KUŽEL, Roman, ZUPANC, Beno. Hybrid HPC-Quantum Exact Solver for Combinatorial Optimization Problems. V: CSASC 2026 : Joint Meeting and Conference of the Czech, Slovenian, Austrian, Slovak and Catalan Mathematical Societies : Plzeň, Czechia : 2026, Feb. 2-6. [S. l.: s. n.]. 2026, 1 spletni vir. https://csasc2026.zcu.cz/index.php?form=submission-preview-full&sid=123. [COBISS.SI-ID 274293251]