activity
20142026
most citedCommunity structure and the evolution of interdisciplinarity in Slovenia's scientific collaboration network

55 citations · 148 across the 14 of their papers we have counts for

collaborators

14 papers

math.CO2026

Improving Upper Bounds for the Maximum Clique Problem using Reduction Rules

Aljaž Krpan, Janez Povh

We study the interaction between reduction rules and upper-bound functions for the Maximum Clique Problem (MCP). We show how MCP upper-bound functions can strengthen classical core…

cs.LG2026

On solving symmetric multi-type orthogonal non-negative matrix tri-factorization problem

Rok Hribar, Gregor Papa, Janez Povh +1

We study the symmetric multi-type orthogonal non-negative matrix tri-factorization problem, where several symmetric non-negative matrices are simultaneously approximated by factors…

math.OC2025

Quantum and Simulated Annealing-Based Iterative Algorithms for QUBO Relaxations of the Sparsest -Subgraph Problem

Omkar Bihani, Roman Kužel, Janez Povh +1

In this paper, we introduce three QUBO (Quadratic Unconstrained Binary Optimization) relaxations for the sparsest -subgraph (SkS) problem: a quadratic penalty relaxation, a Lagr…

math.OC2024★ 2 cited

Quantum computing and the stable set problem

Aljaž Krpan, Janez Povh, Dunja Pucher

Given an undirected graph, the stable set problem asks to determine the cardinality of the largest subset of pairwise non-adjacent vertices. This value is called the stability numb…

math.OC2023

Advancing stable set problem solutions through quantum annealers

Janez Povh, Dunja Pucher

We assess the performance of D-wave quantum solvers for solving the stable set problem in a graph, one of the most studied NP-hard problems. We perform computations on some instanc…

math.OC2023

Ground truth clustering is not the optimum clustering

Lucia Absalom Bautista, Timotej Hrga, Janez Povh +1

The clustering of data is one of the most important and challenging topics in data science. The minimum sum-of-squares clustering (MSSC) problem asks to cluster the data points int…

cs.DS2020

Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem

Rok Hribar, Timotej Hrga, Gregor Papa +4

In this paper, we consider the symmetric multi-type non-negative matrix tri-factorization problem (SNMTF), which attempts to factorize several symmetric non-negative matrices simul…

math.OC2020★ 1 cited

MADAM: A parallel exact solver for Max-Cut based on semidefinite programming and ADMM

Timotej Hrga, Janez Povh

We present MADAM, a parallel semidefinite based exact solver for Max-Cut, a problem of finding the cut with maximum weight in a given graph. The algorithm uses branch and bound par…

math.OC2020★ 20 cited

BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints

Nicolò Gusmeroli, Timotej Hrga, Borut Lužar +3

We present BiqBin, an exact solver for linearly constrained binary quadratic problems. Our approach is based on an exact penalty method to first efficiently transform the original…

math.OC2020

A Block Coordinate Descent-based Projected Gradient Algorithm for Orthogonal Non-negative Matrix Factorization

Soodabeh Asadi, Janez Povh

This article utilizes the projected gradient method (PG) for a non-negative matrix factorization problem (NMF), where one or both matrix factors must have orthonormal columns or ro…

nlin.CD2019★ 11 cited

Collective dynamics of phase-repulsive oscillators solves graph coloring problem

Aladin Crnkić, Janez Povh, Vladimir Jaćimović +1

We show how to couple phase-oscillators on a graph so that collective dynamics "searches" for the coloring of that graph as it relaxes toward the dynamical equilibrium. This transl…

math.OC2019★ 41 cited

Sparse Noncommutative Polynomial Optimization

Igor Klep, Victor Magron, Janez Povh

This article focuses on optimization of polynomials in noncommuting variables, while taking into account sparsity in the input data. A converging hierarchy of semidefinite relaxati…

cs.DL2018★ 18 cited

Is science driven by principal investigators?

Andrej Kastrin, Jelena Klisara, Borut Lužar +1

In this paper we consider the scientific and career performance of principal investigators (PI's) of publicly funded research projects compared to scientific performance of all res…

physics.soc-ph2014★ 55 cited

Community structure and the evolution of interdisciplinarity in Slovenia's scientific collaboration network

Borut Luzar, Zoran Levnajic, Janez Povh +1

Interaction among the scientific disciplines is of vital importance in modern science. Focusing on the case of Slovenia, we study the dynamics of interdisciplinary sciences from 19…