We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...