18 citations · 19 across the 3 of their papers we have counts for
3 papers
math.OC2026
The Weighted Connected p-Median Problem
Murat Elhüseyni, Burak Kocuk, Miklós Krész
The connected p-median problem is defined as a variant of the classical p-median problem when the facility nodes induce a connected subgraph. In this paper, we introduce the weight…
cs.CC2020★ 1 cited
Counting Maximum Matchings in Planar Graphs Is Hard
Istvan Miklos, Miklos Kresz
Here we prove that counting maximum matchings in planar, bipartite graphs is #P-complete. This is somewhat surprising in the light that the number of perfect matchings in planar gr…
cs.DM2018★ 18 cited
Discovering the hidden community structure of public transportation networks
Laszlo Hajdu, Andras Bota, Miklos Kresz +2
Advances in public transit modeling and smart card technologies can reveal detailed contact patterns of passengers. A natural way to represent such contact patterns is in the form…